Related papers: Snake Graphs from Triangulated Orbifolds

We conjecture a combinatorial formula for the monomial expansion of the image of any Schur function under the Bergeron-Garsia nabla operator. The formula involves nested labeled Dyck paths weighted by area and a suitable "diagonal…

Temperley-Lieb algebras have been generalized to sl(3) web spaces. Since a cubic bipartite planar graph with suitable directions on edges is a web, the quantum sl(3) invariants naturally extend to all cubic bipartite planar graphs. First we…

We study a factor Hopf algebra $\mathfrak{PP}$ of the Malvenuto-Reutenauer convolution algebra of functions on symmetric groups ${\mathfrak{S}}=\oplus_{n\geq 0} \mathbb C[{\mathfrak{S}}_n] $ that we coined pre-plactic algebra. The…

In combinatorial topology we aim to triangulate manifolds such that their topological properties are reflected in the combinatorial structure of their description. Here, we give a combinatorial criterion on when exactly triangulations of…

We consider the distribution of the major index on standard tableaux of arbitrary straight shape and certain skew shapes. We use cumulants to classify all possible limit laws for any sequence of such shapes in terms of a simple auxiliary…

In [LP] we introduced Laurent phenomenon algebras, a generalization of cluster algebras. Here we give an explicit description of Laurent phenomenon algebras with a linear initial seed arising from a graph. In particular, any graph…

Gelfand - Na\u{i}mark theorem supplies a one to one correspondence between commutative $C^*$-algebras and locally compact Hausdorff spaces. So any noncommutative $C^*$-algebra can be regarded as a generalization of a topological space.…

A matrix-weighted graph is an undirected graph with a $k\times k$ positive semidefinite matrix assigned to each edge. There are natural generalizations of the Laplacian and adjacency matrices for such graphs. These matrices can be used to…

We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…

Let $\gamma$ be a bounded convex curve on a plane. Then $\sharp (\gamma\cap (\Z/n)^2)=o(n^{2/3})$. It streghtens the classical result of Jarn\'\i k (an upper estimate $O(n^{2/3})$) and disproves a conjecture of Vershik on existence of the…

We show a precise proof of Steenbrink's formula for the spectrum of convenient Newton non-degenerate functions, and prove the symmetry of combinatorial polynomials in the simplicial case. Combined with the modified Steenbrink conjecture for…

Using connections to random matrix theory and orthogonal polynomials, we develop a framework for obtaining explicit closed-form formulae for the number, $\mathscr{N}_{g}(2\nu,j)$, of connected $2\nu$-valent labeled graphs with $j$ vertices…

The aim of the paper is to define noncommutative cluster structure on several algebras ${\mathcal A}$ related to marked surfaces possibly with orbifold points of various orders, which includes noncommutative clusters, i.e., embeddings of a…

Let M be an oriented compact 3-manifold and let T be a (loose) triangulation of M, with ideal vertices at the components of the boundary of M and possibly internal vertices. We show that any spin structure s on M can be encoded by extra…

We present sweeping line graphs, a generalization of $\Theta$-graphs. We show that these graphs are spanners of the complete graph, as well as of the visibility graph when line segment constraints or polygonal obstacles are considered. Our…

Let $D$ be an oriented classical or virtual link diagram with directed universe $\vec{U}$. Let $C$ denote a set of directed Euler circuits, one in each connected component of $U$. There is then an associated looped interlacement graph…

In this paper, we describe geometrical constructions to obtain triangulations of connected sums of closed orientable triangulated 3-manifolds. Using these constructions, we show that it takes time polynomial in the number of tetrahedra to…

Bi-partite ribbon graphs arise in organising the large $N$ expansion of correlators in random matrix models and in the enumeration of observables in random tensor models. There is an algebra $\mathcal{K}(n)$, with basis given by bi-partite…

We study the asymptotic behaviour of uniform random maps with a prescribed face-degree sequence, in the bipartite case, as the number of faces tends to infinity. Under mild assumptions, we show that, properly rescaled, such maps converge in…

We prove two mixed versions of the Discrete Nodal Theorem of Davies et. al. [3] for bounded degree graphs, and for three-connected graphs of fixed genus $g$. Using this we can show that for a three-connected graph satisfying a certain…