Related papers: A randomized version of the Littlewood Conjecture
In the absence of a fundamental theory that precisely predicts values for observable parameters, anthropic reasoning attempts to constrain probability distributions over those parameters in order to facilitate the extraction of testable…
The Illumination Problem may be phrased as the problem of covering a convex body in Euclidean $n$-space by a minimum number of translates of its interior. By a probabilistic argument, we show that, arbitrarily close to the Euclidean ball,…
We prove a result in the area of twisted Diophantine approximation related to the theory of Schmidt games. In particular, under certain restrictions we give a affirmative answer to the analogue in this setting of a famous conjecture of…
Math is widely considered as a powerful tool and its strong appeal depends on the high level of abstraction it allows in modelling a huge number of heterogeneous phenomena and problems, spanning from the static of buildings to the flight of…
We consider the Ekst\''om-Persson conjecture concerning the value of the Hausdorff dimension of random covering sets formed by balls with radii $(k^{-\alpha})_{k=1}^\infty$ and centres chosen independently at random according to an…
This paper is motivated by two problems in the theory of Diophantine approximation, namely, Davenport's problem regarding badly approximable points on submanifolds of a Euclidean space and Schmidt's problem regarding the intersections of…
The paper deals with studying a connection of the Littlewood--Offord problem with estimating the concentration functions of some symmetric infinitely divisible distributions. It is shown that the values at zero of the concentration…
We discuss some easy statements dealing with linear inhomogeneous Diophantine approximation. Surprisingly, we did not find some of them in the literature.
Dickson conjectured that a set of polynomials will take on infinitely many simultaneous prime values. Later others, such as Hardy and Littlewood, gave estimates for the number of these primes. In this article we look at this conjecture,…
In this paper, we investigate the extent to which the Bump-Hoffstein conjecture could be generalized for central coverings of general linear groups. We provide evidence for such generalized Bump-Hoffstein conjecture by proving some special…
We give an overview of the constrained Willmore problem and address some conjectures arising from partial results and numerical experiments. Ramifications of these conjectures would lead to a deeper understanding of the Willmore functional…
We provide finite-sample distribution approximations, that are uniform in the parameter, for inference in linear mixed models. Focus is on variances and covariances of random effects in cases where existing theory fails because their…
We study random 2-dimensional complexes in the Linial - Meshulam model and find torsion in their fundamental groups at various regimes. We find a simple algorithmically testable criterion for a subcomplex of a random 2-complex to be…
We establish, via a formal/heuristic Fourier inversion calculation, that the Hardy-Littlewood twin prime conjecture is equivalent to an asymptotic formula for the two-point correlation function of Riemann zeros at a height $E$ on the…
We give a precise estimate for the number of lattice points in certain bounded subsets of $\mathbb{R}^{n}$ that involve `hyperbolic spikes' and occur naturally in multiplicative Diophantine approximation. We use Wilkie's o-minimal structure…
This paper discusses a methodology for determining a functional representation of a random process from a collection of scattered pointwise samples. The present work specifically focuses onto random quantities lying in a high dimensional…
We develop a theory of multidimensional randomization in Lebesgue spaces $L^p$ with the aid of Kahane-Khintchine-Marcus-Pisier inequalities. More precisely, we obtain a result in the spirit of Maurey-Pisier's theorem which involves random…
A celebrated theorem of Pippenger states that any almost regular hypergraph with small codegrees has an almost perfect matching. We show that one can find such an almost perfect matching which is `pseudorandom', meaning that, for instance,…
We study strong approximation for some algebraic varieties over which are defined using norm forms over the rationals. This allows us to confirm a special case of a conjecture due to Harpaz and Wittenberg.
For a given irrational number, we consider the properties of best rational approximations of given parities. There are three different kinds of rational numbers according to the parity of the numerator and denominator, say odd/odd, even/odd…