English
Related papers

Related papers: Unavoidable flats in matroids representable over p…

200 papers

It has been conjectured that asymptotically almost all matroids are sparse paving, i.e. that $s(n) \sim m(n)$, where $m(n)$ denotes the number of matroids on a fixed groundset of size $n$, and $s(n)$ the number of sparse paving matroids. In…

Combinatorics · Mathematics 2016-01-26 Rudi Pendavingh , Jorn van der Pol

In this paper, we give a new axioms system based on nonseparable flats with their ranks to define a matroid. We deduce a polynomial time algorithm for deciding if a given matroid (respectively, arbitrary structure) is an uniform matroid.…

Combinatorics · Mathematics 2024-02-15 Brahim Chaourar

A well-known result by Graham in Euclidean Ramsey Theory states that, for every positive real number $A$, every coloring of the plane with finite number of colors contains a monochromatic triangle of area $A$. We consider canonical versions…

Combinatorics · Mathematics 2026-03-17 Sukumar Das Adhikari , Tássio Naia , Oriol Serra

For any positive integer $l$ we prove that if $M$ is a simple matroid with no $(l+2)$-point line as a minor and with sufficiently large rank, then $|E(M)|\le \frac{q^{r(M)}-1}{q-1}$, where $q$ is the largest prime power less than or equal…

Combinatorics · Mathematics 2011-05-23 Jim Geelen , Peter Nelson

Let G(K) be the group of K-rational points of a connected adjoint simple algebraic group defined over a non-archimedean local field K. In this paper we classify the unipotent representations of G(K) in terms of the geometry of the Langlands…

Representation Theory · Mathematics 2007-05-23 G. Lusztig

A framework consists of an undirected graph $G$ and a matroid $M$ whose elements correspond to the vertices of $G$. Recently, Fomin et al. [SODA 2023] and Eiben et al. [ArXiV 2023] developed parameterized algorithms for computing paths of…

Data Structures and Algorithms · Computer Science 2023-05-04 Fedor V. Fomin , Petr A. Golovach , Tuukka Korhonen , Giannos Stamoulis

The Topological Representation Theorem for (oriented) matroids states that every (oriented) matroid can be realized as the intersection lattice of an arrangement of codimension one homotopy spheres on a homotopy sphere. In this paper, we…

Combinatorics · Mathematics 2015-03-19 Matthew T. Stamps

We study a matrix-based notion of matroid representation over local commutative rings obtained by replacing linear independence with modular independence. This construction always defines an independence system, though not necessarily a…

Combinatorics · Mathematics 2026-03-11 Koji Imamura , Keisuke Shiromoto

It is shown that the lattices of flats of boolean representable simplicial complexes are always atomistic, but semimodular if and only if the complex is a matroid. A canonical construction is introduced for arbitrary finite atomistic…

Combinatorics · Mathematics 2015-10-20 Stuart Margolis , John Rhodes , Pedro V. Silva

In this paper we show that two dimensional (mod p) Galois representations satisfying mild hypotheses can be lifted to p-adic Galois representations ramified at infinitely many primes such that the characteristic polynomials of Frobenius at…

Number Theory · Mathematics 2007-05-23 Chandrashekhar Khare , Michael Larsen , Ravi Ramakrishna

A maniplex of rank n is a connected, n-valent, edge-coloured graph that generalises abstract polytopes and maps. If the automorphism group of a maniplex M partitions the vertex-set of M into k distinct orbits, we say that M is a k-orbit…

Combinatorics · Mathematics 2018-12-12 Daniel Pellicer , Primož Potočnik , Micael Toledo

A coloring of a matroid is an assignment of colors to the elements of its ground set. We restrict to proper colorings - those for which elements of the same color form an independent set. Seymour proved that a $k$-colorable matroid is also…

Combinatorics · Mathematics 2016-01-29 Michał Lasoń

Let $k$ and $p$ be positive integers and let $Q$ be a finite point set in general position in the plane. We say that $Q$ is $(k,p)$-Ramsey if there is a finite point set $P$ such that for every $k$-coloring $c$ of $\binom{P}{p}$ there is a…

Combinatorics · Mathematics 2017-10-23 Martin Balko , Jan Kynčl , Stefan Langerman , Alexander Pilz

For a lattice polytope $P$, the rank of $P$ is defined by $F-(\dim P+1)$, where $F$ is the number of facets of $P$. In this paper, we study matroid polytopes with small rank. More precisely, we characterize matroid independence polytopes…

Combinatorics · Mathematics 2025-03-31 Masato Konoike , Koji Matsushita

We consider the GF$(4)$-representable matroids with a circuit-hyperplane such that the matroid obtained by relaxing the circuit-hyperplane is also GF$(4)$-representable. We characterize the structure of these matroids as an application of…

Combinatorics · Mathematics 2018-06-04 Ben Clark , James Oxley , Stefan H. M. van Zwam

Let K be an arbitrary (commutative) field with at least three elements, and let n, p and r be positive integers with r<=min(n,p). In a recent work, we have proved that an affine subspace of M_{n,p}(K) containing only matrices of rank…

Rings and Algebras · Mathematics 2012-05-10 Clément de Seguins Pazzis

This paper initiates the explicit study of face numbers of matroid polytopes and their computation. We prove that, for the large class of split matroid polytopes, their face numbers depend solely on the number of cyclic flats of each rank…

Combinatorics · Mathematics 2025-07-02 Luis Ferroni , Benjamin Schröter

We calculate the number of the isomorphism class of the finite flat models over the ring of integers of an absolutely ramified $p$-adic field of constant group schemes of rank two over finite fields, by counting the rational points of a…

Number Theory · Mathematics 2020-11-24 Naoki Imai

We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in $\Sigma_2^p$. In the case of linear matroids, which are represented over polynomially growing fields, we note that the problem is…

Computational Complexity · Computer Science 2008-11-25 Raghavendra Rao B. V. , Jayalal M. N. Sarma

A new connection between two different necessary conditions for a polymatroid to be linearly representable is presented. Specifically, we prove that the existence of a tensor product with the uniform matroid of rank two on three elements…

Combinatorics · Mathematics 2025-02-20 Carles Padró