Metraipolis › archive › dc_666352d5174d
Matching algebras and their Dunkl subalgebras — arXiv:2609.34260
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.34260
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T23:29:12.475Z
- SHA-256 of the archived text
6c17bbc42cf484c8550eac6b1920037ffe179b1c6d52aeec8ae7934b106b8c54- Stable URL of this page
https://metraipolis.com/documento/dc_666352d5174d
How to cite
Matching algebras and their Dunkl subalgebras — arXiv:2609.34260 — arXiv (en), https://arxiv.org/abs/2609.34260 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_666352d5174d (Metraipolis archive dc_666352d5174d, sha256 6c17bbc42cf484c8550eac6b1920037ffe179b1c6d52aeec8ae7934b106b8c54)
BibTeX
@misc{dc666352d5174d,
title = {Matching algebras and their Dunkl subalgebras — arXiv:2609.34260},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.34260},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_666352d5174d; sha256 6c17bbc42cf484c8550eac6b1920037ffe179b1c6d52aeec8ae7934b106b8c54},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.34260. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For a finite simple graph $G = (V, E)$, we consider the quotient algebra $\mathcal M(G)$ of the polynomial ring in the variables $u_e$ (for $e \in E$) by the ideal generated by all products $u_e u_f$ for non-disjoint edges $e$ and $f$ (including all squares $u_e^2$). This quotient is called the matching algebra of $G$, since it has a basis indexed by the matchings of $G$. In this quotient, we define a subalgebra $\mathcal D(G)$ generated by the signed incidence sums $\theta_v=\sum_{e=(v,w)}u_e-\sum_{e=(w,v)}u_e$ for all $v \in V$ (where all edges of $G$ are oriented arbitrarily); we call this the Dunkl matching algebra. We show that, as a graded vector space, $\mathcal D(G)$ is dual to the span of all polynomials $p_M = \prod_{(i,j) \in M} (x_i - x_j)$, where $M$ ranges over all matchings of $G$. For the complete graph $K_n$, the latter span is a direct sum of two-row Specht modules (one in each degree); thus its Hilbert series is that of the Catalan triangle, and, in characteristic zero, the Dunkl matching algebra can be presented by linear and quadratic relations. For arbitrary graphs, we formulate the saturation problem of deciding when the selected matching Specht generators $p_M$ in a given degree $k$ span the full two-row Specht module $S^{(n-k,k)}$. We show that saturation in degree $k$ forces $k$-connectivity, that saturation in degree $2$ is equivalent to $2$-connectivity, and that $k$-linked graphs are saturated in degree $k$. We also prove saturation in every possible degree whenever the complement of $G$ is a matching. We show that the Dunkl matching algebra equals the full matching algebra exactly for forests, and give an explicit Hilbert series formula for unicyclic graphs.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Commutative Algebra (math.AC).
Pagina del lavoro: https://arxiv.org/abs/2609.34260 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T23:08:10.843Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).