Related papers: Computing Kazhdan constants by semidefinite progra…

Kernel Stein discrepancies (KSDs) have emerged as a powerful tool for quantifying goodness-of-fit over the last decade, featuring numerous successful applications. To the best of our knowledge, all existing KSD estimators with known rate…

For a character $\chi$ of a finite group $G$, the number cod$(\chi):=|G:\mathrm{ker}(\chi)|/\chi(1)$ is called the codegree of $\chi$.In this paper, we give a solvability criterion for a finite group $G$ depending on the minimum of the…

For a finite abelian group $G$ and a positive integer $d$, let $\mathsf s_{d \mathbb N} (G)$ denote the smallest integer $\ell \in \mathbb N_0$ such that every sequence $S$ over $G$ of length $|S| \ge \ell$ has a nonempty zero-sum…

We provide optimal lower bounds for two well-known parameter estimation (also known as statistical estimation) tasks in high dimensions with approximate differential privacy. First, we prove that for any $\alpha \le O(1)$, estimating the…

The Computation of discrete Contractive semigroups becomes necessary when we deal with several types of evolution equations in Discretizable Hilbert spaces, in this work we study some properties of the discrete forms of the contractive…

If $G$ is a finite Abelian group, define $s_{k}(G)$ to be the minimal $m$ such that a sequence of $m$ elements in $G$ always contains a $k$-element subsequence which sums to zero. Recently Bitz et al. proved that if $n = exp(G)$, then…

The Krohn-Rhodes Theorem proves that a finite semigroup divides a wreath product of groups and aperiodic semigroups. Krohn-Rhodes complexity equals the minimal number of groups that are needed. Determining an algorithm to compute complexity…

An overview of quantum computing and in particular the Hidden Subgroup Problem are presented from a mathematical viewpoint. Detailed proofs are supplied for many important results from the literature, and notation is unified, making it…

We prove a tight lower bound (up to constant factors) on the sample complexity of any non-interactive local differentially private protocol for optimizing a linear function over the simplex. This lower bound also implies a tight lower bound…

For $\Pi \subset \mathbb{R}^2$ a connected, open, bounded set whose boundary is a finite union of disjoint polygons whose vertices have integer coordinates, the logarithm of the discrete Laplacian on $L\Pi \cap \mathbb{Z}^2$ with Dirichlet…

Tight estimation of the Lipschitz constant for deep neural networks (DNNs) is useful in many applications ranging from robustness certification of classifiers to stability analysis of closed-loop systems with reinforcement learning…

For any Lipschitz domain we construct an arbitrarily small, localized perturbation which splits the spectrum of the Laplacian into simple eigenvalues. We use for this purpose a Hadamard's formula and spectral stability results.

The Margulis constant for Kleinian groups is the smallest constant $c$ such that for each discrete group $G$ and each point $x$ in the upper half space ${\bold H}^3$, the group generated by the elements in $G$ which move $x$ less than…

Variational methods play an important role in the study of quantum many-body problems, both in the flavor of classical variational principles based on tensor networks as well as of quantum variational principles in near-term quantum…

We introduce compactness classes of Hilbert space operators by grouping together all operators for which the associated singular values decay at a certain speed and establish upper bounds for the norm of the resolvent of operators belonging…

The so--called subgroup commutativity degree $sd(G)$ of a finite group $G$ is the number of permuting subgroups $(H,K) \in \mathrm{L}(G) \times \mathrm{L}(G)$, where $\mathrm{L}(G)$ is the subgroup lattice of $G$, divided by…

We consider kernel operators defined by a dynamical system. The Hausdorff distance of spectra is estimated by the Hausdorff distance of subsystems. We prove that the spectrum map is $ \frac{1}{2} $-H\"older continuous provided the group…

Let $G$ be a semisimple algebraic group. We develop a machinery for manipulation and manufacture of well-rounded families $\left\{ \mathcal{B}_{T}\right\} _{T>0}\subset G$ as they were defined in a work by A. Gorodnik and A. Nevo. The…

A quantitative regularity theory is developed for weak solutions to the parabolic system $$ \partial_t u-\mathrm{div}\,{\boldsymbol{\mathsf A}}(x,t,Du)=0 \quad\text{in }E_T\subset \mathbb{R}^N\times\mathbb{R}, $$ which features the…

The problem of establishing out-of-sample bounds for the values of an unkonwn ground-truth function is considered. Kernels and their associated Hilbert spaces are the main formalism employed herein along with an observational model where…