English
Related papers

Related papers: On Approximability of Satisfiable k-CSPs: IV

200 papers

We characterize the symmetric distributions that can be (approximately) generated by shallow Boolean circuits. More precisely, let $f\colon \{0,1\}^m \to \{0,1\}^n$ be a Boolean function where each output bit depends on at most $d$ input…

Computational Complexity · Computer Science 2025-11-19 Daniel M. Kane , Anthony Ostuni , Kewen Wu

Let $G$ be a graph on $n$ vertices and $(H,+)$ be an abelian group. What is the minimum size ${\sf S}_H(G)$ of the set of all sums $A(u)+A(v)$ over all injections $A:V(G)\to H$? In 2012, the first author, Angel, the second author, and…

Combinatorics · Mathematics 2025-08-04 Noga Alon , Itai Benjamini , Georgii Zakharov , Maksim Zhukovskii

With a graph $G=(V,E)$ we associate a collection of non-negative real weights $\cup_{v\in V}{\lambda_{i,v}:1\leq i \leq m} \cup \cup_{uv \in E} {\lambda_{ij,uv}:1\leq i \leq j \leq m}$. We consider the probability distribution on…

Combinatorics · Mathematics 2012-06-15 David Galvin

Let $d\geq 3$ be a constant and let $F$ be a $d$-regular graph on $[n]$ with not too many symmetries. By the union bound, the probability threshold for the existence of a spanning subgraph in $G(n,p)$ isomorphic to $F$ is at least…

Combinatorics · Mathematics 2023-03-10 Maksim Zhukovskii

The connective constant $\mu(G)$ of a graph $G$ is the exponential growth rate of the number of self-avoiding walks starting at a given vertex. We investigate the validity of the inequality $\mu \ge \phi$ for infinite, transitive, simple,…

Combinatorics · Mathematics 2019-08-19 Geoffrey R. Grimmett , Zhongyang Li

A pair of graphs $(\Gamma,\Sigma)$ is said to be stable if the full automorphism group of $\Gamma\times\Sigma$ is isomorphic to the product of the full automorphism groups of $\Gamma$ and $\Sigma$ and unstable otherwise, where…

Combinatorics · Mathematics 2022-10-14 Yan-Li Qin , Binzhou Xia , Sanming Zhou

We investigate a family of distributions having a property of stability-under-addition, provided that the number $\nu$ of added-up random variables in the random sum is also a random variable. We call the corresponding property a…

Probability · Mathematics 2010-08-19 L. B. Klebanov , A. V. Kakosyan , S. T. Rachev , G. Temnov

A celebrated result of Hastad established that, for any constant $\varepsilon>0$, it is NP-hard to find an assignment satisfying a $(1/|G|+\varepsilon)$-fraction of the constraints of a given 3-LIN instance over an Abelian group $G$ even if…

Computational Complexity · Computer Science 2025-10-06 Silvia Butti , Alberto Larrauri , Stanislav Živný

Let $n,s,k$ be three positive integers such that $1\leq s\leq(n-k+1)/k$ and let $[n]=\{1,\ldots,n\}$. Let $H$ be a $k$-graph with vertex set $\{1,\ldots,n\}$, and let $e(H)$ denote the number of edges of $H$. Let $\nu(H)$ and $\tau(H)$…

Combinatorics · Mathematics 2021-05-26 Mingyang Guo , Hongliang Lu , Dingjia Mao

We definitively establish that the theory of symmetric Macdonald polynomials aligns with quantum and affine Schubert calculus using a discovery that distinguished weak chains can be identified by chains in the strong (Bruhat) order poset on…

Combinatorics · Mathematics 2014-02-07 Avinash J. Dalal , Jennifer Morse

Astrophysical tests of the stability of fundamental couplings are becoming an increasingly important probe of new physics. Motivated by the recent availability of new and stronger constraints we update previous works testing the consistency…

Cosmology and Nongalactic Astrophysics · Physics 2017-01-31 C. J. A. P. Martins , A. M. M. Pinho

Suppose Alice and Bob receive strings $X=(X_1,...,X_n)$ and $Y=(Y_1,...,Y_n)$ each uniformly random in $[s]^n$ but so that $X$ and $Y$ are correlated . For each symbol $i$, we have that $Y_i = X_i$ with probability $1-\eps$ and otherwise…

Information Theory · Computer Science 2012-08-30 Siu On Chan , Elchanan Mossel , Joe Neeman

Let $\pi : X\to \Lambda$ be a flat family of smooth complex projective varieties parameterized by a smooth quasi-projective variety $\Lambda$, and let $f: X\to X$ be a family of automorphisms with positive topological entropy. Suppose…

Dynamical Systems · Mathematics 2025-01-08 Yugang Zhang

Suppose that G is a compact Abelian topological group, m is the Haar measure on G and f is a measurable function. Given (n_k), a strictly monotone increasing sequence of integers we consider the nonconventional ergodic/Birkhoff averages…

Dynamical Systems · Mathematics 2019-02-20 Zoltan Buczolich , Gabriella Keszthelyi

Let $G$ be a transitive permutation group on a finite set $\Omega$ and recall that a base for $G$ is a subset of $\Omega$ with trivial pointwise stabiliser. The base size of $G$, denoted $b(G)$, is the minimal size of a base. If $b(G)=2$…

Group Theory · Mathematics 2022-03-17 Timothy C. Burness , Hong Yi Huang

Let M be an oriented compact positively curved 4-manifold. Let G be a finite subgroup of the isometry group of $M$. Among others, we prove that there is a universal constant C (cf. Corollary 4.3 for the approximate value of C), such that if…

Differential Geometry · Mathematics 2007-05-23 Fuquan Fang

We prove existence of solutions $(\phi,\lambda)$ of a family of of Feigenbaum-like equations \label{family} \phi(x)={1+\eps \over \lambda} \phi(\phi(\lambda x)) -\eps x +\tau(x), where $\eps$ is a small real number and $\tau$ is analytic…

Dynamical Systems · Mathematics 2010-09-28 Denis Gaidashev

A seminal result of H\r{a}stad [J. ACM, 48(4):798--859, 2001] shows that it is NP-hard to find an assignment that satisfies $\frac{1}{|G|}+\varepsilon$ fraction of the constraints of a given $k$-LIN instance over an abelian group, even if…

Computational Complexity · Computer Science 2020-09-08 Amey Bhangale , Subhash Khot

Let G be a connected reductive group defined over a non-archimedean local field of characteristic 0. We assume G is quasi-split, adjoint and absolutly simple. Let g be the Lie algebra of G. We consider the space of the invariant…

Representation Theory · Mathematics 2025-09-15 Jean-Loup Waldspurger

Let $\Sigma \subset \mathbb{C}$ be a compact subset of the complex plane, and $\mu$ be a probability distribution on $\Sigma$. We give necessary and sufficient conditions for $\mu$ to be the weak* limit of a sequence of uniform probability…

Number Theory · Mathematics 2024-04-09 Bryce Joseph Orloski , Naser Talebizadeh Sardari