English
Related papers

Related papers: Positive Moments Forever: Undecidable and Decidabl…

200 papers

We focus on computing certified upper bounds for the positive maximal singular value (PMSV) of a given matrix. The PMSV problem boils down to maximizing a quadratic polynomial on the intersection of the unit sphere and the nonnegative…

Optimization and Control · Mathematics 2022-02-18 Victor Magron , Ngoc Hoang Anh Mai , Yoshio Ebihara , Hayato Waki

We consider the following natural question. Given a matrix $A$ with i.i.d. random entries, what are the moments of the determinant of $A$? In other words, what is $\mathbb{E}[\det(A)^k]$? While there is a general expression for…

Combinatorics · Mathematics 2025-07-08 Dominik Beck , Zelin Lv , Aaron Potechin

We consider the Membership and the Half-Space Reachability problems for matrices in dimensions two and three. Our first main result is that the Membership Problem is decidable for finitely generated sub-semigroups of the Heisenberg group…

Computational Complexity · Computer Science 2019-04-30 Thomas Colcombet , Joël Ouaknine , Pavel Semukhin , James Worrell

We classify all functions which, when applied term by term, leave invariant the sequences of moments of positive measures on the real line. Rather unexpectedly, these functions are built of absolutely monotonic components, or reflections of…

Classical Analysis and ODEs · Mathematics 2022-05-17 Alexander Belton , Dominique Guillot , Apoorva Khare , Mihai Putinar

For the second fundamental representation of the general linear group over a commutative ring $R$ we construct straightforward and uniform polynomial expressions of elementary generators as products of elementary conjugates of an arbitrary…

Group Theory · Mathematics 2024-05-31 Roman Lubkov

The notion of non-deterministic logical matrix (where connectives are interpreted as multi-functions) preserves many good properties of traditional semantics based on logical matrices (where connectives are interpreted as functions) whilst…

Logic in Computer Science · Computer Science 2022-04-15 Pedro Filipe , Carlos Caleiro , Sérgio Marcelino

We discuss several conjectures about the real-rootedness of polynomials whose coefficients are determinants of coefficients of a real-rooted polynomial. We also consider some questions about matrices generalizing totally positive matrices,…

Classical Analysis and ODEs · Mathematics 2008-08-14 Steve Fisk

The long run behaviour of linear dynamical systems is often studied by looking at eventual properties of matrices and recurrences that underlie the system. A basic problem that lies at the core of many questions in this setting is the…

Formal Languages and Automata Theory · Computer Science 2022-05-20 S Akshay , Supratik Chakraborty , Debtanu Pal

We consider n by n real matrices whose entries are non-degenerate random variables that are independent but non necessarily identically distributed, and show that the probability that such a matrix is singular is O(1/sqrt{n}). The purpose…

Probability · Mathematics 2008-01-09 Laurent Bruneau , Francois Germinet

For almost a century, the decidability of the Skolem Problem - that is, the problem of finding whether a given linear recurrence sequence (LRS) has a zero term - has remained open. A breakthrough in the 1980s established that the Skolem…

Formal Languages and Automata Theory · Computer Science 2025-12-10 Piotr Bacik

We investigate the joint moments of the 2k-th power of the characteristic polynomial of random unitary matrices with the 2h-th power of the derivative of this same polynomial. We prove that for a fixed h, the moments are given by rational…

Number Theory · Mathematics 2011-05-05 Paul-Olivier Dehaye

T. M. Bisgaard proved that the $*$-algebra ${\bf C}[z,\overline{z},1/z\overline{z}]$ has the moment property, that is, each positive linear functional on this $*$-algebra is a moment functional. We generalize this result to polynomials in…

Functional Analysis · Mathematics 2024-08-15 Claus Scheiderer , Konrad Schmüdgen

We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…

Logic in Computer Science · Computer Science 2014-11-04 Danko Ilik

We are interested in the uniqueness of solutions to Maxwell's equations when the magnetic permeability $\mu$ and the permittivity $\varepsilon$ are symmetric positive definite matrix-valued functions in $\mathbb{R}^{3}$. We show that a…

Analysis of PDEs · Mathematics 2012-12-07 John M. Ball , Yves Capdeboscq , Basang Tsering Xiao

We investigate the decidability of model-checking logics of time, knowledge and probability, with respect to two epistemic semantics: the clock and synchronous perfect recall semantics in partially observed discrete-time Markov chains.…

Logic in Computer Science · Computer Science 2015-11-11 Ron van der Meyden , Manas K. Patra

Real algebraic geometry provides certificates for the positivity of polynomials on semi-algebraic sets by expressing them as a suitable combination of sums of squares and the defining inequalitites. We show how Putinar's theorem for…

Optimization and Control · Mathematics 2014-02-26 Daniel Plaumann

We study the moment space corresponding to matrix measures on the unit circle. Moment points are characterized by non-negative definiteness of block Toeplitz matrices. This characterization is used to derive an explicit representation of…

Classical Analysis and ODEs · Mathematics 2009-04-28 Holger Dette , Jens Wagener

We first show that a continuous function f is nonnegative on a closed set $K\subseteq R^n$ if and only if (countably many) moment matrices of some signed measure $d\nu =fd\mu$ with support equal to K, are all positive semidefinite (if $K$…

Optimization and Control · Mathematics 2011-05-13 Jean B. Lasserre

We describe all solutions of the matrix Hamburger moment problem in a general case (no conditions besides solvability are assumed). We use the fundamental results of A.V. Shtraus on the generalized resolvents of symmetric operators. All…

Classical Analysis and ODEs · Mathematics 2009-10-21 Sergey M. Zagorodnyuk

We study the computability of the operator norm of a matrix with respect to norms induced by linear operators. Our findings reveal that this problem can be solved exactly in polynomial time in certain situations, and we discuss how it can…

Numerical Analysis · Mathematics 2025-10-23 Adrian Kulmburg