Finite-dimensional Space Research Articles

Immersions into Sasakian space forms

We study immersions of Sasakian manifolds into finite and infinite dimensional Sasakian space forms. After proving Calabi’s rigidity results in the Sasakian setting, we characterise all homogeneous Sasakian manifolds which admit a (local) Sasakian immersion into a nonelliptic Sasakian space form. Moreover, we give a characterisation of homogeneous Sasakian manifolds which can be embedded into the standard sphere both in the compact and noncompact case.

Coherent spin states and emergent de Sitter quasinormal modes

As a toy model for the microscopic description of matter in de Sitter space, we consider a Hamiltonian acting on the spin-j representation of SU(2). This is a model with a finite-dimensional Hilbert space, from which quasinormal modes emerge in the large-spin limit. The path integral over coherent spin states can be evaluated at the semiclassical level and from it we find the single-particle de Sitter density of states, including 1/j corrections. Along the way, we discuss the use of quasinormal modes in quantum mechanics, starting from the paradigmatic upside-down harmonic oscillator.

A constructive approach for investigating the stability of incommensurate fractional differential systems

This paper is devoted to studying the asymptotic behaviour of solutions to generalized incommensurate fractional systems. To this end, we first consider fractional systems with rational orders and introduce a criterion that is necessary and sufficient to ensure the stability of such systems. Next, from the fractional order pseudospectrum definition proposed by Šanca et al., we formulate the concept of a rational approximation for the fractional spectrum of incommensurate fractional systems with general, not necessarily rational, orders. Our first important new contribution is to show the equivalence between the fractional spectrum of a incommensurate linear system and its rational approximation. With this result in hand, we use ideas developed in our earlier work to demonstrate the stability of an equilibrium point to nonlinear systems in arbitrary finite-dimensional spaces. A second novel aspect of our work is the fact that the approach is constructive. It is effective and widely applicable in studying the asymptotic behaviour of solutions to linear incommensurate fractional differential systems with constant coefficient matrices and linearized stability theory for nonlinear incommensurate fractional differential systems. Finally, we give numerical simulations to illustrate the merit of the proposed theoretical results.

Randomized complexity of mean computation and the adaption problem

Recently the adaption problem of Information-Based Complexity (IBC) for linear problems in the randomized setting was solved in Heinrich (2024) [8]. Several papers treating further aspects of this problem followed. However, all examples obtained so far were vector-valued. In this paper we settle the scalar-valued case. We study the complexity of mean computation in finite dimensional sequence spaces with mixed LpN norms. We determine the n-th minimal errors in the randomized adaptive and non-adaptive settings. It turns out that among the problems considered there are examples where adaptive and non-adaptive n-th minimal errors deviate by a power of n. The gap can be (up to log factors) of the order n1/4. We also show how to turn such results into infinite dimensional examples with suitable deviation for all n simultaneously.

An Algorithm for Detecting Sentence Validity

In this paper, we introduce an algorithm for determining the grammatical validity of a sentence. We take a similar approach as in (Preller, 2007) and (Lambek, Type Grammar Revisited, 1999) (Lambek, From word to sentence: a computational algebraic approach to grammar, 2008) by encoding the English words based on word type which we call components. A sentence can be described both algebraically and geometrically. Our algorithm generates the geometric portion called underlinks from the generalized reductions of the algebraic portion. Underlinks uniquely determine the reduction of the components leading to the empty string. This is the mathematical basis for determining if a sentence is valid. We also provide a proof for the algorithm’s time complexity of O(n2) along with a Python implementation. This paper is part of a bigger project based on (Coecke, Mehrnoosh, Clarky, 2010) where we explore the combination of a sentence’s grammar and meaning. This is done by combining two compact closed categories; pregroups represent the grammar of a sentence, and finite dimensional vector spaces describe the meaning of a sentence. Together one compact closed category is created, representing both aspects of the sentence.

Asymptotic Insights for Projection, Gordon–Lewis, and Sidon Constants in Boolean Cube Function Spaces

Abstract The main aim of this work is to study important local Banach space constants for Boolean cube function spaces. Specifically, we focus on $\mathcal{B}_{\mathcal{S}}^{N}$, the finite-dimensional Banach space of all real-valued functions defined on the $N$-dimensional Boolean cube $\{-1, +1\}^{N}$ that have Fourier–Walsh expansions supported on a fixed family $\mathcal{S}$ of subsets of $\{1, \ldots , N\}$. Our investigation centers on the projection, Sidon, and Gordon–Lewis constants of this function space. We combine tools from different areas to derive exact formulas and asymptotic estimates of these parameters for special types of families $\mathcal{S}$ depending on the dimension $N$ of the Boolean cube and other complexity characteristics of the support set $\mathcal{S}$. Using local Banach space theory, we establish the intimate relationship among these three important constants.

On the truncated matricial moment problem. I

This paper is about the general truncated matrix-valued moment problem. Let Hq denote the complex Hermitian q×q-matrices, q∈N. Suppose that (X,X) is a measurable space and E is a finite-dimensional vector space of measurable mappings of X into Hq. A linear functional Λ on E is called a moment functional if there exists a positive Hq-valued measure μ on (X,X) such that Λ(F)=∫X〈F,dμ〉 for F∈E.We prove a matricial version of the Richter–Tchakaloff theorem which states that each moment functional on E has a finitely atomic representing measure. It is shown that strictly positive linear functionals on E are moment functionals. For a moment functional Λ, we study the set of atoms W(Λ) and define two Carathéodory numbers of Λ. Further, we define and investigate the core set V(Λ) which generalizes the core variety from the scalar case to the matricial setting. A main result of the paper is the equality W(Λ)=V(Λ).

Nonlinear two-component system of time-fractional PDEs in [formula omitted]-dimensions: Invariant subspace method combined with variable transformation

In this article, we develop a systematic approach of the invariant subspace method combined with variable transformation to find the generalized separable exact solutions of the nonlinear two-component system of time-fractional PDEs (TFPDEs) in (2+1)-dimensions for the first time. Also, we explicitly explain how to construct various kinds of finite-dimensional invariant linear product spaces for the given system using the invariant subspace method combined with variable transformation. Additionally, we present how to use the obtained invariant linear product spaces to derive the generalized separable exact solutions of the discussed system. We also note that the discussed method will help to reduce the nonlinear two-component system of TFPDEs in (2+1)-dimensions into the nonlinear two-component system of TFPDEs in (1+1)-dimensions, which again reduces to a system of time-fractional ODEs through the obtained invariant linear product spaces. More specifically, the significance and efficacy of the systematic investigation of the discussed method have been investigated through the initial and boundary value problems of the generalized nonlinear two-component system of time-fractional reaction–diffusion equations (TFRDEs) in (2+1)-dimensions for finding the generalized separable exact solutions, which can be expressed in terms of the exponential, trigonometric, polynomial, Euler-Gamma and Mittag-Leffler functions. Also, 2D and 3D graphical representations of some of the obtained solutions are presented for different values of fractional orders.

TQFTs and quantum computing

Quantum computing is captured in the formalism of the monoidal subcategory of VectC generated by C2 — in particular, quantum circuits are diagrams in VectC — while topological quantum field theories, in the sense of Atiyah, are diagrams in VectC indexed by cobordisms. We initiate a program to formalize this connection. In doing so, we equip cobordisms with machinery for producing linear maps by parallel transport along curves under a connection and then assemble these structures into a higher category. Finite-dimensional complex vector spaces and linear maps between them are given a suitable higher categorical structure which we call FVectC. We realize quantum circuits as images of cobordisms under monoidal functors from these modified cobordisms to FVectC, which are computed by taking parallel transports of vectors and then combining the results in a pattern encoded in the domain category.

Centrality measures-based sensitivity analysis and entropy of nonzero component graphs

The nonzero component graph of a finite-dimensional vector space over a finite field is a graph whose vertices are the nonzero vectors in the vector space, and any two vertices are adjacent if the corresponding linear combination contains a common basis vector. In this paper, we discuss the centrality measures and entropy of the nonzero component graph and also analyze the sensitivity of the graph using the centrality measures.

Simple modules for twisted Hamiltonian extended affine Lie algebras

In this paper we consider the twisted Hamiltonian extended affine Lie algebra (THEALA). We classify the irreducible integrable modules for these Lie algebras with finite dimensional weight spaces when the finite dimensional center acts non-trivially. This Lie algebra has a triangular decomposition, which is different from the natural triangular decomposition of twisted full toroidal Lie algebra. Any irreducible integrable module of it is a highest weight module with respect to the given triangular decomposition. In this paper we describe the highest weight space in detail.

A general formulation of reweighted least squares fitting

We present a generalized formulation for reweighted least squares approximations. The goal of this article is twofold: firstly, to prove that the solution of such problem can be expressed as a convex combination of certain interpolants when the solution is sought in any finite-dimensional vector space; secondly, to provide a general strategy to iteratively update the weights according to the approximation error and apply it to the spline fitting problem. In the experiments, we provide numerical examples for the case of polynomials and splines spaces. Subsequently, we evaluate the performance of our fitting scheme for spline curve and surface approximation, including adaptive spline constructions.

Double capture of coordinated evaders in recurrent differential games

In finite-dimensional Euclidean space, a problem of pursuit of two evaders by a group of pursuers, which is described by a linear nonstationary system of differential equations, is considered under the assumption that the fundamental matrix of the homogeneous system is a recurrent function. It is assumed that the evaders use the same control. The pursuers use counterstrategies based on information about the initial positions and the prehistory of the control of the evaders. The set of admissible controls is a strictly convex compact with a smooth boundary, and the goal sets are the origin of coordinates. The goal of the group of pursuers is to catch at least one evader by two pursuers. In terms of initial positions and parameters of the game, a sufficient condition for capture is obtained. This study is based on the method of resolving functions, which makes it possible to obtain sufficient conditions for solvability of the problem of pursuit in some guaranteed time.

Limits of Bessel functions for root systems as the rank tends to infinity

We study the asymptotic behaviour of Bessel functions associated to root systems of type An−1 and type Bn with positive multiplicities as the rank n tends to infinity. In both cases, we characterize the possible limit functions and the Vershik–Kerov type sequences of spectral parameters for which such limits exist. In the type A case, this gives a new and very natural approach to recent results by Assiotis and Najnudel in the context of β-ensembles in random matrix theory. These results generalize known facts about the approximation of the positive-definite Olshanski spherical functions of the space of infinite-dimensional Hermitian matrices over F=R,ℂ,H (with the action of the associated infinite unitary group) by spherical functions of finite-dimensional spaces of Hermitian matrices. In the type B case, our results include asymptotic results for the spherical functions associated with the Cartan motion groups of non-compact Grassmannians as the rank goes to infinity, and a classification of the Olshanski spherical functions of the associated inductive limits.

Збурення ізотропного $\alpha$-стійкого випадкового процесу псевдоградієнтом з узагальненим коефіцієнтом

The article is devoted to the perturbation of an isotropic $\alpha$-stable stochastic process in a finite-dimensional Euclidean space by a pseudo-gradient operator multiplied by a delta-function on a hypersurface. This is analogous to the construction of some membrane in the phase space. Semigroup of operators on the space of continuous bounded functions is constructed. It has the infinitesimal generator (in some generalized sense) $c\Delta_\alpha+(q\delta_S\nu,\nabla_\beta)$, where $c$ is some positive constant, $\Delta_\alpha$ is the fractional Laplacian of the order $\alpha$, $\delta_S$ is the delta-function on the hypersurface $S$, which has a normal vector $\nu$, $q$ is some continuous bounded function, $\nabla_\beta$ is a fractional gradient (pseudo-gradient), that is the pseudo-differentional operator defined by the symbol $i\lambda|\lambda|^{\beta-1}$. The order of the pseudo-gradient is less than $\alpha-1$. Some properties of the obtained semigroup are investigated. This semigroup defines a pseudo-process.

Birkhoff–James classification of norm’s properties

For an arbitrary normed space X\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathcal {X}$$\\end{document} over a field F∈{R,C},\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathbb {F}\\in \\{ \\mathbb {R}, \\mathbb {C}\\},$$\\end{document} we define the directed graph Γ(X)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\Gamma (\\mathcal {X})$$\\end{document} induced by Birkhoff–James orthogonality on the projective space P(X),\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathbb P(\\mathcal {X}),$$\\end{document} and also its nonprojective counterpart Γ0(X).\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\Gamma _0(\\mathcal {X}).$$\\end{document} We show that, in finite-dimensional normed spaces, Γ(X)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\Gamma (\\mathcal {X})$$\\end{document} carries all the information about the dimension, smooth points, and norm’s maximal faces. It also allows to determine whether the norm is a supremum norm or not, and thus classifies finite-dimensional abelian C∗\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$C^*$$\\end{document}-algebras among other normed spaces. We further establish the necessary and sufficient conditions under which the graph Γ0(R)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\Gamma _0({\\mathcal {R}})$$\\end{document} of a (real or complex) Radon plane R\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$${\\mathcal {R}}$$\\end{document} is isomorphic to the graph Γ0(F2,‖·‖2)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\Gamma _0(\\mathbb {F}^2, {\\Vert \\cdot \\Vert }_2)$$\\end{document} of the two-dimensional Hilbert space and construct examples of such nonsmooth Radon planes.

Adjacency preserving maps between tensor spaces

Let r and s be positive integers such that r⩾3. Let U1,…,Ur be vector spaces over a field F and V1,…,Vs be vector spaces over a field K such that dim⁡Ui,dim⁡Vj⩾2 for all i,j. In this paper, we characterize maps ψ:⨂i=1rUi→⨂i=1sVi that preserve adjacency in both directions, which extends Hua's fundamental theorem of geometry of rectangular matrices. We also characterize related results concerning locally full maps preserving adjacency in both directions between tensor spaces, maps preserving adjacency in both directions between tensor spaces over a field all whose nonzero endomorphisms are automorphisms, and injective continuous adjacency preserving maps on finite dimensional tensor spaces over the real field.

Nontrivial solutions for indefinite Schrödinger–Poisson systems and Kirchhoff equations

In this paper we consider 4-superlinear Schrödinger–Poisson systems. The potential V here is indefinite so that the Schrödinger operator −Δ+V possesses a finite-dimensional negative space. By Morse theory, we obtain the existence of nontrivial solutions for this problem. Similar result for Kirchhoff equations on R3 is also presented.

Controllability and observability of conformable fractional finite dimensional linear systems

In this research paper, we investigate the controllability and observability of continuous-time fractional dynamical systems. The characterisation of all fractional continuous one-parameter semi groups on a finite dimensional vector space as fractional matrix-valued exponential functions is given. This characterisation is used to express the solution of continuous-time fractional dynamical system. Furthermore, we analyse controllability and observability of linear conformable fractional systems in the mathematical context of linear operators on a finite dimensional vector space. By defining the controllability and observability maps, we establish necessary and sufficient conditions for controllability and observability of this type of systems. We also present the Hautus test for controllability and observability, and introduce controllability and observability Gramians, both for finite and infinite time interval. Finally, we present several illustrative applications and examples to validate all the obtained results.

Spectral decomposition of [formula omitted] and Poincaré inequality on a compact interval — Application to kernel quadrature

Motivated by uncertainty quantification of complex systems, we aim at finding quadrature formulas of the form ∫abf(x)dμ(x)=∑i=1nwif(xi) where f belongs to H1(μ). Here, μ belongs to a class of continuous probability distributions on [a,b]⊂R and ∑i=1nwiδxi is a discrete probability distribution on [a,b]. We show that H1(μ) is a reproducing kernel Hilbert space with a continuous kernel K, which allows to reformulate the quadrature question as a kernel (or Bayesian) quadrature problem. Although K has not an easy closed form in general, we establish a correspondence between its spectral decomposition and the one associated to Poincaré inequalities, whose common eigenfunctions form a T-system (Karlin and Studden, 1966). The quadrature problem can then be solved in the finite-dimensional proxy space spanned by the first eigenfunctions. The solution is given by a generalized Gaussian quadrature, which we call Poincaré quadrature.We derive several results for the Poincaré quadrature weights and the associated worst-case error. When μ is the uniform distribution, the results are explicit: the Poincaré quadrature is equivalent to the midpoint (rectangle) quadrature rule. Its nodes coincide with the zeros of an eigenfunction and the worst-case error scales as b−a23n−1 for large n. By comparison with known results for H1(0,1), this shows that the Poincaré quadrature is asymptotically optimal. For a general μ, we provide an efficient numerical procedure, based on finite elements and linear programming. Numerical experiments provide useful insights: nodes are nearly evenly spaced, weights are close to the probability density at nodes, and the worst-case error is approximately O(n−1) for large n.