Related papers: 3AP-free permutations have no exponential growth r…

Given $A$ a set of $N$ positive integers, an old question in additive combinatorics asks that whether $A$ contains a sum-free subset of size at least $N/3+\omega(N)$ for some increasing unbounded function $\omega$. The question is generally…

We answer the question of Frantzikinakis and Host about the convergence of ergodic $(n^2,n^3)$-averages and consider a more general case. Let sequences ${ p(n)},{ q(n)}$ satisfy the property $ p(n+1)- p(n), \ q(n+1)- q(n)\ \to\ +\infty.$…

We study $P(n,3)$, the size of the largest subset of the set of all permutations $S_n$ with minimum Kendall $\tau$-distance $3$. Using a combination of group theory and integer programming, we reduced the upper bound of $P(p,3)$ from…

Let $p \ge 5$ be a prime and let $\mathbb{Q}_{n,p}$ denote the $n$-th layer of the cyclotomic $\mathbb{Z}_p$-extension of $\mathbb{Q}$. We show that $\mathbb{Q}_{n,p}$ has no exceptional units. We use this to prove the effective asymptotic…

For any $\varepsilon >0$, we obtain an asymptotic formula for the number of solutions $n \le x$ to $$ \lVert \alpha n + \beta \rVert < x^{-\frac{1}{4}+\varepsilon} $$ where $n$ is $[y,z]$-smooth for infinitely many real number $x$. In…

Let $0<\beta<\bar\beta<1/3$. We construct infinitely many distributional solutions in $C^{\beta}_{x,t}$ to the three-dimensional Euler equations that do not conserve the energy, for a given initial data in $C^{\bar\beta}$. We also show that…

In a research seminar in $2006$, M. Filaseta, O. Trifonov, and G. Yu showed for each integer $n\geq3$ there is no distinct covering with all moduli in the interval $[n, 6n]$. In $2022$, this interval was subsequently improved to $[n, 8n]$…

We reconsider the complete solution of the linear TBA equation describing the energy density of finite density states in the $O(N)$ nonlinear sigma models by the Wiener-Hopf method. We keep all perturbative and non-perturbative…

Let $up(r, t) = (a_1 a_2 \dots a_r)^t$. We investigate the problem of determining the maximum possible integer $n(r, t)$ for which there exist $2t-1$ permutations $\pi_1, \pi_2, \dots, \pi_{2t-1}$ of $1, 2, \dots, n(r, t)$ such that the…

It is shown that there exist a probability space $(X,{\mathcal X},\mu)$, two ergodic measure preserving transformations $T,S$ acting on $(X,{\mathcal X},\mu)$ with $h_\mu(X,T)=h_\mu(X,S)=0$, and $f, g \in L^\infty(X,\mu)$ such that the…

We prove that there are 0/1 polytopes P that do not admit a compact LP formulation. More precisely we show that for every n there is a sets X \subseteq {0,1}^n such that conv(X) must have extension complexity at least 2^{n/2 * (1-o(1))}. In…

We show that almost all permutations have some power that is a cycle of prime length. The proof includes a theorem giving a strong upper bound on the proportion of elements of the symmetric group having no cycles with length in a given set.

We prove the infinitude of shifted primes $p-1$ without prime factors above $p^{0.2844}$. This refines $p^{0.2961}$ from Baker and Harman in 1998. Consequently, we obtain an improved lower bound on the the distribution of Carmichael…

Let $B$ be a set of natural numbers of size $n$. We prove that the length of the longest arithmetic progression contained in the product set $B.B = \{bb'| \, b, b' \in B\}$ cannot be greater than $O(\frac{n\log^2 n}{\log \log n})$ and…

A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[\alpha n]+1$, where $1<\alpha<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical…

Let $\{A_{i,n}\}$ be a triangular array of elements in a Banach algebra, whose norms do not grow too fast, and whose row averages converge to $A$. Let $\sigma \in S(n)$ be a permutation drawn uniformly at random. If the array only contains…

In this short note we present a simple combinatorial trick which can be effectively applied to show the non--existence of sharply transitive sets of permutations in certain finite permutation groups.

We solve an asymptotic problem in the geometry of numbers, where we count the number of singular $n\times n$ matrices where row vectors are primitive and of length at most T. Without the constraint of primitivity, the problem was solved by…

We show that for any $\Delta \geq 3$, there is no bound computable from $(\varepsilon, r)$ on the size of a graph required to approximate a graph of maximum degree at most $\Delta$ up to $\varepsilon$ error in $r$-neighborhood statistics.…

Using recent results on the concentration of the largest eigenvalue and maximal vertex degree of large random graphs, we show that the infinite sequence of Erd\H os-R\'enyi random graphs $G(n,\rho_n/n)$ such that $\rho_n/\log n$ infinitely…