Related papers: Around Pelikan's conjecture on very odd sequences
Holroyd, Liggett, and Romik introduced the following probability model. Let $C_1, C_2,...$ be independent events with probabilities $\P_s(C_n)= 1-e^{-ns}$ under a probability measure $\P_s$ with $0<s<1$. Let $A_k$ be the event that there is…
`Terquem's problem' is a name given in the twentieth century to the problem of enumerating certain integer sequences whose entries alternate in parity. In particular, this problem asks for the count of strictly increasing length $m$…
The Legendre conjecture has resisted analysis over a century, even under assumption of the Riemann Hypothesis. We present, a significant improvement on previous results by greatly reducing the assumption to a more modest statement called…
In 1974, Erd\H{o}s and Kleitman conjectured that if a family $\mathcal{F}\subseteq 2^{[n]}$ contains no matching of size \(s\) and is maximal with respect to this property, then $ |\mathcal{F}|\ge \left(1-2^{-(s-1)}\right)\cdot 2^{n}. $ For…
Semi-regular sequences over $\mathbb{F}_2$ are sequences of homogeneous elements of the algebra $ B^{(n)}=\mathbb{F}_2[X_1,...,X_n]/(X_1^2,...,X_n^2) $, which have as few relations between them as possible. They were introduced in order to…
The paper introduces the notions of an elliptic pair, an elliptic cycle and an elliptic list over a square free positive integer d. These concepts are related to the notions of amicable pairs of primes and aliquot cycles that were…
The Caccetta-Haggkvist conjecture made in 1978 asserts that every orgraph on n vertices without oriented cycles of length <= l must contain a vertex of outdegree at most (n-1)/l. It has a rather elaborate set of (conjectured) extremal…
We prove that any quasirandom graph with $n$ vertices and $rn$ edges can be decomposed into $n$ copies of any fixed tree with $r$ edges. The case of decomposing a complete graph establishes a conjecture of Ringel from 1963.
Whereas exceptional sequences have a long history with many well-known connections to combinatorics, signed exceptional sequences are relatively recent. The authors introduced this concept in 2017 [19], although it was retroactively…
Let $G$ be a 2-connected graph, $l$ be the length of a longest path in $G$ and $c$ be the circumference - the length of a longest cycle in $G$. In 1952, Dirac proved that $c>\sqrt{2l}$ and conjectured that $c\ge 2\sqrt{l}$. In this paper we…
In a convex n-gon, let d[1] > d[2] > ... denote the set of all distances between pairs of vertices, and let m[i] be the number of pairs of vertices at distance d[i] from one another. Erdos, Lovasz, and Vesztergombi conjectured that m[1] +…
Stanley and Odlyzko proposed a method for greedily constructing sets with no 3-term arithmetic progressions. It is conjectured that there is a dichotomy between such sequences: those that have a periodic structure as the sequence satisfies…
The deletion distance between two binary words $u,v \in \{0,1\}^n$ is the smallest $k$ such that $u$ and $v$ share a common subsequence of length $n-k$. A set $C$ of binary words of length $n$ is called a $k$-deletion code if every pair of…
The enumeration of inversion sequences avoiding a single pattern was initiated by Corteel--Martinez--Savage--Weselcouch and Mansour--Shattuck independently. Their work has sparked various investigations of generalized patterns in inversion…
In this paper we study the distribution of very short sequences of inversive congruential pseudorandom numbers modulo $2^t$. We derive a new bound on exponential sums with such sequences and use it to give estimate their discrepancy. The…
In a previous article, we reduced the unsolved problem of the convergence of Collatz sequences, to convergence of Collatz sequences of odd numbers, that are divisible by 3. In this article, we further reduce this set to odd numbers that are…
We look at the number $L(n)$ of $O$-sequences of length $n$. Recall that an $O$-sequence can be defined algebraically as the Hilbert function of a standard graded $k$-algebra, or combinatorially as the $f$-vector of a multicomplex. The…
In 1975, P. Erd\"{o}s proposed the problem of determining the maximum number $f(n)$ of edges in a graph of $n$ vertices in which any two cycles are of different lengths. In this paper, it is proved that $$f(n)\geq n+32t-1$$ for…
Finding the underlying probability distributions of a set of observed sequences under the constraint that each sequence is generated i.i.d by a distinct distribution is considered. The number of distributions, and hence the number of…
We revisit the pseudo-random sequence introduced by Ehrenfeucht and Mycielski and its connections with DeBruijn strings.