相关论文: On distinct consecutive differences

Suppose that P is an infinite set of primes such that P = A + B + C, where A,B,C are sets with at least two elements. We show that if P(x) > c x/log^d x (where P(x) = the number of elements of P that are <= x), and if A,B,C is a "regular"…

We establish new upper bounds for the length of runs of consecutive positive integers each with exactly $k$ divisors, where $k$ is a given positive integer of some special forms. Also we have found exact values of the maximum possible runs…

We show that for every sufficiently large $n$, the number of monotone subsequences of length four in a permutation on $n$ points is at least $\binom{\lfloor n/3 \rfloor}{4} + \binom{\lfloor(n+1)/3\rfloor}{4} + \binom{\lfloor…

We show that if a finite, large enough subset A of an arbitrary abelian group satisfies the small doubling condition |A + A| < (log |A|)^{1 - epsilon} |A|, then A must contain a three-term arithmetic progression whose terms are not all…

We derive lower and upper bounds on possible growth rates of certain sets of positive integers $A_k=\{1= a_1 < a_2 < ... < a_{k}\}$ such that all integers $n\in \{0, 1, 2, ..., ka_{k}\}$ can be represented as a sum of no more than $k$…

In this paper, we extend recent work of the third author and Ziegler on triples of integers $(a,b,c)$, with the property that each of $(a,b,c)$, $(a+1,b+1,c+1)$ and $(a+2,b+2,c+2)$ is multiplicatively dependent, completely classifying such…

A conjecture of Graham (repeated by Erd\H{o}s) asserts that for any set $A \subseteq \mathbb{F}_p \setminus \{0\}$, there is an ordering $a_1, \ldots, a_{|A|}$ of the elements of $A$ such that the partial sums $a_1, a_1+a_2, \ldots,…

Let $T$ be an $n\times n$ random matrix, such that each diagonal entry $T_{i,i}$ is a continuous random variable, independent from all the other entries of $T$. Then for every $n\times n$ matrix $A$ and every $t\ge0$ $$…

In this paper we show some remarkable consequences of the method which proves that every bisymmetric, symmetric, reflexive, strictly monotonic binary map on a proper interval is continuous, in particular it is a quasi-arithmetic mean. Now…

We prove that for any finite set A of real numbers its difference set D:=A-A has large product set and quotient set, namely, |DD|, |D/D| \gg |D|^{1+c}, where c>0 is an absolute constant. A similar result takes place in the prime field F_p…

Main result: If a C*-algebra is simple, $\sigma$-unital, has finitely many extremal traces, and has strict comparison of positive elements by traces, then its multiplier also has strict comparison of positive elements by traces. The same…

Let $A$ be a finite nonempty set of integers. An asymptotic estimate of several dilates sum size was obtained by Bukh. The unique known exact bound concerns the sum $|A+k\cdot A|,$ where $k$ is a prime and $|A|$ is large. In its full…

A finite set of integers $A$ is a sum-dominant (also called an More Sums Than Differences or MSTD) set if $|A+A| > |A-A|$. While almost all subsets of $\{0, \dots, n\}$ are not sum-dominant, interestingly a small positive percentage are. We…

Let A be a finite set of integers. We prove that if |A| is at least 2 and |A+A| is 3|A|-3, then one of the following is true: 1. A is a bi-arithmetic progression; 2. A+A contains an arithmetic progression of length 2|A|-1; 3. |A| is 6 and A…

Let $A$ be a finite multiset of integers. If $B$ be a multiset such that $A$ and $B$ are $t$-complementing multisets of integers, then $B$ is periodic. We obtain the Biro-type upper bound for the smallest such period of $B$: Let…

In this paper, we study $k$-term arithmetic progressions $N, N+d, ..., N+(k-1)d$ of powerful numbers. Under the $abc$-conjecture, we obtain $d \gg_\epsilon N^{1/2 - \epsilon}$. On the other hand, there exist infinitely many $3$-term…

We show that every set $A$ of natural numbers with positive upper density can be shifted to contain the restricted sumset $\{b_1 + b_2 : b_1, b_2\in B \text{ and } b_1 \neq b_2 \}$ for some infinite set $B \subset A$.

The motivation for this paper is to study the complexity of constant-width arithmetic circuits. Our main results are the following. 1. For every k > 1, we provide an explicit polynomial that can be computed by a linear-sized monotone…

We show that a finite zero-sum-free sequence $\alpha$ over an abelian group has at least $c|\alpha|^{4/3}$ distinct subsequence sums, unless $\alpha$ is "controlled" by a small number of its terms; here $|\alpha|$ denotes the number of…

We study the multiplicative convolution for c-monotone independence. This convolution unifies the monotone, Boolean and orthogonal multiplicative convolutions. We characterize convolution semigroups for the c-monotone multiplicative…