Related papers: Counting and Joint equidistribution of approximate…
We develop asymptotic approximations that can be applied to sequential estimation and inference problems, adaptive randomized controlled trials, and related settings. In batched adaptive settings where the decision at one stage can affect…
A central question in random matrix theory is universality. When an emergent phenomena is observed from a large collection of chosen random variables it is natural to ask if this behavior is specific to the chosen random variable or if the…
These notes represent an extended version of a talk I gave for the participants of the IMO 2009 and other interested people. We introduce diophantine equations and show evidence that it can be hard to solve them. Then we demonstrate how one…
In this paper, we introduce and study a new extragradient iterative process for finding a common element of the set of fixed points of an infinite family of nonexpansive mappings and the set of solutions of a variational inequality for an…
We investigate approximation to a given real number by algebraic numbers and algebraic integers of prescribed degree. We deal with both best and uniform approximation, and highlight the similarities and differences compared with the…
Using the circle method in combination with lattice point counting arguments, we show that for almost all homogeneous diophantine equations of additive type and degree $k$ in more than $4k$ variables, the Local-Global principle holds true.…
In this paper we prove quantitative results about geodesic approximations to submanifolds in negatively curved spaces. Among the main tools is a new and general Jarn\'{i}k-Besicovitch type theorem in Diophantine approximation. The framework…
We identify a relationship between a certain family of random walks on Euclidean lattices and difference matrices over cyclic groups. We then use the techniques of Fourier analysis to estimate the return probabilities of these random walks,…
We draw connections between the various conjectures which are included in G. R\'emond's generalized Lehmer problems. Specifically, we show that the degree one form of his conjecture for the multiplicative group is, in a sense, almost as…
Consider the collection of all binary matrices having a specific sequence of row and column sums and consider sampling binary matrices uniformly from this collection. Practical algorithms for exact uniform sampling are not known, but there…
We present a novel deep learning approach to approximate the solution of large, sparse, symmetric, positive-definite linear systems of equations. These systems arise from many problems in applied science, e.g., in numerical methods for…
This paper presents the first discrete-time distributed algorithm to track the tightest ellipsoids that outer approximates the global dynamic intersection of ellipsoids. Given an undirected network, we consider a setup where each node…
We deduce Diophantine arithmetic inequalities for big linear systems and with respect to finite extensions of number fields. Our starting point is the Parametric Subspace Theorem, for linear forms, as formulated by Evertse and Ferretti…
In this note we prove a new symmetrization result, in the form of mass concentration comparison, for solutions of nonlocal nonlinear Dirichlet problems involving fractional p Laplacians. Some regularity estimates of solutions will be…
Discrimination in machine learning often arises along multiple dimensions (a.k.a. protected attributes); it is then desirable to ensure \emph{intersectional fairness} -- i.e., that no subgroup is discriminated against. It is known that…
We give a simple inequality that compares the laws of two random variables taking values in a convex subset of a normed vector space. By combining this with Arratia's coupling, recently refined by Koukoulopoulos and the author, we obtain a…
We study the counting function of rational approximations with given bounds on the denominator and satisfying the critical Dirichlet exponent on the sphere $S^d$, $d\geq 3$. We give an effective estimate for this counting function, with an…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
A reparametrized Dirichlet-multinomial distribution is introduced, and the covariance matrix, as well as, the algorithm for calculating the PDF for n species are provided. The distribution is suited for modelling the joint distribution of…
In this paper, we explore several threads arising from our recent joint work on arithmetic holonomy bounds, which were originally devised to prove new irrationality results based on the method of Ap\'ery limits. We propose a new method to…