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

推荐订阅源

WordPress大学
WordPress大学
Jina AI
Jina AI
小众软件
小众软件
GbyAI
GbyAI
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
博客园 - 【当耐特】
D
DataBreaches.Net
腾讯CDC
V
Visual Studio Blog
博客园 - 叶小钗
B
Blog
Apple Machine Learning Research
Apple Machine Learning Research
T
The Blog of Author Tim Ferriss
S
SegmentFault 最新的问题
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
V
V2EX
博客园 - 三生石上(FineUI控件)
云风的 BLOG
云风的 BLOG
The Cloudflare Blog
MongoDB | Blog
MongoDB | Blog
有赞技术团队
有赞技术团队
U
Unit 42
博客园 - 司徒正美
博客园 - 聂微东

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}}$
Simultaneous approximation in nilsystems and the multipli...
Daniel Glasscock · 2022-07-01 · via math.CO updates on arXiv.org

In the topological dynamical system $(X,T)$, a point $x$ simultaneously approximates a point $y$ if there exists a sequence $n_1$, $n_2$, ... of natural numbers for which $T^{n_i} x$, $T^{2n_i}x$, ..., $T^{k n_i} x$ all tend to $y$. In 1978, Furstenberg and Weiss showed that every system possesses a point which simultaneously approximates itself (a multiply recurrent point) and deduced refinements of van der Waerden's theorem on arithmetic progressions. In this paper, we study the denseness of the set of points that are simultaneously approximated by a given point. We show that in a minimal nilsystem, all points simultaneously approximate a $δ$-dense set of points under a necessarily restricted set of powers of $T$. We tie this theorem to the multiplicative combinatorial properties of return-time sets, showing that all nil-Bohr sets and typical return-time sets in a minimal system are multiplicatively thick in a coset of a multiplicative subsemigroup of the natural numbers. This yields an inhomogeneous multiple recurrence result that generalizes Furstenberg and Weiss' theorem and leads to new enhancements of van der Waerden's theorem. This work relies crucially on continuity in the prolongation relation (the closure of the orbit-closure relation) developed by Auslander, Akin, and Glasner; the theory of rational points and polynomials on nilmanifolds developed by Leibman, Green, and Tao; and the machinery of topological characteristic factors developed recently by Glasner, Huang, Shao, Weiss, and Ye.