English
Related papers

Related papers: An independent set axiomatization for symplectic m…

200 papers

Let $M$ be a matroid on a set $E$ and let $w:E\longrightarrow G$ be a weight function, where $G$ is a cyclic group. Assuming that $w(E)$ satisfies the Pollard's Condition (i.e. Every non-zero element of $w(E)-w(E)$ generates $G$), we obtain…

Combinatorics · Mathematics 2009-03-05 Y. O. Hamidoune , I. P. da Silva

Graph independence (also known as $\epsilon$-independence or $\lambda$-independence) is a mixture of classical independence and free independence corresponding to graph products or groups and operator algebras. Using conjugation by certain…

We show that the class of Metropolis-Rota implication algebras can be given a universal axiomatization using an operation closely related to composition in oriented matroids. Lastly we describe the role of our new operation in the collapse…

Combinatorics · Mathematics 2009-02-03 Colin Bailey , Joseph Oliveira

We define a matroid invariant called the three-cosystole that is related to higher notions of cogirth for weighted matroids, and we prove an optimal upper bound for it in the class of regular matroids of rank at most six. To accomplish…

Combinatorics · Mathematics 2026-05-21 James Dylan Douthitt , Elana Israel , Lee Kennard

An arithmetic matroid is weakly multiplicative if the multiplicity of at least one of its bases is equal to the product of the multiplicities of its elements. We show that if such an arithmetic matroid can be represented by an integer…

Combinatorics · Mathematics 2019-10-04 Matthias Lenz

One approach to studying the dynamics of a singular Lagrangian system is to attempt to regularize it, that is, to find an equivalent and regular system. In the case of time-independent singular Lagrangians, an approach due to \textit{A.…

Differential Geometry · Mathematics 2026-03-26 Manuel De León , Rubén Izquierdo-López , Luca Schiavone , Pablo Soto

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

We give an explicit description of the poset of cells of Bergman complexes of Lattice Path Matroids and establish a criterion for its simpliciality, in terms of the shape of the bounding paths.

Combinatorics · Mathematics 2015-08-21 Emanuele Delucchi , Martin Dlugosch

We use the geometry of the stellahedral toric variety to study matroids. We identify the valuative group of matroids with the cohomology ring of the stellahedral toric variety, and show that valuative, homological, and numerical equivalence…

Algebraic Geometry · Mathematics 2023-09-08 Christopher Eur , June Huh , Matt Larson

As we said in our previous work [4], the main idea of our research is to introduce a class of Lie groupoids by means of co-adjoint representation of a Lie groupoid on its isotropy Lie algebroid, which we called coadjoint Lie groupoids. In…

Dynamical Systems · Mathematics 2024-11-26 Ghorbanali Haghighatdoost , Rezvaneh Ayoubi

We give one more proof of the fact that symplectic matrices over real and complex fields have determinant one. While this has already been proved many times, there has been lasting interest in finding an elementary proof. Our result is…

History and Overview · Mathematics 2022-10-11 Donsub Rim

The core of the Taylor-Wiles and Taylor-Wiles-Kisin method in proving modularity lifting theorems is the construction of Taylor-Wiles primes satisfying certain conditions relating automorphic side and Galois side. In this article, we…

Number Theory · Mathematics 2025-08-21 Xiaoyu Zhang

The asyptotic number of nonequivalent binary n-codes is determined. This is also the asymptotic number of nonisomorphic binary n-matroids. The connection to a result of Lefmann, Roedl, Phelps is explored. The latter states that almost all…

Information Theory · Computer Science 2017-03-01 Marcel Wild

We conjecture that the class of frame matroids can be characterised by a sentence in the monadic second-order logic of matroids, and we prove that there is such a characterisation for the class of bicircular matroids. The proof does not…

Combinatorics · Mathematics 2021-03-02 Daryl Funk , Dillon Mayhew , Mike Newman

We give a simple polynomial time approximation scheme for the weighted matroid matching problem on strongly base orderable matroids. We also show that even the unweighted version of this problem is NP-complete and not in oracle-coNP.

Data Structures and Algorithms · Computer Science 2011-02-18 José A. Soto

Matroids are combinatorial abstractions of independence, a ubiquitous notion that pervades many branches of mathematics. June Huh and his collaborators recently made spectacular breakthroughs by developing a Hodge theory of matroids that…

Combinatorics · Mathematics 2023-06-08 Christopher Eur

We compute Aut(W) for any even Coxeter group whose Coxeter diagram is connected, contains no edges labeled 2, and cannot be separated into more than 2 connected components by removing a single vertex. The description is given explicitly in…

Group Theory · Mathematics 2007-05-23 Patrick Bahls

Milgrom (2017) has proposed a heuristic for determining a maximum weight basis of an independence system ${\mathcal I}$ given that we want an approximation guarantee only for sets in a prescribed ${\mathcal O}\subseteq {\mathcal I}$. This…

Discrete Mathematics · Computer Science 2020-04-08 Sven de Vries , Rakesh V. Vohra

We define and study q-delta-matroids, and q-g-matroids. These objects are analogues, for finite-dimensional vector spaces over finite fields, of delta-matroids and g-matroids arising from finite sets. We compare axiomatic descriptions with…

Combinatorics · Mathematics 2025-05-08 Michela Ceria , Trygve Johnsen , Relinde Jurrius

In 1977 Stanley conjectured that the $h$-vector of a matroid independence complex is a pure $O$-sequence. In this paper we use lexicographic shellability for matroids to motivate a combinatorial strengthening of Stanley's conjecture. This…

Combinatorics · Mathematics 2014-06-10 Steven Klee , Jose Alejandro Samper