English
Related papers

Related papers: Geometric Bijections for Regular Matroids, Zonotop…

200 papers

A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…

Combinatorics · Mathematics 2018-10-08 Mark Dukes , Thomas Selig , Jason P. Smith , Einar Steingrimsson

Let K be an algebraically closed field which is complete with respect to a nontrivial, non-Archimedean valuation and let \Lambda be its value group. Given a smooth, proper, connected K-curve X and a skeleton \Gamma of the Berkovich…

Algebraic Geometry · Mathematics 2013-08-20 Matthew Baker , Joseph Rabinoff

We prove several results about matroids and matroidal families associated with rigidity in dimension $2$. In particular, we establish new properties of the generic rigidity matroid family $\mathcal{R}$ and Kalai's hyperconnectivity matroid…

Combinatorics · Mathematics 2026-02-13 Mykhaylo Tyomkyn

For any given graph $G$ consider a graph $\widetilde{G}$ which is a cone over graph $G.$ In this paper, we study two important invariants of such a cone. Namely, complexity (the number of spanning trees) and the Jacobian of a graph. We…

Combinatorics · Mathematics 2021-11-09 L. A. Grunwald , I. A. Mednykh

We show that the intermediate Jacobian fibration associated to any smooth cubic fourfold $X$ admits a hyper-K\"ahler compactification $J(X)$ with a regular Lagrangian fibration $J \to \mathbb P^5$. This builds upon arXiv:1602.05534, where…

Algebraic Geometry · Mathematics 2023-06-21 Giulia Saccà , with an appendix by Claire Voisin

We introduce a canonical operator-theoretic construction associated to a finite geometric lattice, in which a simple nonassociative ``diamond product'' on the lattice basis gives rise to a family of creation operators indexed by atoms and a…

Combinatorics · Mathematics 2026-04-13 Thomas Sinclair

Let G be a group. The intersection graph G(G) of G is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper nontrivial subgroups of G; and there is an edge between two distinct…

Group Theory · Mathematics 2014-06-13 Ergün Yaraneri

Given a collection $\{ G_i\}_{i=1}^d$ of finite groups and a ring $R$, we define a subring of the ring $M_n(R)$ ($n = \sum_{i=1}^d|G_i|)$ that encompasses all the individual group rings $R[G_i]$ along the diagonal blocks as $G_i$-circulant…

We introduce bijections between families of rooted maps with unfixed genus and families of so-called blossoming trees endowed with an arbitrary forward matching of their leaves. We first focus on Eulerian maps with controlled vertex…

Combinatorics · Mathematics 2022-11-28 Éric Fusy , Emmanuel Guitter

We present a new construction for matroids from gain graphs that simultaneously generalizes several existing constructions. The construction takes as input a gain graph over a Frobenius group $\Gamma$ with Frobenius kernel $\Gamma_1$ and…

Combinatorics · Mathematics 2026-02-27 Zach Walsh

A harmonic cover of graphs $p:\widetilde{X}\to X$ induces a surjective pushforward morphism $p_*:\operatorname{Jac}(\widetilde{X})\to \operatorname{Jac}(X)$ on the critical groups. In the case when $p$ is Galois with abelian Galois group,…

Combinatorics · Mathematics 2024-09-10 Mariia Vetluzhskikh , Dmitry Zakharov

This paper proves results about the Jacobians of a certain family of covering graphs, $Y$, of a base graph $X$, that is constructed from an assignment of elements from a group $G$ to the edges of $X$ ($G$ is called the voltage group and $Y$…

Combinatorics · Mathematics 2021-08-05 Sophia Gonet

Let G:=SO(n,1)^\circ and \Gamma be a geometrically finite Zariski dense subgroup with critical exponent delta bigger than (n-1)/2. Under a spectral gap hypothesis on L^2(\Gamma \ G), which is always satisfied for delta>(n-1)/2 for n=2,3 and…

Number Theory · Mathematics 2013-06-18 Amir Mohammadi , Hee Oh

We evaluate combinatorially certain connection coefficients of the symmetric group that count the number of factorizations of a long cycle as a product of three permutations. Such factorizations admit an important topological interpretation…

Combinatorics · Mathematics 2015-03-17 Alejandro H. Morales , Ekaterina A. Vassilieva

We study the statistics of Hamiltonian cycles on various families of bicolored random planar maps (with the spherical topology). These families fall into two groups corresponding to two distinct universality classes with respective central…

Mathematical Physics · Physics 2023-12-15 Bertrand Duplantier , Olivier Golinelli , Emmanuel Guitter

We present a new, general approach to gauge theory on principal $G$-spectral triples, where $G$ is a compact connected Lie group. We introduce a notion of vertical Riemannian geometry for $G$-$C^\ast$-algebras and prove that the resulting…

Mathematical Physics · Physics 2021-10-22 Branimir Ćaćić , Bram Mesland

We study Coxeter diagrams of some unitary reflection groups. Using solely the combinatorics of diagrams, we give a new proof of the classification of root lattices defined over $\cE = \ZZ[e^{2 \pi i/3}]$: there are only four such lattices,…

Group Theory · Mathematics 2010-12-07 Tathagata Basak

In this article, we introduce rotation groups as a common generalisation of Coxeter groups and graph products of groups (including right-angled Artin groups). We characterise algebraically these groups by presentations (periagroups) and we…

Group Theory · Mathematics 2026-02-17 Anthony Genevois

A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely related with many other topics in discrete mathematics, such…

Combinatorics · Mathematics 2022-03-16 Gianira N. Alfarano , Karan Khathuria , Simran Tinani

We study rank-three matroids, known as point-line configurations, and their associated matroid varieties, defined as the Zariski closures of their realization spaces. Our focus is on determining finite generating sets of defining equations…

Combinatorics · Mathematics 2025-06-10 Emiliano Liwski , Fatemeh Mohammadi , Lisa Vandebrouck