English
Related papers

Related papers: A generalisation of uniform matroids

200 papers

$q$-Matroids are defined on complemented modular support lattices. Minors of length 2 are of four types as in a "classical" matroid. Tutte polynomials $\tau(x,y)$ of matroids are calculated either by recursion over deletion/contraction of…

Combinatorics · Mathematics 2017-07-13 Guus Bollen , Henry Crapo , Relinde Jurrius

The unitary Birkhoff theorem states that any unitary matrix with all row sums and all column sums equal unity can be decomposed as a weighted sum of permutation matrices, such that both the sum of the weights and the sum of the squared…

Mathematical Physics · Physics 2018-12-24 Alexis De Vos , Stijn De Baerdemacker

We introduce various quantities that can be defined for an arbitrary matroid, and show that certain conditions on these quantities imply that a matroid is not representable over $\mathbb{F}_q$ where $q$ is a prime power. Mostly, for a…

Combinatorics · Mathematics 2023-06-01 J. Sun , S. B. Damelin

We show that an adjoint of a loopless matroid is connected if and only if it itself is connected. Our first goal is to study the adjoint of modular matroids. We prove that a modular matroid has only one adjoint (up to isomorphism) which can…

Combinatorics · Mathematics 2023-04-18 Houshan Fu , Chunming Tang , Suijie Wang

We prove that if R is a principal ideal ring and A\in\M_n(R) is a matrix with trace zero, then A is a commutator, that is, A=XY-YX for some X,Y\in\M_n(R). This generalises the corresponding result over fields due to Albert and Muckenhoupt,…

Rings and Algebras · Mathematics 2013-02-26 Alexander Stasinski

Let $M$ to 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$. In this paper, we prove that the nontrivial facets…

Computational Complexity · Computer Science 2017-02-24 Brahim Chaourar

Inspired by Kontsevich's graphic orbifold Euler characteristic we define a virtual Euler characteristic for any finite set of isomorphism classes of matroids of rank $r$. Our main result provides a simple formula for the virtual Euler…

Combinatorics · Mathematics 2026-02-05 Madeline Brandt , Juliette Bruce , Daniel Corey

We consider matroids with the property that every subset of the ground set of size $t$ is contained in both an $\ell$-element circuit and an $\ell$-element cocircuit; we say that such a matroid has the $(t,\ell)$-property. We show that for…

Combinatorics · Mathematics 2020-06-02 Nick Brettell , Rutger Campbell , Deborah Chun , Kevin Grace , Geoff Whittle

B\'ar\'any, Kalai, and Meshulam recently obtained a topological Tverberg-type theorem for matroids, which guarantees multiple coincidences for continuous maps from a matroid complex to d-dimensional Euclidean space, if the matroid has…

Combinatorics · Mathematics 2017-05-11 Pavle V. M. Blagojević , Albert Haase , Günter M. Ziegler

Let $M$ be a matroid satisfying a matroidal analogue of the Cayley-Bacharach condition. Given a number $k \ge 2$, we show that there is no nontrivial bound on ranks of a $k$-tuple of flats covering the underlying set of $M$. This addresses…

Combinatorics · Mathematics 2022-11-15 Soohyun Park

Let $\rho$ be a non-negative integer. A $\rho$-removed uniform matroid is a matroid obtained from a uniform matroid by removing a collection of $\rho$ disjoint bases. We present a combinatorial formula for Kazhdan-Lusztig polynomials of…

Combinatorics · Mathematics 2019-11-13 Kyungyong Lee , George D. Nasr , Jamie Radcliffe

The existence of $k$-uniform states has been a widely studied problem due to their applications in several quantum information tasks and their close relation to combinatorial objects like Latin squares and orthogonal arrays. With the…

Quantum Physics · Physics 2025-03-05 Yu Ning , Fei Shi , Tao Luo , Xiande Zhang

A polynomial $A(q)=\sum_{i=0}^n a_iq^i$ is said to be unimodal if $a_0\le a_1\le \cdots \le a_k\ge a_{k+1} \ge \cdots \ge a_n$. We investigate the unimodality of rational $q$-Catalan polynomials, which is defined to be $C_{m,n}(q)=…

Combinatorics · Mathematics 2019-12-05 Guoce Xin , Yueming Zhong

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 components of K*-vectors associated to a simple oriented matroid M are the numbers of general or special tope committees for M. Using the principle of inclusion-exclusion, we determine how the reorientations of M on one-element subsets…

Combinatorics · Mathematics 2010-10-19 Andrey O. Matveev

We consider certain subsets of the space of $n\times n$ matrices of the form $K = \cup_{i=1}^m SO(n)A_i$, and we prove that for $p>1, q \geq 1$ and for connected $\Omega'\subset\subset\Omega\subset \R^n$, there exists positive constant…

Classical Analysis and ODEs · Mathematics 2008-02-07 Robert L. Jerrard , Andrew Lorent

Assume that the vertices of a graph $G$ are always operational, but the edges of $G$ fail independently with probability $q \in[0,1]$. The \emph{all-terminal reliability} of $G$ is the probability that the resulting subgraph is connected.…

Combinatorics · Mathematics 2018-10-01 J. I. Brown , C. D. C. DeGagne

For each proper minor-closed subclass $\cM$ of the $\GF(q^2)$-representable matroids containing all simple $\GF(q)$-representable matroids, we give, for all large $r$, a tight upper bound on the number of points in a rank-$r$ matroid in…

Combinatorics · Mathematics 2011-05-23 Peter Nelson

We provide a simple $(1-O(\frac{1}{\sqrt{k}}))$-selectable Online Contention Resolution Scheme for $k$-uniform matroids against a fixed-order adversary. If $A_i$ and $G_i$ denote the set of selected elements and the set of realized active…

Data Structures and Algorithms · Computer Science 2023-11-28 Atanas Dinev , S. Matthew Weinberg

We consider unimodular matrices $M$ such that neither $M$ nor $M^{-1}$ contain zero entries. Matrices typically exhibit a trade-off: small $M$ imply large $M^{-1}$. We investigate rare cases where both remain small, classify these matrices…

Combinatorics · Mathematics 2026-05-13 Steven Finch