Search arXivSearch

arXiv · 2509.21618

Polynomial Invariants of q-Matroids and Rank-Metric Codes

Abstract

It is shown that the Whitney function of a representable q-matroid and the collection of all higher weight enumerators of any representing rank-metric code determine each other via a monomial substitution. Moreover, the q-matroid itself and the collection of all higher support enumerators of the code determine each other. Next, it is proven that the Whitney function of a q-matroid and the Whitney function of its projectivization determine each other via a monomial substitution. Finally, q-matroids with isomorphic projectivizations are studied. It is shown that the projectivizations are isomorphic iff the q-matroids admit a dimension-preserving lattice isomorphism between their lattices of flats. Such q-matroids are called weakly isomorphic.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Heide Gluesing-Luerssen, Benjamin Jany. 2025-09-25. Polynomial Invariants of q-Matroids and Rank-Metric Codes. https://arxiv.org/abs/2509.21618

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