Related papers: Zaremba's Conjecture for Geometric Sequences: An A…
We prove a variant of the multidimensional polynomial Szemer\'edi theorem of Bergelson and Leibman where one replaces polynomial sequences with other sparse sequences defined by functions that belong to some Hardy field and satisfy certain…
We prove results concerning the representation of a given distribution by means of a given random quantity. The existence of a solution to this problem is related to the notion of conglomerability, originally introduced by Dubins to study…
This paper studies the proof of Collatz conjecture for some set of sequence of odd numbers with infinite number of elements. These set generalized to the set which contains all positive odd integers. This extension assumed to be the proof…
We prove an effective version of the Oppenheim conjecture with a polynomial error rate. The proof is based on an effective equidistribution theorem which in turn relies on recent progress towards restricted projection problem.
We present a fast algorithm for global rigid symmetry detection with approximation guarantees. The algorithm is guaranteed to find the best approximate symmetry of a given shape, to within a user-specified threshold, with very high…
We study here a sequence of secondary measures, so called because the set of secondary polynomials on a given term become orthogonal for the next measure. The main result is a formula making explicit the density of any term of the sequence,…
Several continued fraction expansions for $e$ have been produced by an automated conjecture generator (ACG) called \emph{The Ramanujan Machine}. Some of these were already known, some have recently been proved and some remain unproven.…
We prove Sarnak's density conjecture for the principal congruence subgroup of SL_n(Z) of squarefree level and discuss various arithmetic applications. The ingredients include new bounds for local Whittaker functions and Kloosterman sums.
We consider the space of complete and separable metric spaces which are equipped with a probability measure. A notion of convergence is given based on the philosophy that a sequence of metric measure spaces converges if and only if all…
In this paper, we present a study of a kernel-based consensual aggregation on randomly projected high-dimensional features of predictions for regression. The aggregation scheme is composed of two steps: the high-dimensional features of…
We develop a theory for the existence of perfect matchings in hypergraphs under quite general conditions. Informally speaking, the obstructions to perfect matchings are geometric, and are of two distinct types: 'space barriers' from convex…
Motivated by the optimal continued fractions studied independently by Selenius and Bosma, we define and introduce algorithms producing superoptimal continued fraction expansions of irrationals. The convergents of these expansions…
In 2021, the first author and Kalita obtained two general hypergeometric formulas for sums involving certain rising factorials to prove some supercongruence conjectures of Guo related to (B.2) and (C.2). In this paper, we further generalize…
We take the first steps to develop Conley-Zehnder Theory, as conjectured by Arnold, in the world of probability. As far as we know, this paper provides the first probabilistic theorems about the density of fixed points of symplectic twist…
We prove a suite of dynamical results, including exactness of the transformation and piecewise-analyticity of the invariant measure, for a family of continued fraction systems, including specific examples over reals, complex numbers,…
We resolve a long-standing open problem posed by Federer concerning the rectifiability of the integral geometric measure with exponent p >1, thereby settling a question that has persisted since its formulation. While the main theorem is…
Reed conjectured that for every $\varepsilon>0$ and every integer $\Delta$, there exists $g$ such that the fractional total chromatic number of every graph with maximum degree $\Delta$ and girth at least $g$ is at most…
We introduce the notion of matrices graph, defining continued fraction algorithms where the past and the future are almost independent. We provide an algorithm to convert more general algorithms into matrices graphs. We present an algorithm…
We report about some results, interesting examples, problems and conjectures revolving around the parabolic Kostant partition functions, the parabolic Kostka polynomials and ``saturation'' properties of several generalizations of the…
We prove some new cases of the Grothendieck-Serre conjecture for classical groups. This is based on a new construction of the Gersten-Witt complex for Witt groups of Azumaya algebras with involution on regular semilocal rings, with explicit…