English
Related papers

Related papers: Linear independence over tropical semirings and be…

200 papers

Tensors, or multi-linear forms, are important objects in a variety of areas from analytics, to combinatorics, to computational complexity theory. Notions of tensor rank aim to quantify the "complexity" of these forms, and are thus also…

Computational Complexity · Computer Science 2023-06-16 Mandar Juvekar , Arian Nadjimzadah

For an $\omega$-categorical theory $T$ and model $\mathcal{M}$ of $T$ we define a hierarchy of ranks, the $n$-ranks for $n < \omega$ which only care about imaginary elements ``up to level $n$'', where level $n$ contains every element of $M$…

Logic · Mathematics 2026-05-28 Vera Koponen

We consider partial symmetric Toeplitz matrices where a positive definite completion exists. We characterize those patterns where the maximum determinant completion is itself Toeplitz. We then extend these results with positive definite…

Optimization and Control · Mathematics 2018-02-05 Stefan Sremac , Hugo J. Woerdeman , Henry Wolkowicz

We introduce an elementary method to study the border rank of polynomials and tensors, analogous to the apolarity lemma. This can be used to describe the border rank of all cases uniformly, including those very special ones that resisted a…

Algebraic Geometry · Mathematics 2020-11-10 Weronika Buczyńska , Jarosław Buczyński

In this text, we study factorizations of polynomials over the tropical hyperfield and the sign hyperfield, which we call `tropical polynomials' and `sign polynomials', respectively. We classify all irreducible polynomials in either case. We…

Number Theory · Mathematics 2020-05-27 Alexander Agudelo , Oliver Lorscheid

We give conditions on a finite set of series of rational numbers to ensure that they are algebraically independent. Specialising our results to polynomials of lower degree, we also obtain new results on irrationality and $mathbb{Q}$-linear…

Number Theory · Mathematics 2025-02-27 Jaroslav Hancl , Mathias L. Laursen , Simon Kristensen

We show that with high probability, random rank 1 matrices over a finite field are in (linearly) general position, at least provided their shape k x l is not excessively unbalanced. This translates into saying that the dimension of the…

Information Theory · Computer Science 2015-01-27 Hugues Randriambololona

We construct a general framework for tropical differential equations based on idempotent semirings and an idempotent version of differential algebra. Over a differential ring equipped with a non-archimedean norm enhanced with additional…

Algebraic Geometry · Mathematics 2023-06-02 Jeffrey Giansiracusa , Stefano Mereta

A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…

Optimization and Control · Mathematics 2016-10-27 Sander Gribling , David de Laat , Monique Laurent

We launch the study of the tropicalization of the symplectic Grassmannian, that is, the space of all linear subspaces that are isotropic with respect to a fixed symplectic form. We formulate tropical analogues of several equivalent…

Combinatorics · Mathematics 2021-10-18 George Balla , Jorge Alberto Olarte

Motivated by problems in algebraic complexity theory (e.g., matrix multiplication) and extremal combinatorics (e.g., the cap set problem and the sunflower problem), we introduce the geometric rank as a new tool in the study of tensors and…

Computational Complexity · Computer Science 2023-04-27 Swastik Kopparty , Guy Moshkovitz , Jeroen Zuiddam

We develop a combinatorial framework to study certain polyhedral maps which are higher-dimensional analogues of tropical covers between metric graphs. Under a mild combinatorial assumption, we show that a map satisfies the so-called…

Combinatorics · Mathematics 2023-05-08 Alejandro Vargas

The tropical semifield, i.e., the real numbers enhanced by the operations of addition and maximum, serves as a base of tropical mathematics. Addition is an abelian group operation, whereas the maximum defines an idempotent semigroup…

Algebraic Geometry · Mathematics 2010-03-18 Z. Izhakian , E. Shustin

In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…

Information Theory · Computer Science 2014-10-15 Hugues Randriambololona

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over a field and $A$ a standard graded $S$-algebra. In terms of the Gr\"obner basis of the defining ideal $J$ of $A$ we give a condition, called the x-condition, which implies that all graded…

Commutative Algebra · Mathematics 2020-10-23 Jürgen Herzog , Takayuki Hibi , Somayeh Moradi

We consider the problem of finding the smallest rank of a complex matrix whose absolute values of the entries are given. We call this minimum the phaseless rank of the matrix of the entrywise absolute values. In this paper we study this…

Algebraic Geometry · Mathematics 2020-10-09 António Pedro Goucha , João Gouveia

Tropical roots of tropical polynomials have been previously studied and used to localize roots of classical polynomials and eigenvalues of matrix polynomials. We extend the theory of tropical roots from tropical polynomials to tropical…

Numerical Analysis · Mathematics 2024-09-11 Gian Maria Negri Porzio , Vanni Noferini , Leonardo Robol

Our objective in this project is three-fold, the first two covered in this paper. In tropical mathematics, as well as other mathematical theories involving semirings, when trying to formulate the tropical versions of classical algebraic…

Rings and Algebras · Mathematics 2021-05-07 Louis Halle Rowen

We show that the set of realizations of a given dimension of a max-plus linear sequence is a finite union of polyhedral sets, which can be computed from any realization of the sequence. This yields an (expensive) algorithm to solve the…

Data Structures and Algorithms · Computer Science 2011-03-14 Vincent Blondel , Stéphane Gaubert , Natacha Portier

The feasibility of a classification-by-rank program for modular categories follows from the Rank-Finiteness Theorem. We develop arithmetic, representation theoretic and algebraic methods for classifying modular categories by rank. As an…

Quantum Algebra · Mathematics 2016-03-23 Paul Bruillard , Siu-Hung Ng , Eric C. Rowell , Zhenghan Wang