Related papers: Zaremba's Conjecture for Geometric Sequences: An A…

We prove that the finitistic dimension conjecture, the Gorenstein Symmetry Conjecture, the Wakamatsu-tilting conjecture and the generalized Nakayama conjecture hold for artin algebras which can be realized as endomorphism algebras of…

We obtain a hypergraph generalisation of the graph blow-up lemma proved by Komlos, Sarkozy and Szemeredi, showing that hypergraphs with sufficient regularity and no atypical vertices behave as if they were complete for the purpose of…

Zagier-Hoffman's conjectures predict the dimension and a basis for the $\mathbb Q$-vector spaces spanned by $N$th cyclotomic multiple zeta values (MZV's) of fixed weight where $N$ is a natural number. For $N=1$ (MZV's case), half of these…

We prove the convergence and ergodicity of a wide class of real and higher-dimensional continued fraction algorithms, including folded and $\alpha$-type variants of complex, quaternionic, octonionic, and Heisenberg continued fractions,…

Let $A$ be a sufficiently dense subset of a finite field $\mathbb F_q$ or a finite, cyclic ring $\mathbb Z/ N\mathbb Z$. Assuming that $q$ and $N$ have no small prime divisors, we show that generalised Fermat equations have the expected…

We define certain arithmetic derivatives on $\mathbb{Z}$ that respect the Leibniz rule, are additive for a chosen equation $a+b=c$, and satisfy a suitable non-degeneracy condition. Using Geometry of Numbers, we unconditionally show their…

We present a perturbation theory by extending a prescription due to Feynman for computing the probability density function for the random flight motion. The method can be applied to a wide variety of otherwise difficult circumstances. The…

The study of combinatorial properties of mathematical objects is a very important research field and continued fractions have been deeply studied in this sense. However, multidimensional continued fractions, which are a generalization…

The Szemer\'edi Regularity Lemma, in combination with the Blow-up Lemma, form the Regularity Method, a fundamental tool in graph embeddings, albeit restricted to very large and dense graphs. We propose an alternative vertex-partitioning…

Fox, Gromov, Lafforgue, Naor, and Pach proved a regularity lemma for semi-algebraic $k$-uniform hypergraphs of bounded complexity, showing that for each $\epsilon>0$ the vertex set can be equitably partitioned into a bounded number of parts…

We present in this work a heuristic expression for the density of prime numbers. Our expression leads to results which possesses approximately the same precision of the Riemann's function in the domain that goes from 2 to 1010 at least.…

We use the cluster method to enumerate permutations avoiding consecutive patterns. We reprove and generalize in a unified way several known results and obtain new ones, including some patterns of length 4 and 5, as well as some infinite…

Green and Tao famously proved in 2005 that any subset of the primes of fixed positive density contains arbitrarily long arithmetic progressions. Green had previously shown that in fact any subset of the primes of relative density tending to…

Let $\varepsilon>0$. We construct an explicit, full-measure set of $\alpha \in[0,1]$ such that if $\gamma \in \mathbb{R}$ then, for almost all $\beta \in[0,1]$, if $\delta \in \mathbb{R}$ then there are infinitely many integers $n\geq 1$…

For a long time, Collatz Conjecture has been assumed to be true, although a formal proof has eluded all efforts to date. In this article, evidence is presented that suggests such an assumption is incorrect. By analysing the stopping times…

We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…

We develop a cluster expansion for the probability of full connectivity of high density random networks in confined geometries. In contrast to percolation phenomena at lower densities, boundary effects, which have previously been largely…

In 2000, Enomoto and Ota conjectured that if a graph $G$ satisfies $\sigma_{2}(G) \geq n + k - 1$, then for any set of $k$ vertices $v_{1}, \dots, v_{k}$ and for any positive integers $n_{1}, \dots, n_{k}$ with $\sum n_{i} = |G|$, there…

We provide quantitative and abstract strong convergence results for sequences from a compact metric space satisfying a certain form of \emph{generalized Fej\'er monotonicity} where (1) the metric can be replaced by a much more general type…

Shortly after Szemer\'edi's proof that a set of positive upper density contains arbitrarily long arithmetic progressions, Furstenberg gave a new proof of this theorem using ergodic theory. This gave rise to the field of ergodic Ramsey…