Related papers: Upper Bounds for Stern's Diatomic Sequence and Rel…
We write $S_{\leq n}(A)$ and $\Part_{\fin}(A)$ for the set of permutations with at most $n$ non-fixed points, where $n$ is a natural number, and the set of partitions whose members are finite, respectively, of a set $A$. Among our results,…
We study statistics of records in a sequence of random variables. These identical and independently distributed variables are drawn from the parent distribution rho. The running record equals the maximum of all elements in the sequence up…
For a fixed integer base $b\geq2$, we consider the number of compositions of $1$ into a given number of powers of $b$ and, related, the maximum number of representations a positive integer can have as an ordered sum of powers of $b$. We…
In 2001 Heinrich, Novak, Wasilkowski and Wo\'zniakowski proved that the inverse of the star discrepancy satisfies $n(d,\varepsilon)\leq c_{\abs}d \varepsilon^{-2}$ by showing that there exists a set of points in $[0,1)^d$ whose…
Let $1<g_1<\ldots<g_{\varphi(p-1)}<p-1$ be the ordered primitive roots modulo~$p$. We study the pseudorandomness of the binary sequence $(s_n)$ defined by $s_n\equiv g_{n+1}+g_{n+2}\bmod 2$, $n=0,1,\ldots$. In particular, we study the…
Given a sequence $s=(s_1,s_2,\ldots)$ of positive integers, the inversion sequences with respect to $s$, or $s$-inversion sequences, were introduced by Savage and Schuster in their study of lecture hall polytopes. A sequence…
For any sequence $u$, the extremal function $Ex(u, j, n)$ is the maximum possible length of a $j$-sparse sequence with $n$ distinct letters that avoids $u$. We prove that if $u$ is an alternating sequence $a b a b \dots$ of length $s$, then…
Let $G$ be a permutation group of degree $n$ and let $s(G)$ denote the number of set-orbits of $G$. We determine $\inf(\frac {\log_2 s(G)} n)$ over all groups $G$ that satisfy certain restrictions on composition factors (i.e. $Alt(k), k >…
We study the complexity of S-adic sequences corresponding to a family of 216 multi-dimensional continued fractions maps, called Triangle Partition maps (TRIP maps), with an emphasis on those with low upper bounds on complexity. Our main…
Observations have indicated that we do not see neutron stars (NS) of mass near the theoretical upper limit as predicted. Here we invoke the role of dark matter (DM) particles in star formation, and their role in lowering the mass of…
Given a distribution of pebbles on the vertices of a graph, say that we can pebble a vertex if a pebble is left on it after some sequence of moves, each of which takes two pebbles from some vertex and places one on an adjacent vertex. A…
Let K_n denote the smaller mode of the nth row of Stirling numbers of the second kind S(n, k). Using a probablistic argument, it is shown that for all n>=2, [exp(w(n))]-2<=K_n<=[exp(w(n))]+1, where [x] denotes the integer part of x, and…
Motivated by the recent discovery of a compact object with mass in the range $2.5{-}2.67\, \mathrm{M}_\odot$ in the binary merger GW190814, we revisit the question of the maximum mass of neutron stars (NSs). We use a Markov Chain Monte…
When $g\in\mathbb{N}$ we say that $A\subset\mathbb{N}$ is a $B_{2}[g]$ sequence if every $m\in\mathbb{N}$ has at most $g$ distinct representations of the shape $m=b_{1}+b_{2}$ with $b_{1}\leq b_{2}$ and $b_{1},b_{2}\in A$. We show for every…
Continued fractions are linked to Stern's diatomic sequence 0,1,1,2,1,3,2,3,1,4,... (given by the recursion relation a_2n=a_n and a_{2n+1} = a_n + a_{n+1}, where a_0=0 and a_1=1), which has long been known. Using a particular…
Let A be a nonempty finite set of relatively prime positive integers, and let p_A(n) denote the number of partitions of n with parts in A. An elementary arithmetic argument is used to obtain an asymptotic formula for p_A(n).
This is an expository note answering a question posed to us by Richard Stanley, in which we prove a limit shape theorem for partitions of $n$ which maximize the number of subpartitions. The limit shape and the growth rate of the number of…
The aim of this note is to provoke discussion concerning arithmetic properties of function $p_{d}(n)$ counting partitions of an positive integer $n$ into $d$-th powers, where $d\geq 2$. Besides results concerning the asymptotic behavior of…
In parametric sequence alignment, optimal alignments of two sequences are computed as a function of the penalties for mismatches and spaces, producing many different optimal alignments. Here we give a 3/(2^{7/3}\pi^{2/3})n^{2/3} +O(n^{1/3}…
In a delightful article, Richard Stanley derived, algebraically, the surprisingly simple formula, 3 times 7 to the power n-1, for the sum of the cubes of the n-th row of Stern's diatomic array. In this note, we find an elegant bijective…