Related papers: Constructive Relationships Between Algebraic Thick…

We introduce the notion of the algebraic overshear density property which implies both the algebraic notion of flexibility and the holomorphic notion of the density property. We investigate basic consequences of this stronger property, and…

We define $(\alpha_n)$ -regular sets in uniformly perfect metric spaces. This definition is quasisymmetrically invariant and the construction resembles generalized dyadic cubes in metric spaces. For these sets we then determine the…

We study holomorphic functions attaining weighted norms and its connections with the classical theory of norm attaining holomorphic functions. We prove that there are polynomials on $\ell_p$ which attain their weighted but not their…

The existence of an equidimensional morphism f with etale local sections from a regular algebraic space X to a locally noetherian normal algebraic space S of characteristic zero with excellent local rings implies that S is regular and f…

A new notion of thickness for subsets of $B[0,1]\subset \mathbb{R}^n$ called affine thickness is defined; this notion of thickness is a generalisation of Falconer-Yavicoli thickness and is adapted to be used in the study of certain sets…

Sensitivity conjecture is a longstanding and fundamental open problem in the area of complexity measures of Boolean functions and decision tree complexity. The conjecture postulates that the maximum sensitivity of a Boolean function is…

One of the basic aims of this paper is to study the relationship between the geometry of ``hypersurface like'' subsets of Euclidean space and the properties of the measures they support. In this context we show that certain doubling…

Bent functions are Boolean functions in an even number of variables that are indicators of Hadamard difference sets in elementary abelian 2-groups. A bent function in m variables is said to be normal if it is constant on an affine space of…

In previous works, an approach to the study of cyclic functions in reproducing kernel Hilbert spaces has been presented, based on the study of so called \emph{optimal polynomial approximants}. In the present article, we extend such approach…

We investigate the relationship between affine and Stein varieties in the context of rigid geometry. We show that the two concepts are much more closely related than in complex geometry, e.g. they are equivalent for surfaces. This rests on…

An integer polynomial $p$ of $n$ variables is called a \emph{threshold gate} for a Boolean function $f$ of $n$ variables if for all $x \in \zoon$ $f(x)=1$ if and only if $p(x)\geq 0$. The \emph{weight} of a threshold gate is the sum of its…

We introduce extremal affine surface areas in a functional setting. We show their main properties. Among them are linear invariance, isoperimetric inequalities and monotonicity properties. We establish a new duality formula, which shows…

Smoothness of a function $f:{\mathbb R}^n\to {\mathbb R}$ can be measured in terms of the rate of convergence of $f\ast\rho_\varepsilon$ to $f$, where $\rho$ is an appropriate mollifier. In the framework of fractional Sobolev spaces, we…

The approximate degree of a Boolean function $f \colon \{-1, 1\}^n \rightarrow \{-1, 1\}$ is the least degree of a real polynomial that approximates $f$ pointwise to error at most $1/3$. We introduce a generic method for increasing the…

We show optimal Lipschitz regularity for very weak solutions of the (measure-valued) elliptic PDE $-\mathrm{div}(A(x) \nabla u) = Q \; \mathcal{H}^{n-1} \llcorner \Gamma$ in a smooth domain $\Omega \subset \mathbb{R}^n$. Here $\Gamma$ is a…

We show that for any constant $c>0$, any (two-sided error) adaptive algorithm for testing monotonicity of Boolean functions must have query complexity $\Omega(n^{1/2-c})$. This improves the $\tilde\Omega(n^{1/3})$ lower bound of [CWX17] and…

It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…

Understanding the query complexity for testing linear-invariant properties has been a central open problem in the study of algebraic property testing. Triangle-freeness in Boolean functions is a simple property whose testing complexity is…

Given a convex function $\Phi:[0,1]\to\mathbb{R}$ and the mean $\mathbb{E}f(\mathbf{X})=a\in[0,1]$, which Boolean function $f$ maximizes the $\Phi$-stability $\mathbb{E}[\Phi(T_{\rho}f(\mathbf{X}))]$ of $f$? Here $\mathbf{X}$ is a random…

Previous work has shown that DNNs with large depth $L$ and $L_{2}$-regularization are biased towards learning low-dimensional representations of the inputs, which can be interpreted as minimizing a notion of rank $R^{(0)}(f)$ of the learned…