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

推荐订阅源

G
Google Developers Blog
博客园 - 司徒正美
Last Week in AI
Last Week in AI
Recent Announcements
Recent Announcements
Y
Y Combinator Blog
博客园 - 聂微东
M
MIT News - Artificial intelligence
博客园_首页
Jina AI
Jina AI
博客园 - 叶小钗
酷 壳 – CoolShell
酷 壳 – CoolShell
H
Hackread – Cybersecurity News, Data Breaches, AI and More
J
Java Code Geeks
F
Fortinet All Blogs
aimingoo的专栏
aimingoo的专栏
小众软件
小众软件
Vercel News
Vercel News
The Cloudflare Blog
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
云风的 BLOG
云风的 BLOG
N
Netflix TechBlog - Medium
B
Blog
Google DeepMind News
Google DeepMind News
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More

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}}$
The Theory of Khinchin Families
Víctor J. Maciá · 2025-03-18 · via math.CO updates on arXiv.org

The theory of Khinchin families connects Probability Theory and Complex Analysis. Along this PhD thesis, we exploit this connection to obtain, using a variety of local central limit theorems, asymptotic formulas for the coefficients of analytic functions with non-negative coefficients. We give criteria for a power series to have certain specific, and in most cases, computable, asymptotic formula. The theory of Khinchin families was initiated and is strongly influenced by the work of Walter K. Hayman, Paul C. Rosembloom, and Luis Báez-Duarte. We can assign to each power series $f$ in the class $\mathcal{K}$, having radius of convergence $R>0$, a family of random variables $(X_t)_{[0,R)}$. This theory examines the behavior of this family of random variables, and also of its normalized version, as $t \uparrow R$. This thesis aims to harmonize the various asymptotic formulas for combinatorial or probabilistic objects within a single framework. With this aim we have extended some of the classes of functions and also studied the coefficients of large powers of analytic functions. One of our main goals was to consolidate and develop some aspects of a comprehensive theory: providing a guidebook for combinatorialists or probabilists, a series of results, or basic criteria, where they can follow a step-by-step process, verify if certain straightforward conditions are met, and then derive an asymptotic formula for the object of study. However, this is not the sole primary goal; we are also profoundly interested in the functional theoretical properties of these classes of functions and their connections to the respective Khinchin families (such as the case of $f \in \mathcal{K}$ being an entire function).