Related papers: "Strange" occurrences in SuperEnalotto
We report a rigorous theory to show the origin of the unexpected periodic behavior seen in the consecutive differences between prime numbers. We also check numerically our findings to ensure that they hold for finite sequences of primes,…
Consider a fair lottery over the natural numbers in which the selected number is removed. This lottery is iterated countably infinite times, with a known ratio of iterations to natural numbers. Removed numbers are not replaced. The natural…
We investigate the probability for the largest segment in with total displacement $Q$ in an $N$-step random walk to have length $L$. Using analytical, exact enumeration, and Monte Carlo methods, we reveal the complex structure of the…
In this paper, we study the distribution of consecutive patterns in the set of 123-avoiding permutations and the set of 132-avoiding permutations, that is, in $\mathcal{S}_n(123)$ and $\mathcal{S}_n(132)$. We first study the distribution of…
The chronicle of prime numbers travel back thousands of years in human history. Not only the traits of prime numbers have surprised people, but also all those endeavors made for ages to find a pattern in the appearance of prime numbers has…
The focus of this paper is the random sequences in the form $\{X_{0},X_{1},$ $X_{n}=X_{n-2}+X_{n-1},n=2,3,..\dot{\}},$ referred to as Fibonacci Random Sequence (FRS). The initial random variables $X_{0}$ and $X_{1}$ are assumed to be…
We introduce the following natural generalization of trace reconstruction, parameterized by a deletion probability $\delta \in (0,1)$ and length $n$: There is a length $n$ string of probabilities, $S=p_1,\ldots,p_n,$ and each "trace" is…
This paper describes a class of sequences that are in many ways similar to Fibonacci sequences: given n, sum the previous two terms and divide them by the largest possible power of n. The behavior of such sequences depends on n. We analyze…
The problem of determining the correct order of fluctuation of the optimal alignment score of two random strings of length $n$ has been open for several decades. It is known that the biased expected effect of a random letter-change on the…
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…
We study the entropy $S$ of longest increasing subsequences (LIS), i.e., the logarithm of the number of distinct LIS. We consider two ensembles of sequences, namely random permutations of integers and sequences drawn i.i.d.\ from a limited…
Let $n\in\mathbb{Z}^+$. Is it true that every sequence of $n$ consecutive integers greater than $n^2$ and smaller than $(n+1)^2$ contains at least one prime number? In this paper we show that this is actually the case for every $n \leq…
We establish supercongruences for two kinds of Ap\'ery-like numbers, which involve Bernoulli numbers and Bernoulli polynomials. Conjectural supercongruences of the same type for another four kinds of Ap\'ery-like numbers are also proposed.
The law of large numbers is one of the most fundamental results in Probability Theory. In the case of independent sequences, there are some known characterizations; for instance, in the independent and identically distributed setting it is…
Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. Using an analysis of the probability that two overlapping consecutive $k$-permutations are order isomorphic, the authors of a recent paper showed that the expected number of…
This note examines a problem in enumerative and asymptotic combinatorics involving the classical structure of integer compositions. What is sought is an analysis on average and in distribution of the length of the longest run of consecutive…
Counting the types of squares rather than their occurrences, we consider the problem of bounding the number of distinct squares in a string. Fraenkel and Simpson showed in 1998 that a string of length n contains at most 2n distinct squares.…
We calculate the large deviations for the length of the longest alternating subsequence and for the length of the longest increasing subsequence in a uniformly random permutation that avoids a pattern of length three. We treat all six…
Congruences modulo prime powers involving generalized Harmonic numbers are known. While looking for similar congruences, we have encountered a curious triangular array of numbers indexed with positive integers $n,k$, involving the Bernoulli…
A chain is an ordering of the integers 1 to n such that adjacent pairs have sums of a particular form, such as squares, cubes, triangular numbers, pentagonal numbers, or Fibonacci numbers. For example 4 1 2 3 5 form a Fibonacci chain while…