Related papers: Partial skew Dyck paths -- a kernel method approac…
Since ordered trees and Dyck paths are equinumerous, so are ordered forests and grand-Dyck paths that start with an upwards step.
Minimax problems of the form $\min_x \max_y \Psi(x,y)$ have attracted increased interest largely due to advances in machine learning, in particular generative adversarial networks. These are typically trained using variants of stochastic…
Let a and b be two positive integers. A culminating path is a path of Z^2 that starts from (0,0), consists of steps (1,a) and (1,-b), stays above the x-axis and ends at the highest ordinate it ever reaches. These paths were first…
We introduce square diagrams that represent numerical semigroups and we obtain an injection from the set of numerical semigroups into the set of Dyck paths.
In this paper, we introduce a new class of derivations that generalizes skew derivations and semi-derivations, and we call it ``skew semi-derivation". Further, we present a study of the conditions under which this type of multiplicative…
Two kinds of configurations involving steps on surfaces are reviewed. The first one results from an initially planar vicinal surface, i.e. slightly deviating from a high-symmetry (001) or (111) orientation. In some cases, these surfaces…
A wide class of skew derivations on degree-one generalized Weyl algebras $R(a,\varphi)$ over a ring $R$ is constructed. All these derivations are twisted by a degree-counting extensions of automorphisms of $R$. It is determined which of the…
Let S be a finite subset of Z^2. A walk on the slit plane with steps in S is a sequence (0,0)=w_0, w_1, ..., w_n of points of Z^2 such that w_{i+1}-w_i belongs to S for all i, and none of the points w_i, i>0, lie on the half-line H= {(k,0):…
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 study the quadratic $k$-vertex-disjoint paths problem (Q-$k$-VDP), which seeks $k$ vertex-disjoint paths in a directed graph that minimize a nonconvex quadratic objective function. We formulate the problem as a binary quadratic program…
In queuing theory, it is usual to have some models with a "reset" of the queue. In terms of lattice paths, it is like having the possibility of jumping from any altitude to zero. These objects have the interesting feature that they do not…
Inspired by a new mathematical model for bobbin lace, this paper considers finite lattice paths formed from the set of step vectors $\mathfrak{A}=$$\{\rightarrow,$ $\nearrow,$ $\searrow,$ $\uparrow,$ $\downarrow\}$ with the restriction that…
Dyck paths categories are introduced as a combinatorial model of the category of representations of quivers of Dynkin type An. In particular, it is proved that there is a bijection between some Dyck paths and perfect matchings of some snake…
Kim and Drake used generating functions to prove that the number of 2-distant noncrossing matchings, which are in bijection with little Schroeder paths, is the same as the weight of Dyck paths in which downsteps from even height have weight…
We use Jones-Wenzl idempotents to construct bases for the relative Kauffman bracket skein module of a square with n points colored 1 and one point colored h. We consider a natural bilinear form on this skein module. We calculate the…
Some problems founds in teaching physics related to curved paths that are unfortunately only described as illustration. A simple way to introduce the path is presented, which can help students to test their concept numerically. The…
A skew meadow is a non-commutative ring with an inverse operator satisfying two special equations and in which the inverse of zero is zero. All skew fields and products of skew fields can be viewed as skew meadows. Conversely, we give an…
In this paper, we propose to obtain the skewed version of a unimodal symmetric density using a skewing mechanism that is not based on a cumulative distribution function. Then we disturb the unimodality of the resulting skewed density. In…
Recently, a new way of avoiding crossings in straight-line drawings of non-planar graphs has been investigated. The idea of partial edge drawings (PED) is to drop the middle part of edges and rely on the remaining edge parts called stubs.…
The analysis of Frank Wolfe (FW) variants is often complicated by the presence of different kinds of "good" and "bad" steps. In this article we aim to simplify the convergence analysis of some of these variants by getting rid of such a…