English
Related papers

Related papers: Dyck Numbers, I. Successor Function

200 papers

In a paper by Sapounakis, Tasoulas, and Tsikouras \cite{stt}, the authors count the number of occurrences of patterns of length four in Dyck paths. In this paper we specify in one direction and generalize in another. We only count ballot…

Combinatorics · Mathematics 2010-04-19 Heinrich Niederhausen , Shaun Sullivan

The ECO method and the theory of Catalan-like numbers introduced by Aigner seems two completely unrelated combinatorial settings. In this work we try to establish a bridge between them, aiming at starting a (hopefully) fruitful study on…

Combinatorics · Mathematics 2007-05-23 Luca Ferrari , Renzo Pinzani

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…

Functions like the exponential, Chebyshev polynomials, and monomial symmetric polynomials are preeminent among all special functions. They have simple definitions and can be expressed using easily specified integers like n!. Families of…

Classical Analysis and ODEs · Mathematics 2012-10-11 Charles F. Dunkl

A variation of Dyck paths allows for down-steps of arbitrary length, not just one. Credits for this invention are given to Emeric Deutsch. Surprisingly, the enumeration of them is somewhat akin to the analysis of Motzkin-paths; the last…

Combinatorics · Mathematics 2020-04-16 Helmut Prodinger

We study a partially ordered set of planar labeled rooted trees by use of combinatorial objects called Dyck tilings. A generating function of the poset is factorized when the minimum element of the poset is $312$-avoiding and satisfies some…

Combinatorics · Mathematics 2024-08-13 Keiichi Shigechi

We provide new interpretations for a subset of Raney numbers, involving threshold sequences and Motzkin-like paths with long up and down steps. Given three integers n, k, l such that n >= 1, k >= 2 and 0 <= l <= k-2, a (k,l)-threshold…

Combinatorics · Mathematics 2021-09-14 Irena Rusu

Three-dimensional Catalan numbers are a variant of the classical (bidimensional) Catalan numbers, that count, among other interesting objects, the standard Young tableaux of shape (n,n,n). In this paper, we present a structural bijection…

Combinatorics · Mathematics 2020-12-02 Justine Falque

We provide generating functions, formulas, and asymptotic expressions for the number of Catalan words based on the number of runs of ascents (descents), runs of weak ascents (descents), $\ell$-valleys, valleys, symmetric valleys,…

Combinatorics · Mathematics 2024-04-09 Jean-Luc Baril , Pamela E. Harris , Kimberly J. Harry , Matt McClinton , José L. Ramírez

Let $D$ be a set of positive integers. A $D$-diffsequence of length $k$ is a sequence of positive integers $a_1 < \cdots < a_k$ such that $a_{i+1}-a_i\in D$ for $i=1,\ldots,k-1$. For $D=\{2^i\mid i\in \mathbb{Z}_{\ge 0}\}$, it is known that…

Combinatorics · Mathematics 2025-09-01 Kanav Talwar , Utkarsh Gupta

We consider the numerical approximation for a class of radial Dunkl processes corresponding to arbitrary (reduced) root systems in $\mathbb{R}^{d}$. This class contains some well-known processes such as Bessel processes, Dyson's Brownian…

Probability · Mathematics 2024-10-11 Hoang-Long Ngo , Dai Taguchi

Special kinds of continued fractions have been proved to converge to transcendental real numbers by means of the celebrated Subspace Theorem. In this paper we study the analogous $p$--adic problem. More specifically, we deal with Browkin…

Number Theory · Mathematics 2025-02-11 Ignazio Longhi , Nadir Murru , Francesco Maria Saettone

The well-known $k$-disjoint path problem ($k$-DPP) asks for pairwise vertex-disjoint paths between $k$ specified pairs of vertices $(s_i, t_i)$ in a given graph, if they exist. The decision version of the shortest $k$-DPP asks for the…

Data Structures and Algorithms · Computer Science 2018-02-06 Samir Datta , Siddharth Iyer , Raghav Kulkarni , Anish Mukherjee

We present a method to obtain congruences modulo powers of 2 for sequences given by recurrences of finite depth with polynomial coefficients. We apply this method to Catalan numbers, Fu\ss-Catalan numbers, and to subgroup counting functions…

Combinatorics · Mathematics 2012-06-27 Manuel Kauers , Christian Krattenthaler , Thomas W. Müller

We show that the Eulerian-Catalan numbers enumerate Dyck permutations. We provide two proofs for this fact, the first using the geometry of alcoved polytopes and the second a direct combinatorial proof via an Eulerian-Catalan analogue of…

Combinatorics · Mathematics 2011-01-07 Hoda Bidkhori , Seth Sullivant

This paper provides an algorithmic pipeline for studying the intrinsic structure of a finite discrete dynamical system (DDS) modelling an evolving phenomenon. Here, by intrinsic structure we mean, regarding the dynamics of the DDS under…

Dynamical Systems · Mathematics 2022-12-20 Alberto Dennunzio , Enrico Formenti , Luciano Margara , Sara Riva

Function theory of Cayley-Dickson variables is applied to Fermat's last theorem. For this the homotopy theorem, Rouch\'e's theorem and residues of meromorphic functions over Cayley-Dickson algebras are used. A special meromorphic function…

General Mathematics · Mathematics 2018-12-18 S. V. Ludkovsky

We give a extensive account of a recent new way of applying the Dirichlet form theory to random Poisson measures. The main application is to obtain existence of density for thelaws of random functionals of L\'evy processes or solutions of…

Probability · Mathematics 2010-04-19 Nicolas Bouleau

We introduce the notion of doubly rooted plane trees and give a decomposition of these trees, called the butterfly decomposition which turns out to have many applications. From the butterfly decomposition we obtain a one-to-one…

Combinatorics · Mathematics 2007-05-23 William Y. C. Chen , Nelson Y. Li , Louis W. Shapiro

A symmetric subset of the reals is one that remains invariant under some reflection x --> c-x. Given 0 < x < 1, there exists a real number D(x) with the following property: if 0 < d < D(x), then every subset of [0,1] with measure x contains…

Number Theory · Mathematics 2007-05-23 Greg Martin , Kevin O'Bryant
‹ Prev 1 4 5 6 7 8 10 Next ›