Related papers: Generalized difference sets and autocorrelation in…

Aldous' spectral gap conjecture states that the second largest eigenvalue of any connected Cayley graph on the symmetric group Sn with respect to a set of transpositions is achieved by the standard representation of Sn. This celebrated…

We derive novel concentration inequalities for the operator norm of the sum of self-adjoint operators that do not explicitly depend on the underlying dimension of the operator, but rather an intrinsic notion of it. Our analysis leads to…

We prove an optimal order error bound in the discrete $H^2(\Omega)$ norm for finite difference approximations of the first boundary-value problem for the biharmonic equation in $n$ space dimensions, with $n \in \{2,\dots,7\}$, whose…

Arrangements of pseudolines are classic objects in discrete and computational geometry. They have been studied with increasing intensity since their introduction almost 100 years ago. The study of the number $B_n$ of non-isomorphic simple…

A sequence $(x_n)_{n=1}^{\infty}$ on the torus $\mathbb{T} \cong [0,1]$ is said to exhibit Poissonian pair correlation if the local gaps behave like the gaps of a Poisson random variable, i.e. $$ \lim_{N \rightarrow \infty}{ \frac{1}{N} \#…

In the field of machine learning there is a growing interest towards more robust and generalizable algorithms. This is for example important to bridge the gap between the environment in which the training data was collected and the…

In one-dimensional Diophantine approximation, the Diophantine properties of a real number are characterized by its partial quotients, especially the growth of its large partial quotients. Notably, Kleinbock and Wadleigh [Proc. Amer. Math.…

Combinatorial discrepancy is a complexity measure of a collection of sets which quantifies how well the sets in the collection can be simultaneously balanced. More precisely, we are given an n-point set $P$, and a collection $\mathcal{F} =…

We prove that Riemannian contraction in a supervised learning setting implies generalization. Specifically, we show that if an optimizer is contracting in some Riemannian metric with rate $\lambda > 0$, it is uniformly algorithmically…

Motivated by the optimality principles for non-subdifferentiable optimization problems, we introduce new relative subdifferentials and examine some properties for relatively lower semicontinuous functions including $\epsilon$-regular…

We propose a strategy for approximating Pareto optimal sets based on the global analysis framework proposed by Smale (Dynamical systems, New York, 1973, pp. 531-544). The method highlights and exploits the underlying manifold structure of…

We investigate the interplay between the local and asymptotic geometry of a set $A \subseteq \mathbb{R}^n$ and the geometry of model sets $\mathcal{S} \subset \mathcal{P}(\mathbb{R}^n)$, which approximate $A$ locally uniformly on small…

We establish a general principle which states that regularizing an inverse problem with a convex function yields solutions which are convex combinations of a small number of atoms. These atoms are identified with the extreme points and…

We prove new theorems which are higher-dimensional generalizations of the classical theorems of Siegel on integral points on affine curves and of Picard on holomorphic maps from $\mathbb{C}$ to affine curves. These include results on…

We introduce the notion of ideally supported achievement sets for a series of real numbers. We analize their complexity and topological properties. We compare the notion of ideal achievement sets with the notion of ideally supported sum…

Let $(G,+)$ be a finite abelian group. Then, $\so(G)$ and $\eta(G)$ denote the smallest integer $\ell$ such that each sequence over $G$ of length at least $\ell$ has a subsequence whose terms sum to $0$ and whose length is equal to and at…

Zeckendorf proved that every integer can be written uniquely as a sum of non-adjacent Fibonacci numbers $\{1,2,3,5,\dots\}$. This has been extended to many other recurrence relations $\{G_n\}$ (with their own notion of a legal…

Given $h,g \in \mathbb{N}$, we write a set $X \subset \mathbb{Z}$ to be a $B_{h}^{+}[g]$ set if for any $n \in \mathbb{Z}$, the number of solutions to the additive equation $n = x_1 + \dots + x_h$ with $x_1, \dots, x_h \in X$ is at most…

We generalize optimal inequalities of C. Loewner and M. Gromov, by proving lower bounds for the total volume in terms of the homotopy systole and the stable systole. Our main tool is the construction of an area-decreasing map to the Jacobi…

We study definably complete locally o-minimal expansions of ordered groups in this paper. A definable continuous function defined on a closed, bounded and definable set behave like a continuous function on a compact set. We demonstrate…