Related papers: Improved Bounds for the Index Conjecture in Zero-S…

Let $n$ be a positive even integer, and let $a_1,...,a_n$ and $w_1, ..., w_n$ be integers satisfying $\sum_{k=1}^n a_k\equiv\sum_{k=1}^n w_k =0 (mod n)$. A conjecture of Bialostocki states that there is a permutation $\sigma$ on {1,...,n}…

A zero-sum sequence over ${\mathbb Z}$ is a sequence with terms in ${\mathbb Z}$ that sum to $0$. It is called minimal if it does not contain a proper zero-sum subsequence. Consider a minimal zero-sum sequence over ${\mathbb Z}$ with…

Let $\{q_n\}_{n=0}^\infty\subset [0,1]$ satisfy $q_0=0$, $\sum_{n=0}^\infty q_n=1$, and $\gcd\{n\geq 1\mid q_n\neq 0\}=1$. We consider the following process: Let $x$ be a real number. We first set $x=0$. Then $x$ is increased by $i$ with…

A famous conjecture of Erd\H os and Straus is that for every integer $n\ge2$, $4/n$ can be represented as $1/x+1/y+1/z$, where $x,y,z$ are positive integers. This conjecture was generalized to $5/n$ by Sierpi\'nski, and then Schinzel…

More than twenty-five years ago, Manickam, Miklos, and Singhi conjectured that for positive integers $n,k$ with $n \geq 4k$, every set of $n$ real numbers with nonnegative sum has at least $\binom{n-1}{k-1}$ $k$-element subsets whose sum is…

Recently, Gilmer proved the first constant lower bound for the union-closed sets conjecture via an information-theoretic argument. The heart of the argument is an entropic inequality involving the OR function of two i.i.d.\ binary vectors,…

Let $r$ and $k$ be positive integers with $r \mid k$. Denote by $S_{\mathrm{\mathfrak{z}}}(k;r)$ the minimum integer $n$ such that every coloring $\chi:[1,n] \rightarrow \{0,1,\dots,r-1\}$ admits a solution to $\sum_{i=1}^{k-1} x_i = x_k$…

An algorithmic upper bound on the domination number $\gamma$ of graphs in terms of the order $n$ and the minimum degree $\delta$ is proved. It is demonstrated that the bound improves best previous bounds for any $5\le \delta \le 50$. In…

Let $G$ be a finite abelian group. Let $g(G)$ be the smallest positive integer $t$ such that every subset of cardinality $t$ of the group $G$ contains a subset of cardinality $\mathrm{exp}(G)$ whose sum is zero. In this paper, we show that…

We study the problem of finding zero-sum blocks in bounded-sum sequences, which was introduced by Caro, Hansberg, and Montejano. Caro et al. determine the minimum $\{-1,1\}$-sequence length for when there exist $k$ consecutive terms that…

Due to the distribution of primes among integers, we establish an upper bound for the probability $\mathbb{P}_n$ that the Goldbach conjecture fails. Assuming the conjecture holds true for all even number less than $2N$, we prove this…

For positive integers $n$, $m$, and $h$, we let $\rho \hat{\;}(\mathbb{Z}_n, m, h)$ denote the minimum size of the $h$-fold restricted sumset among all $m$-subsets of the cyclic group of order $n$. The value of $\rho \hat{\;}(\mathbb{Z}_n,…

The $3k-4$ Theorem asserts that, if $A,\,B\subseteq \mathbb Z$ are finite, nonempty subsets with $|A|\geq |B|$ and $|A+B|=|A|+|B|+r< |A|+2|B|-3$, then there are arithmetic progressions $P_A$ and $P_B$ of common difference with $X\subseteq…

Gerard and Washington proved that, for $k > -1$, the number of primes less than $x^{k+1}$ can be well approximated by summing the $k$-th powers of all primes up to $x$. We extend this result to primes in arithmetic progressions: we prove…

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

For a fixed exponent $0 < \theta \leq 1$, it is expected that we have the prime number theorem in short intervals $\sum_{x \leq n < x+x^\theta} \Lambda(n) \sim x^\theta$ as $x \to \infty$. From the recent zero density estimates of Guth and…

We formulate some refinements of Goldbach's conjectures based on heuristic arguments and numerical data. For instance, any even number greater than 4 is conjectured to be a sum of two primes with one prime being 3 mod 4. In general, for…

In this paper we prove the supercongruence $$\sum_{n=0}^{(p-1)/2}\frac{6n+1}{256^n}\binom{2n}n^3\equiv p(-1)^{(p-1)/2}+(-1)^{(p-1)/2}\frac{7}{24}p^4B_{p-3}\pmod{p^5}$$ for any prime $p>3$, which was conjectured by Sun in 2019.

The ABC conjecture of Masser and Oesterle' states that if (a,b,c) are coprime integers with a + b + c = 0, then sup(|a|,|b|,|c|) < c_e (rad(abc))^{1+e} for any e > 0. Oesterle' has observed that if the ABC conjecture holds for all (a,b,c)…

The minimum k-assignment of an m by n matrix X is the minimum sum of k entries of X, no two of which belong to the same row or column. If X is generated by choosing each entry independently from the exponential distribution with mean 1,…