English
Related papers

Related papers: Mixed Dimer Models for Euler and Catalan Numbers

200 papers

We consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maximum number of vertices that such graphs can attain. We first…

Combinatorics · Mathematics 2020-06-05 C. Dalfó , M. A. Fiol , N. López , J. Ryan

In this paper, we find distributions of the left-to-right maxima, right-to-left maxima, left-to-right minima and right-to-left-minima statistics on up-down and down-up permutations of even and odd lengths. For instance, we show that the…

Combinatorics · Mathematics 2024-08-26 Tian Han , Sergey Kitaev , Philip B. Zhang

Building up on our previous works regarding $q$-deformed $P$-partitions, we introduce a new family of subalgebras for the ring of quasisymmetric functions. Each of these subalgebras admits as a basis a $q$-analogue to Gessel's fundamental…

Combinatorics · Mathematics 2023-09-26 Darij Grinberg , Ekaterina A. Vassilieva

A recurrent state of the rotor-routing process on a finite sink-free graph can be represented by a unicycle that is a connected spanning subgraph containing a unique directed cycle. We distinguish between short cycles of length 2 called…

Combinatorics · Mathematics 2014-04-14 V. S. Poghosyan , V. B. Priezzhev

We introduce a correspondence between dimer models (and hence superconformal quivers) and the quantum Teichmuller space of the Riemann surfaces associated to them by mirror symmetry. Via the untwisting map, every brane tiling gives rise to…

High Energy Physics - Theory · Physics 2015-05-28 Sebastian Franco

The exchange graph of a cluster algebra encodes the combinatorics of mutations of clusters. Through the recent "categorifications" of cluster algebras using representation theory one obtains a whole variety of exchange graphs associated…

Representation Theory · Mathematics 2023-08-04 Thomas Brüstle , Dong Yang

We prove the existence of a limit shape for the dimer model on planar periodic bipartite graphs with an arbitrary fundamental domain and arbitrary periodic weights. This proof is based on a variational principle that uses the locality of…

Mathematical Physics · Physics 2017-12-25 Nikolai Kuchumov

We explicitly describe the derived Picard groups of symmetric representation-finite algebras of type $D$. In particular, we prove that these groups are generated by spherical twists along collections of $0$-spherical objects, the shift and…

Representation Theory · Mathematics 2026-02-17 Anya Nordskova

In this paper we give tight upper bounds on the total domination number, the weakly connected domination number and the connected domination number of a graph in terms of order and Euler characteristic. We also present upper bounds for the…

Combinatorics · Mathematics 2013-10-08 Vladimir Samodivkin

We show that matchings avoiding certain partial patterns are counted by the 3-Catalan numbers. We give a characterization of 12312-avoiding matchings in terms of restrictions on the corresponding oscillating tableaux. We also find a…

Combinatorics · Mathematics 2007-05-23 William Y. C. Chen , Toufik Mansour , Sherry H. F. Yan

The notion of mixed representations of quivers can be derived from ordinary quiver representations by considering the dual action of groups on "vertex" vector spaces together with the usual action. A generating system for the algebra of…

Representation Theory · Mathematics 2011-06-07 A. A. Lopatin , A. N. Zubkov

We give a new method for analysing the mixing time of a Markov chain using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics for independent sets in a hypergraph mixes…

Probability · Mathematics 2007-05-23 Magnus Bordewich , Martin Dyer , Marek Karpinski

We exhibit a connection between two statistics on set partitions, the intertwining number and the depth-index. In particular, results link the intertwining number to the algebraic geometry of Borel orbits. Furthermore, by studying the…

Combinatorics · Mathematics 2018-07-09 Mahir Bilen Can , Yonah Cherniavsky , Martin Rubey

Remixed Eulerian numbers are a polynomial $q$-deformation of Postnikov's mixed Eulerian numbers. They arose naturally in previous work by the authors concerning the permutahedral variety and subsume well-known families of polynomials such…

Combinatorics · Mathematics 2022-09-20 Philippe Nadeau , Vasu Tewari

We define and study two structures associated to permutation groups: Dirichlet characters on permutation groups, and the "cycle form," a bilinear form on the group algebras of permutation groups. We use Dirichlet characters and the cycle…

Combinatorics · Mathematics 2024-07-11 A. Salch

Euler diagrams are a tool for the graphical representation of set relations. Due to their simple way of visualizing elements in the sets by geometric containment, they are easily readable by an inexperienced reader. Euler diagrams where the…

Computational Geometry · Computer Science 2024-06-12 Dominik Dürrschnabel , Uta Priss

We study solutions to the $\alpha$-SQG equations, which interpolate between the incompressible Euler and surface quasi-geostrophic equations. We extend prior results on existence of bounded patches, proving propagation of $H^k$-regularity…

Analysis of PDEs · Mathematics 2025-04-25 David M. Ambrose , Fazel Hadadifard , James P. Kelliher

We show that Verdier duality for certain sheaves on the moduli spaces of graphs associated to Koszul operads corresponds to Koszul duality of operads. This in particular gives a conceptual explanation of the appearance of graph cohomology…

Quantum Algebra · Mathematics 2007-05-23 A. Lazarev , A. A. Voronov

We provide a superalgebraic analogue of Markov numbers, which are defined as the Grassmann integer solutions to the equation $x^2 + y^2 + z^2 + (xy + yz + xz)\epsilon = 3(1 + \epsilon)xyz$, as well as applications to the Decorated Super…

Combinatorics · Mathematics 2025-03-31 Gregg Musiker

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, and $L(G)$ be the line graph of $G$, which has vertex set $E(G)$ and two vertices $e$ and $f$ of $L(G)$ is adjacent if $e$ and $f$ is incident in $G$. The vertex-edge graph…

Combinatorics · Mathematics 2021-06-08 Shuli Li , Weigen Yan , Danyi Li