English
Related papers

Related papers: Anchored Dyck Paths

200 papers

We derive a worldline path integral representation for the effective action of a multiplet of Dirac fermions coupled to the most general set of matrix-valued scalar, pseudoscalar, vector, axial vector and antisymmetric tensor background…

High Energy Physics - Theory · Physics 2009-10-28 Eric D'Hoker , Darius G. Gagne

We propose a categorical setting for the study of the combinatorics of rational numbers. We find combinatorial interpretation for the Bernoulli and Euler numbers and polynomials.

Combinatorics · Mathematics 2009-02-09 Hector Blandin , Rafael Diaz

Springer numbers are an analog of Euler numbers for the group of signed permutations. Arnol'd showed that they count some objects called snakes, that generalize alternating permutations. Hoffman established a link between Springer numbers,…

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

This paper will describe how combinatorial interpretations can help us understand the algebraic structure of two aspects of perturbative quantum field theory, namely analytic Dyson-Schwinger equations and periods of scalar Feynman graphs.…

Mathematical Physics · Physics 2013-08-22 Karen Yeats

We prove a combinatorial reciprocity theorem for the enumeration of non-intersecting paths in a linearly growing sequence of acyclic planar networks. We explain two applications of this theorem: reciprocity for fans of bounded Dyck paths,…

Combinatorics · Mathematics 2023-12-21 Sam Hopkins , Gjergji Zaimi

The $q,t$-Catalan numbers can be defined using rational functions, geometry related to Hilbert schemes, symmetric functions, representation theory, Dyck paths, partition statistics, or Dyck words. After decades of intensive study, it was…

Combinatorics · Mathematics 2019-11-01 Kyungyong Lee , Li Li , Nicholas A. Loehr

There is a natural bijection between Dyck paths and basis diagrams of the Temperley-Lieb algebra defined via tiling. Overhang paths are certain generalisations of Dyck paths allowing more general steps but restricted to a rectangle in the…

Combinatorics · Mathematics 2020-12-21 Bethany Marsh , Paul Martin

The super Catalan numbers $T(m,n)=(2m)!(2n)!/2m!n!(m+n)!$ are integers which generalize the Catalan numbers. With the exception of a few values of $m$, no combinatorial interpretation in known for $T(m,n)$. We give a weighted interpretation…

Combinatorics · Mathematics 2014-08-27 Emily Allen , Irina Gheorghiciuc

This paper studies combinatorial properties of the 'complex of planar injective words', a chain complex of modules over the Temperley-Lieb algebra that arose in our work on homological stability. Despite being a linear rather than a…

Algebraic Topology · Mathematics 2022-08-24 Rachael Boyd , Richard Hepworth

For each positive integer $k$, we consider five well-studied posets defined on the set of Dyck paths of semilength $k$. We prove that uniquely sorted permutations avoiding various patterns are equinumerous with intervals in these posets.…

Combinatorics · Mathematics 2020-03-13 Colin Defant

In this paper, we consider a generalization of the Stirling number sequence of both kinds by using a specialization of a new family of symmetric functions. We give combinatorial interpretations for this symmetric functions by means of…

Combinatorics · Mathematics 2021-10-22 Bazeniar Abdelghafour , Moussa Ahmia , José L. Ramírez , Diego Villamizar

In this short note, we first present a simple bijection between binary trees and colored ternary trees and then derive a new identity related to generalized Catalan numbers.

Combinatorics · Mathematics 2008-05-12 Yidong Sun

A new algorithm to generate all Dyck words is presented, which is used in ranking and unranking Dyck words. We emphasize the importance of using Dyck words in encoding objects related to Catalan numbers. As a consequence of formulas used in…

Discrete Mathematics · Computer Science 2010-02-15 Zoltan Kasa

I propose a class of non-positional numeral systems where numbers are represented by Dyck words, with the systems arising from a recursive extension of prime factorization. After describing two proper subsets of the Dyck language capable of…

Formal Languages and Automata Theory · Computer Science 2026-02-18 Ralph L. Childress

We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…

Combinatorics · Mathematics 2020-10-13 Mirko D'Ovidio , Anna Chiara Lai , Paola Loreti

In this paper, we derive several formulas of counting families of non-intersecting paths for two-sided ladder-shaped regions. As an application, we give a new proof to a combinatorial interpretation of Fibonacci numbers obtained by G.…

Commutative Algebra · Mathematics 2007-05-23 Hsin-Ju Wang

We give some elementary manifestly positive formulae for the Kronecker products s_(d,d) * s_(d+k,d-k) and s_(d,d) * s_(2d-k,1^k). These formulae demonstrate some fundamental properties of the Kronecker coefficients, and we use them to…

Combinatorics · Mathematics 2015-09-11 Andrew Brown , Stephanie van Willigenburg , Mike Zabrocki

This (partly expository) paper originated from the study of Hankel determinants of convolution powers of Catalan numbers and of Narayana polynomials. This led to some Hankel determinants of signed Catalan numbers whose values are multiples…

Combinatorics · Mathematics 2018-04-10 Johann Cigler

It is known that both the number of Dyck paths with $2n$ steps and $k$ peaks, and the number of Dyck paths with $2n$ steps and $k$ steps at odd height follow the Narayana distribution. In this paper we present a bijection which explicitly…

Combinatorics · Mathematics 2014-01-27 Paul R. G. Mortimer , Thomas Prellberg

Given a permutation $f$, we study the positroid Catalan number $C_f$ defined to be the torus-equivariant Euler characteristic of the associated open positroid variety. We introduce a class of repetition-free permutations and show that the…

Combinatorics · Mathematics 2021-04-13 Pavel Galashin , Thomas Lam