English
Related papers

Related papers: Lipschitz bijections between boolean functions

200 papers

Assuming the Generalized Riemann Hypothesis and a pair correlation conjecture for the zeros of Dirichlet $L$-functions, we establish the truth of a conjecture of Montgomery (in its corrected form stated by Friedlander and Granville) on the…

Number Theory · Mathematics 2026-02-17 Neelam Kandhil , Alessandro Languasco , Pieter Moree

We characterize the functions $f\colon [0,1] \longrightarrow [0,1]$ for which there exists a measurable set $C\subseteq [0,1]$ of positive measure satisfying $\frac{|C\cap I|}{|I|}<f(|I|)$ for any nontrivial interval $I \subseteq [0,1]$. As…

Functional Analysis · Mathematics 2021-08-06 Rafael Chiclana

In this paper we prove generalizations of Lusin-type theorems for gradients due to Giovanni Alberti, where we replace the Lebesgue measure with any Radon measure $\mu$. We apply this to go beyond the known result on the existence of…

Classical Analysis and ODEs · Mathematics 2019-05-07 Andrea Marchese , Andrea Schioppa

We introduce the generalized notion of semicontinuity of a function defined on a topological space and derive the useful classification of the so-called Lipschitz derivatives of functions defined on a metric space. Secondly, we investigate…

Functional Analysis · Mathematics 2025-09-26 Oleksandr V. Maslyuchenko , Ziemowit M. Wójcicki

Given an open subset $\Omega$ of a Banach space and a Lipschitz function $u_0: \overline{\Omega} \to \mathbb{R},$ we study whether it is possible to approximate $u_0$ uniformly on $\Omega$ by $C^k$-smooth Lipschitz functions which coincide…

Functional Analysis · Mathematics 2019-02-22 Robert Deville , Carlos Mudarra

We consider several variants of Baumgartner's axiom for $\aleph_1$-dense sets defined on the Baire and Cantor spaces in terms of Lipschitz functions with respect to the usual metric. A variation of Baumgartner's original argument shows that…

Logic · Mathematics 2025-10-10 Corey Bacal Switzer

This note studies numerical methods for solving compositional optimization problems, where the inner function is smooth, and the outer function is Lipschitz continuous, non-smooth, and non-convex but exhibits one of two special structures…

Optimization and Control · Mathematics 2024-11-22 Yao Yao , Qihang Lin , Tianbao Yang

Let $S_n$ and $S_{n,k}$ be, respectively, the number of subsets and $k$-subsets of $\mathbb{N}_n=\{1,\ldots,n\}$ such that no two subset elements differ by an element of the set $\mathcal{Q}$, the largest element of which is $q$. We prove a…

Combinatorics · Mathematics 2025-07-22 Michael A. Allen

We obtain a criterion for an analytic subset of a Euclidean space to contain points of differentiability of a typical Lipschitz function, namely, that it cannot be covered by countably many sets, each of which is closed and purely…

Functional Analysis · Mathematics 2020-11-11 Michael Dymond , Olga Maleva

In this paper, we study stochastic optimization of two-level composition of functions without Lipschitz continuous gradient. The smoothness property is generalized by the notion of relative smoothness which provokes the Bregman gradient…

Optimization and Control · Mathematics 2023-02-24 Yin Liu , Sam Davanloo Tajbakhsh

We study the oracle complexity of producing $(\delta,\epsilon)$-stationary points of Lipschitz functions, in the sense proposed by Zhang et al. [2020]. While there exist dimension-free randomized algorithms for producing such points within…

Optimization and Control · Mathematics 2025-05-01 Guy Kornowski , Ohad Shamir

The discrepancy function measures the deviation of the empirical distribution of a point set in $[0,1]^d$ from the uniform distribution. In this paper, we study the classical discrepancy function with respect to the BMO and exponential…

Number Theory · Mathematics 2016-08-25 Josef Dick , Aicke Hinrichs , Lev Markhasin , Friedrich Pillichshammer

Recently, Ivan Mihajlin and Alexander Smal proved a composition theorem of a universal relation and some function via so called xor composition, that is there exists some function $f:\{0,1\}^n \rightarrow \{0,1\}$ such that…

Computational Complexity · Computer Science 2023-11-14 Hao Wu

This work studies the typical behavior of random integer-valued Lipschitz functions on expander graphs with sufficiently good expansion. We consider two families of functions: M-Lipschitz functions (functions that change by at most M along…

Probability · Mathematics 2017-03-14 Ron Peled , Wojciech Samotij , Amir Yehudayoff

It is shown that the counting function of n Boolean variables can be implemented with the formulae of size O(n^3.06) over the basis of all 2-input Boolean functions and of size O(n^4.54) over the standard basis. The same bounds follow for…

Data Structures and Algorithms · Computer Science 2012-08-21 Igor S. Sergeev

An invertible function is bi-Lipschitz if both the function and its inverse have bounded Lipschitz constants. Nowadays, most Normalizing Flows are bi-Lipschitz by design or by training to limit numerical errors (among other things). In this…

Machine Learning · Computer Science 2024-03-08 Alexandre Verine , Benjamin Negrevergne , Fabrice Rossi , Yann Chevaleyre

We present a bijection between non-crossing partitions of the set $[2n+1]$ into $n+1$ blocks such that no block contains two consecutive integers, and the set of sequences $\{s_{i}\}_{1}^{n}$ such that $1 \leq s_{i} \leq i$, and if…

Combinatorics · Mathematics 2007-05-23 Rekha Natarajan

Given an unpredictable Boolean function $f: \{0, 1\}^n \rightarrow \{0, 1\}$, the standard Yao's XOR lemma is a statement about the unpredictability of computing $\oplus_{i \in [k]}f(x_i)$ given $x_1, ..., x_k \in \{0, 1\}^n$, whereas the…

Computational Complexity · Computer Science 2019-08-16 Ragesh Jaiswal

This article presents unified bijective constructions for planar maps, with control on the face degrees and on the girth. Recall that the girth is the length of the smallest cycle, so that maps of girth at least $d=1,2,3$ are respectively…

Combinatorics · Mathematics 2012-06-13 Olivier Bernardi , Eric Fusy

We find bijections on 2-distant noncrossing partitions, 12312-avoiding partitions, 3-Motzkin paths, UH-free Schr{\"o}der paths and Schr{\"o}der paths without peaks at even height. We also give a direct bijection between 2-distant…

Combinatorics · Mathematics 2011-08-30 Jang Soo Kim