Related papers: Enumerative combinatorics of intervals in the Dyck…
We are interested in classifying those sets of primes $\mathcal{P}$ such that when we sieve out the integers up to $x$ by the primes in $\mathcal{P}^c$ we are left with roughly the expected number of unsieved integers. In particular, we…
Let n points be taken at random on a circle of unit circumference and clockwise ordered. Uniform spacings are defined as the clockwise arc-lengths between the successive points from this sample. We are interested in the asymptotic behavior…
The confluent binomial posets with the atomic function A(n) = max (1,2^(n-2)) are classified. In particular, it is shown that in general there are non-isomorphic intervals of the same length.
Let $B$ be a finite Boolean algebra. Let $\mathcal A$ be the partial order of all implication sublattices of $B$. We will compute the M\"obius function on $\mathcal A$ in two different ways.
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…
In a Dyck path a peak which is (weakly) higher than all the preceding peaks is called a strict (weak) left to right maximum. We obtain explicit generating functions for both weak and strict left to right maxima in Dyck paths. The proofs of…
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…
We present combinatorial bijections and identities between certain skew Young tableaux, Dyck paths, triangulations, and dissections.
In this paper we propose some very promissing results in interval arithmetics which permit to build well-defined arithmetics including distributivity of multiplication and division according addition and substraction. Thus, it allows to…
A reparametrization (of a continuous path) is given by a surjective weakly increasing self-map of the unit interval. We show that the monoid of reparametrizations (with respect to compositions) can be understood via ``stop-maps'' that allow…
We give a $q$-enumeration of circular Dyck paths, which is a superset of the classical Dyck paths enumerated by the Catalan numbers. These objects have recently been studied by Alexandersson and Panova. Furthermore, we show that this…
We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…
In this paper, we use techniques of enumerative combinatorics to study the following problem: we count the number of ways to split $n$ balls into nonempty, ordered bins so that the most crowded bin has exactly $k$ balls. We find closed…
This paper analyzes the M\"obius ($\mu(i)$) function defined on the partially ordered set of triangular numbers ($\mathcal T(i)$) under the divisibility relation. We make conjectures on the asymptotic behavior of the classical M\"obius and…
Dey and Xin (J.Appl.Comput.Top., 2022, arXiv:1904.03766) describe an algorithm to decompose finitely presented multiparameter persistence modules using a matrix reduction algorithm. Their algorithm only works for modules whose generators…
For any finite totally ordered set, the multisets of intervals form an abelian category. Various classes of subcategories admit natural combinatorial descriptions, and counting them yields familiar integer sequences. Surprisingly, in some…
We introduce new combinatorial objects, the interval- posets, that encode intervals of the Tamari lattice. We then find a combinatorial interpretation of the bilinear operator that appears in the functional equation of Tamari intervals…
A monotone function interval is the set of monotone functions that lie pointwise between two fixed monotone functions. We characterize the set of extreme points of monotone function intervals and apply this to a number of economic settings.…
We define the notion of connectivity set for elements of any finitely generated Coxeter group. Then we define an order related to this new statistic and show that the poset is graded and each interval is a shellable lattice. This implies…
This paper is devoted to a new approach of the arithmetic of intervals. We present the set of intervals as a normed vector space. We define also a four-dimensional associative algebra whose product gives the product of intervals in any…