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

推荐订阅源

D
Docker
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
Last Week in AI
Last Week in AI
博客园_首页
Microsoft Security Blog
Microsoft Security Blog
Blog — PlanetScale
Blog — PlanetScale
M
MIT News - Artificial intelligence
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
A
About on SuperTechFans
aimingoo的专栏
aimingoo的专栏
V
Visual Studio Blog
Jina AI
Jina AI
N
Netflix TechBlog - Medium
量子位
博客园 - 三生石上(FineUI控件)
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
I
InfoQ
J
Java Code Geeks
T
Tailwind CSS Blog
博客园 - 司徒正美
Stack Overflow Blog
Stack Overflow Blog
阮一峰的网络日志
阮一峰的网络日志
Engineering at Meta
Engineering at Meta
腾讯CDC

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}}$
Seminorm estimates and joint ergodicity for pairwise inde...
Sebastián Donoso, Andreas Koutsogiannis, Borys Kuca, Wenbo Sun, · 2024-10-19 · via math.CO updates on arXiv.org

We develop a robust structure theory for multiple ergodic averages of commuting transformations along Hardy sequences of polynomial growth. We then apply it to derive a number of novel results on joint ergodicity, recurrence and convergence. In particular, we prove joint ergodicity for (a) pairwise independent Hardy sequences and weakly mixing transformations, (b) strongly independent Hardy sequences and ergodic transformations, (c) strongly irrationally independent Hardy sequences and totally ergodic transformations. We use these joint ergodicity results to provide new recurrence results for multidimensional patterns along strongly independent Hardy sequences, showing for instance that all subsets of $\mathbb{Z}^2$ of positive upper density contain patterns of the form $$ (m_1, m_2),\; (m_1 + \lfloor n^{\sqrt{2}}\rfloor, m_2),\; (m_1, m_2 + \lfloor n^{\sqrt{2}} + n^{1/2}\rfloor).$$ Last but not least, we positively resolve the joint ergodicity classification problem for pairwise independent Hardy sequences, of which the aforementioned families are special cases. While building on recent technical advances (e.g. PET coefficient tracking schemes and joint ergodicity criteria), our work introduces a number of technical developments of its own. We construct a suitable generalization of Host-Kra and box seminorms that quantitatively control ergodic averages along Hardy sequences. We subsequently use them to obtain Host-Kra seminorm estimates for averages along all pairwise independent Hardy sequences. Furthermore, we develop an ergodic version of the quantitative concatenation argument that has recently found extensive use in combinatorics, number theory and harmonic analysis. Lastly, we obtain new simultaneous Taylor approximations for Hardy sequences, a crucial ingredient to deal with the aforementioned classes of Hardy sequences.