English
Related papers

Related papers: Matroids over a ring

200 papers

We investigate special points on the Grassmannian which correspond to friezes with coefficients in the case of rank two. Using representations of arithmetic matroids we obtain a theorem on subpolygons of specializations of the coordinate…

Combinatorics · Mathematics 2022-07-20 Michael Cuntz

The h-vector of a matroid M is an important invariant related to the independence complex of M and can also be recovered from an evaluation of its Tutte polynomial. A well-known conjecture of Stanley posits that the h-vector of a matroid is…

Combinatorics · Mathematics 2025-09-16 Scott Corry , Anton Dochtermann , Solís McClain , David Perkinson , Lixing Yi

Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…

Combinatorics · Mathematics 2011-10-05 Mike Develin , Jeremy L. Martin , Victor Reiner

In this work we present an algorithm to construct sparse-paving matroids over finite set $S$. From this algorithm we derive some useful bounds on the cardinality of the set of circuits of any Sparse-Paving matroids which allow us to prove…

Combinatorics · Mathematics 2018-10-18 B. Mederos , M. Takane , G. Tapia-Sanchez , B. Zavala

It is well known that a matroid L is a lift of a matroid M if and only if every circuit of L is the union of some circuits of M. In this paper we give a simpler proof of this important theorem. We also described a discrete homotopy theorem…

Combinatorics · Mathematics 2022-10-03 Jose De Jesus , Alexander Kelmans

We begin with a review of Tutte's homotopy theory, which concerns the structure of certain graph associated to a matroid (together with some extra data). Concretely, Tutte's path theorem asserts that this graph is connected, and his…

Combinatorics · Mathematics 2026-01-21 Matthew Baker , Tong Jin , Oliver Lorscheid

Rough set theory is a useful tool to deal with uncertain, granular and incomplete knowledge in information systems. And it is based on equivalence relations or partitions. Matroid theory is a structure that generalizes linear independence…

Artificial Intelligence · Computer Science 2012-10-24 Yanfang Liu , William Zhu

We prove that the Tutte polynomial of a coloopless paving matroid is convex along the portions of the line segments x+y=p lying in the positive quadrant. Every coloopless paving matroids is in the class of matroids which contain two…

Combinatorics · Mathematics 2010-04-16 L. E. Chavez-Lomelí , C. Merino , S. D. Noble , M. Ramírez-Ibañez

We introduce a connectivity function for infinite matroids with properties similar to the connectivity function of a finite matroid, such as submodularity and invariance under duality. As an application we use it to extend Tutte's linking…

Combinatorics · Mathematics 2011-01-31 Henning Bruhn , Paul Wollan

Let $R$ be a commutative noetherian ring. The $n$-semidualizing modules of $R$ are generalizations of its semidualizing modules. We will prove some basic properties of $n$-semidualizing modules. Our main result and example shows that the…

Commutative Algebra · Mathematics 2022-10-04 Tony Se

We give a semi-small orthogonal decomposition of the Chow ring of a matroid M. The decomposition is used to give simple proofs of Poincar\'e duality, the hard Lefschetz theorem, and the Hodge-Riemann relations for the Chow ring, recovering…

Algebraic Geometry · Mathematics 2020-10-15 Tom Braden , June Huh , Jacob P. Matherne , Nicholas Proudfoot , Botong Wang

Subject to hypotheses based on the matroid structure theory of Geelen, Gerards, and Whittle, we completely characterize the highly connected members of the class of golden-mean matroids and several other closely related classes of…

Combinatorics · Mathematics 2021-01-13 Kevin Grace

We provide a complete classification of all tilting modules and tilting classes over almost perfect domains, which generalizes the classifications of tilting modules and tilting classes over Dedekind and 1-Gorenstein domains. Assuming the…

Commutative Algebra · Mathematics 2009-03-09 Jawad Abuhlail , Mohammad Jarrar

We show that given a finitely generated standard-graded algebra of dimension $d$ over an infinite field, its graded Noether normalizations obey a certain kind of `generic exchange', allowing one to pass between any two of them in at most…

Commutative Algebra · Mathematics 2011-07-07 Joseph P. Brennan , Neil Epstein

Over a finite field $\mathbb{F}_{q^m}$, the evaluation of skew polynomials is intimately related to the evaluation of linearized polynomials. This connection allows one to relate the concept of polynomial independence defined for skew…

Information Theory · Computer Science 2016-10-26 Siyu Liu , Felice Manganiello , Frank R. Kschischang

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

Computational Complexity · Computer Science 2014-08-19 Robert L. Surowka , Kenneth W. Regan

Matroid varieties are the closures in the Grassmannian of sets of points defined by specifying which Pl\"ucker coordinates vanish and which don't --- the set of nonvanishing Pl\"ucker coordinates forms a well-studied object called a…

Algebraic Geometry · Mathematics 2015-08-11 Nicolas Ford

We make progress towards characterizing the algebraic matroid of the determinantal variety defined by the minors of fixed size of a matrix of variables. Our main result is a novel family of base sets of the matroid, which characterizes the…

Algebraic Geometry · Mathematics 2023-02-24 Manolis C. Tsakiris

We recover the Tutte polynomial of a matroid, up to change of coordinates, from an Ehrhart-style polynomial counting lattice points in the Minkowski sum of its base polytope and scalings of simplices. Our polynomial has coefficients of…

Combinatorics · Mathematics 2018-02-28 Amanda Cameron , Alex Fink

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
‹ Prev 1 8 9 10 Next ›