Search arXiv⌕ Search

arXiv · 2508.00132

The symmetric strong circuit elimination property

Abstract

If $C_1$ and $C_2$ are circuits in a matroid $M$ with $e_1$ in $C_1-C_2$ and $e$ in $C_1\cap C_2$, then $M$ has a circuit $C_3$ such that $e\in C_3\subseteq (C_1\cup C_2)-e$. This strong circuit elimination axiom is inherently asymmetric. A matroid $M$ has the symmetric strong circuit elimination property (SSCE) if, when the above conditions hold and $e_2\in C_2-C_1$, there is a circuit $C_3'$ with $\{e_1,e_2\}\subseteq C_3'\subseteq (C_1\cup C_2)-e$. We prove that a connected matroid has this property if and only if it has no two skew circuits. We also characterize such matroids in terms of forbidden series minors, and we give a new matroid axiom system that is built around a modification of SSCE.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christine Cho, James Oxley, Suijie Wang. 2025-07-31. The symmetric strong circuit elimination property. https://arxiv.org/abs/2508.00132

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗