Abstract: Quaternion-valued differential equations (QDEs) is a new kind of differential equations which have many applications in physics and life sciences. The largest difference between QDEs and ODEs is the algebraic structure. On the non-commutativity of the quaternion algebra, the algebraic structure of the solutions to the QDEs is completely different from ODEs. It is actually a left- or right- free module, not a linear vector space. This paper establishes a systematic frame work for the theory of linear QDEs, which can be applied to quantum mechanics, fluid mechanics, Frenet frame in differential geometry, kinematic modelling, attitude dynamics, Kalman filter design and spatial rigid body dynamics, etc. We prove that the algebraic structure of the solutions to the QDEs is actually a left- or right- module, not a linear vector space. On the non-commutativity of the quaternion algebra, many concepts and properties for the ordinary differential equations (ODEs) can not be used. They should be redefined accordingly. A definition of Wronskian is introduced under the framework of quaternions which is different from standard one in the ordinary differential equations. Liouville formula for QDEs is given. Also, it is necessary to treat the eigenvalue problems with left- and right-sides, accordingly. Upon these, we studied the solutions to the linear QDEs. Furthermore, we present two algorithms to evaluate the fundamental matrix. Some concrete examples are given to show the feasibility of the obtained algorithms. Finally, a conclusion and discussion ends the paper.

Abstract: This methodological study provides a step-by-step introduction to a computational implementation of word and paradigm morphology using linear mappings between vector spaces for form and meaning. Taking as starting point the linear regression model, the main concepts underlying linear mappings are introduced and illustrated with R code. It is then shown how vector spaces can be set up for Latin verb conjugations, using 672 inflected variants of two verbs each from the four main conjugation classes. It turns out that mappings from form to meaning (comprehension), and from meaning to form (production) can be carried out loss-free. This study concludes with a demonstration that when the graph of triphones, the units that underlie the form space, is mapped onto a 2-dimensional space with a self-organising algorithm from physics (graphopt), morphological functions show topological clustering, even though morphemic units do not play any role whatsoever in the model. It follows, first, that evidence for morphemes emerging from experimental studies using, for instance, fMRI, to localize morphemes in the brain, does not guarantee the existence of morphemes in the brain, and second, that potential topological organization of morphological form in the cortex may depend to a high degree on the morphological system of a language.

Abstract: In this paper, we consider the problem of information transfer across shapes and propose an extension to the widely used functional map representation. Our main observation is that in addition to the vector space structure of the functional spaces, which has been heavily exploited in the functional map framework, the functional algebra (i.e., the ability to take pointwise products of functions) can significantly extend the power of this framework. Equipped with this observation, we show how to improve one of the key applications of functional maps, namely transferring real-valued functions without conversion to point-to-point correspondences. We demonstrate through extensive experiments that by decomposing a given function into a linear combination consisting not only of basis functions but also of their pointwise products, both the representation power and the quality of the function transfer can be improved significantly. Our modification, while computationally simple, allows us to achieve higher transfer accuracy while keeping the size of the basis and the functional map fixed. We also analyze the computational complexity of optimally representing functions through linear combinations of products in a given basis and prove NP-completeness in some general cases. Finally, we argue that the use of function products can have a wide-reaching effect in extending the power of functional maps in a variety of applications, in particular by enabling the transfer of high-frequency functions without changing the representation size or complexity.

Abstract: In this study, some new order relations on family of sets are introduced by using Minkowski difference. The relations between these orders and the ordering cone of the vector space are obtained. It is shown that depending on the corresponding cone, these order relations are partial orders on the family of nonempty bounded sets. Some relationships between these order relations and upper and lower set less order relations are investigated. Also, two scalarizing functions are introduced in order to replace set optimization problems with respect to these partial order relations with scalar optimization problems. Moreover, necessary and sufficient optimality conditions are presented.

Abstract: For a triangulated category A with a 2-periodic dg-enhancement and a triangulated oriented marked surface S we introduce a dg-category F(S,A) parametrizing systems of exact triangles in A labelled by triangles of S. Our main result is that F(S,A) is independent on the choice of a triangulation of S up to essentially unique Morita equivalence. In particular, it admits a canonical action of the mapping class group. The proof is based on general properties of cyclic 2-Segal spaces. In the simplest case, where A is the category of 2-periodic complexes of vector spaces, F(S,A) turns out to be a purely topological model for the Fukaya category of the surface S. Therefore, our construction can be seen as implementing a 2-dimensional instance of Kontsevich's program on localizing the Fukaya category along a singular Lagrangian spine.

Abstract: In this paper, we study the metric dimension of barycentric subdivision of Mobius ladders and the metric dimension of generalized Petersen multigraphs. We prove that the generalized Petersen multigraphs denoted by $P(2n,n)$ have metric dimension 3 when $n$ is even and 4 otherwise. We also study the exchange property for resolving sets of barycentric subdivisions of Mobius ladders and generalized Petersen multigraphs and prove that the exchange property of the bases in a vector space does not hold for minimal resolving sets of these graphs.

Abstract: Every Grassmannian, in its Plucker embedding, is defined by quadratic polynomials. We prove a vast, qualitative, generalisation of this fact to what we call Plucker varieties. A Plucker variety is in fact a family of varieties in exterior powers of vector spaces that, like the Grassmannian, is functorial in the vector space and behaves well under duals. A special case of our result says that for each fixed natural number k, the k-th secant variety of any Plucker-embedded Grassmannian is defined in bounded degree independent of the Grassmannian. Our approach is to take the limit of a Plucker variety in the dual of a highly symmetric space known as the infinite wedge, and to prove that up to symmetry the limit is defined by finitely many polynomial equations. For this we prove the auxilliary result that for every natural number p the space of p-tuples of infinite-by-infinite matrices is Noetherian modulo row and column operations. Our results have algorithmic counterparts: every bounded Plucker variety has a polynomial-time membership test, and the same holds for Zariski-closed, basis-independent properties of p-tuples of matrices.

Abstract: This paper is concerned with approximating the dominant left singular vector space of a real matrix $A$ of arbitrary dimension, from block Krylov spaces generated by the matrix ${A}{A}^T$ and the b...

Abstract: The present study pretends to describe an alternative way to look at Vector Spaces as a scaffold to produce a meaningful new theoretical structure to be used in both classical and quantum QSPR. To reach this goal it starts from the fact that N-Dimensional Boolean Hypercubes contain as vertices the whole information maximally expressible by means of strings of N bits. One can use this essential property to construct the structure of $N$-Dimensional Vector Spaces, considering vector classes within a kind of Space Wireframe related to a Boolean Hypercube. This way of deconstruct-reconstruct Vector Spaces starts with some newly coined nomenclature, because, through the present paper, any vector set is named as a Vector Polyhedron, or a polyhedron for short if the context allows it. Also, definition of an Inward Vector Product allows to easily build up polyhedral vector structures, made of inward powers of a unique vector, which in turn one might use as Vector Space basis sets. Moreover, one can construct statistical-like vectors of a given Vector Polyhedron as an extended polyhedral sequence of vector inward powers. Furthermore, the Complete Sum of a vector is defined simply as the sum of all its elements. Once defined, one can use it to compute, by means of inward products, generalized scalar products, generalized vector norms and statistical-like indices attached to a Vector Polyhedron.

Abstract: According to Sakellaridis, many zeta integrals in the theory of automorphic forms can be produced or explained by appropriate choices of a Schwartz space of test functions on a spherical homogeneous space, which are in turn dictated by the geometry of affine spherical embeddings. We pursue this perspective by developing a local counterpart and try to explicate the functional equations. These constructions are also related to the L 2 -spectral decomposition of spherical homogeneous spaces in view of the Gelfand-Kostyuchenko method. To justify this viewpoint, we prove the convergence of p-adic local zeta integrals under certain premises, work out the case of prehomogeneous vector spaces and re-derive a large portion of Godement-Jacquet theory. Furthermore, we explain the doubling method and show that it fits into the paradigm of L-monoids developed by L. Lafforgue, B. C. Ngo et al., by reviewing the constructions of Braverman and Kazhdan (2002). In the global setting, we give certain speculations about global zeta integrals, Poisson formulas and their relation to period integrals.

Abstract: This paper is devoted to an elementary new construction of 1-singular Gelfand–Tsetlin modules using complex geometry. We introduce a universal ring D v together with the vector space S = S ( D v ) with basis B v = B ( D v ) consisted of some local distributions such that S is a natural D v -module. For any homomorphism of rings U ( h ) → D v , where h is a Lie algebra, it follows that S is also an h -module. We observe that the homomorphism of rings constructed in [8] is a homomorphism of type U ( gl n ( C ) ) → D v . Using this observation we obtain a construction of the universal 1-singular Gelfand–Tsetlin gl n ( C ) -module from [7] .

Abstract: The interleaving distance is arguably the most prominent distance measure in topological data analysis. In this paper, we provide bounds on the computational complexity of determining the interleaving distance in several settings. We show that the interleaving distance is NP-hard to compute for persistence modules valued in the category of vector spaces. In the specific setting of multidimensional persistent homology we show that the problem is at least as hard as a matrix invertibility problem. Furthermore, this allows us to conclude that the interleaving distance of interval decomposable modules depends on the characteristic of the field. Persistence modules valued in the category of sets are also studied. As a corollary, we obtain that the isomorphism problem for Reeb graphs is graph isomorphism complete.

Abstract: The classical Truncated Moment problem asks for necessary and sufficient conditions so that a linear functional $L$ on $\mathcal{P}_{d}$, the vector space of real $n$-variable polynomials of degree at most $d$, can be written as integration with respect to a positive Borel measure $\mu$ on $\mathbb{R}^n$. We work in a more general setting, where $L$ is a linear functional acting on a finite dimensional vector space $V$ of Borel-measurable functions defined on a $T_{1}$ topological space $S$. Using an iterative geometric construction, we associate to $L$ a subset of $S$ called the \textit{core variety}, $\mathcal{CV}(L)$. Our main result is that $L$ has a representing measure $\mu$ if and only if $\mathcal{CV}(L)$ is nonempty. In this case, $L$ has a finitely atomic representing measure, and the union of the supports of such measures is precisely $\mathcal{CV}(L)$. We also use the core variety to describe the facial decomposition of the cone of functionals in the dual space $V^{*}$ having representing measures. We prove a generalization of the Truncated Riesz-Haviland Theorem of Curto-Fialkow, which permits us to solve a generalized Truncated Moment Problem in terms of positive extensions of $L$. These results are adapted to derive a Riesz-Haviland Theorem for a generalized Full Moment Problem and to obtain a core variety theorem for the latter problem.

Abstract: We compute all Nichols algebras of rigid braided vector spaces of dimension 2 that admit a non-trivial quadratic relation.

Abstract: We discuss the geometry of transverse linear sections of the spinor tenfold $X$, the connected component of the orthogonal Grassmannian of 5-dimensional isotropic subspaces in a 10-dimensional vector space equipped with a non-degenerate quadratic form. In particular, we show that as soon as the dimension of a linear section of $X$ is at least 5, its integral Chow motive is of Lefschetz type. We discuss classification of smooth linear sections of $X$ of small codimension; in particular we check that there is a unique isomorphism class of smooth hyperplane sections and exactly two isomorphism classes of smooth linear sections of codimension 2. Using this, we define a natural quadratic line complex associated with a linear section of $X$. We also discuss the Hilbert schemes of linear spaces and quadrics on $X$ and its linear sections.

Abstract: The standard way of solving numerically a polynomial eigenvalue problem (PEP) is to use a linearization and solve the corresponding generalized eigenvalue problem (GEP). In addition, if the PEP possesses one of the structures arising very often in applications, then the use of a linearization that preserves such structure combined with a structured algorithm for the GEP presents considerable numerical advantages. Block-symmetric linearizations have proven to be very useful for constructing structured linearizations of structured matrix polynomials. In this scenario, we analyze the eigenvalue condition numbers and backward errors of approximated eigenpairs of a block symmetric linearization that was introduced by Fiedler (Linear Algebra Appl 372:325–331, 2003) for scalar polynomials and generalized to matrix polynomials by Antoniou and Vologiannidis (Electron J Linear Algebra 11:78–87, 2004). This analysis reveals that such linearization has much better numerical properties than any other block-symmetric linearization analyzed so far in the literature, including those in the well known vector space $$\mathbb {DL}(P)$$ of block-symmetric linearizations. The main drawback of the analyzed linearization is that it can be constructed only for matrix polynomials of odd degree, but we believe that it will be possible to extend its use to even degree polynomials via some strategies in the near future.

Abstract: This paper assesses the performance of frequency and concept based text representation in Mixed Script Information Retrieval and Classification tasks. In text analytics, representation serves as an unresolved research problem to progress further towards different applications. In this paper observations from different text representation methods in text classification and information retrieval are presented. The data set from the Mixed Script Information Retrieval shared task is used in this experiment and the performance of final submitted model is evaluated by task organizers. It is observed that distributional representation performs better than the frequency based text representation methods. The final system attained first place in task 2 and was 3.89% lesser than the top scored system in task 1.

Abstract: Let V be a vector space over a field k, P : V → k, d ≥ 3. We show the existence of a function C(r, d) such that rank(P) ≤ C(r, d) for any field k, char(k) > d, a finite-dimensional k-vector space V and a polynomial P : V → k of degree d such that rank(∂P/∂t) ≤ r for all t ∈ V − 0. Our proof of this theorem is based on the application of results on Gowers norms for finite fields k. We don’t know a direct proof even in the case when k = ℂ.

Abstract: In this paper, we provide three types of general convergence theorems for Picard iteration in n-dimensional vector spaces over a valued field. These theorems can be used as tools to study the convergence of some particular Picard-type iterative methods. As an application, we present a new semilocal convergence theorem for the one-dimensional Newton method for approximating all the zeros of a polynomial simultaneously. This result improves in several directions the previous one given by Batra (BIT Numer Math 42:467–476, 2002).

Abstract: Nonstandard hulls of a vector lattice were introduced and studied in many papers. Recently, these notions were extended to ordered vector spaces. In the present paper, following the construction of associated Banach--Kantorovich space due to Emelyanov, we describe and investigate the nonstandard hull of a lattice-normed space, which is the foregoing generalization of Luxemburg's nonstandard hull of a normed space.

Abstract: Let Gr(d; n) be the Grassmannian of d-dimensional linear subspaces of an n-dimensional vector space V n. A submanifold X Gr(d; n) gives rise to a differential system ⊂(X) that governs d-dimensional submanifolds of V n whose Gaussian image is contained in X. Systems of the form Σ(X) appear in numerous applications in continuum mechanics, theory of integrable systems, general relativity and differential geometry. They include such wellknown examples as the dispersionless Kadomtsev-Petviashvili equation, the Boyer-Finley equation, Plebansky's heavenly equations, and so on. In this paper we concentrate on the particularly interesting case of this construction where X is a fourfold in Gr(3; 5). Our main goal is to investigate differential-geometric and integrability aspects of the corresponding systems Σ(X). We demonstrate the equivalence of several approaches to dispersionless integrability such as • the method of hydrodynamic reductions, • the method of dispersionless Lax pairs, • integrability on solutions, based on the requirement that the characteristic variety of system Σ(X) defines an Einstein-Weyl geometry on every solution, • integrability on equation, meaning integrability (in twistor-theoretic sense) of the canonical GL(2;R) structure induced on a fourfold X ⊂ Gr(3; 5). All these seemingly different approaches lead to one and the same class of integrable systems Σ(X). We prove that the moduli space of such systems is 6-dimensional. We give a complete description of linearisable systems (the corresponding fourfold X is a linear section of Gr(3; 5)) and linearly degenerate systems (the corresponding fourfold X is the image of a quadratic map P4 99K Gr(3; 5)). The fourfolds corresponding to `generic' integrable systems are not algebraic, and can be parametrised by generalised hypergeometric functions.

Abstract: It is known that connected translation invariant n-dimensional noncommutative differentials dxi on the algebra k[x1, …, xn] of polynomials in n-variables over a field k are classified by commutative algebras V on the vector space spanned by the coordinates. These data also apply to construct differentials on the Heisenberg algebra “spacetime” with relations [xμ, xν] = λΘμν, where Θ is an antisymmetric matrix, as well as to Lie algebras with pre-Lie algebra structures. We specialise the general theory to the field k=F2 of two elements, in which case translation invariant metrics (i.e., with constant coefficients) are equivalent to making V a Frobenius algebra. We classify all of these and their quantum Levi-Civita bimodule connections for n = 2, 3, with partial results for n = 4. For n = 2, we find 3 inequivalent differential structures admitting 1, 2, and 3 invariant metrics, respectively. For n = 3, we find 6 differential structures admitting 0, 1, 2, 3, 4, 7 invariant metrics, respectively. We give some examples for n = 4 and general n. Surprisingly, not all our geometries for n ≥ 2 have zero quantum Riemann curvature. Quantum gravity is normally seen as a weighted “sum” over all possible metrics but our results are a step towards a deeper approach in which we must also “sum” over differential structures. Over F2 we construct some of our algebras and associated structures by digital gates, opening up the possibility of “digital geometry.”

Abstract: The algebras considered in this paper are commutative rings of which the additive group is a finite-dimensional vector space over the field of rational numbers. We present deterministic polynomial-time algorithms that, given such an algebra, determine its nilradical, all of its prime ideals, as well as the corresponding localizations and residue class fields, its largest separable subalgebra, and its primitive idempotents. We also solve the discrete logarithm problem in the multiplicative group of the algebra. While deterministic polynomial-time algorithms were known earlier, our approach is different from previous ones. One of our tools is a primitive element algorithm; it decides whether the algebra has a primitive element and, if so, finds one, all in polynomial time. A methodological novelty is the use of derivations to replace a Hensel–Newton iteration. It leads to an explicit formula for lifting idempotents against nilpotents that is valid in any commutative ring.

Abstract: We introduce the concept of mixture inner product spaces associated with a given separable Hilbert space, which feature an infinite-dimensional mixture of finite-dimensional vector spaces and are dense in the underlying Hilbert space. Any Hilbert valued random element can be arbitrarily closely approximated by mixture inner product space valued random elements. While this concept can be applied to data in any infinite-dimensional Hilbert space, the case of functional data that are random elements in the $L^{2}$ space of square integrable functions is of special interest. For functional data, mixture inner product spaces provide a new perspective, where each realization of the underlying stochastic process falls into one of the component spaces and is represented by a finite number of basis functions, the number of which corresponds to the dimension of the component space. In the mixture representation of functional data, the number of included mixture components used to represent a given random element in $L^{2}$ is specifically adapted to each random trajectory and may be arbitrarily large. Key benefits of this novel approach are, first, that it provides a new perspective on the construction of a probability density in function space under mild regularity conditions, and second, that individual trajectories possess a trajectory-specific dimension that corresponds to a latent random variable, making it possible to use a larger number of components for less smooth and a smaller number for smoother trajectories. This enables flexible and parsimonious modeling of heterogeneous trajectory shapes. We establish estimation consistency of the functional mixture density and introduce an algorithm for fitting the functional mixture model based on a modified expectation-maximization algorithm. Simulations confirm that in comparison to traditional functional principal component analysis the proposed method achieves similar or better data recovery while using fewer components on average. Its practical merits are also demonstrated in an analysis of egg-laying trajectories for medflies.

Abstract: We show that finite-dimensional order unit spaces equipped with a continuous sequential product as defined by Gudder and Greechie are homogeneous and self-dual. As a consequence of the Koecher-Vinberg theorem these spaces therefore correspond to Euclidean Jordan algebras. We remark on the significance of this result in the context of reconstructions of quantum theory. In particular, we show that sequential product spaces must be C*-algebras when their vector space tensor product is also a sequential product space (in the parlance of operational theories, when the space `allows a local composite'). We also show that sequential product spaces in infinite dimension correspond to JB-algebras when a few additional conditions are satisfied. Finally, we remark on how changing the axioms of the sequential product might lead to a new characterisation of homogeneous cones.