Related papers: A note on infinite antichain density

We show that in the setting of fair-coin measure on the power set of the natural numbers, each sufficiently random set has an infinite subset that computes no random set. That is, there is an almost sure event $\mathcal A$ such that if…

In this paper, we prove that the period of the continued fraction expansion of ${\sqrt {2^{n}+1}}$ tends to infinity when $n$ tends to infinity through odd positive integers.

A nonempty finite set of positive integers A is relatively prime if gcd(A) = 1 and it is relatively prime to n if gcd(A [ fng) = 1. The number of nonempty subsets of A which are relatively prime to n is \Phi(A, n) and the number of such…

We provide two ways to show that the R. Thompson group $F$ has maximal subgroups of infinite index which do not fix any number in the unit interval under the natural action of $F$ on $(0,1)$, thus solving a problem by D. Savchuk. The first…

In this article we describe all possible infinite linear configurations that can be found in a shift of any set of positive upper Banach density. This simultaneously generalizes Szemer\'edi's theorem on arithmetic progressions and the…

Let $p$ be a prime number, $q=p^s$ for a positive integer $s$. For any positive divisor $e$ of $q-1$, we construct an infinite family codes of size $q^{2m}$ with few Lee-weight. These codes are defined as trace codes over the ring…

Given an Abelian groups $G$, denote $\mu(G)$ the size of its largest sum-free subset and $f_{\max}(G)$ the number of maximal sum-free sets in $G$. Confirming a prediction by Liu and Sharifzadeh, we prove that all even-order $G\ne…

We consider the Cauchy problem for doubly non-linear degenerate parabolic equations on Riemannian manifolds of infinite volume, or in $\R^N$. The equation contains a weight function as a capacitary coefficient which we assume to decay at…

We prove that for an arbitrary subtree $T$ of $2^{<\omega}$ with each element extendable to a path, a given countable class $\mathcal{M}$ closed under disjoint union, and any set $A$, if none of the members of $\mathcal{M}$ strongly…

In this paper we use the Recursion Theorem to show the existence of various infinite sequences and sets. Our main result is that there is an increasing sequence e_0, e_1, e_2 .. such that W_{e_n}={e_{n+1}} for every n. Similarly, we prove…

We solve the infinitesimal Torelli problem for $3$-dimensional quasi-smooth ${\mathbb{Q}}$-Fano hypersurfaces with at worst terminal singularities. We also find infinite chains of double coverings of increasing dimension which alternatively…

Choose a polynomial $f$ uniformly at random from the set of all monic polynomials of degree $n$ with integer coefficients in the box $[-L,L]^n$. The main result of the paper asserts that if $L=L(n)$ grows to infinity, then the Galois group…

A beautiful theorem of Zeckendorf states that every positive integer can be uniquely decomposed as a sum of non-consecutive Fibonacci numbers $\{F_n\}$, where $F_1 = 1$, $F_2 = 2$ and $F_{n+1} = F_n + F_{n-1}$. For general recurrences…

Let $A$ be a subset of a finite field $\mathbb{F}$. When $\mathbb{F}$ has prime order, we show that there is an absolute constant $c > 0$ such that, if $A$ is both sum-free and equal to the set of its multiplicative inverses, then $|A| <…

Given a finite poset $\mathcal P$, how small can a family $\mathcal F$ of subsets of $[n]$ be such that $\mathcal F$ does not contain an induced copy of $\mathcal P$, but $\mathcal F\cup\{X\}$ contains such a copy for all $X\in\mathcal…

We prove that all elements of infinite order in $Out(F_n)$ have positive translation lengths; moreover, they are bounded away from zero. Consequences include a new proof that solvable subgroups of $Out(F_n)$ are finitely generated and…

We constructively prove that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain.

Let $\mathcal{A}$ be the set of all integers of the form $\gcd(n, F_n)$, where $n$ is a positive integer and $F_n$ denotes the $n$th Fibonacci number. We prove that $\#\left(\mathcal{A} \cap [1, x]\right) \gg x / \log x$ for all $x \geq 2$,…

We prove that for any additive noise channel over $\mathbb{F}_q$, there exist error-correcting codes approaching channel capacity encodable by arithmetic circuits (with weighted addition gates) over $\mathbb{F}_q$ of size $O(n)$ and depth…

This paper is concerned with finite sequences of integers that may be written as sums of squares of two nonzero integers. We first find infinitely many integers $n$ such that $n, n+h$ and $n+k$ are all sums of two squares where $h$ and $k$…