English
Related papers

Related papers: On matrices with different tropical and Kapranov r…

200 papers

This paper contributes to the proof of the conjecture posed in arXiv:1606.02521, stating that a Nichols algebra of diagonal type with finite Gelfand-Kirillov dimension has finite (generalized) root system. We prove the conjecture assuming…

Quantum Algebra · Mathematics 2021-06-21 Iván Angiono , Agustín García Iglesias

To determine whether an $n\times n$-matrix has rank at most $r$ it suffices to check that the $(r+1)\times (r+1)$-minors have rank at most $r$. In other words, to describe the set of $n\times n$-matrices with the property of having rank at…

Algebraic Geometry · Mathematics 2024-06-14 Andreas Blatter

We introduce the monic rank of a vector relative to an affine-hyperplane section of an irreducible Zariski-closed affine cone $X$. We show that the monic rank is finite and greater than or equal to the usual $X$-rank. We describe an…

Algebraic Geometry · Mathematics 2020-06-15 Arthur Bik , Jan Draisma , Alessandro Oneto , Emanuele Ventura

Let $p',q'\in R^n$. Write $p'\sim q'$ if $p'-q'$ is a multiple of $(1,\ldots,1)$. Two different points $p$ and $q$ in $R^n/\sim$ uniquely determine a tropical line $L(p,q)$, passing through them, and stable under small perturbations. This…

Metric Geometry · Mathematics 2014-04-11 M. J. de la Puente

Tropical geometry gives a bound on the ranks of divisors on curves in terms of the combinatorics of the dual graph of a degeneration. We show that for a family of examples, curves realizing this bound might only exist over certain…

Algebraic Geometry · Mathematics 2018-06-18 Dustin Cartwright

The orthogonal decomposition factorizes a tensor into a sum of an orthogonal list of rankone tensors. We present several properties of orthogonal rank. We find that a subtensor may have a larger orthogonal rank than the whole tensor and…

Numerical Analysis · Mathematics 2022-12-05 Chao Zeng

Flag matroids are combinatorial abstractions of flags of linear subspaces, just as matroids are of linear subspaces. We introduce the flag Dressian as a tropical analogue of the partial flag variety, and prove a correspondence between: (a)…

Combinatorics · Mathematics 2021-03-08 Madeline Brandt , Christopher Eur , Leon Zhang

We present an example of a subfield $\mathcal{F}\subset\mathbb{R}$ and a matrix $A$ whose conventional and nonnegative ranks equal five, but the nonnegative rank with respect to $\mathcal{F}$ equals six. In other words, $A$ can be…

Combinatorics · Mathematics 2019-07-25 Yaroslav Shitov

We study the geometry of tropical extensions of hyperfields, including the ordinary, signed and complex tropical hyperfields. We introduce the framework of 'enriched valuations' as hyperfield homomorphisms to tropical extensions, and show…

Algebraic Geometry · Mathematics 2024-11-27 James Maxwell , Ben Smith

Given an explicit presentation of a reflection group of rank two (or any rank two group for that matter), we give a simple procedure for calculating all its systems of imprimitivity, when viewed as a matrix group over the quaternions. This…

Group Theory · Mathematics 2026-01-27 Shayne Waldron

In this paper we describe a parallel algorithm for generating all non-isomorphic rank $3$ simple matroids with a given multiplicity vector. We apply our implementation in the HPC version of GAP to generate all rank $3$ simple matroids with…

Combinatorics · Mathematics 2021-10-26 Mohamed Barakat , Reimer Behrends , Christopher Jefferson , Lukas Kühne , Martin Leuner

We show that for any $k$ at least $6$ and $g$ sufficiently large, the mapping class group of a surface of genus $g$ can be generated by three elements of order $k$. We also show that this can be done with four elements of order $5$. We…

Geometric Topology · Mathematics 2017-10-16 Justin Lanier

We show that computing the minimum rank of a sign pattern matrix is NP hard. Our proof is based on a simple but useful connection between minimum ranks of sign pattern matrices and the stretchability problem for pseudolines arrangements. In…

Computational Complexity · Computer Science 2015-05-18 Amey Bhangale , Swastik Kopparty

Generalizing supertropical algebras, we present a "layered" structure, "sorted" by a semiring which permits varying ghost layers, and indicate how it is more amenable than the "standard" supertropical construction in factorizations of…

Commutative Algebra · Mathematics 2011-08-16 Zur Izhakian , Manfred Knebusch , Louis Rowen

We study Green's J-order and J-equivalence for the semigroup of all n-by-n matrices over the tropical semiring. We give an exact characterisation of the J-order, in terms of morphisms between tropical convex sets. We establish connections…

Rings and Algebras · Mathematics 2012-01-05 Marianne Johnson , Mark Kambites

The tropical Grassmannian parameterizes tropicalizations of linear spaces, while the Dressian parameterizes all planes in $\TP^{n-1}$. We study these parameter spaces and we compute them explicitly for $n \leq 7$. Planes are identified with…

Combinatorics · Mathematics 2014-12-23 Sven Herrmann , Anders Jensen , Michael Joswig , Bernd Sturmfels

The purpose of this note is to give a linear algebra algorithm to find out if a rank of a given tensor over a field $\F$ is at most $k$ over the algebraic closure of $\F$, where $k$ is a given positive integer. We estimate the arithmetic…

Combinatorics · Mathematics 2020-11-17 Mohsen Aliabadi , Shmuel Friedland

We show factorization of polynomials in one variable over the tropical semiring is in general NP-complete, either if all coefficients are finite, or if all are either 0 or infinity (Boolean case). We give algorithms for the factorization…

Combinatorics · Mathematics 2007-05-23 Ki Hang Kim , Fred W. Roush

We prove the meridional rank conjecture for arborescent links associated to plane trees with the following property: all branching points carry a straight branch to at least three leaves. The proof involves an upper bound on the bridge…

Geometric Topology · Mathematics 2023-04-05 Sebastian Baader , Ryan Blair , Alexandra Kjuchukova , Filip Misev

We study the maximal rank in affine subspaces of symmetric or alternating matrices, in terms of the matching numbers of certain associated graphs. Applications include simple proofs of upper bounds on the dimension of such subspaces in…

Combinatorics · Mathematics 2017-03-17 Roy Meshulam
‹ Prev 1 3 4 5 6 7 10 Next ›