Gorenstein graphic matroids
The toric variety of a matroid is projectively normal, and therefore it is Cohen-Macaulay. We provide a complete graph-theoretic classification when the toric variety of a graphic matroid is Gorenstein.
math.CO↗
arXiv subjects
Mateusz Michałek
Publications and source records attributed to Mateusz Michałek.
Uniform matrix product states from an algebraic geometer's point of view
We apply methods from algebraic geometry to study uniform matrix product states. Our main results concern the topology of the locus of tensors expressed as uMPS, their defining equations and identifiability. By an interplay of theorems from algebra, geometry and quantum physics we answer several questions and conjectures posed by Critch, Morton and Hackbusch.
math-ph↗
A tensor version of the quantum Wielandt theorem
We prove boundedness results for the injectivity regions for PEPS. Our result is a higher-dimensional generalization of the quantum Wielandt inequality.
math-ph↗
Flag matroids: algebra and geometry
Matroids are ubiquitous in modern combinatorics. As discovered by Gelfand, Goresky, MacPherson and Serganova there is a beautiful connection between matroid theory and the geometry of Grassmannians: realizable matroids correspond to torus orbits in Grassmannians. Further, as observed by Fink and Speyer general matroids correspond to classes in the $K$-theory of Grassmannians. This yields in particular a geometric description of the Tutte polynomial. In this review we describe all these constructions in detail, and moreover we generalise some of them to polymatroids. More precisely, we study the class of flag matroids and their relations to flag varieties. In this way, we obtain an analogue of the Tutte polynomial for flag matroids.
math.CO↗
Quantum version of Wielandt's Inequality revisited
Consider a linear space L of complex D-dimensional linear operators, and assume that some power L^k of L is the whole space of DxD matrices. Perez-Garcia, Verstraete, Wolf and Cirac conjectured that the sequence L^1,L^2,... stablilizes after O(D^2) terms; we prove that this happens after O(D^2 log(D)) terms, improving the previously known bound of O(D^4).
math.AC↗
Complex best $r$-term approximations almost always exist in finite dimensions
We show that in finite-dimensional nonlinear approximations, the best $r$-term approximant of a function $f$ almost always exists over $\mathbb{C}$ but that the same is not true over $\mathbb{R}$, i.e., the infimum $\inf_{f_1,\dots,f_r \in Y} \lVert f - f_1 - \dots - f_r \rVert$ is almost always attainable by complex-valued functions $f_1,\dots, f_r$ in $Y$, a set of functions that have some desired structures. Our result extends to functions that possess special properties like symmetry or skew-symmetry under permutations of arguments. For the case where $Y$ is the set of separable functions, the problem becomes that of best rank-$r$ tensor approximations. We show that over $\mathbb{C}$, any tensor almost always has a unique best rank-$r$ approximation. This extends to other notions of tensor ranks such as symmetric rank and alternating rank, to best $r$-block-terms approximations, and to best approximations by tensor networks. When applied to sparse-plus-low-rank approximations, we obtain that for any given $r$ and $k$, a general tensor has a unique best approximation by a sum of a rank-$r$ tensor and a $k$-sparse tensor with a fixed sparsity pattern; this arises in, for example, estimation of covariance matrices of a Gaussian hidden variable model with $k$ observed variables conditionally independent given $r$ hidden variables. The existential (but not the uniqueness) part of our result also applies to best approximations by a sum of a rank-$r$ tensor and a $k$-sparse tensor with no fixed sparsity pattern, as well as to tensor completion problems.
math.NA↗
Circulant matrices and Galois-Togliatti systems
The goal of this article is to compare the coefficients in the expansion of the permanent with those in the expansion of the determinant of a three-lines circulant matrix. As an application we prove a conjecture concerning the minimality of Galois-Togliatti systems.
math.AC↗
Arithmetic aspects of symmetric edge polytopes
We investigate arithmetic, geometric and combinatorial properties of symmetric edge polytopes. We give a complete combinatorial description of their facets. By combining Gröbner basis techniques, half-open decompositions and methods for interlacing polynomials we provide an explicit formula for the $h^\ast$-polynomial in case of complete bipartite graphs. In particular, we show that the $h^\ast$-polynomial is $γ$-positive and real-rooted. This proves Gal's conjecture for arbitrary flag unimodular triangulations in this case, and, beyond that, we prove a strengthing due to Nevo and Petersen (2011).
math.CO↗
Smooth centrally symmetric polytopes in dimension 3 are IDP
In 1997 Oda conjectured that every smooth lattice polytope has the integer decomposition property. We prove Oda's conjecture for centrally symmetric $3$-dimensional polytopes, by showing they are covered by lattice parallelepipeds and unimodular simplices.
math.CO↗
Computing images of polynomial maps
The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric techniques, addressing this problem. We also apply these methods to answer a question of W. Hackbusch on the non-closedness of site-independent cyclic matrix product states for infinitely many parameters.
math.AG↗
The design and the performance of stratospheric mission in the search for the Schumann resonances
The technical details of a balloon stratospheric mission that is aimed at measuring the Schumann resonances are described. The gondola is designed specifically for the measuring of faint effects of ELF (Extremely Low Frequency electromagnetic waves) phenomena. The prototype met the design requirements. The ELF measuring system worked properly for entire mission; however, the level of signal amplification that was chosen taking into account ground-level measurements was too high. Movement of the gondola in the Earth magnetic field induced the signal in the antenna that saturated the measuring system. This effect will be taken into account in the planning of future missions. A large telemetry dataset was gathered during the experiment and is currently under processing. The payload consists also of biological material as well as electronic equipment that was tested under extreme conditions.
astro-ph.IM↗
The poset of rational cones
We introduce a natural partial order on the set Cones(d) of rational cones in R^d. The poset NPol(d-1) of normal polytopes in R^{d-1} embeds into Cones(d) via the homogenization map. The order in Cones(d) is conjecturally the inclusion order. We prove this for d=3 and show a stronger version of the connectivity of Cones(d) for all d. Topological aspects of the conjecture are also discussed.
math.CO↗
When is a polynomial ideal binomial after an ambient automorphism?
Can an ideal I in a polynomial ring k[x] over a field be moved by a change of coordinates into a position where it is generated by binomials $x^a - cx^b$ with c in k, or by unital binomials (i.e., with c = 0 or 1)? Can a variety be moved into a position where it is toric? By fibering the G-translates of I over an algebraic group G acting on affine space, these problems are special cases of questions about a family F of ideals over an arbitrary base B. The main results in this general setting are algorithms to find the locus of points in B over which the fiber of F - is contained in the fiber of a second family F' of ideals over B; - defines a variety of dimension at least d; - is generated by binomials; or - is generated by unital binomials. A faster containment algorithm is also presented when the fibers of F are prime. The big-fiber algorithm is probabilistic but likely faster than known deterministic ones. Applications include the setting where a second group T acts on affine space, in addition to G, in which case algorithms compute the set of G-translates of I - whose stabilizer subgroups in T have maximal dimension; or - that admit a faithful multigrading by $Z^r$ of maximal rank r. Even with no ambient group action given, the final application is an algorithm to - decide whether a normal projective variety is abstractly toric. All of these loci in B and subsets of G are constructible; in some cases they are closed.
math.AC↗
Phylogenetic complexity of the Kimura 3-parameter model
In algebraic statistics, the Kimura 3-parameter model is one of the most interesting and classical phylogenetic models. We prove that the ideals associated to this model are generated in degree four, confirming a conjecture by Sturmfels and Sullivant.
math.CO↗
Selected topics on Toric Varieties
This article is based on a series of lectures on toric varieties given at RIMS, Kyoto. We start by introducing toric varieties, their basic properties and later pass to more advanced topics relating mostly to combinatorics.
math.AG↗
Spaces of Sums of Powers and Real Rank Boundaries
We investigate properties of Waring decompositions of real homogeneous forms. We study the moduli of real decompositions, so-called Space of Sums of Powers, naturally included in the Variety of Sums of Powers. Explicit results are obtained for quaternary quadrics, relating the algebraic boundary of ${\rm SSP}$ to various loci in the Hilbert scheme of four points in $\mathbb{P}^3$. Further, we study the locus of general real forms whose real rank coincides with the complex rank. In case of quaternary quadrics the boundary of this locus is a degree forty hypersurface $J(σ_3(v_3(\mathbb{P}^3)),τ(v_3(\mathbb{P}^3)))$.
math.AG↗
Interlacing Ehrhart Polynomials of Reflexive Polytopes
It was observed by Bump et al. that Ehrhart polynomials in a special family exhibit properties similar to the Riemann ζ function. The construction was generalized by Matsui et al. to a larger family of reflexive polytopes coming from graphs. We prove several conjectures confirming when such polynomials have zeros on a certain line in the complex plane. Our main new method is to prove a stronger property called interlacing.
math.CO↗
Constructions of k-regular maps using finite local schemes
A continuous map from R^m to R^N or from C^m to C^N is called k-regular if the images of any $k$ points are linearly independent. Given integers m and k a problem going back to Chebyshev and Borsuk is to determine the minimal value of N for which such maps exist. The methods of algebraic topology provide lower bounds for N, however there are very few results on the existence of such maps for particular values m and k. Using the methods of algebraic geometry we construct k-regular maps. We relate the upper bounds on N with the dimension of the locus of certain Gorenstein schemes in the punctual Hilbert scheme. The computations of the dimension of this family is explicit for k<10, and we provide explicit examples for k<6. We also provide upper bounds for arbitrary m and k.
math.DG↗