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

推荐订阅源

大猫的无限游戏
大猫的无限游戏
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
C
Check Point Blog
F
Fortinet All Blogs
腾讯CDC
V
V2EX
Y
Y Combinator Blog
I
InfoQ
月光博客
月光博客
博客园 - 司徒正美
云风的 BLOG
云风的 BLOG
H
Hackread – Cybersecurity News, Data Breaches, AI and More
WordPress大学
WordPress大学
J
Java Code Geeks
D
DataBreaches.Net
Apple Machine Learning Research
Apple Machine Learning Research
M
MIT News - Artificial intelligence
The Cloudflare Blog
Jina AI
Jina AI
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
博客园 - 【当耐特】
Engineering at Meta
Engineering at Meta
B
Blog RSS Feed
P
Proofpoint News Feed

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 geometric and generating function approach to plethysm
Álvaro Gutiérrez, Rosa Orellana, Franco Saliola, Anne Schilling, · 2025-11-04 · via math.CO updates on arXiv.org

Plethysm coefficients $\mathsf{a}_{μ[ν]}^λ$ are the structure coefficients of the plethysm of Schur functions $s_μ[s_ν] = \sum_λ \mathsf{a}_{μ[ν]}^λs_λ$. We study a bivariate generating function of plethysm coefficients when $λ$ has bounded length. We show that this generating function is rational. A key step is MacMahon's combinatory analysis. When the bound on the length is $2$ we give an explicit geometric algorithm to compute it using $q$-Ehrhart theory. We give evidence that the generating function is the quantum Ehrhart series of a union of half-open polytopes and show that it satisfies a reciprocity theorem reminiscent of Ehrhart reciprocity. Furthermore, we give a set of linear recursions that completely describe the $\mathrm{SL}_2$-plethysm coefficients.