Related papers: Descending Dungeons and Iterated Base-Changing
In this work, we expose four bijections each allowing to increase (or decrease) one parameter in either uniform random forests with a fixed number of edges and trees, or quadrangulations with a boundary having a fixed number of faces and a…
Common meadows are commutative and associative algebraic structures with two operations (addition and multiplication) with additive and multiplicative identities and for which inverses are total. The inverse of zero is an error term…
We generalize the common notion of descending and ascending central series. The descending approach determines a naturally graded Lie ring and the ascending version determines a graded module for this ring. We also link derivations of these…
A permutation $\sigma=\sigma_1 \sigma_2 \cdots \sigma_n$ has a descent at $i$ if $\sigma_i>\sigma_{i+1}$. A descent $i$ is called a peak if $i>1$ and $i-1$ is not a descent. The size of the set of all permutations of $n$ with a given…
In this paper we introduce an Euclidean decomposition of elements a_n of an increasing sequence of natural numbers into weight * level + jump which we use to classify the numbers a_n either by weight or by level. We then show that this…
We consider a variant of Dickson lemma, where each entry of a vector can be reseted or incremented by 1 in respect to the previous one. We give an example of non dominating sequence of length $2^{2^{\theta (n)}}$. It perfectly match the…
The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice…
Let $\alpha=(1+\sqrt 5)/2$, the golden ratio, and $\beta=-1/\alpha=(1 - \sqrt 5)/2$. Let $F_n$ and $L_n$ be the Fibonacci and Lucas numbers, defined by $F_n=(\alpha^n -\beta^n)/\sqrt 5$ and $L_n=\alpha^n + \beta^n$, for all non-negative…
We discuss the problem of counting certain LEGO structures, primarily those comprising parallel $w \times 1$ tiles. These can be combined, as a single LEGO structure, by interlocking the tiles. %Alternatively, if the interlocking condition…
We prime-encode the natural numbers via recursive factorisation, iterated to the exponents, generating a corpus of planar rooted trees equivalently represented as Dyck words. This forms a deterministic text endowed with internal rules.…
Given a one-dimensional shift $X$, let $|F_X(n)|$ be the number of follower sets of words of length $n$ in $X$, and $|P_X(n)|$ be the number of predecessor sets of words of length $n$ in $X$. We call the sequence $\{|F_X(n)|\}_{n \in…
We count the number of subsets of $\{1,2,\cdots,n\}$ under different conditions and study the sequence obtained as we let $n$ increase.
A "tournament sequence" is an increasing sequence of positive integers (t_1,t_2,...) such that t_1=1 and t_{i+1} <= 2 t_i. A "Meeussen sequence" is an increasing sequence of positive integers (m_1,m_2,...) such that m_1=1, every nonnegative…
A permutation is (1-23-4)-avoiding if it contains no four entries, increasing left to right, with the middle two adjacent in the permutation. Here we give a 2-variable recurrence for the number of such permutations, improving on the…
We provide guessed recurrence equations for the counting sequences of rook paths on d-dimensional chess boards starting at (0..0) and ending at (n..n), where d=2,3,...,12. Our recurrences suggest refined asymptotic formulas of these…
The ever-growing size of the foundation language model has brought significant performance gains in various types of downstream tasks. With the existence of side-effects brought about by the large size of the foundation language model such…
Consider a weighted branching process generated by a point process on $[0,1]$, whose atoms sum up to one. Then the weights of all individuals in any given generation sum up to one, as well. We define a nested occupancy scheme in random…
Answering a question of Donald Knuth, we find the bivariate exponential generating function for "up-up-or-down-down'' permutations of odd length according to their last entry. An up-up-or-down-down permutation is a permutation $a_1a_2\cdots…
If the list of binary numbers is read by upward-sloping diagonals, the resulting ``sloping binary numbers'' 0, 11, 110, 101, 100, 1111, 1010, ... (or 0, 3, 6, 5, 4, 15, 10, ...) have some surprising properties. We give formulae for the n-th…
Collatz Conjecture sequences increase and decrease in seemingly random fashion. By identifying and analyzing the forms of numbers, we discover that Collatz sequences are governed by very specific, well-defined rules, which we call cascades.