Related papers: Avoid Schnorr randomness
For $m\geq 1$, let $0<b_0<b_1<...<b_m$ and $\ e_0,e_1,...,e_m>0$ be fixed positive integers. Assume there exists a prime $p$ and an integer $t>0$ such that $p^t\mid b_0$, but $p^t\nmid b_{i}\ {\rm for}\ 1\leq i\leq m$. Then, we prove that…
Suppose that $S \subseteq [n]^2$ contains no three points of the form $(x,y), (x,y+\delta), (x+\delta,y')$, where $\delta \neq 0$. How big can $S$ be? Trivially, $n \le |S| \le n^2$. Slight improvements on these bounds are obtained from…
Erd\H{o}s, S\'ark\"ozy, and S\'os studied the asymptotics of the maximum size of a subset of $\{1,2,\ldots, N\}$ such that it does not contain $k$ distinct elements whose product is a perfect square. More generally, Verstra\"ete proposed a…
Let $\omega=[a_1, a_2, \cdots]$ be the infinite expansion of continued fraction for an irrational number $\omega \in (0,1)$; let $R_n (\omega)$ (resp. $R_{n, \, k} (\omega)$, $R_{n, \, k+} (\omega)$) be the number of distinct partial…
We present two short proofs giving the best known asymptotic lower bound for the maximum element in a set of $n$ positive integers with distinct subset sums.
We extend the notion of proper elements to all Coxeter groups. For all infinite families of finite Coxeter groups we prove that the probability a random element is proper goes to zero in the limit. This proves a conjecture of the third…
We provide an infinite family of sofic one-relator groups that are not residually solvable nor residually finite. The proof is essentially different from the one in [1], as it does not require just Magnus' decompositions.
The goal of this note is to provide yet another proof of the following theorem of Golod: there exists an infinite finitely generated group $G$ such that every element of $G$ has finite order. Our proof is based on the Nielsen-Schreier index…
In this paper we extend some classical results valid for canonical multiplicative cascades to exact scaling log-infinitely divisible cascades. We complete previous results on non-degeneracy and moments of positive orders obtained by Barral…
The infinite pigeonhole principle for 2-partitions asserts the existence, for every set $A$, of an infinite subset of $A$ or of its complement. In this paper, we develop a new notion of forcing enabling a fine analysis of the…
The framework of algebraically natural proofs was independently introduced in the works of Forbes, Shpilka and Volk (2018), and Grochow, Kumar, Saks and Saraf (2017), to study the efficacy of commonly used techniques for proving lower…
We prove, in particular, the well--known Zaremba conjecture from the theory of continued fractions for any prime denominator. More precisely, we show, firstly, that under some mild conditions, for any sufficiently large $q$, there exists…
We construct an increasing $\omega$-sequence $(a_n)$ of Turing degrees which forms an initial segment of the Turing degrees, and such that each~$a_{n+1}$ is diagonally noncomputable relative to $a_n$. It follows that the~$\mathsf{DNR}$…
We present a no-go theorem for the distinguishability between quantum random numbers (i.e., random numbers generated quantum mechanically) and pseudo-random numbers (i.e., random numbers generated algorithmically). The theorem states that…
In this paper we treat the $\tau$-tilting finiteness of biserial (respectively special biserial) algebras over algebraically closed (respectively arbitrary) fields. Inside these families, to compare the notions of representation-finiteness…
Motivated by the recent experimental demonstrations of quantum supremacy, proving the hardness of the output of random quantum circuits is an imperative near term goal. We prove under the complexity theoretical assumption of the…
Answering a question asked by Hsia and Tucker in their paper on the finiteness of greatest common divisors of iterates of polynomials, we prove that if $f, g \in \mathbb{C}(X)$ are compositionally independent rational functions and $c \in…
Noether, Fleischmann and Fogarty proved that if the characteristic of the underlying field does not divide the order $|G|$ of a finite group $G$, then the polynomial invariants of $G$ are generated by polynomials of degrees at most $|G|$.…
Erd\H{o}s and Graham asked whether any sparse enough admissible set of natural numbers can be translated into a subset of the primes. By using a greedy construction involving powers of primitive roots, we prove that there exist arbitrarily…
We show that there is $n\in \mathbf N$, a finite system $\Sigma(\vec x,\vec y)$ of equations and inequations having a solution in some group, where $\vec x$ has length $n$, and $\epsilon>0$ such that: for any group $G$ and any $\vec a\in…