Related papers: Generalized difference sets and autocorrelation in…

The bivariate normal density with unit variance and correlation $\rho$ is well-known. We show that by integrating out $\rho$, the result is a function of the maximum norm. The Bayesian interpretation of this result is that if we put a…

Recently it has been proven that simple GP systems can efficiently evolve a conjunction of $n$ variables if they are equipped with the minimal required components. In this paper, we make a considerable step forward by analysing the…

The Generalized Central Limit Theorem is a remarkable generalization of the Central Limit Theorem, showing that the sum of a large number of independent, identically-distributed (i.i.d) random variables with infinite variance may converge…

Nonlinear Poincar\'e inequalities are indispensable tools in the study of dimension reduction and low-distortion embeddings of graphs into metric spaces, and have found remarkable algorithmic applications. A basic open problem, posed by Jon…

Let $(G,u)$ be an archimedean norm-complete dimension group with order unit. Continuing a previous paper, we study intervals (i.e., nonempty upward directed lower subsets) of $G$ which are closed with respect to the canonical norm of…

This paper proposes a universal algorithm for convex minimization problems of the composite form $g_0(x)+h(g_1(x),\dots, g_m(x)) + u(x)$. We allow each $g_j$ to independently range from being nonsmooth Lipschitz to smooth, from convex to…

We study some generalized notions of cohesiveness which arise naturally in connection with effective versions of Ramsey's Theorem. An infinite set $A$ of natural numbers is $n$--cohesive (respectively, $n$--r--cohesive) if $A$ is almost…

We show that for any natural number $s$, there is a constant $\gamma$ and a subgraph-closed class having, for any natural $n$, at most $\gamma^n$ graphs on $n$ vertices up to isomorphism, but no adjacency labeling scheme with labels of size…

We reconsider the Schr\"oder-Siegel problem of conjugating an analytic map in $\mathbb{C}$ in the neighborhood of a fixed point to its linear part, extending it to the case of dimension $n>1$. Assuming a condition which is equivalent to…

Let $A$ be a finite subset of an abelian group $G$, and suppose that $|A+A|\leq K|A|$. We show that for any $\epsilon>0$, there exists a constant $C_\epsilon$ such that $A$ can be covered by at most $\exp(C_\epsilon \log(2K)^{1+\epsilon})$…

A finite set $S \subset \mathbb{Z}$ is a Sidon set if its pairwise differences are distinct. Recall that a perfect difference set (PDS) of order $n$ is a set $B \subset \mathbb{Z}_v$ ($v = n^2 - n + 1$) of size $n$ such that every nonzero…

We consider supervised learning problems in which set predictions provide explicit uncertainty estimates. Using Choquet integrals (a.k.a. Lov{\'a}sz extensions), we propose a convex loss function for nondecreasing subset-valued functions…

Erdos, Herzog and Piranian asked whether, for $n$ points in the plane with fixed diameter (maximum distance between points), an arrangement of a regular $n$-gon maximizes their product of all pairs of distances. Recently, it was discovered…

Many geometric optimization problems can be reduced to finding points in space (centers) minimizing an objective function which continuously depends on the distances from the centers to given input points. Examples are $k$-Means, Geometric…

The problem of learning threshold functions is a fundamental one in machine learning. Classical learning theory implies sample complexity of $O(\xi^{-1} \log(1/\beta))$ (for generalization error $\xi$ with confidence $1-\beta$). The private…

We make progress on a conjecture of Cilleruelo on the growth of the least common multiple of consecutive values of an irreducible polynomial $f$ on the additional hypothesis that the polynomial be even. This strengthens earlier work of…

Let $\mathfrak{F}_n$ be the set of unitary cuspidal automorphic representations of $\mathrm{GL}_n$ over a number field $F$, and let $S\subseteq\mathfrak{F}_n$ be an arbitrary finite subset. Given $\pi_0\in\mathfrak{F}_{n_0}$, we establish…

We study global optimization of non-convex functions through optimal control theory. Our main result establishes that (quasi-)optimal trajectories of a discounted control problem converge globally and practically asymptotically to the set…

We discuss three convolution inequalities that are connected to additive combinatorics. Cloninger and the second author showed that for nonnegative $f \in L^1(-1/4, 1/4)$, $$ \max_{-1/2 \leq t \leq 1/2} \int_{\mathbb{R}}{f(t-x) f(x) dx}…

We consider numbers and sizes of independent sets in graphs with minimum degree at least $d$, when the number $n$ of vertices is large. In particular we investigate which of these graphs yield the maximum numbers of independent sets of…