English
Related papers

Related papers: On Mappings on the Hypercube with Small Average St…

200 papers

For two functions $f,g:\{0,1\}^n\to\{0,1\}$ a mapping $\psi:\{0,1\}^n\to\{0,1\}^n$ is said to be a $\textit{mapping from $f$ to $g$}$ if it is a bijection and $f(z)=g(\psi(z))$ for every $z\in\{0,1\}^n$. In this paper we study Lipschitz…

Discrete Mathematics · Computer Science 2015-01-14 Shravas Rao , Igor Shinkar

We resolve a conjecture of Rob Morris concerning bijections on the hypercube. Specifically, we show that for any bijection $f : \{-1,1\}^n \to \{-1,1\}^n$, \[ \Pr_{x,y \in \{-1,1\}^n}\big[ \langle x,y \rangle \ge 0 \;\text{and}\; \langle…

Combinatorics · Mathematics 2026-04-21 Ijay Narang , Muchen Ju

Length-constrained expander decompositions are a new graph decomposition that has led to several recent breakthroughs in fast graph algorithms. Roughly, an $(h, s)$-length $\phi$-expander decomposition is a small collection of length…

Data Structures and Algorithms · Computer Science 2025-10-14 Greg Bodwin , Bernhard Haeupler , D Ellis Hershkowitz , Zihan Tan

We introduce average-distortion sketching for metric spaces. As in (worst-case) sketching, these algorithms compress points in a metric space while approximately recovering pairwise distances. The novelty is studying average-distortion: for…

Data Structures and Algorithms · Computer Science 2025-04-11 Yiqiao Bao , Anubhav Baweja , Nicolas Menand , Erik Waingarten , Nathan White , Tian Zhang

A {\em Wakeford pairing} from $S$ onto $T$ is a bijection $\phi : S \to T$ such that $x\phi(x)\notin T,$ for every $x\in S.$ The number of such pairings will be denoted by $\mu(S,T)$. Let $A$ and $ B$ be finite subsets of a group $G$ with…

Combinatorics · Mathematics 2008-12-16 Yahya Ould Hamidoune

In a geometric graph, $G$, the \emph{stretch factor} between two vertices, $u$ and $w$, is the ratio between the Euclidean length of the shortest path from $u$ to $w$ in $G$ and the Euclidean distance between $u$ and $w$. The \emph{average…

Computational Geometry · Computer Science 2013-12-02 Vida Dujmovic , Pat Morin , Michiel Smid

The prediction of Debye-Scherrer diffraction patterns from strained samples is typically conducted in the small strain limit. Although valid for small deviations from the hydrostat (such as the conditions of finite strength typically…

Materials Science · Physics 2015-06-17 Andrew Higginbotham , David McGonegle

We give new, improved bounds for approximating the sparsest cut value or in other words the conductance $\phi$ of a graph in the CONGEST model. As our main result, we present an algorithm running in $O(\log^2 n/\phi)$ rounds in which every…

Data Structures and Algorithms · Computer Science 2025-08-28 Yannic Maus , Tijn de Vos

We characterize all compact and Hausdorff spaces $X$ which satisfy that for every multiplicative bijection $\phi$ on $C(X, I)$, there exist a homeomorphism $\mu : X \to X$ and a continuous map $p: X \to (0, +\infty)$ such that $$\phi (f)…

Functional Analysis · Mathematics 2007-12-13 Jesus Araujo

We provide a proximal average with repect to a $1$-coercive Legendre function. In the sense of Bregman distance, the Bregman envelope of the proximal average is a convex combination of Bregman envelopes of individual functions. The Bregman…

Optimization and Control · Mathematics 2022-02-25 Xianfu Wang , Heinz H. Bauschke

We present a general bijective approach to planar hypermaps with two main results. First we obtain unified bijections for all classes of maps or hypermaps defined by face-degree constraints and girth constraints. To any such class we…

Combinatorics · Mathematics 2019-06-14 Olivier Bernardi , Eric Fusy

Consider a piecewise affine Lipschitz map $\phi : \Omega \to \mathbb R$, where $\Omega \subset \mathbb R^d$ is an open set, and assume that $x \mapsto x + t \nabla \phi(x)$ is injective for almost every $t > 0$. In (J.-G. Liu, R.~L. Pego,…

Analysis of PDEs · Mathematics 2026-03-20 Stefano Bianchini , Luca Talamini

We define linear and radial stretch maps in the affine-additive group, and prove that they are minimizers of the mean quasiconformal distortion functional. For the proofs we use a method based on the notion of modulus of a curve family and…

Differential Geometry · Mathematics 2024-11-21 Z. M. Balogh , E. Bubani , I. D. Platis

The scaling limit of large simple outerplanar maps was established by Caraceni using a bijection due to Bonichon, Gavoille and Hanusse. The present paper introduces a new bijection between outerplanar maps and trees decorated with ordered…

Probability · Mathematics 2016-12-12 Benedikt Stufler

An edge-ordering of a graph $G=(V,E)$ is a bijection $\phi:E\to\{1,2,...,|E|\}$. Given an edge-ordering, a sequence of edges $P=e_1,e_2,...,e_k$ is an increasing path if it is a path in $G$ which satisfies $\phi(e_i)<\phi(e_j)$ for all…

Combinatorics · Mathematics 2015-02-12 Jessica De Silva , Theodore Molla , Florian Pfender , Troy Retter , Michael Tait

We consider the averaging process on a graph, that is the evolution of a mass distribution undergoing repeated averages along the edges of the graph at the arrival times of independent Poisson processes. We establish cutoff phenomena for…

Probability · Mathematics 2023-12-04 Pietro Caputo , Matteo Quattropani , Federico Sau

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…

Metric Geometry · Mathematics 2026-01-26 Richard A. Howat

Let $X$ be a metric space and let $\mu$ be a probability measure on it. Consider a Lipschitz map $T: X \rightarrow \Rn$, with Lipschitz constant $\leq 1$. Then one can ask whether the image $TX$ can have large projections on many…

Functional Analysis · Mathematics 2011-06-27 Mark Kozdoba

We extend the Marcus-Schaeffer bijection between orientable rooted bipartite quadrangulations (equivalently: rooted maps) and orientable labeled one-face maps to the case of all surfaces, that is orientable and non-orientable as well. This…

Combinatorics · Mathematics 2016-09-06 Guillaume Chapuy , Maciej Dołęga

We answer four questions from a recent paper of Rao and Shinkar on Lipschitz bijections between functions from $\{0,1\}^n$ to $\{0,1\}$. (1) We show that there is no $O(1)$-bi-Lipschitz bijection from $\mathrm{Dictator}$ to $\mathrm{XOR}$…

Combinatorics · Mathematics 2021-12-13 Tom Johnston , Alex Scott
‹ Prev 1 2 3 10 Next ›