Related papers: A Note on Boolean Lattices and Farey Sequences II
We study compositions whose parts are colored by subsequences of the Fibonacci numbers. We give explicit bijections between Fibonacci colored compositions and several combinatorial objects, including certain restricted ternary and…
We consider a certain linear recursive relation with integer parameters and study some of its algebraic and geometric properties, with the purpose of estimating the number of chains of valences in the Farey series.
We establish an order-preserving bijective correspondence between the sets of coclosed elements of some bounded lattices related by suitable Galois connections. As an application, we deduce that if $M$ is a finitely generated…
The spacing distribution between Farey points has drawn attention in recent years. It was found that the gaps $\gamma_{j+1}-\gamma_j$ between consecutive elements of the Farey sequence produce, as $Q\to\infty$, a limiting measure. Numerical…
We construct a monadic second-order sentence that characterizes the ternary relations that are the betweenness relations of finite or infinite partial orders. We prove that no first-order sentence can do that. We characterize the partial…
For a fixed irrational number $\alpha$ and $n\in \mathbb{N}$, we look at the shape of the sequence $(f(1),\ldots,f(n))$ after Schensted insertion, where $f(i) = \alpha i \mod 1$. Our primary result is that the boundary of the Schensted…
We introduce a notion of variable quasi-Bregman monotone sequence which unifies the notion of variable metric quasi-Fej\'er monotone sequences and that of Bregman monotone sequences. The results are applied to analyze the asymptotic…
A bijection between ternary trees with $n$ nodes and a subclass of Motzkin paths of length $3n$ is given. This bijection can then be generalized to $t$-ary trees.
We study here a sequence of secondary measures, so called because the set of secondary polynomials on a given term become orthogonal for the next measure. The main result is a formula making explicit the density of any term of the sequence,…
We present three bijections, the first between little Schr\"{o}der paths and a class of growth-constrained integer sequences, the second between lattice paths consisting of steps with nonnegative slope and another class of…
In previous work, we associated to any finite simple graph a particular set of derangements of its vertices. These derangements are in bijection with the spheres in the wedge sum describing the homotopy type of the boolean complex for this…
We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey numbers. We formalize situations in which we can use arbitrary families of…
We identify a large class of positive-semidefinite kernels for which a certain polynomial rate of convergence of maximum mean discrepancies of Farey sequences is equivalent to the Riemann hypothesis. This class includes all Mat\'ern kernels…
We reformulate several known results about continued fractions in combinatorial terms. Among them the theorem of Conway and Coxeter and that of Series, both relating continued fractions and triangulations. More general polygon dissections…
We show that, for every linear ordering of $[2]^n$, there is a large subcube on which the ordering is lexicographic. We use this to deduce that every long sequence contains a long monotone subsequence supported on an affine cube. More…
As the conclusion of a line of investigation undertaken in two previous papers, we compute asymptotic frequencies for the values taken by numerators of differences of consecutive Farey fractions with denominators restricted to lie in…
In this paper, we develop the general intersection theory of nef b-divisors, extending the movable intersection theory. We define a notion of restricted volume of b-divisors and prove a quantitative version of the monotonicity of the…
We introduce new classes of general monotone sequences and study their properties. For functions whose Fourier coefficients belong to these classes, we establish Hardy-Littlewood-type theorems.
Monadic second order logic is the expansion of first order logic by quantifiers ranging over unary relations. We study the shared monadic second order theory of finite linear orders, i.e. the pseudofinite monadic second order theory of…
We consider a category of all finite partial orderings with quotient maps as arrows and construct a Fra\"iss\'e sequence in this category. Then we use commonly known relations between partial orders and lattices to construct a sequence of…