English
Related papers

Related papers: A generalisation of uniform matroids

200 papers

We prove that the maximum size of a simple binary matroid of rank $r \geq 5$ with no AG(3,2)-minor is $\binom{r+1}{2}$ and characterise those matroids achieving this bound. When $r \geq 6$, the graphic matroid $M(K_{r+1})$ is the unique…

Combinatorics · Mathematics 2013-04-10 Joseph P. S. Kung , Dillon Mayhew , Irene Pivotto , Gordon F. Royle

Over a decade ago De Loera, Haws and K\"oppe conjectured that Ehrhart polynomials of matroid polytopes have only positive coefficients and that the coefficients of the corresponding $h^*$-polynomials form a unimodal sequence. The first of…

Combinatorics · Mathematics 2022-08-05 Luis Ferroni , Katharina Jochemko , Benjamin Schröter

A simple binary matroid is called $I_4$-free if none of its rank-4 flats are independent sets. These objects can be equivalently defined as the sets $E$ of points in $PG(n-1,2)$ for which $|E \cap F|$ is not a basis of $F$ for any…

Combinatorics · Mathematics 2020-05-04 Peter Nelson , Kazuhiro Nomoto

One characterization of binary matroids is that the symmetric difference of every pair of intersecting circuits is a disjoint union of circuits. This paper considers circuit-difference matroids, that is, those matroids in which the…

Combinatorics · Mathematics 2020-08-11 George Drummond , Tara Fife , Kevin Grace , James Oxley

Let $EX[M_1\dots, M_k]$ denote the class of binary matroids with no minors isomorphic to $M_1, \dots, M_k$. In this paper we give a decomposition theorem for $EX[S_{10}, S_{10}^*]$, where $S_{10}$ is a certain 10-element rank-4 matroid. As…

Combinatorics · Mathematics 2014-05-21 Sandra Kingan

For a matroid $M$, an element $e$ such that both $M\backslash e$ and $M/e$ are regular is called a regular element of $M$. We determine completely the structure of non-regular matroids with at least two regular elements. Besides four small…

Combinatorics · Mathematics 2015-09-15 Sandra Kingan , Manoel Lemos

A pure quantum state is called $k$-uniform if all its reductions to $k$-qudit are maximally mixed. We investigate the general constructions of $k$-uniform pure quantum states of $n$ subsystems with $d$ levels. We provide one construction…

Information Theory · Computer Science 2015-11-26 Keqin Feng , Lingfei Jin , Chaoping Xing , Chen Yuan

The prism graph is the dual of the complete graph on five vertices with an edge deleted, $K_5\backslash e$. In this paper we determine the class of binary matroids with no prism minor. The motivation for this problem is the 1963 result by…

Combinatorics · Mathematics 2015-09-15 Sandra Kingan , Manoel Lemos

We consider some applications of our characterisation of the internally 4-connected binary matroids with no M(K3,3)-minor. We characterise the internally 4-connected binary matroids with no minor in some subset of…

Combinatorics · Mathematics 2017-03-03 Dillon Mayhew , Gordon Royle , Geoff Whittle

A phased matroid is a matroid with additional structure which plays the same role for complex vector arrangements that oriented matroids play for real vector arrangements. The realization space of an oriented (resp., phased) matroid is the…

Combinatorics · Mathematics 2018-07-20 Amanda Ruiz

It is well known that linear rank-metric codes give rise to q-polymatroids. Analogously to matroid theory one may ask whether a given q-polymatroid is representable by a rank-metric code. We provide an answer by presenting an example of a…

Information Theory · Computer Science 2022-03-14 Heide Gluesing-Luerssen , Benjamin Jany

Every bi-uniform matroid is representable over all sufficiently large fields. But it is not known exactly over which finite fields they are representable, and the existence of efficient methods to find a representation for every given…

Combinatorics · Mathematics 2014-07-29 Simeon Ball , Carles Padró , Zsuzsa Weiner , Chaoping Xing

We present a new type of equivalence for representable matroids that uses the automorphisms of the underlying matroid. Two $r\times n$ matrices $A$ and $A'$ representing the same matroid $M$ over a field $F$ are {\it geometrically…

Combinatorics · Mathematics 2015-09-16 S. R. Kingan

Motivated by the notion of the inverse $Z$-polynomial introduced by Ferroni, Matherne, Stevens, and Vecchi, we study the equivariant inverse $Z$-polynomial of a matroid equipped with a finite group. We prove that the coefficients of the…

Combinatorics · Mathematics 2026-01-27 Alice L. L. Gao , Yun Li , Matthew H. Y. Xie

The notion of thin sums matroids was invented to extend the notion of representability to non-finitary matroids. A matroid is tame if every circuit-cocircuit intersection is finite. We prove that a tame matroid is a thin sums matroid over a…

Combinatorics · Mathematics 2012-12-18 Nathan Bowler , Johannes Carmesin

Let $(M, q)$ be a quadratic projective module of an odd rank over an commutative ring, where the form $q$ is semiregular, with global Witt index of at least $2$, and with $\mathrm{rk}(M) \ge 7$. We prove standard commutator formulae and…

Group Theory · Mathematics 2026-01-05 Leonid Danilevich

Let $M$ be a matroid on a finite ground set $E$, and suppose that the automorphism group of $M$ acts transitively on $E$. We show the following: if $X_1,\ldots,X_K$ are sampled independently from a distribution $p$ on $E$, then the…

Combinatorics · Mathematics 2026-05-25 Mladen Kovačević

Each square complex matrix is unitarily similar to an upper triangular matrix with diagonal entries in any prescribed order. Let A and B be upper triangular n-by-n matrices that (i) are not similar to direct sums of matrices of smaller…

Representation Theory · Mathematics 2011-10-19 Douglas Farenick , Vyacheslav Futorny , Tatiana G. Gerasimova , Vladimir V. Sergeichuk , Nadya Shvai

Let $U_{n,d}$ denote the uniform matroid of rank $d$ on $n$ elements. We obtain some recurrence relations satisfied by Speyer's $g$-polynomials $g_{U_{n,d}}(t)$ of $U_{n,d}$. Based on these recurrence relations, we prove that the polynomial…

Combinatorics · Mathematics 2024-08-29 Rong Zhang , James Jing Yu Zhao

If $M$ is a matroid, then a simple matroid $M'$ with the same rank as $M$ is an adjoint of $M$ if there is an inclusion-reversing embedding $\phi$ of the lattice of flats of $M$ into the lattice of flats of $M'$ such that $\phi$ maps the…

Combinatorics · Mathematics 2025-02-25 Kevin Grace
‹ Prev 1 3 4 5 6 7 10 Next ›