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

推荐订阅源

Martin Fowler
Martin Fowler
D
DataBreaches.Net
F
Fortinet All Blogs
阮一峰的网络日志
阮一峰的网络日志
博客园_首页
Apple Machine Learning Research
Apple Machine Learning Research
H
Help Net Security
M
MIT News - Artificial intelligence
美团技术团队
人人都是产品经理
人人都是产品经理
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
The Cloudflare Blog
有赞技术团队
有赞技术团队
L
LangChain Blog
博客园 - Franky
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
博客园 - 【当耐特】
S
SegmentFault 最新的问题
V
Visual Studio Blog
Blog — PlanetScale
Blog — PlanetScale
Hugging Face - Blog
Hugging Face - Blog
B
Blog
I
InfoQ

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Sprout Symmetric Functions: Part 1
Tewodros Amdeberhan, John Shareshian, Richard P. Stanley · 2026-05-27 · via math updates on arXiv.org

A \emph{sprout sequence} is a sequence $\frakr=(R_0=1,R_1,R_2,\dots)$ of symmetric functions in the variables $\bmx=(x_1,x_2,\dots)$ over a field $K$ generated from a power series $F(t)=1+a_1t+a_2t^2+\cdots$ by the rule $\sum_{n\geq 0}R_nt^n = \prod_{i\geq 1} F(x_it)$. The power series $F(t)$ is called the \emph{seed} of $\frakr$. This concept originated in the work of Littlewood and Richardson (though not with the name ``sprout sequence''), and numerous examples of sprout sequences have appeared in the literature. They are related to chromatic Tutte polynomials of complete graphs and complete hypergraphs, binomial posets, upper homogeneous (upho) posets, topological genera, etc. We first develop the basic theory of sprout sequences and then look at the special case $F(t)=\sec(\sqrt{t})$. We give five characterizations of sprout sequences and consider the expansion of sprout symmetric functions in terms of well-known symmetric function bases. The Schur positivity, elementary symmetric function positivity, and complete homogeneous symmetric function positivity of $R_n$ for all $n$ are completely characterized using the Edrei-Thoma theorem from the theory of total positivity. The seed $F(t)=\sec(\sqrt{t})$ is especially interesting. The expansion of $R_n$ in the power sum or monomial basis is related to alternating permutations. The Schur function expansion is related to standard Young skew tableaux. The expansion in terms of the complete symmetric functions has nonnegative integer coefficients, but we don't know a combinatorial interpretation. Finally we give a formula for $R_n$ as a sum of chromatic symmetric functions of interval orders.