Related papers: Counting rational approximations on rank one flag …
In this paper we show error bounds for randomly subsampled rank-1 lattices. We pay particular attention to the ratio of the size of the subset to the size of the initial lattice, which is decisive for the computational complexity. In the…
Positive semi-definite matrices commonly occur as normal matrices of least squares problems in statistics or as kernel matrices in machine learning and approximation theory. They are typically large and dense. Thus algorithms to solve…
In this paper, we define the geometric median of a probability measure on a Riemannian manifold, give its characterization and a natural condition to ensure its uniqueness. In order to calculate the median in practical cases, we also…
We study the maximal rank in affine subspaces of symmetric or alternating matrices, in terms of the matching numbers of certain associated graphs. Applications include simple proofs of upper bounds on the dimension of such subspaces in…
This paper is a short summary of our recent work on the medians and means of probability measures in Riemannian manifolds. Firstly, the existence and uniqueness results of local medians are given. In order to compute medians in practical…
We establish efficient approximate counting algorithms for several natural problems in local lemma regimes. In particular, we consider the probability of intersection of events and the dimension of intersection of subspaces. Our approach is…
We investigate geometry of D-affine varieties. Our main result is that a D-affine rational projective surface over an algebraically closed field is a generalised flag variety of a reductive group.
Fulton asked how many solutions to a problem of enumerative geometry can be real, when that problem is one of counting geometric figures of some kind having specified position with respect to some general fixed figures. For the problem of…
We investigate special points on the Grassmannian which correspond to friezes with coefficients in the case of rank two. Using representations of arithmetic matroids we obtain a theorem on subpolygons of specializations of the coordinate…
In this work we develop an algorithmic procedure for associating a function defined on the Riemann surface of the $\log$ to given asymptotic data from a function at an essential singularity. We do this by means of rational approximations…
We introduce the flag-approximability of a convex body to measure how easy it is to approximate by polytopes. We show that the flag-approximability is exactly half the volume entropy of the Hilbert geometry on the body, and that both…
We give a general method to obtain from the integral restrictions of functions sharp pointwise and uniform estimates of these functions. This scheme is illustrated by the examples for Fock\,--\,Bargmann spaces of entire functions of several…
We use discrete holomorphic polynomials to prove that, given a refining sequence of critical maps of a Riemann surface, any holomorphic function can be approximated by a converging sequence of discrete holomorphic functions.
We consider random multiplicative functions taking the values $\pm 1$. Using Stein's method for normal approximation, we prove a central limit theorem for the sum of such multiplicative functions in appropriate short intervals.
We establish a sharp asymptotic formula for the number of rational points up to a given height and within a given distance from a hypersurface. Our main innovation is a bootstrap method that relies on the synthesis of Poisson summation,…
We solve the convergence case of the generalized Baker-Schmidt problem for simultaneous approximation on affine subspaces, under natural diophantine type conditions. In one of our theorems, we do not require monotonicity on the…
Consensus algorithms are popular distributed algorithms for computing aggregate quantities, such as averages, in ad-hoc wireless networks. However, existing algorithms mostly address the case where the measurements lie in a Euclidean space.…
We provide a formal, simple and intuitive theory of rational decision making including sequential decisions that affect the environment. The theory has a geometric flavor, which makes the arguments easy to visualize and understand. Our…
Using the Riemann Hypothesis over finite fields and bounds for the size of spherical codes, we give explicit upper bounds, of polynomial size with respect to the size of the field, for the number of geometric isomorphism classes of…
In this paper, we present finite element approximations of a class of Generalized random fields defined over a bounded domain of R d or a smooth d-dimensional Riemannian manifold (d $\ge$ 1). An explicit expression for the covariance matrix…