English
Related papers

Related papers: Mixed Dimer Models for Euler and Catalan Numbers

200 papers

A classical result of Euler states that the tangent numbers are an alternating sum of Eulerian numbers. A dual result of Roselle states that the secant numbers can be obtained by a signed enumeration of derangements. We show that both…

Combinatorics · Mathematics 2017-09-13 Matthieu Josuat-Vergès

We introduce the concept of alternate-edge-colourings for maps, and study highly symmetric examples of such maps. Edge-biregular maps of type $(k,l)$ occur as smooth normal quotients of a particular index two subgroup of $T_{k,l}$, the full…

Combinatorics · Mathematics 2020-10-30 Olivia Reade Jeans

We study a model of colored multiwebs, which generalizes the dimer model to allow each vertex to be adjacent to \(n_v\) edges. These objects can be formulated as a random tiling of a graph with partial dimer covers. We examine the case of a…

Probability · Mathematics 2025-09-30 Christina Meng

It is a classical result that the parity-balance of the number of weak excedances of all permutations (derangements, respectively) of length $n$ is the Euler number $E_n$, alternating in sign, if $n$ is odd (even, respectively).…

Combinatorics · Mathematics 2018-02-06 Sen-Peng Eu , Tung-Shan Fu , Hsiang-Chun Hsu , Hsin-Chieh Liao

Mixed graphs can be seen as digraphs with arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite and in which the undirected and directed degrees are one. The best graphs,…

Combinatorics · Mathematics 2024-03-29 C. Dalfó , G. Erskine , G. Exoo , M. A. Fiol , J. Tuite

We consider GL$_m$-dimers of triangulations of regular convex $n$-gons, which give rise to a dimer model with boundary $Q$ and a dimer algebra $\Lambda_Q$. Let $e_b$ be the sum of the idempotents of all the boundary vertices, and…

Representation Theory · Mathematics 2020-03-03 Lukas Andritsch

Stirling numbers, which count partitions of a set and permutations in the symmetric group, have found extensive application in combinatorics, geometry, and algebra. We study analogues and q-analogues of these numbers corresponding to the…

Combinatorics · Mathematics 2022-05-30 Bruce E. Sagan , Joshua P. Swanson

Umbral extensions of the stirling numbers of the second kind are considered and the resulting dobinski-like various formulas including new ones are presented. These extensions naturally encompass the two well known q-extensions. The further…

Combinatorics · Mathematics 2008-02-11 A. K. Kwasniewski

Dimer coverings (or perfect matchings) of a finite graph are classical objects of graph theory appearing in the study of exactly solvable models of statistical mechanics. We introduce more general dimer labelings which form a topological…

Geometric Topology · Mathematics 2012-11-30 Vladimir Turaev

We give a $q$-analog of middle convolution for linear $q$-difference equations with rational coefficients. In the differential case, middle convolution is defined by Katz, and he examined properties of middle convolution in detail. In this…

Classical Analysis and ODEs · Mathematics 2015-05-05 Hidetaka Sakai , Masashi Yamaguchi

A classical result states that the parity balance of the number of excedances of all permutations (derangements, respectively) of length $n$ is the Euler number. In 2010, Josuat-Verg\`{e}s gives a $q$-analogue with $q$ representing the…

Combinatorics · Mathematics 2020-06-25 Hsin-Chieh Liao

We investigate morphologies of semiflexible polymer rings, such as circular DNA, which are adsorbed onto topographically or chemically structured substrate surfaces. We classify all equilibrium morphologies for two striped surface…

Soft Condensed Matter · Physics 2014-05-27 Petra Gutjahr , Reinhard Lipowsky , Jan Kierfeld

In the past three decades, the study of rhombus tilings and domino tilings of various plane regions has been a thriving subfield of enumerative combinatorics. Physicists classify such work as the study of dimer covers of finite graphs. In…

Combinatorics · Mathematics 2024-01-19 James Propp

The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. There has been much recent interest in the problem for mixed graphs, where we allow both undirected…

Combinatorics · Mathematics 2017-12-19 Grahame Erskine

We propose a duality between quiver gauge theories and the combinatorics of dimer models. The connection is via toric diagrams together with multiplicities associated to points in the diagram (which count multiplicities of fields in the…

High Energy Physics - Theory · Physics 2007-05-23 Amihay Hanany , Kristian D. Kennaway

We introduce area, bounce and dinv statistics on decorated parallelogram polyominoes, and prove that some of their q,t-enumerators match $\langle \Delta_{h_m} e_{n+1},s_{k+1,1^{n-k}}\rangle$, extending in this way the work in (Aval et al.…

Combinatorics · Mathematics 2017-12-27 Michele D'Adderio , Alessandro Iraci

A mixed graph can be seen as a type of digraph containing some edges (two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line digraphs. These structures…

Combinatorics · Mathematics 2016-10-13 C. Dalfó , M. A. Fiol , N. López

We consider the dual space of linear groups over Dynkinian and Euclidean algebras, i.e. finite dimensional algebras derived equivalent to the path algebra of Dynkin or Euclidean quiver. We prove that this space contains an open dense subset…

Representation Theory · Mathematics 2015-01-27 Viktor Bekkert , Yuriy Drozd , Vyacheslav Futorny

The object of this paper is to give a systematic treatment of excedance-type polynomials. We first give a sufficient condition for a sequence of polynomials to have alternatingly increasing property, and then we present a systematic study…

Combinatorics · Mathematics 2021-04-05 Shi-Mei Ma , Jun Ma , Jean Yeh , Yeong-Nan Yeh

The Elliptic Somber and Euler Somber indices are newly defined topological indices based on the Somber index. Our paper presents calculations of the upper and lower bounds of these indices for the join and corona product of arbitrary…

Combinatorics · Mathematics 2025-02-11 Bishal Sonar , Ravi Srivastava