Related papers: Double Dimer Covers on Snake Graphs from Super Clu…
We develop the local theory of the generalized doubling method for the $m$-fold central extension $Sp_{2n}^{(m)}$ of Matsumoto of the symplectic group. We define local $\gamma$-, $L$- and $\epsilon$-factors for pairs of genuine…
The Sperner and Tucker lemmas are combinatorial analogous of the Brouwer and Borsuk - Ulam theorems with many useful applications. These classic lemmas are concerning labellings of triangulated discs and spheres. In this paper we show that…
Snake graphs and their perfect matchings play a key role in the description of cluster variables of cluster algebras associated to surfaces. In this paper, we introduce triangular snake graphs and establish a bijection between their routes…
The recent classification scheme of so-called adinkraic off-shell supermultiplets of N-extended worldline supersymmetry without central charges finds a combinatorial explosion. Completing our earlier efforts, we now complete the…
Charles, Goren, and Lauter [J. Cryptology 22(1), 2009] explained how one can construct hash functions using expander graphs in which it is hard to find paths between specified vertices. The set of solutions to the classical Markoff equation…
The dimer model is the study of random dimer covers (perfect matchings) of a graph. A double-dimer configuration on a graph $G$ is a union of two dimer covers of $G$. We introduce quaternion weights in the dimer model and show how they can…
We present some promising ideas to treat the problem of making completely rigorous the development of our expression for $\lambda_d(p)$ of the monomer-dimer problem on a $d$-dimensional hypercubic lattice \begin{equation}\label{abstract1}…
Expander graphs, due to their mixing properties, are useful in many algorithms and combinatorial constructions. One can produce an expander graph with high probability by taking a random graph (e.g., the union of $d$ random bijections for a…
In the article, two implementations of the representation of the complex Lie algebra $\mathfrak{sl}_2$ on the algebra of symmetric polynomials $\Lambda_n$ by differential operators are proposed. The realizations of irreducible…
Suppose $\lambda$ and $\mu$ are integer partitions with $\lambda\supseteq\mu$. Kenyon and Wilson have introduced the notion of a cover-inclusive Dyck tiling of the skew Young diagram $\lambda\setminus\mu$, which has applications in the…
We develop a combinatorial framework to study certain polyhedral maps which are higher-dimensional analogues of tropical covers between metric graphs. Under a mild combinatorial assumption, we show that a map satisfies the so-called…
In this paper which is based on the results obtained in collaboration with Igor Bandos and Dmitri Sorokin I present the extention of the "doubled fields" formalism by Cremmer, Julia, Lu and Pope to the supersymmetric case and lifting this…
As a generalization of the use of graphs to describe pairwise interactions, simplicial complexes can be used to model higher-order interactions between three or more objects in complex systems. There has been a recent surge in activity for…
Nonlinear spectral gaps with respect to uniformly convex normed spaces are shown to satisfy a spectral calculus inequality that establishes their decay along Cesaro averages. Nonlinear spectral gaps of graphs are also shown to behave…
Snake graphs appear naturally in the theory of cluster algebras. For cluster algebras from surfaces, each cluster variable is given by a formula which is parametrized by the perfect matchings of a snake graph. In this paper, we identify…
The expansion of a Lie algebra entails finding a new, bigger algebra G, through a series of well-defined steps, from an original Lie algebra g. One incarnation of the method, the so-called S-expansion, involves the use of a finite abelian…
We introduce an expansion formula for elements in quantum cluster algebras associated to type A and Kronecker quivers with principal quantization. Our formula is parametrized by perfect matchings of snake graphs as in the classical case. In…
We introduce and investigate generalizations of interval and proper interval graphs to simplicial complexes, including strong interval, unit interval, and under closed variants. Through equivalent combinatorial and algebraic…
Let $G$ be a group and $N$ its normal subgroup. On the mixed commutator subgroup $[G,N]$, the mixed stable commutator length $\mathrm{scl}_{G,N}$ and the restriction of the ordinary stable commutator length $\mathrm{scl}_{G}$ are defined.…
We prove a formula for the image of a skew Schur polynomial $s_{\lambda/\mu}\left( x_{1}, x_{2}, \ldots, x_{N}\right) $ under the differential operator $\nabla:= \dfrac{\partial}{\partial x_{1}} +\dfrac{\partial}{\partial…