Search arXivSearch

arXiv · 2503.06830

On the one-dimensional extensions of $q$-matroids

Abstract

In this paper we introduce a $q$-analogue of the single-element extensions of matroids for $q$-matroids, which we call one-dimensional extensions. To enumerate such extensions, we define a $q$-analogue of modular cuts and define a certain function which we call a modular cut selector. It assigns each newly appearing one-dimensional subspace to a modular cut. By using these notion, we prove the one-to-one correspondence between the one-dimensional extensions and the modular cut selectors. Furthermore, we define the canonnical representatives of the isomorphic class of the $q$-matroids, which enable us to enumerate non-isomorphic $q$-matroids without the paiwise isomorphism testing. As an application, we develop a classification algorithm for $q$-matroids, and classify all the $q$-matroids on ground spaces over $\mathbb{F}_2$ and $\mathbb{F}_3$ of dimension $4$ and $5$ respectively. We also determine some $5$-dimensional $q$-matroids related to the $q$-Fano plane, which is the $q$-analogue of the Fano plane, over $\mathbb{F}_2$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Koji Imamura, Shinya Kawabuchi, Keisuke Shiromoto. 2025-11-14. On the one-dimensional extensions of $q$-matroids. https://arxiv.org/abs/2503.06830

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