Related papers: 4D Dyck triangle and its projections
We study combinatorial properties of a rational Dyck path by decomposing it into a tuple of Dyck paths. The combinatorial models such as $b$-Stirling permutations, $(b+1)$-ary trees, parenthesis presentations, and binary trees play central…
Rational Dyck paths are the rational generalization of classical Dyck paths. They play an important role in Catalan combinatorics, and have multiple applications in algebra and geometry. Two statistics over rational Dyck paths called run…
Dyck paths (also balanced brackets and Dyck words) are among the most heavily studied Catalan families. This paper is a continuation of [2, 3]. In the paper we enumerate the terms of the OEIS A036991, Dyck numbers, and construct a…
The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with $m$ flaws is the $n$-th Catalan number and independent on $m$. In this paper, we consider the refinements of Dyck paths with flaws by four…
Dyck paths having height at most $h$ and without valleys at height $h-1$ are combinatorially interpreted by means of 312-avoding permutations with some restrictions on their \emph{left-to-right maxima}. The results are obtained by analyzing…
A polarity of a projective plane is a map, often assumed to be involutive, mapping a generic point to a generic line and reciprocally. The most classical polarity is the polarity with respect to a conic, but other exist: the harmonic…
This paper is the second part of a two-part paper investigating the structure and properties of dyadic polygons. A dyadic polygon is the intersection of the dyadic subplane $D^2$ of the real plane $R^2$ and a real convex polygon with…
Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…
A circular Pascal array is a periodization of the familiar Pascal's triangle. Using simple operators defined on periodic sequences, we find a direct relationship between the ranges of the circular Pascal arrays and numbers of certain…
The orthogonal projection of a 4-cube onto a uniform random 3-subspace in R^4 is a convex 3-polyhedron P with 14 vertices almost surely. Three numerical characteristics of P -- volume, surface area and mean width -- are studied. These…
The classical theory of plane projective geometry is examined constructively, using both synthetic and analytic methods. The topics include Desargues's Theorem, harmonic conjugates, projectivities, involutions, conics, Pascal's Theorem,…
A k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them mutually cross in their interiors. We present a bijection between 2-triangulations of a convex n-gon and pairs of non-crossing Dyck paths of length…
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…
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…
A "truncation" of Pascal's triangle is a triangular array of numbers that satisfies the usual Pascal recurrence but with a boundary condition that declares some terminal set of numbers along each row of the array to be zero. Presented here…
The article deals with a lexicographic order in various sequences. Consider the axiomatic of lexicographic series, based on the properties of the natural numbers. Elements of the set are ordered first the code length; further in each sign…
Cover-inclusive Dyck tilings are tilings of skew Young diagrams with ribbon tiles shaped like Dyck paths, in which tiles are no larger than the tiles they cover. These tilings arise in the study of certain statistical physics models and…
The Catalan triangle, as well as a Fuss-Catalan triangle, enter a problem of counting particular tied arc diagrams. This setting allows us to prove some combinatorial properties of these triangles.
We define a set of binary matrices where any two of them can not be placed one on the other in a way such that the corresponding entries coincide. The rows of the matrices are obtained by means of Dyck words. The cardinality of the set of…
A Dyck path is a lattice path in the plane integer lattice $\mathbb{Z}\times\mathbb{Z}$ consisting of steps (1,1) and (1,-1), which never passes below the x-axis. A peak at height k on a Dyck path is a point on the path with coordinate y=k…