Related papers: Generalized difference sets and autocorrelation in…

Given an arbitrary closed set A of $\mathbf{R}^{n}$, we establish the relation between the eigenvalues of the approximate differential of the spherical image map of A and the principal curvatures of A introduced by Hug-Last-Weil, thus…

In this note, we report five mathematical discoveries made in collaboration with Grok, all of which have been subsequently verified by the authors. These include an improved lower bound on the maximal Gaussian perimeter of convex sets in…

We investigate the Hausdorff measure and content on a class of quasi self-similar sets that include, for example, graph-directed and sub self-similar and self-conformal sets. We show that any Hausdorff measurable subset of such a set has…

Major progress has been made in the previous decade to characterize the asymptotic behavior of regularized M-estimators in high-dimensional regression problems in the proportional asymptotic regime where the sample size $n$ and the number…

Let $G = (G,+)$ be an additive group. The sumset theory of Pl\"unnecke and Ruzsa gives several relations between the size of sumsets $A+B$ of finite sets $A, B$, and related objects such as iterated sumsets $kA$ and difference sets $A-B$,…

We study uniform and non-uniform model sets in arbitrary locally compact second countable (lcsc) groups, which provide a natural generalization of uniform model sets in locally compact abelian groups as defined by Meyer and used as…

We show that for every positive integer $k$ there are positive constants $C$ and $c$ such that if $A$ is a subset of $\{1, 2, \dots, n\}$ of size at least $C n^{1/k}$, then, for some $d \leq k-1$, the set of subset sums of $A$ contains a…

We design and mathematically analyze sampling-based algorithms for regularized loss minimization problems that are implementable in popular computational models for large data, in which the access to the data is restricted in some way. Our…

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…

We prove that every graph with average degree $d$ and smallest adjacency eigenvalue $|\lambda_n|\leq d^{\gamma}$ contains a clique of size $d^{1-O(\gamma)}$. A simple corollary of this yields the first polynomial bound for Chowla's cosine…

Consider a convex function that is invariant under an group of transformations. If it has a minimizer, does it also have an invariant minimizer? Variants of this problem appear in nonparametric statistics and in a number of adjacent fields.…

Nourdin et al. [9] established the following universality result: if a sequence of off-diagonal homogeneous polynomial forms in i.i.d. standard normal random variables converges in distribution to a normal, then the convergence also holds…

The notions and certain fundamental characteristics of the proximal and limiting normal cones with respect to a set are first presented in this paper. We present the ideas of the limiting coderivative and subdifferential with respect to a…

In a 2019 paper, Barnard and Steinerberger show that for $f\in L^1(\mathbf{R})$, the following autocorrelation inequality holds: \begin{equation*} \min_{0 \leq t \leq 1} \int_\mathbf{R} f(x) f(x+t)\ \mathrm{d}x \ \leq\ 0.411 ||f||_{L^1}^2,…

We consider the problem of minimizing convex combinations of the first two eigenvalues of the Dirichlet-Laplacian among open sets of $R^N$ of fixed measure. We show that, by purely elementary arguments, based on the minimality condition, it…

The main result of this paper supports a conjecture by C. P\'erez and E. Rela about a very recent result of theirs on self-improving theory. Also, we extend the conclusions of their theorem to the range $p<1$. As an application of our…

A finite set $ S \subset \mathbb{R} $ is called a Sidon set if all sums $ x+y $ with $ x,y \in S $ and $ x \le y $ are distinct, and a weak Sidon set if all sums $ x+y $ with $ x,y \in S $ and $ x < y $ are distinct. For a finite set $ A…

Let $d \geq 4$ be a natural number and let $A$ be a finite, non-empty subset of $\mathbb{R}^d$ such that $A$ is not contained in a translate of a hyperplane. In this setting, we show that \[ |A-A| \geq \bigg(2d - 2 + \frac{1}{d-1} \bigg)…

We generalize the measurement using an expanded concept of cover, in order to provide a new approach to size of set other than cardinality. The generalized measurement has application backgrounds such as a generalized problem in dimension…

This article investigates the approximation quality achievable for biobjective minimization problems with respect to the Pareto cone by solutions that are (approximately) optimal with respect to larger ordering cones. When simultaneously…