Search arXiv⌕ Search

arXiv · 2609.29927

Chromatic word-quasisymmetric functions of matroids

Abstract

Billera, Jia, and Reiner (2009) introduced the quasisymmetric functions of matroids and showed that this defines a Hopf algebra homomorphism which is a valuative invariant, i.e., isomorphic matroids have the same quasisymmetric function and polytopal subdivisions of matroid base polytopes define relations among the corresponding quasisymmetric functions. In this project we study an analogue in non-commuting variables, the word-quasisymmetric functions. To every matroid $M$ we associate a word-quasisymmetric function $ψ(M)$ and call this the chromatic word-quasisymmetric functions of a matroid. Matroids and word-quasisymmetric functions form Hopf algebras, and our map $ψ$ between them is a homomorphism. We want to study the kernel, equivalently the image, of the map $ψ$ from matroids to word-quasisymmetric functions, that is, we would like to understand which matroids are indistinguishable by the chromatic word-quasisymmetric functions. The map $ψ$ is not an invariant, but we can show that it is valuative. Using Schubert matroids and nested matroids, special classes of matroids, we prove a lower bound of $2^d-d$ for the rank of the map $ψ$ from matroids to the chromatic word-quasisymmetric functions in degree $d$ and conjecture the upper bound of $d!$ is tight.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Raul Penaguiao, Sophie Rehberg. 2026-09-24. Chromatic word-quasisymmetric functions of matroids. https://arxiv.org/abs/2609.29927

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↗