Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1005.5640

A Generalization of NBC Bases to Broken Circuit Complexes of Matroids

Andri Egilsson·Martina Kubitzke
View original source ↗Read source document ↗Export metadata ↓

Abstract

Brown has shown that the Stanley-Reisner ring of the broken circuit complex of a graph has a linear system of parameters which is defined in terms of the circuits and cocircuits of the graph. Later on Brown and Sagan conjectured a special set of monomials - a so-called NBC basis - described in terms of the circuits and cocircuits of the graph to be a monomial basis for the corresponding quotient of the Stanley-Reisner ring and proved this to be true for theta and phi graphs. We generalize the aforementioned linear system of parameters to broken circuit complexes of regular matroids and transfer the notion of NBC bases to the general setting of regular matroids. We are able to obtain the analogous results to the ones of Brown and Sagan in this more general context. We show a deletion-contraction axiom for the existence of NBC bases. Using this results we identify two infinite classes of matroids which have NBC bases and which are the matroid theoretic analogue of theta and phi graphs.

Explore related subjects

math.COmath.AC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andri Egilsson, Martina Kubitzke. 2010-05-31. A Generalization of NBC Bases to Broken Circuit Complexes of Matroids. https://arxiv.org/abs/1005.5640

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗