Related papers: Dyck Numbers, I. Successor Function

Motivated by the study of the distribution of zeros of generalized Bessel-type functions, the principal goal of this paper is to identify new research directions in the theory of multiplier sequences. The investigations focus on multiplier…

Many digital functions studied in the literature, e.g., the summatory function of the base-$k$ sum-of-digits function, have a behavior showing some periodic fluctuation. Such functions are usually studied using techniques from analytic…

We give methods for Bayesian inference of directed acyclic graphs, DAGs, and the induced causal effects from passively observed complete data. Our methods build on a recent Markov chain Monte Carlo scheme for learning Bayesian networks,…

Pappe, Paul, and Schilling introduced two combinatorial statistics, depth and ddinv, associated with classical Dyck paths, and proved that the distributions of (area, depth) and (dinv, ddinv) are $q,t$-symmetric by constructing an…

The classical q-hypergeometric orthogonal polynomials are assembled into a hierarchy called the q-Askey scheme. At the top of the hierarchy, there are two closely related families, the Askey-Wilson and q-Racah polynomials. As it is well…

We extend the recursion formula for matrix Bessel functions, which we obtained previously, to superspace. It is sufficient to do this for the unitary orthosymplectic supergroup. By direct computations, we show that fairly explicit results…

We consider the set of alternating paths on a fixed fully packed loop of size n. This set is in bijection with the set of fully packed loops of size n. Furthermore, for a special choice of fully packed loop, we demonstrate that the set of…

Motivated by independent results of Bizley and Duchon, we study rational Dyck paths and their subset of factor-free elements. On the one hand, we give a bijection between rational Dyck paths and regular Dyck paths with ascents colored by…

Motivated by the relation holding for the m-generalized Catalan numbers of type A and C, the connection between dominant regions of the m-Shi arrangement of type A and C is investigated. In the same line of thought, a bijection between mn+1…

We consider Dyck paths having height at most two with some constraints on the number of consecutive valleys at height one which must be followed by a suitable number of valleys at height zero. We prove that they are enumerated by so-called…

The notion of symmetric and asymmetric peaks in Dyck paths was introduced by Fl\'orez and Rodr\'{\i}guez, who counted the total number of such peaks over all Dyck paths of a given length. In this paper we generalize their results by giving…

In this article we investigate the lattices of Dyck paths of type $A$ and $B$ under dominance order, and explicitly describe their Heyting algebra structure. This means that each Dyck path of either type has a relative pseudocomplement with…

We establish combinatorial interpretations of several identities for the Catalan and Fine numbers and, along the way, we present some new bijections of independent interest. Briefly, we show that C_{n} = 1/(n+1) Sum_{k} (n+1)choose(2k+1)…

This work presents new asymptotic formulas for family of walks in Weyl chambers. The models studied here are defined by step sets which exhibit many symmetries and are restricted to the first orthant. The resulting formulas are very…

Experience shows that the poset of levels (or dimensions) of the topos of presheaves on some elegant Reedy categories may be equipped with a monotone increasing `successor' function which, as the case of simplicial sets shows, is different…

A permutation is called Grassmannian if it has at most one descent. The study of pattern avoidance in such permutations was initiated by Gil and Tomasko in 2021. We continue this work by studying Grassmannian permutations that avoid an…

In 1944 Dyson defined the rank of a partition as the largest part minus the number of parts, and conjectured that the residue of the rank mod 5 divides the partitions of 5n+4 into five equal classes. This gave a combinatorial explanation of…

Analysis of the dynamics of the Dyck words helped solve the problem of representing the Catalan number as a sum of squares of natural numbers. In this case, the Dyck triangle is considered in different coordinates. In the calculations, we…

Discrete analogs of the index transforms, involving Bessel and the modified Bessel functions are introduced and investigated. The corresponding inversion theorems for suitable classes of functions and sequences are established.

Bargraphs are a special class of convex polyominoes. They can be identified with lattice paths with unit steps north, east, and south that start at the origin, end on the $x$-axis, and stay strictly above the $x$-axis everywhere except at…