English
Related papers

Related papers: Approximability of word maps by homomorphisms

200 papers

In a recent paper, Oliver Riordan shows that for $r \ge 4$ and $p$ up to and slightly larger than the threshold for a $K_r$-factor, the hypergraph formed by the copies of $K_r$ in $G(n,p)$ contains a copy of the binomial random hypergraph…

Combinatorics · Mathematics 2018-07-23 Annika Heckel

In the study of holomorphic maps, the term "rigidity" refers to certain types of results that give us very specific information about a general class of holomorphic maps owing to the geometry of their domains or target spaces. Under this…

Complex Variables · Mathematics 2015-08-28 Gautam Bharali , Indranil Biswas

A celebrated theorem of Friedgut says that every function $f:\{0,1\}^n \to \{0,1\}$ can be approximated by a function $g:\{0,1\}^n \to \{0,1\}$ with $\|f-g\|_2^2 \le \epsilon$ which depends only on $e^{O(I_f/\epsilon)}$ variables where…

Probability · Mathematics 2009-03-14 Hamed Hatami

Let $(T,{\cal F},\mu)$ be a $\sigma$-finite measure space, $E$ a separable real Banach space and $p\geq 1$. Given a sequence of functions $f, f_1, f_2,...$ from $T\times E$ to ${\bf R}$, under general assumptions, we prove that, for each…

Functional Analysis · Mathematics 2025-12-10 Biagio Ricceri

We establish rigidity results for holomorphic mappings and plurisubharmonic functions in complex geometry. First, under mild conditions, we show that the gradient of a $\operatorname{U}(1)$-invariant strictly plurisubharmonic function in…

Complex Variables · Mathematics 2026-04-30 Hanwen Liu

A generalized polymorphism of a predicate $P \subseteq \{0,1\}^m$ is a tuple of functions $f_1,\dots,f_m\colon \{0,1\}^n \to \{0,1\}$ satisfying the following property: If $x^{(1)},\dots,x^{(m)} \in \{0,1\}^n$ are such that…

Combinatorics · Mathematics 2025-12-02 Yaroslav Alekseev , Yuval Filmus

A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ if and only if $xy\in E$. Word-representable graphs generalize several important classes of graphs such…

Combinatorics · Mathematics 2023-07-13 Anthony V. Petyuk

Menger's theorem is an important building block of numerous results in the study of graph structure. We consider a variant in terms of coarse geometry. We say that a set of graphs has the weak coarse Menger property if there exist functions…

Combinatorics · Mathematics 2026-05-12 Chun-Hung Liu

Using tools from the theory of optimal transport, we establish several results concerning isometric actions of amenable topological groups with potentially unbounded orbits. Specifically, suppose $d$ is a compatible left-invariant metric on…

Functional Analysis · Mathematics 2025-09-16 Christian Rosendal

Let $A$ be a finite-dimensional algebra over a field $F$ with char$(F)\ne 2$. We show that a linear map $D:A\to A$ satisfying $xD(x)x\in [A,A]$ for every $x\in A$ is the sum of an inner derivation and a linear map whose image lies in the…

Rings and Algebras · Mathematics 2021-12-01 Matej Brešar

For any $1\le r\le \infty$, we show that every diffeomorphism of a manifold of the form $\mathbb{R}/\mathbb{Z} \times M$ is a total renormalization of a $C^r$-close to identity map. In other words, for every diffeomorphism $f$ of…

Dynamical Systems · Mathematics 2024-12-05 Pierre Berger , Nicolaz Gourmelon , Mathieu Helfter

To any infinite word w over a finite alphabet A we can associate two infinite words min(w) and max(w) such that any prefix of min(w) (resp. max(w)) is the lexicographically smallest (resp. greatest) amongst the factors of w of the same…

Combinatorics · Mathematics 2010-03-16 Amy Glen

For a real c\`{a}dl\`{a}g function f and a positive constant c we find another c\`{a}dl\`{a}g function, which has the smallest total variation pos- sible among all functions uniformly approximating f with accuracy c/2. The solution is…

Classical Analysis and ODEs · Mathematics 2017-06-26 Rafał M. Łochowski

For an arbitrary word $w$ on an alphabet, we can define the alternating symbol graph, $G(w)$, as the graph in which the edge $(a, b)$ is in $E$ iff the letters $a$ and $b$ alternate in the word $w$. A graph $G = (V, E)$ is said to be…

Combinatorics · Mathematics 2018-06-14 Ameya Daigavane , Mrityunjay Singh , Benny K. George

In this paper we investigate Hartman functions on a topological group $G$. Recall that $(\iota, C)$ is a group compactification of $G$ if $C$ is a compact group, $\iota: G\to C$ is a continuous group homomorphism and $\iota(G)$ is dense in…

Functional Analysis · Mathematics 2009-09-29 Gabriel Maresch , Reinhard Winkler

Let $w$ be an unbounded radial weight on the complex plane. We study the following approximation problem: find a proper holomorphic map $f: \mathbb{C}\to\mathbb{C}^n$ such that $|f|$ is equivalent to $w$. We give several characterizations…

Complex Variables · Mathematics 2017-04-04 Evgeny Abakumov , Evgueni Doubtsov

Consider a group G such that there is no homomorphism f:G to {+1,-1}. In that case, how close can we come to such a homomorphism? We show that if f has zero expectation, then the probability that f(xy) = f(x) f(y), where x, y are chosen…

Combinatorics · Mathematics 2010-05-27 Cristopher Moore , Alexander Russell

The paper is devoted to the fixed point theory in four aspects: of contractions, nonexpansive mappings, generalized inward mappings, and of the tool theorems. The manuscript was written about ten years ago. At first Nadler's concept of…

General Topology · Mathematics 2021-04-27 Lech Pasicki

Let $G$ be a group and let ${\mathcal G}$ be a free factor system of $G$, namely a free splitting of $G$ as $G=G_1*\dots*G_k*F_r$. In this paper, we study the set of train track points for ${\mathcal G}$-irreducible automorphisms $\phi$…

Group Theory · Mathematics 2024-04-16 Stefano Francaviglia , Armando Martino , Dionysios Syrigos

Write ${\cal F}$ for the set of homomorphisms from $\{0,1\}^d$ to ${\bf Z}$ which send $\underline{0}$ to 0 (think of members of ${\cal F}$ as labellings of $\{0,1\}^d$ in which adjacent strings get labels differing by exactly 1), and…

Combinatorics · Mathematics 2012-06-15 David Galvin