Related papers: Numerical and Statistical Analysis of Aliquot Sequ…

We model the growth of a cell population by a piecewise deterministic Markov branching tree. Each cell splits into two offsprings at a division rate $B(x)$ that depends on its size $x$. The size of each cell grows exponentially in time, at…

We consider the well-studied pattern counting problem: given a permutation $\pi \in \mathbb{S}_n$ and an integer $k > 1$, count the number of order-isomorphic occurrences of every pattern $\tau \in \mathbb{S}_k$ in $\pi$. Our first result…

We revisit staircases for words and prove several exact as well as asymptotic results for longest left-most staircase subsequences and subwords and staircase separation number, the latter being defined as the number of consecutive maximal…

If $R=k[x_1,\ldots,x_n]/I$ is a graded artinian algebra, then the length of $k[x_1,\ldots,x_n]/I^s$ becomes a polynomial in $s$ of degree $n$ for large $s$. If we write this polynomial as $\sum_{i=0}^n(-1)^ie_i{s+n-i-1\choose n-i}$, then…

We study the extremal function $S^k_d(n)$, defined as the maximum number of regular $(k-1)$-simplices spanned by $n$ points in $\mathbb{R}^d$. For any fixed $d\geq2k\geq6$, we determine the asymptotic behavior of $S^k_d(n)$ up to a…

We study the asymptotic behavior of cumulants of lacunary trigonometric sums $S_n(\omega) := \sum_{k=1}^n \cos (2 \pi a_k \omega)$, $\omega\in[0,1]$, and show that cumulant growth is highly sensitive to the arithmetic structure of the…

A classical result of Khinchin says that for almost all real numbers $\alpha$, the geometric mean of the first $n$ digits $a_i(\alpha)$ in the continued fraction expansion of $\alpha$ converges to a number $K = 2.6854520\ldots$ (Khinchin's…

Recently Kauers, Koutschan and Spahn announced a significant increase in the length of the so-called {\em gerrymander sequence}, given as A348456 in the OEIS, extending the sequence from 3 terms to 7 terms. We give a further extension to 11…

Green and Sisask showed that the maximal number of $3$-term arithmetic progressions in $n$-element sets of integers is $\lceil n^2/2\rceil$; it is easy to see that the same holds if the set of integers is replaced by the real line or by any…

For a linear code $C$ of length $n$ with dimension $k$ and minimum distance $d$, it is desirable that the quantity $kd/n$ is large. Given an arbitrary field $\mathbb{F}$, we introduce a novel, but elementary, construction that produces a…

We examine the behavior of the coefficients of powers of polynomials over a finite field of prime order. Extending the work of Allouche-Berthe, 1997, we study a(n), the number of occurring strings of length n among coefficients of any power…

We consider Galton--Watson trees conditioned on both the total number of vertices $n$ and the number of leaves $k$. The focus is on the case in which both $k$ and $n$ grow to infinity and $k = \alpha n + O(1)$, with $\alpha \in (0, 1)$.…

In one-dimensional Diophantine approximation, the Diophantine properties of a real number are characterized by its partial quotients, especially the growth of its large partial quotients. Notably, Kleinbock and Wadleigh [Proc. Amer. Math.…

We study several related models of self-avoiding polygons in a tubular subgraph of the simple cubic lattice, with a particular interest in the asymptotics of the knotting statistics. Polygons in a tube can be characterised by a finite…

For each integer $k \geq 2$, we introduce a sequence of $k$-ary discrete trees constructed recursively by choosing at each step an edge uniformly among the present edges and grafting on "its middle" $k-1$ new edges. When $k=2$, this…

We consider the following problem: given an unsorted array of $n$ elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the intervals. We describe a simple algorithm which uses O(n) space…

Denote by p_k the k-th power sum symmetric polynomial n variables. The interpretation of the q-analogue of the binomial coefficient as Hilbert function leads us to discover that n consecutive power sums in n variables form a regular…

Lomonaco and Kauffman introduced a knot mosaic system to give a precise and workable definition of a quantum knot system, the states of which are called quantum knots. This paper is inspired by an open question about the knot mosaic…

Let $S_m f$ denote the $m$-th partial sum of the Walsh-Fourier series of $f \in L^1$. For an increasing sequence $a=(a(n))_{n \geq 1}$ of positive integers, consider the arithmetic means $$ \sigma_N f:=\frac{1}{N} \sum_{n=1}^N S_{a(n)} f .…

We study the space requirements of a sorting algorithm where only items that at the end will be adjacent are kept together. This is equivalent to the following combinatorial problem: Consider a string of fixed length n that starts as a…