English
Related papers

Related papers: Infinite matroids in tropical differential algebra

200 papers

Describing the combinatorial structure of the tropical complex $C$ of a tropical matroid polytope, we obtain a formula for the coarse types of the maximal cells of $C$. Due to the connection between tropical complexes and resolutions of…

Combinatorics · Mathematics 2010-12-16 Katja Kulas

We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from the problem of computing the pathwidth of a graph, we show…

Discrete Mathematics · Computer Science 2007-07-13 Navin Kashyap

We study the notion of degeneration for affine schemes associated to systems of algebraic differential equations with coefficients in the fraction field of a multivariate formal power series ring. In order to do this, we use an integral…

Algebraic Geometry · Mathematics 2023-09-20 Lara Bossinger , Sebastian Falkensteiner , Cristhian Garay-López , Marc Paul Noordman

We associate to every matroid M a polynomial with integer coefficients, which we call the Kazhdan-Lusztig polynomial of M, in analogy with Kazhdan-Lusztig polynomials in representation theory. We conjecture that the coefficients are always…

Combinatorics · Mathematics 2016-07-04 Ben Elias , Nicholas Proudfoot , Max Wakefield

A transversal matroid whose dual is also transversal is called bi-transversal. Let $G$ be an undirected graph with vertex set $V$. In this paper, for every subset $W$ of $V$, we associate a bi-transversal matroid to the pair $(G,W)$. We…

Combinatorics · Mathematics 2024-03-01 Mahdi Ebrahimi

Let $M$ be a matroid defined on a finite set $E$ and $L\subset E$. $L$ is locked in $M$ if $M|L$ and $M^*|(E\backslash L)$ are 2-connected, and $min\{r(L), r^*(E\backslash L)\} \geq 2$. Locked subsets characterize nontrivial facets of the…

Computational Complexity · Computer Science 2019-06-20 Brahim Chaourar

We consider linear systems arising from the use of the finite element method for solving scalar linear elliptic problems. Our main result is that these linear systems, which are symmetric and positive semidefinite, are well approximated by…

Numerical Analysis · Mathematics 2025-10-20 Erik Boman , Bruce Hendrickson , Stephen Vavasis

We study the tropicalization of the image of the cone of positive definite matrices under the principal minors map. It is a polyhedral subset of the set of $M$-concave functions on the discrete $n$-dimensional cube. We show it coincides…

Combinatorics · Mathematics 2025-09-03 Abeer Al Ahmadieh , Felipe Rincón , Cynthia Vinzant , Josephine Yu

For each odd integer $k\ge 5$, we prove that, if $M$ is a simple rank-$r$ binary matroid with no odd circuit of length less than $k$ and with $|M| > k 2^{r-k+1}$, then $M$ is isomorphic to a restriction of the rank-$r$ binary affine…

Combinatorics · Mathematics 2014-02-25 Jim Geelen

Symmetric powers of matroids were first introduced by Lovasz and Mason in the 1970s, where it was shown that not all matroids admit higher symmetric powers. Since these initial findings, the study of matroid symmetric powers has remained…

Combinatorics · Mathematics 2024-01-04 Nicholas Anderson

We consider the fundamental Matroid Theory problem of finding a circuit in a matroid spanning a set T of given terminal elements. For graphic matroids this corresponds to the problem of finding a simple cycle passing through a set of given…

Data Structures and Algorithms · Computer Science 2016-07-20 Fedor V. Fomin , Petr A. Golovach , Daniel Lokshtanov , Saket Saurabh

We consider arrangements of tropical hyperplanes where the apices of the hyperplanes are taken to infinity in certain directions. Such an arrangement defines a decomposition of Euclidean space where a cell is determined by its `type' data,…

Commutative Algebra · Mathematics 2025-02-21 Ayah Almousa , Anton Dochtermann , Ben Smith

An infinite matroid is graphic if all of its finite minors are graphic and the intersection of any circuit with any cocircuit is finite. We show that a matroid is graphic if and only if it can be represented by a graph-like topological…

Combinatorics · Mathematics 2013-09-17 Nathan Bowler , Johannes Carmesin , Robin Christian

We prove that for each finite field $\mathbb F$ and integer $k\in \mathbb Z$ there exists $n\in \mathbb Z$ such that no excluded minor for the class of $\mathbb F$-representable matroids has $n$ nested $k$-separations.

Combinatorics · Mathematics 2015-11-12 Shalev Ben-David , Jim Geelen

The objective of this paper is to develop a general algebraic theory of supertropical matrix algebra, extending [11]. Our main results are as follows: * The tropical determinant (i.e., permanent) is multiplicative when all the determinants…

Commutative Algebra · Mathematics 2009-12-07 Zur Izhakian , Louis Rowen

Using a new technique, we prove a rich family of special cases of the matroid intersection conjecture. Roughly, we prove the conjecture for pairs of tame matroids which have a common decomposition by 2-separations into finite parts.

Combinatorics · Mathematics 2014-04-25 Nathan Bowler , Johannes Carmesin

We investigate the asymptotic behavior of entropy polymatroids associated with algebraic matroids over finite fields. Given an algebraic matroid ${\sf M}:=(\mathcal{E},r)$ and the irreducible variety $V$ associated with ${\sf M}$, we…

Combinatorics · Mathematics 2025-09-22 Guillermo Matera

Speyer recognized that matroids encode the same data as a special class of tropical linear spaces and Shaw interpreted tropically certain basic matroid constructions; additionally, Frenk developed the perspective of tropical linear spaces…

Algebraic Geometry · Mathematics 2023-03-03 Colin Crowley , Noah Giansiracusa , Joshua Mundinger

Antimatroids were discovered by Dilworth in the context of lattices [4] and introduced by Edelman and Jamison as convex geometries in[5]. The author of the current paper independently discovered (possibly infinite) antimatroids in the…

Combinatorics · Mathematics 2012-01-17 Christian Joseph Altomare

An algebra $\A$ is said to be an independence algebra if it is a matroid algebra and every map $\al:X\to A$, defined on a basis $X$ of $\A$, can be extended to an endomorphism of $\A$. These algebras are particularly well behaved…

Group Theory · Mathematics 2014-05-29 João Araújo , Wolfram Bentz , Janusz Konieczny
‹ Prev 1 3 4 5 6 7 10 Next ›