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

推荐订阅源

aimingoo的专栏
aimingoo的专栏
宝玉的分享
宝玉的分享
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
WordPress大学
WordPress大学
V
V2EX
Apple Machine Learning Research
Apple Machine Learning Research
J
Java Code Geeks
腾讯CDC
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Engineering at Meta
Engineering at Meta
L
LangChain Blog
Jina AI
Jina AI
博客园 - 叶小钗
B
Blog RSS Feed
Recent Announcements
Recent Announcements
H
Help Net Security
小众软件
小众软件
大猫的无限游戏
大猫的无限游戏
B
Blog
云风的 BLOG
云风的 BLOG
Blog — PlanetScale
Blog — PlanetScale
D
DataBreaches.Net
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
罗磊的独立博客

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}}$
A criterion for sharpness in tree enumeration and the asy...
Robert Scherer · 2020-03-18 · via math.CO updates on arXiv.org

We prove a conjectured asymptotic formula of Kuperberg from the representation theory of the Lie algebra $G_2$. Given a non-negative sequence $(a_n)_{n\geq 1}$, the identity $B(x)=A(xB(x))$ for generating functions $A(x)=1+\sum_{n\geq 1} a_n x^n$ and $B(x)=1+\sum_{n\geq 1} b_n x^n$ determines the number $b_n$ of rooted planar trees with $n$ vertices such that each vertex having $i$ children can have one of $a_i$ distinct colors. Kuperberg proved in \cite{Kuperberg} that this identity holds in the case that $b_n=\dim \text{Inv}_{G_2} (V(λ_1)^{\otimes n})$, where $V(λ_1)$ is the 7-dimensional fundamental representation of $G_2$, and $a_n$ is the number of triangulations of a regular $n$-gon such that each internal vertex has degree at least $6$. He also observed that $\limsup_{n\to\infty}\sqrt[n]{a_n}\leq 7/B(1/7)$ and conjectured that this estimate is sharp, or in terms of power series, that the radius of convergence of $A(x)$ is exactly $B(1/7)/7$. We prove this conjecture by introducing a new criterion for sharpness in the analogous estimate for general power series $A(x)$ and $B(x)$ satisfying $B(x)=A(xB(x))$. Moreover, by way of singularity analysis performed on a recently-discovered generating function for $B(x)$, we significantly refine the conjecture by deriving an asymptotic formula for the sequence $(a_n)$.