Search arXivSearch

arXiv · 2210.12483

The Euler characteristic, $q$-matroids, and a Möbius function

Abstract

We first give two new proofs of an old result that the reduced Euler characteristic of a matroid complex is equal to the Möbius number of the lattice of cycles of the matroid up to the sign. The purpose has been to find a model to establish an analogous result for the case of $q$-matroids and we find a relation between the Euler characteristic of the simplicial chain complex associated to a $q$-matroid complex and the lattice of $q$-cycles of the $q$-matroid. We use this formula to find the complete homology over $\mathbb{Z}$ of this shellable simplicial complex. We give a characterization of nonzero Euler characteristic for such order complexes. Finally, based on these results we remark why singular homology of a $q$-matroid equipped with order topology may not be effective to describe the $q$-cycles unlike the classical case of matroids.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Trygve Johnsen, Rakhi Pratihar, Tovohery Hajatiana Randrianarisoa. 2022-10-22. The Euler characteristic, $q$-matroids, and a Möbius function. https://arxiv.org/abs/2210.12483

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO