Search arXivSearch

arXiv · 2403.04548

An Introduction to T-Systems -- with a special Emphasis on Sparse Moment Problems, Sparse Positivstellensätze, and Sparse Nichtnegativstellensätze

Abstract

These are the lecture notes based on [dD23] for the (upcoming) lecture "T-systems with a special emphasis on sparse moment problems and sparse Positivstellensätze" in the summer semester 2024 at the University of Konstanz. The main purpose of this lecture is to prove the sparse Positiv- and Nichtnegativstellensätze of Samuel Karlin (1963) and to apply them to the algebraic setting. That means given finitely many monomials, e.g. $1, x^2, x^3, x^6, x^7, x^9,$ how do all linear combinations of these look like which are strictly positive or non-negative on some interval $[a,b]$ or $[0,\infty)$, e.g. describe and even write down all $f(x) = a_0 + a_1 x^2 + a_2 x^3 + a_3 x^6 + a_4 x^7 + a_5 x^9$ with $f(x)>0$ or $f(x)\geq 0$ on $[a,b]$ or $[0,\infty)$, respectively. To do this we introduce the theoretical framework in which this question can be answered: T-systems. We study these T-systems to arrive at Karlin's Positiv- and Nichtnegativstellensatz but we also do not hide the limitations of the T-systems approach. The main limitation is the Curtis$-$Mairhuber$-$Sieklucki Theorem which essentially states that every T-system is only one-dimensional and hence we can only apply these results to the univariate polynomial case. This can also be understood as a lesson or even a warning that this approach has been investigated and found to fail, i.e., learning about these results and limitations shall save students and researchers from following old footpaths which lead to a dead end. We took great care finding the correct historical references where the results appeared first but are perfectly aware that like people before we not always succeed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Philipp J. di Dio. 2024-03-07. An Introduction to T-Systems -- with a special Emphasis on Sparse Moment Problems, Sparse Positivstellensätze, and Sparse Nichtnegativstellensätze. https://arxiv.org/abs/2403.04548

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fragment-wise differentiable structures

The $p$-modulus of curves, test plans, upper gradients, charts, differentials, approximations in energy and density of directions are all concepts associated to the theory of Sobolev functions in metric measure spaces. The purpose of this paper is to give an analogous geometric and ``fragment-wise'' theory for Lipschitz functions and Weaver derivations, where $\infty$-modulus of curve fragments, $\ast$-upper gradients and Alberti representations play a central role. We give a new definition of fragment-wise charts and prove that they exists for spaces with finite Hausdorff dimension. We give a replacement for $p$-duality in terms of Alberti representations and $\infty$-modulus and present the theory of $\ast$-upper gradients. Further, we give new and sharper results for approximations of Lipschitz functions, which yields the density of directions. Our results are applicable to all complete and separable metric measure spaces. In the process, we show that there are strong parallels between the Sobolev and Lipschitz worlds.

math.CA

Tensor Derivatives, Unified Tensor-Form Differential Equations, and Model Reduction via Partial Tucker Decomposition

This paper develops a unified tensor calculus for matrix-valued functions and their derivatives, and leverages this framework to construct efficient model reduction techniques for high-dimensional tensor differential equations. We first establish a systematic theory of tensor differentiation, wherein the derivative of a matrix with respect to another matrix is represented as a fourth-order tensor. Building on this calculus, we recast linear ordinary differential equations (ODEs) and partial differential equations(PDEs) into a compact tensor-matrix form $\frac{dX}{dt} = \A\ast X$. The general solution is expressed as $X = \exp(t\A)\ast C$, extending the matrix exponential to the tensor setting. Conditions under which the solution admits this exponential form are characterized in terms of the commutativity of the associated matrix slices. We introduce the partial Tucker decomposition (parTuckerD) to address the computational challenges posed by high-order tensor systems. On a synthetic electronic health record (EHR) tensor, parTuckerD achieves a relative reconstruction error of $0.0992$ with a $136.3\times$ compression ratio, matching the accuracy of the full TuckerD while preserving patient-level similarity structure. The results demonstrate that the proposed tensor calculus and parTuckerD framework provide a principle and computationally efficient approach for analyzing and solving high-dimensional tensor differential equations arising in data-intensive applications.

math.CA

Distance preservers for Lobachevsky space

We obtain a complete description of the class of entrywise preservers of Lorentz-Gram matrices. This resolves, for the case of constant negative curvature, the classification of entrywise preservers obtained by Schoenberg in the zero-curvature (Euclidean) and constant-positive-curvature (spherical) settings. These preservers admit a Lévy--Khintchine-type representation and their asymptotic characteristics are related to Krein's classification of screw lines in Lobachevsky space. Connections with complete Nevanlinna--Pick kernels and Bochner subordination are also obtained.

math.CA