English
Related papers

Related papers: Generalizations of Chung-Feller Theorem

200 papers

Glaisher's theorem states that the number of partitions of $n$ into parts which repeat at most $m-1$ times is equal to the number of partitions of $n$ into parts which are not divisible by $m$. The $m=2$ case is Euler's famous partition…

Combinatorics · Mathematics 2026-04-14 George E. Andrews , Aritram Dhar

Chromatic symmetric functions are well-studied symmetric functions in algebraic combinatorics that generalize the chromatic polynomial and are related to Hessenberg varieties and diagonal harmonics. Motivated by the Stanley--Stembridge…

Combinatorics · Mathematics 2025-02-11 Jacob P. Matherne , Alejandro H. Morales , Jesse Selover

We prove the existence of flips for $\mathbb Q$-factorial NQC generalized lc pairs, and the cone and contraction theorems for NQC generalized lc pairs. This answers a question of C. Birkar which was conjectured by J. Han and Z. Li. As an…

Algebraic Geometry · Mathematics 2021-09-10 Christopher D. Hacon , Jihao Liu

What are called secondary characteristic classes in Chern-Weil theory are a refinement of ordinary characteristic classes of principal bundles from cohomology to differential cohomology. We consider the problem of refining the construction…

Algebraic Topology · Mathematics 2013-09-30 Domenico Fiorenza , Urs Schreiber , Jim Stasheff

We consider the system of equations $A_k(x)=p(x)A_{k-1}(x)(q(x)+\sum_{i=0}^k A_i(x))$ for $k\geq r+1$ where $A_i(x)$, $0\leq i \leq r$, are some given functions and show how to obtain a close form for $A(x)=\sum_{k\geq 0}A_k(x)$. We apply…

Combinatorics · Mathematics 2021-10-28 Jean-Luc Baril , Sergey Kirgizov

A new approach to the quantization of Chern-Simons theory has been developed in recent papers of the author. It uses a "simulation" of the moduli space of flat connections modulo the gauge group which reveals to be related to a lattice…

q-alg · Mathematics 2008-02-03 E. Buffenoir

We call progressive paths and rushed paths two families of Dyck paths studied by Asinowski and Jelinek, which have the same enumerating sequence (OEIS entry A287709). We present a bijection proving this fact. Rushed paths turn out to be in…

Combinatorics · Mathematics 2026-05-25 Axel Bacher

A discrete-time Quantum Walk (QW) is essentially an operator driving the evolution of a single particle on the lattice, through local unitaries. Some QWs admit a continuum limit, leading to well-known physics partial differential equations,…

Quantum Physics · Physics 2018-06-20 Pablo Arrighi , Giuseppe Di Molfetta , Iván Márquez-Martín , Armando Pérez

We introduce and study the new combinatorial class of Dyck paths with air pockets. We exhibit a bijection with the peakless Motzkin paths which transports several pattern statistics and give bivariate generating functions for the…

Discrete Mathematics · Computer Science 2023-03-07 Jean-Luc Baril , Sergey Kirgizov , Rémi Maréchal , Vincent Vajnovszki

Wei's celebrated Duality Theorem is generalized in several ways, expressed as duality theorems for linear codes over division rings and, more generally, duality theorems for matroids. These results are further generalized, resulting in two…

Information Theory · Computer Science 2009-10-13 Thomas Britz , Bård Heiseldel , Trygve Johnsen , Dillon Mayhew , Keisuke Shiromoto

This article deals with the enumeration of directed lattice walks on the integers with any finite set of steps, starting at a given altitude $j$ and ending at a given altitude $k$, with additional constraints such as, for example, to never…

We propose the Wilson discretization of the supersymmetric Yang-Mills Quantum Mechanics as a lattice version of the matrix model of M-theory. An SU(2) model is studied numerically in the quenched approximation for D=4. A clear signal for…

High Energy Physics - Lattice · Physics 2009-10-31 R. A. Janik , J. Wosiek

A {\em Motzkin path} of length $n$ is a lattice path from $(0,0)$ to $(n,0)$ in the plane integer lattice $\mathbb{Z}\times\mathbb{Z}$ consisting of horizontal-steps $(1, 0)$, up-steps $(1,1)$, and down-steps $(1,-1)$, which never passes…

Combinatorics · Mathematics 2008-05-29 Yidong Sun

Raised $k$-Dyck paths are a generalization of $k$-Dyck paths that may both begin and end at a nonzero height. In this paper, we develop closed formulas for the number of raised $k$-Dyck paths from $(0,\alpha)$ to $(\ell,\beta)$ for all…

Combinatorics · Mathematics 2022-06-03 Paul Drube

The quantisation of the two-dimensional Liouville field theory is investigated using the path integral, on the sphere, in the large radius limit. The general form of the $N$-point functions of vertex operators is found and the three-point…

High Energy Physics - Theory · Physics 2009-10-31 L. O'Raifeartaigh , J. M. Pawlowski , V. V. Sreedhar

Connections between homotopy theory and type theory have recently attracted a lot of attention, with Voevodsky's univalent foundations and the interpretation of Martin-Lof's identity types in Quillen model categories as some of the…

Category Theory · Mathematics 2016-09-21 Benno van den Berg

Koroljuk gave a summation formula for counting the number of lattice paths from $(0,0)$ to $(m,n)$ with $(1,0), (0,1)$-steps in the plane that stay strictly above the line $y=k(x-d)$, where $k$ and $d$ are positive integers. In this paper…

Combinatorics · Mathematics 2013-06-26 James J. Y. Zhao

Lattice paths are important tools on solving some combinatorial identities. This note gives a new bijection between unbalanced Dyck path (a path that never reaches the diagonal of the lattice) and NE (North and East only) lattice path from…

General Mathematics · Mathematics 2023-06-09 Yannan Qian

Each quiver corresponds to a path semigroup, and such a path semigroup also corresponds to an associative K-algebra over an algebraically closed field K. Let Q be a quiver and S_Q, KQ be its path semigroup, path algebra, respectively. In…

Group Theory · Mathematics 2024-05-30 Yongle Luo , Zhengpan Wang , Jiaqun Wei

For $m,n$ coprime we introduce a new statistic skip on $(m,n)$-rational Dyck paths and give a fast way to compute dinv and skip statistics. We also introduce $(m,n)$-rank words, which are in one-to-one correspondence with $(m,n)$-Dyck…

Combinatorics · Mathematics 2016-11-16 Ryan Kaliszewski , Huilan Li
‹ Prev 1 8 9 10 Next ›