Related papers: On long arithmetic progressions in binary Morse-li…
The classical arithmetic Grothendieck-Riemann-Roch theorem can be applied only to projective morphisms that are smooth over the complex numbers. In this paper we generalize the arithmetic Grothendieck-Riemann-Roch theorem to the case of…
We improve the quantitative estimate for Roth's theorem on three-term arithmetic progressions, showing that if $A\subset\{1,\ldots,N\}$ contains no non-trivial three-term arithmetic progressions then $\lvert A\rvert\ll N(\log\log N)^4/\log…
We prove a structure theorem for Lie n-algebras possessing an invariant inner product. We define the notion of a double extension of a metric Lie n-algebra by another Lie n-algebra and prove that all metric Lie n-algebras are obtained from…
We show that for every finite colouring of the natural numbers there exists $a,b >1$ such that the triple $\{a,b,a^b\}$ is monochromatic. We go on to show the partition regularity of a much richer class of patterns involving exponentiation.…
We study density and partition properties of polynomial equations in prime variables. We consider equations of the form $a_1h(x_1) + \cdots + a_sh(x_s)=b$, where the $a_i$ and $b$ are fixed coefficients, and $h$ is an arbitrary integer…
We motivate and study an infinite sequence of binary operations on the ordinal numbers, extending the standard arithmetic on the ordinals to higher degrees of iteration. Connections to the hyperoperations on the natural numbers are…
We prove a full measurable version of Vizing's theorem for bounded degree Borel graphs, that is, we show that every Borel graph $\mathcal{G}$ of degree uniformly bounded by $\Delta\in \mathbb{N}$ defined on a standard probability space…
We generalized several results for the arithmetic dynamics of monomial maps, including Silverman's conjectures on height growth, dynamical Mordell-Lang conjecture, and dynamical Manin-Mumford conjecture. These results are originally known…
We present a proof of Roth's theorem that follows a slightly different structure to the usual proofs, in that there is not much iteration. Although our proof works using a type of density increment argument (which is typical of most proofs…
We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…
We consider Mertens' function M(x,q,a) in arithmetic progression, Assuming the generalized Riemann hypothesis (GRH), we show an upper bound that is uniform for all moduli which are not too large. For the proof, a former method of K.…
We characterize those strings whose suffix arrays are based on arithmetic progressions, in particular, arithmetically progressed permutations where all pairs of successive entries of the permutation have the same difference modulo the…
This is the second of two coupled papers estimating the mean values of multiplicative functions, of unknown support, on arithmetic progressions with large differences. Applications are made to the study of primes in arithmetic progression…
The Dense Hindman's Theorem states that, in any finite coloring of the integers, one may find a single color and a "dense" set $B_1$, for each $b_1\in B_1$ a "dense" set $B_2^{b_1}$ (depending on $b_1$), for each $b_2\in B_2^{b_1}$ a…
We prove an infinite analogue of the main theorem of discrete Morse theory formulated in terms of discrete Morse matchings. Our theorem holds under the assumption that the given Morse matching induces finitely many equivalence classes of…
Bilinear maps and their classifying tensor products are well-known in the theory of linear algebra, and their generalization to algebras of commutative monads is a classical result of monad theory. Motivated by constructions needed in…
We prove and generalize some recent conjectures of Z.-W. Sun on infinite series whose summands involve products of harmonic numbers and several binomial coefficients. We evaluate various classes of infinite sums in closed form by…
We prove that for any $r\in \mathbb{N}$, there exists a constant $C_r$ such that the following is true. Let $\mathcal{F}=\{F_1,F_2,\dots\}$ be an infinite sequence of bipartite graphs such that $|V(F_i)|=i$ and $\Delta(F_i)\leq \Delta$ hold…
We prove a general large sieve statement in the context of random walks on subgraphs of a given graph. This can be seen as a generalization of previously known results where one performs a random walk on a group enjoying a strong spectral…
The celebrated Green-Tao theorem states that there are arbitrarily long arithmetic progressions in the primes. One of the main ingredients in their proof is a relative Szemer\'edi theorem which says that any subset of a pseudorandom set of…