English
Related papers

Related papers: Maps and $\Delta$-matroids revisited

200 papers

This chapter is an introduction to the connection between random matrices and maps, i.e graphs drawn on surfaces. We concentrate on the one-matrix model and explain how it encodes and allows to solve a map enumeration problem.

Mathematical Physics · Physics 2011-04-18 J. Bouttier

In this paper we prove existence of matings between a large class of renormalizable cubic polynomials with one fixed critical point and another cubic polynomial having two fixed critical points. The resulting mating is a Newton map. Our…

Dynamical Systems · Mathematics 2018-05-16 Magnus Aspenberg , Pascale Roesch

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

For an integer $m\geq 1$, a combinatorial manifold $\widetilde{M}$ is defined to be a geometrical object $\widetilde{M}$ such that for $\forall p\in\widetilde{M}$, there is a local chart $(U_p,\phi_p)$ enable $\phi_p:U_p\to…

General Mathematics · Mathematics 2009-09-29 Linfan Mao

Recently, Gross, Mansour and Tucker introduced the partial duality polynomial of a ribbon graph and posed a conjecture that there is no orientable ribbon graph whose partial duality polynomial has only one non-constant term. We found an…

Combinatorics · Mathematics 2021-08-04 Qi Yan , Xian'an Jin

For a symmetric 2t-cycle in the tope graph of a simple oriented matroid M on the ground set {1,...,t}, where t is even, we describe decompositions of topes and subtopes of M with respect to the subtopes corresponding to the edges of the…

Combinatorics · Mathematics 2021-06-17 Andrey O. Matveev

$q$-Matroids are defined on complemented modular support lattices. Minors of length 2 are of four types as in a "classical" matroid. Tutte polynomials $\tau(x,y)$ of matroids are calculated either by recursion over deletion/contraction of…

Combinatorics · Mathematics 2017-07-13 Guus Bollen , Henry Crapo , Relinde Jurrius

We use the equivariant cohomology ring of the permutohedral variety to study matroids and their invariants. Investigating the pushforward of matroid Chern classes defined by A. Berget, C. Eur, H. Spink and D. Tseng to the product space…

Algebraic Geometry · Mathematics 2025-09-25 Mario Bauer , Matěj Doležálek , Magdaléna Mišinová , Semen Słobodianiuk , Julian Weigert

We provide a naturally isomorphic description of the persistence map from merge trees to barcodes in terms of a monotone map from the partition lattice to the subset lattice. Our description is local, which offers the potential to speed up…

Algebraic Topology · Mathematics 2022-03-02 Brendan Mallery , Adélie Garin , Justin Curry

We extend the notion of representation of a matroid to algebraic structures that we call skew partial fields. Our definition of such representations extends Tutte's definition, using chain groups. We show how such representations behave…

Combinatorics · Mathematics 2012-12-12 R. A. Pendavingh , S. H. M. van Zwam

Postnikov gave a combinatorial description of the cells in a totally-nonnegative Grassmannian. These cells correspond to a special class of matroids called positroid. We prove his conjecture that a positroid is exactly an intersection of…

Combinatorics · Mathematics 2010-10-12 Suho Oh

A topological mating is a map defined by gluing together the filled Julia sets of two quadratic polynomials. The identifications are visualized and understood by pinching ray-equivalence classes of the formal mating. For postcritically…

Dynamical Systems · Mathematics 2017-07-04 Wolf Jung

The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regular matroids generalizes that of graphical matroids, and a…

Combinatorics · Mathematics 2014-05-12 Aaron Dall , Julian Pfeifle

We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, oriented matroids, and regular matroids. To do this, we first introduce algebraic objects called tracts which…

Combinatorics · Mathematics 2018-12-13 Matthew Baker , Nathan Bowler

In this article, we study integrals on the unitary group with respect to the Haar measure. We give a combinatorial interpretation in terms of maps of the asymptotic topological expansion, established previously by Guionnet and Novak. The…

Probability · Mathematics 2024-11-08 Thomas Buc-d'Alché

A classic exercise in the topology of surfaces is to show that, using handle slides, every disc-band surface, or 1-vertex ribbon graph, can be put in a canonical form consisting of the connected sum of orientable loops, and either…

Combinatorics · Mathematics 2017-05-02 Iain Moffatt , Eunice Mphako-Banda

In this article we consider combinatorial maps approach to graphs on surfaces, and how between them can be establish terminological uniformity in favor of combinatorial maps in way rotations are set as base structural elements and all other…

General Mathematics · Mathematics 2012-07-25 Dainis Zeps , Paulis Kikusts

Given a subgroup $\mathcal{H}$ of a product of finite groups $\mathcal{G} = \displaystyle\prod^n_{i=1} \Gamma_i$ and $b>1,$ we define a polymatroid $P(\mathcal{H},b).$ If all of the $\Gamma_i$ are isomorphic to $\mathbb{Z}/p\mathbb{Z},$ $p$…

Combinatorics · Mathematics 2024-02-28 Ed Swartz , Prairie Wentworth-Nice , Alexander Xue

For a discrete poset $\mathcal X$ McCord proved that the natural map $|{\mathcal X}|\to {\mathcal X}$ from the order complex to the poset equipped with the Up topology is a weak homotopy equivalence. Much later, Zivaljevi\'{c} defined the…

Combinatorics · Mathematics 2024-05-30 Ulysses Alvarez , Ross Geoghegan

A rooted planar map is a connected graph embedded in the 2-sphere, with one edge marked and assigned an orientation. A term of the pure lambda calculus is said to be linear if every variable is used exactly once, normal if it contains no…

Logic in Computer Science · Computer Science 2017-01-11 Noam Zeilberger , Alain Giorgetti