English
Related papers

Related papers: Dyck Numbers, I. Successor Function

200 papers

Most planners ground numeric planning tasks, given in a first-order-like language, into a ground task representation. However, this can lead to an exponential blowup in task representation size, which occurs in practice for hard-to-ground…

Artificial Intelligence · Computer Science 2025-11-04 Dominik Drexler

For a fixed integer $k$, we define a sequence $A_k=(a_k(n))_{n\geq0}$ and a corresponding sparse subsequence $S_k$ using the cardinality of the $n$-th symmetric power of the set $\{1,2,\ldots, k\}$. For $k\in\{2,\dots,8\}$, we find…

Combinatorics · Mathematics 2024-07-23 Po-Yi Huang , Wen-Fong Ke

We analyze some enumerative and asymptotic properties of Dyck paths under a line of slope 2/5.This answers to Knuth's problem \\#4 from his "Flajolet lecture" during the conference "Analysis of Algorithms" (AofA'2014) in Paris in June…

Discrete Mathematics · Computer Science 2016-06-29 Cyril Banderier , Michael Wallner

A variation of Dyck paths allows for down-steps of arbitrary length, not just one. This is motivated by ideas published by Emeric Deutsch around the turn of the millenium. We are interested in the subclass of them where the sequence of the…

Combinatorics · Mathematics 2020-05-11 Helmut Prodinger

We present a method for obtaining congruences modulo powers of 3 for sequences given by recurrences of finite depth with polynomial coefficients. We apply this method to Catalan numbers, Motzkin numbers, Riordan numbers, Schr\"oder numbers,…

Combinatorics · Mathematics 2013-08-14 Christian Krattenthaler , Thomas W. Müller

We study the two statistics, the inversion number and the major index, on Catalan combinatorial objects such as $r$-Dyck paths, $r$-Stirling permutations, non-crossing partitions, Dyck tilings, and symmetric Dyck paths. We show that they…

Combinatorics · Mathematics 2024-07-25 Keiichi Shigechi

In a previous work, we developed an algorithm for the computation of incomplete Bessel functions, which pose as a numerical challenge, based on the $G_{n}^{(1)}$ transformation and Slevinsky-Safouhi formula for differentiation. In the…

Numerical Analysis · Mathematics 2022-04-26 Richard M. Slevinsky , Hassan Safouhi

We study the relationship between rational slope Dyck paths and invariant subsets of $\mathbb Z,$ extending the work of the first two authors in the relatively prime case. We also find a bijection between $(dn,dm)$--Dyck paths and…

Combinatorics · Mathematics 2017-09-28 Eugene Gorsky , Mikhail Mazin , Monica Vazirani

We propose generating functions which encode the degeneracies and wall-crossing phenomena of $\mathcal{N}=2$ BPS structures. The generating functions have a representation-theoretic origin and are the analogs of the 1/4-BPS dyon counting…

High Energy Physics - Theory · Physics 2024-08-26 Murad Alim , Daniel Bryan

DNA sequences encode critical genetic information, yet their variable length and discrete nature impede direct utilization in deep learning models. Existing DNA representation schemes convert sequences into numerical vectors but fail to…

Genomics · Quantitative Biology 2025-12-16 Zhiyuan Peng , Naifan Zhang , Yuanbo Tang , Yang Li

A general technique of exact calculation of any correlation functions for the special class of one-dimensional spin models containing small clusters of quantum spins assembled to a chain by alternating with the single Ising spins is…

Statistical Mechanics · Physics 2013-11-05 Stefano Bellucci , Vadim Ohanyan

In this paper, a novel discrete algebra is presented which follows by combining the SU(2) Lie-Poisson bracket with the discrete Frenet equation. Physically, the construction describes a discrete piecewise linear string in R3. The starting…

High Energy Physics - Theory · Physics 2022-10-12 Jin Dai , Theodora Ioannidou , Antti Niemi

We introduce a deformed version of Dyck paths (DDP), where additional to the steps allowed for Dyck paths, 'jumps' orthogonal to the preferred direction of the path are permitted. We consider the generating function of DDP, weighted with…

Mathematical Physics · Physics 2017-02-01 Nils Haug , Adri Olde Daalhuis , Thomas Prellberg

We consider a one-dimensional system of Brownian particles that repel each other through a logarithmic potential. We study two formulations for the system and the relation between them. The first, Dyson's Brownian motion model, has an…

Mathematical Physics · Physics 2012-09-11 Sergio Andraus , Makoto Katori , Seiji Miyashita

We present a new bijection between variants of $m$-Dyck paths (paths with steps in $\{+1,-m\}$ starting and ending at height $0$ and remaining at non-negative height), which generalizes a classical bijection between Dyck prefixes and…

Combinatorics · Mathematics 2016-03-29 Axel Bacher

This paper presents a number of identities for Dirichlet series and series with Stirling numbers of the first kind. As coefficients for the Dirichlet series we use Cauchy numbers of the first and second kinds, hyperharmonic numbers,…

Number Theory · Mathematics 2023-01-20 Khristo N. Boyadzhiev

We enumerate interlaced pairs of parking functions whose underlying Dyck path has a bounded height. We obtain an explicit formula for this enumeration in the form of a quotient of analogs of Chebicheff polynomials having coefficients in the…

Combinatorics · Mathematics 2015-04-28 Francois Bergeron

Multivariate Bessel processes, otherwise known as radial Dunkl processes, are stochastic processes defined in a Weyl chamber that are repelled from the latter's boundary by a singular drift with a strength given by the multiplicity function…

Probability · Mathematics 2023-12-12 Nicole Hufnagel , Sergio Andraus

We provide enumerating results for partial knight's paths of a given size. We prove algebraically that zigzag knight's paths of a given size ending on the $x$-axis are enumerated by the generalized Catalan numbers, and we give a…

Combinatorics · Mathematics 2023-02-01 Jean-Luc Baril , José Luis Ramirez

The exact path length problem is to determine if there is a path of a given fixed cost between two vertices. This paper focuses on the exact path problem for costs $-1,0$ or $+1$ between all pairs of vertices in an edge-weighted digraph.…

Data Structures and Algorithms · Computer Science 2018-03-06 Phillip G. Bradford