惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Y
Y Combinator Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
博客园_首页
量子位
V
Visual Studio Blog
博客园 - Franky
宝玉的分享
宝玉的分享
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博客园 - 【当耐特】
罗磊的独立博客
小众软件
小众软件
V
V2EX
GbyAI
GbyAI
B
Blog RSS Feed
博客园 - 三生石上(FineUI控件)
大猫的无限游戏
大猫的无限游戏
有赞技术团队
有赞技术团队
月光博客
月光博客
Recent Announcements
Recent Announcements
雷峰网
雷峰网
F
Fortinet All Blogs
M
MIT News - Artificial intelligence

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Sharp Hypercontractivity for Global Functions
Nathan Keller, Noam Lifshitz, Omri Marcus · 2023-07-04 · via math.CO updates on arXiv.org

For a function $f$ on the hypercube $\{0,1\}^n$ with Fourier expansion $f=\sum_{S\subseteq[n]}\hat f(S)χ_S$, the hypercontractive inequality allows bounding norms of $T_ρf=\sum_Sρ^{|S|} \hat f(S)χ_S$ in terms of norms of $f$. If $f$ is Boolean-valued, the level-$d$ inequality allows bounding the norm of $f^{=d}=\sum_{|S|=d}\hat f(S)χ_S$ in terms of $E[f]$. These inequalities play a central role in analysis of Boolean functions and its applications. While both inequalities hold in a sharp form when the hypercube is endowed with the uniform measure, they do not hold for more general discrete product spaces, and finding a `natural' generalization was a long-standing open problem. In 2024, Keevash et al.~obtained a hypercontractive inequality for general discrete product spaces, that holds for functions which are `global' -- namely, are not significantly affected by a restriction of a small set of coordinates. This hypercontractive inequality is not sharp, which precludes applications to $S_n$ and to other settings where sharpness of the bound is crucial. Also, no sharp level-$d$ inequality for global functions over general discrete product spaces is known. We obtain sharp versions of the hypercontractive inequality and of the level-$d$ inequality for this setting. Our inequalities open the way for diverse applications to extremal set theory, group theory, theoretical computer science, and number theory. We demonstrate this by proving quantitative bounds on the size of intersecting families of sets and vectors under weak symmetry conditions and by describing numerous applications that were obtained using our results -- to the study of functions over $S_n$, including hypercontractivity and level-$d$ inequalities, character bounds, variants of Roth's theorem and of Bogolyubov's lemma and diameter bounds, and an application to the Furstenberg-S{á}rk{ö}zy problem.