Related papers: Lipschitz bijections between boolean functions

We use the asymptotic large sieve, developed by the authors, to prove that if the Generalized Riemann Hypothesis is true, then there exist many Dirichlet L-functions that have a pair of consecutive zeros closer together than 0.37 times…

The log-rank conjecture, a longstanding problem in communication complexity, has persistently eluded resolution for decades. Consequently, some recent efforts have focused on potential approaches for establishing the conjecture in the…

We study local filters for the Lipschitz property of real-valued functions $f: V \to [0,r]$, where the Lipschitz property is defined with respect to an arbitrary undirected graph $G=(V,E)$. We give nearly optimal local Lipschitz filters…

Let $X^n$ be a uniformly distributed $n$-dimensional binary vector, and $Y^n$ be the result of passing $X^n$ through a binary symmetric channel (BSC) with crossover probability $\alpha$. A recent conjecture postulated by Courtade and Kumar…

A well-known result is that any Lipschitz domain is an extension domain for $W^{s,p}$. This paper extends this result to Lipschitz subsets of compact Lipschitz submanifolds of $\mathbb{R}^n$. We adapt the construction of an extension…

We consider the problem of discretization of neural operators between Hilbert spaces in a general framework including skip connections. We focus on bijective neural operators through the lens of diffeomorphisms in infinite dimensions.…

In this paper we consider an abstract Wiener space $(X,\gamma,H)$ and an open subset $O\subseteq X$ which satisfies suitable assumptions. For every $p\in(1,+\infty)$ we define the Sobolev space $W_{0}^{1,p}(O,\gamma)$ as the closure of…

In binary classification and regression problems, it is well understood that Lipschitz continuity and smoothness of the loss function play key roles in governing generalization error bounds for empirical risk minimization algorithms. In…

We prove that any continuous function f from [0,1]^n to R representable by a finite computation tree with N internal nodes and compositional sparsity s = O(1) admits a deep Kolmogorov-Arnold Network (KAN) representation. Each internal node…

We prove the first convergence guarantees for a subgradient method minimizing a generic Lipschitz function over generic Lipschitz inequality constraints. No smoothness or convexity (or weak convexity) assumptions are made. Instead, we…

We prove that the regular $n\times n$ square grid of points in the integer lattice $\mathbb{Z}^{2}$ cannot be recovered from an arbitrary $n^{2}$-element subset of $\mathbb{Z}^{2}$ via a mapping with prescribed Lipschitz constant…

Lower and upper bounds for a given function are important in many mathematical and engineering contexts, where they often serve as a base for both analysis and application. In this short paper, we derive piecewise linear and quadratic…

The notion of a difference hierarchy, first introduced by Hausdorff, plays an important role in many areas of mathematics, logic and theoretical computer science such as descriptive set theory, complexity theory, and the theory of regular…

Under the generalized Riemann hypothesis, we use Beurling-Selberg extremal functions to bound the mean and mean square of the argument of Dirichlet $L$-functions to a large prime modulus $q$. As applications, we give alternative proofs of…

Let $X = [0,1]$, and let $T:X\to X$ be an expanding piecewise linear map sending each interval of linearity to $[0,1]$. For $\psi:\mathbb N\to\mathbb R_{\geq 0}$, $x\in X$, and $N\in\mathbb N$ we consider the recurrence counting function \[…

We give explicit upper and lower bounds for $N(T,\chi)$, the number of zeros of a Dirichlet $L$-function with character $\chi$ and height at most $T$. Suppose that $\chi$ has conductor $q>1$, and that $T\geq 5/7$. If…

We study the mean radius growth function for quasiconformal mappings. We give a new sub-class of quasiconformal mappings in $\mathbb{R}^n$, for $n\geq 2$, called bounded integrable parameterization mappings, or BIP maps for short. These…

The boundedness (continuity) of composition operators from some function space to another one is significant, though there are few results about this problem. Thus, in this study, we provide necessary and sufficient conditions on the…

One means of fitting functions to high-dimensional data is by providing smoothness constraints. Recently, the following smooth function approximation problem was proposed: given a finite set $E \subset \mathbb{R}^d$ and a function $f: E…

Let $X$ be a random variable with distribution function $F,$ and $X_{1},X_{2},...,X_{n}$ are independent copies of $X.$ Consider the order statistics $X_{i:n},$ $i=1,2,...,n$ and denote $F_{i:n}(x)=P\{X_{i:n}\leq x\}.$ Using majorization…