English
Related papers

Related papers: From dimer models to generalized lattice paths

200 papers

We extend our 2+1 dimensional discrete growth model (PRE 79, 021125 (2009)) with conserved, local exchange dynamics of octahedra, describing surface diffusion. A roughening process was realized by uphill diffusion and curvature dependence.…

Statistical Mechanics · Physics 2010-05-14 Geza Odor , Bartosz Liedke , Karl-Heinz Heinig

We recast the classical notion of standard tableaux in an alcove-geometric setting and extend these classical ideas to all reduced paths in our geometry. This broader path-perspective is essential for implementing the higher categorical…

Representation Theory · Mathematics 2021-05-28 C. Bowman , A. Cox , A. Hazi , D. Michailidis

We introduce the generic Lah polynomials $L_{n,k}(\phi)$, which enumerate unordered forests of increasing ordered trees with a weight $\phi_i$ for each vertex with $i$ children. We show that, if the weight sequence $\phi$ is…

Combinatorics · Mathematics 2020-09-17 Mathias Pétréolle , Alan D. Sokal

Lattice fermion actions are constructed with path integrals which are equivalent to the free one-flavour staggered fermion determinant. The Dirac operators used are local and have an identical spectrum of states to the staggered theory.…

High Energy Physics - Lattice · Physics 2007-05-23 Francesca Maresca , Mike Peardon

We introduce the power collection method for easily deriving connection relations for certain hypergeometric orthogonal polynomials in the $(q-)$Askey scheme. We summarize the full-extent to which the power collection method may be used. As…

Classical Analysis and ODEs · Mathematics 2016-01-13 Michael A. Baeder , Howard S. Cohl , Roberto S. Costas-Santos , Wenqing Xu

We present a general formulation of chiral gauge theories, which admits Dirac operators with more general spectra, reveals considerably more possibilities for the structure of the chiral projections, and nevertheless allows appropriate…

High Energy Physics - Lattice · Physics 2007-05-23 Werner Kerler

We extend the notion of generalized Whittaker models by allowing them to be built upon smooth irreducible representations of unipotent subgroups of a $p$-adic reductive group that are not necessarily characters, nor induced from Weil…

Representation Theory · Mathematics 2025-08-13 Gyujin Oh

We study a phase transition in a 3D lattice gauge theory, a "coarse-grained" version of a classical dimer model. Duality arguments indicate that the dimer lattice theory should be dual to a XY model coupled to a gauge field with geometric…

Strongly Correlated Electrons · Physics 2009-11-13 D. Charrier , F. Alet , P. Pujol

The exponential generating function of ordinary generating functions of diagonal sequences of general Sheffer triangles is computed by an application of Lagrange's theorem. For the special Jabotinsky type this is already known. An analogous…

Number Theory · Mathematics 2017-08-07 Wolfdieter Lang

We study a class of close-packed dimer models on the square lattice, in the presence of small but extensive perturbations that make them non-determinantal. Examples include the 6-vertex model close to the free-fermion point, and the dimer…

Mathematical Physics · Physics 2020-07-14 Alessandro Giuliani , Vieri Mastropietro , Fabio Lucio Toninelli

We present a general theory for studying the difference analogues of special functions of hypergeometric type on the linear-type lattices, i.e., the solutions of the second order linear difference equation of hypergeometric type on a…

Classical Analysis and ODEs · Mathematics 2014-02-06 R. Alvarez-Nodarse , J. L. Cardoso

Bouttier, Di Francesco and Guitter introduced a method for solving certain classes of algebraic recurrence relations arising the context of embedded trees and map enumeration. The aim of this note is to apply this method to three problems.…

Combinatorics · Mathematics 2009-06-29 Markus Kuba

Power-type graphs, such as the power graph, the directed power graph, the enhanced power graph and the difference graph, encode significant information about the internal structure of a finite group. Despite substantial investigation in…

Combinatorics · Mathematics 2025-11-18 Mahsa Mirzargar , Sezer Sorgun , Mohammad Javad Nadjafi Arani

Lattice models with long-range interactions of power-law type are suggested as a new type of microscopic model for fractional non-local elasticity. Using the transform operation, we map the lattice equations into continuum equation with…

Materials Science · Physics 2015-04-16 Vasily E. Tarasov

A circular Pascal array is a periodization of the familiar Pascal's triangle. Using simple operators defined on periodic sequences, we find a direct relationship between the ranges of the circular Pascal arrays and numbers of certain…

Combinatorics · Mathematics 2014-07-09 Shaun V. Ault , Charles Kicey

We derive time dependent correlation functions in an one dimensional XY spin model with the use of generating functionals, the latter being defined as path integrals over fermionic coherent states. We focus on the proper construction of the…

Quantum Physics · Physics 2020-01-23 I. Lyris , P. Lykourgias , A. I. Karanikas

The Dowling lattice $Q_n(\mathfrak{G})$, $\mathfrak{G}$ a finite group, generalizes the geometric lattice generated by all vectors, over a field, with at most two nonzero components. Abstractly, it is a fundamental object in the…

Combinatorics · Mathematics 2023-05-23 Thomas Zaslavsky

Dirichlet integrals and the associated Dirichlet statistical densities are widely used in various areas. Generalizations of Dirichlet integrals and Dirichlet models to matrix-variate cases, when the matrices are real symmetric positive…

Logic · Mathematics 2007-05-23 Joy Jacob , Sebastian George , A M Mathai

Motzkin paths of order-$\ell$ are a generalization of Motzkin paths that use steps $U=(1,1)$, $L=(1,0)$, and $D_i=(1,-i)$ for every positive integer $i \leq \ell$. We further generalize order-$\ell$ Motzkin paths by allowing for various…

Combinatorics · Mathematics 2021-01-01 Isaac DeJager , Madeleine Naquin , Frank Seidl , Paul Drube

Rough sets are efficient for data pre-processing in data mining. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. Both rough sets and matroids are closely related to lattices. For a…

Artificial Intelligence · Computer Science 2013-12-17 Qingyin Li , William Zhu