Related papers: Euler Coefficients and Restricted Dyck Paths
We give a numerical algorithm computing Euler obstruction functions using maximum likelihood degrees. The maximum likelihood degree is a well-studied property of a variety in algebraic statistics and computational algebraic geometry. In…
Motzkin paths consist of up-steps, down-steps, level-steps, and never go below the $x$-axis. They return to the $x$-axis at the end. The concept of skew Dyck path \cite{Deutsch-italy} is transferred to skew Motzkin paths, namely, a left…
We consider the problem of counting subset of Dyck paths contained in a Ferrers diagram. This enumeration concerns to find the number of the elements in a branch of the Kr\'ew\'eras tree. Using the Ferrers diagrams associated with Dyck…
We consider a class of lattice paths with certain restrictions on their ascents and down steps and use them as building blocks to construct various families of Dyck paths. We let every building block $P_j$ take on $c_j$ colors and count all…
We introduce an equivalence relation on the set of Dyck paths and some operations on them. We determine a formula for the cardinality of those equivalence classes and use this information to obtain a combinatorial formula for the number of…
We enumerate the number of monotonic lattice paths starting at $(0,0)$ and terminating at $(m,n)$ in which $l$ of the first $k$ steps lie below the line $y=x\ (0\leq k\leq m\leq n)$. These closed formulas consist of terms which are a…
A problem based on the Extended Euclidean Algorithm applied to a class of polynomials with many factors is presented and believed to be hard. If so, it is a one-way function well suited for applications in digital signicatures.
In this paper we study existence and spectral properties for weak solutions of Neumann and Dirichlet problems associated to second order linear degenerate elliptic partial differential operators $X$, with rough coefficients of the form…
We consider a variant of the continuous and discrete Ulam-Hammersley problems: we study the maximal length of an increasing path through a Poisson point process (or a Bernoulli point process) with the restriction that there must be minimal…
We count the number of lattice paths lying under a cyclically shifting piecewise linear boundary of varying slope. Our main result extends well known enumerative formulae concerning lattice paths, and its derivation involves a classical…
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…
The Riccati equations reducible to first-order linear equations by an appropriate change the dependent variable are singled out. All these equations are integrable by quadrature. A wide class of linear ordinary differential equations…
It is well known that the set of $m$-Dyck paths with a fixed height and a fixed amount of valleys is counted by the Fu{\ss}-Narayana numbers. In this article, we consider the set of $m$-Dyck paths that start with at least $t$ north steps.…
In [1], we proved the existence of solutions to reflected rough differential equations based on an idea of Euler approximation of the solutions which is due to Davie [6]. In this paper, we prove the existence theorem under weaker…
We introduce variational problems on Riemannian manifolds with constrained acceleration and derive necessary conditions for normal extremals in the constrained variational problem. The problem consists on minimizing a higher-order energy…
It is a classical result in combinatorics that among lattice paths with 2m steps U=(1,1) and D=(1,-1) starting at the origin, the number of those that do not go below the x-axis equals the number of those that end on the x-axis. A much more…
We introduce a model of infinite horizon linear dynamic optimization with linear constraints and obtain results concerning feasibility of trajectories and optimal solutions necessarily satisfying conditions that resemble the Euler condition…
We consider open quantum walks on a graph, and consider the random variables defined as the passage time and number of visits to a given point of the graph. We study in particular the probability that the passage time is finite, the…
We show that counting Euler tours in undirected bounded tree-width graphs is tractable even in parallel - by proving a $\#SAC^1$ upper bound. This is in stark contrast to #P-completeness of the same problem in general graphs. Our main…
We use a Hamiltonian (transition matrix) description of height-restricted Dyck paths on the plane in which generating functions for the paths arise as matrix elements of the propagator to evaluate the length and area generating function for…