arXiv subjects
Publications and source records attributed to Mateusz Michałek.
Approximating periodic solutions to the coupled Duffing equations amounts to solving a system of polynomial equations. The number of complex solutions measures the algebraic complexity of this approximation problem. Using the theory of Khovanskii bases, we show that this number is given by the volume of a certain polytope. We also show how to compute all solutions using numerical nonlinear algebra.
We consider the inverse problem for the polynomial map which sends an $m$-tuple of quadratic forms in $n$ variables to the sum of their $d$-th powers. This map captures the moment problem for mixtures of $m$ centered $n$-variate Gaussians. In the first non-trivial case $d = 3$, we show that for any $ n\in \mathbb N $, this map is generically one-to-one (up to permutations of $ q_1,\ldots, q_m $ and third roots of unity) in two ranges: $m\le {n\choose 2} + 1 $ for $n \leq 16$ and $ m\le {n+5 \choose 6}/{n+1 \choose 2}-{n+1 \choose 2}-1$ for $n > 16$, thus proving generic identifiability for mixtures of centered Gaussians from their (exact) moments of degree at most $ 6 $. The first result is obtained by studying the explicit geometry of the tangential contact locus of the variety of sums of cubes of quadratic forms at concrete points, while the second result is accomplished using a link between secant non-defectivity with identifiability. The latter approach generalizes also to sums of $ d $-th powers of $k$-forms for $d \geq 3$ and $k \geq 2$.
We present three families of minimal border rank tensors: they come from highest weight vectors, smoothable algebras, or monomial algebras. We analyse them using Strassen's laser method and obtain an upper bound $2.431$ on $ω$. We also explain how in certain monomial cases using the laser method directly is less profitable than first degenerating. Our results form possible paths in the search for valuable tensors for the laser method away from Coppersmith-Winograd tensors.
The variety $ \mathrm{Sing}_{n, m} $ consists of all tuples $ X = (X_1,\ldots, X_m) $ of $ n\times n $ matrices such that every linear combination of $ X_1,\ldots, X_m $ is singular. Equivalently, $X\in\mathrm{Sing}_{n,m}$ if and only if $\det(λ_1 X_1 + \ldots + λ_m X_m) = 0$ for all $ λ_1,\ldots, λ_m\in \mathbb Q $. Makam and Wigderson asked whether the ideal generated by these equations is always radical, that is, if any polynomial identity that is valid on $ \mathrm{Sing}_{n, m} $ lies in the ideal generated by the polynomials $\det(λ_1 X_1 + \ldots + λ_m X_m)$. We answer this question in the negative by determining the vanishing ideal of $ \mathrm{Sing}_{2, m} $ for all $ m\in \mathbb N $. Our results exhibit that there are additional equations arising from the tensor structure of $ X $. More generally, for any $ n $ and $ m\ge n^2 - n + 1 $, we prove there are equations vanishing on $ \mathrm{Sing}_{n, m} $ that are not in the ideal generated by polynomials of type $\det(λ_1 X_1 + \ldots + λ_m X_m)$. Our methods are based on classical results about Fano schemes, representation theory and Gröbner bases.
We prove a conjecture due to Sturmfels and Uhler concerning the degree of the projective variety associated to the Gaussian graphical model of the cycle. We involve new methods based on the intersection theory in the space of complete quadrics.
Recently, we have witnessed tremendous applications of algebraic intersection theory to branches of mathematics, that previously seemed very distant. In this article we review some of them. Our aim is to provide a unified approach to the results e.g. in the theory of chromatic polynomials (work of Adiprasito, Huh, Katz), maximum likelihood degree in algebraic statistics (Drton, Manivel, Monin, Sturmfels, Uhler, Wiśniewski), Euler characteristics of determinental varieties (Dimca, Papadima), characteristic numbers (Aluffi, Schubert, Vakil) and the degree of semidefinite programming (Bothmer, Nie, Ranestad, Sturmfels). Our main tools come from intersection theory on special varieties called the varieties of complete forms (De Concini, Procesi, Thaddeus) and the study of Segre classes (Laksov, Lascoux, Pragacz, Thorup).
We introduce the characteristic numbers and the chromatic polynomial of a tensor. Our approach generalizes and unifies the chromatic polynomial of a graph and of a matroid, characteristic numbers of quadrics in Schubert calculus, Betti numbers of complements of hyperplane arrangements and Euler characteristic of complements of determinantal hypersurfaces and the maximum likelihood degree for general linear concentration models in algebraic statistics.
We provide an algorithm that takes as an input a given parametric family of homogeneous polynomials, which is invariant under the action of the general linear group, and an integer $d$. It outputs the ideal of that family intersected with the space of homogeneous polynomials of degree $d$. Our motivation comes from open problems, which ask to find equations for varieties of cubic and quartic symmetroids. The algorithm relies on a database of specific Young tableaux and highest weight polynomials. We provide the database and the implementation of the database construction algorithm. Moreover, we provide a julia implementation to run the algorithm using the database, so that more varieties of homogeneous polynomials can easily be treated in the future.
Whereas matrix rank is additive under direct sum, in 1981 Schönhage showed that one of its generalizations to the tensor setting, tensor border rank, can be strictly subadditive for tensors of order three. Whether border rank is additive for higher order tensors has remained open. In this work, we settle this problem by providing analogs of Schönhage's construction for tensors of order four and higher. Schönhage's work was motivated by the study of the computational complexity of matrix multiplication; we discuss implications of our results for the asymptotic rank of higher order generalizations of the matrix multiplication tensor.
We prove that seminormality of cut polytopes is equivalent to normality. This settles two conjectures regarding seminormality of cut polytopes.
We establish connections between: the maximum likelihood degree (ML-degree) for linear concentration models, the algebraic degree of semidefinite programming (SDP), and Schubert calculus for complete quadrics. We prove a conjecture by Sturmfels and Uhler on the polynomiality of the ML-degree. We also prove a conjecture by Nie, Ranestad and Sturmfels providing an explicit formula for the degree of SDP. The interactions between the three fields shed new light on the asymptotic behaviour of enumerative invariants for the variety of complete quadrics. We also extend these results to spaces of general matrices and of skew-symmetric matrices.
We study the maximum likelihood (ML) degree of linear concentration models in algebraic statistics. We relate it to an intersection problem on the variety of complete quadrics. This allows us to provide an explicit, basic, albeit of high computational complexity, formula for the ML-degree. The variety of complete quadrics is an exact analog for symmetric matrices of the permutohedron variety for the diagonal matrices.
In stochastic analysis, a standard method to study a path is to work with its signature. This is a sequence of tensors of different order that encode information of the path in a compact form. When the path varies, such signatures parametrize an algebraic variety in the tensor space. The study of these signature varieties builds a bridge between algebraic geometry and stochastics, and allows a fruitful exchange of techniques, ideas, conjectures and solutions. In this paper we study the signature varieties of two very different classes of paths. The class of rough paths is a natural extension of the class of piecewise smooth paths. It plays a central role in stochastics, and its signature variety is toric. The class of axis-parallel paths has a peculiar combinatoric flavour, and we prove that it is toric in many cases.
Wild forms are homogeneous polynomials whose smoothable rank is strictly larger than their border rank. The discrepancy between these two ranks is caused by the difference between the limit of spans of a family of zero-dimensional schemes and the span of their flat limit. For concise forms of minimal border rank, we show that the condition of vanishing Hessian is equivalent to being wild. This is proven by making a detour through structure tensors of smoothable and Gorenstein algebras. The equivalence fails in the non-minimal border rank regime. We exhibit an infinite series of minimal border rank wild forms of every degree $d\geq 3$ as well as an infinite series of wild cubics. Inspired by recent work on border apolarity of Buczyńska and Buczyński, we study the border varieties of sums of powers $\underline{\mathrm{VSP}}$ of these forms in the corresponding multigraded Hilbert schemes.
We write down an explicit sequence of tensors in $C^m\otimes C^m\otimes C^m$, for all $m$ sufficiently large, having border rank at least $2.02m$, overcoming a longstanding barrier. We obtain our lower bounds via the border substitution method.
Symmetric edge polytopes are a class of lattice polytopes constructed from finite simple graphs. In the present paper we highlight their connections to the Kuramoto synchronization model in physics -- where they are called adjacency polytopes -- and to Kantorovich--Rubinstein polytopes from finite metric space theory. Each of these connections motivates the study of symmetric edge polytopes of particular classes of graphs. We focus on such classes and apply algebraic-combinatorial methods to investigate invariants of the associated symmetric edge polytopes.
Motivated by the study of the secant variety of the Segre-Veronese variety we propose a general framework to analyze properties of the secant varieties of toric embeddings of affine spaces defined by simplicial complexes. We prove that every such secant is toric, which gives a way to use combinatorial tools to study singularities. We focus on the Segre-Veronese variety for which we completely classify their secants that give Gorenstein or $\mathbb Q$-Gorenstein varieties. We conclude providing the explicit description of the singular locus.
Complete monotonicity is a strong positivity property for real-valued functions on convex cones. It is certified by the kernel of the inverse Laplace transform. We study this for negative powers of hyperbolic polynomials. Here the certificate is the Riesz kernel in Garding's integral representation. The Riesz kernel is a hypergeometric function in the coefficients of the given polynomial. For monomials in linear forms, it is a Gel'fand-Aomoto hypergeometric function, related to volumes of polytopes. We establish complete monotonicity for sufficiently negative powers of elementary symmetric functions. We also show that small negative powers of these polynomials are not completely monotone, proving one direction of a conjecture by Scott and Sokal.