Related papers: Mixed Dimer Models for Euler and Catalan Numbers
We prove the existence of "half-plane differentials" with prescribed local data on any Riemann surface. These are meromorphic quadratic differentials with higher-order poles which have an associated singular flat metric isometric to a…
We introduce an inductively defined sequence of directed graphs and prove that the number of edges added at step $k$ is equal to the $k$th Catalan number. Furthermore, we establish an isomorphism between the set of edges adjoined at step…
In this article, the enumeration of partial chord diagrams is discussed via matrix model techniques. In addition to the basic data such as the number of backbones and chords, we also consider the Euler characteristic, the backbone spectrum,…
The genus--g Fuss--Catalan (FC) number counts the number of ways to obtain a genus-g surface by identifying the edges of a pn--gon via p-valent hyperedges. For p=2 these are the genus--g Catalan numbers which are generated as the trace…
The monopole-dimer model introduced recently is an exactly-solvable signed generalisation of the dimer model. We show that the partition function of the monopole-dimer model on a graph invariant under a fixed-point free involution is a…
The purpose of this paper is to derive some applications of umbral calculus by using extended fermionic p-adic q-integral on Zp. From those applications, we derive some new interesting properties on the new family of Euler numbers and…
We define a quasar-galaxy mixing diagram using the slopes of their spectral energy distributions (SEDs) from 1\mu m to 3000\AA\ and from 1\mu m to 3\mu m in the rest frame. The mixing diagram can easily distinguish among quasar-dominated,…
The competition between long-range and short-range interactions among holes moving in an antiferromagnet (AF), is studied within a model derived from the spin density wave picture of layered transition metal oxides. A novel numerical…
We show that planar graphs have bounded queue-number, thus proving a conjecture of Heath, Leighton and Rosenberg from 1992. The key to the proof is a new structural tool called layered partitions, and the result that every planar graph has…
Many coupled problems in engineering and science can be described by elliptic partial differential equations on adjacent domains, where the coupling can be considered either as a thin equidimensional overlap between the model domains, or as…
A properly edge-colored graph is a graph with a coloring of its edges such that no vertex is incident to two or more edges of the same color. A subgraph is called rainbow if all its edges have different colors. The problem of finding…
We study the representation theory of the nested instantons quiver presented in [1], which describes a particular class of surface defects in four-dimensional supersymmetric gauge theories. We show that the moduli space of its stable…
We consider dimer models on graphs which are bipartite, periodic and satisfy a geometric condition called {\em isoradiality}, defined in \cite{Kenyon3}. We show that the scaling limit of the height function of any such dimer model is…
We establish some identities of Euler related sums. By using these identities, we discuss the closed form representations of sums of harmonic numbers and reciprocal parametric binomial coefficients through parametric harmonic numbers,…
We present a formal version of the numbers of vertices, edges, and faces for infinite planar regular triangular meshes of degree r>6. These numbers are defined via Euler summation of sequences obtained from iterated expansions of a convex…
We investigate the quotient ring $R$ of the ring of formal power series $\Q[[x_1,x_2,...]]$ over the closure of the ideal generated by non-constant quasi-\break symmetric functions. We show that a Hilbert basis of the quotient is naturally…
A well known class of objects in combinatorial design theory are {group divisible designs}. Here, we introduce the $q$-analogs of group divisible designs. It turns out that there are interesting connections to scattered subspaces,…
We consider the problem of finding the number of matrices over a finite field with a certain rank and with support that avoids a subset of the entries. These matrices are a q-analogue of permutations with restricted positions (i.e., rook…
We introduce the framework of discrete holomorphic functions on t-embeddings of weighted bipartite planar graphs; t-embeddings also appeared under the name Coulomb gauges in a recent paper arXiv:1810.05616. We argue that this framework is…
Two types of connected chord diagrams with chord endpoints lying in a collection of ordered and oriented real segments are considered here: the real segments may contain additional bivalent vertices in one model but not in the other. In the…