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

推荐订阅源

博客园 - 三生石上(FineUI控件)
S
SegmentFault 最新的问题
阮一峰的网络日志
阮一峰的网络日志
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
雷峰网
雷峰网
Apple Machine Learning Research
Apple Machine Learning Research
WordPress大学
WordPress大学
博客园 - 司徒正美
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
宝玉的分享
宝玉的分享
爱范儿
爱范儿
月光博客
月光博客
The GitHub Blog
The GitHub Blog
M
MIT News - Artificial intelligence
H
Hackread – Cybersecurity News, Data Breaches, AI and More
B
Blog
T
Tailwind CSS Blog
美团技术团队
D
Docker
V
Visual Studio Blog
Martin Fowler
Martin Fowler
博客园 - 聂微东
The Cloudflare Blog

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}}$
Quasicrystal Structure of Fundamental Quasisymmetric Func...
Florence Maas-Gariépy · 2023-02-15 · via math.CO updates on arXiv.org

We use crystals of tableaux and descent compositions to understand the decomposition of Schur functions $s_λ$ into Gessel's fundamental quasisymmetric functions $F_α$. The connected crystal of tableaux $B(λ)$, associated to $s_λ$, is shown to be partitionned into a disjoint union of connected induced subgraphs $B(T_α)$ corresponding to the $F_α$'s. We show that these subgraphs, which we call quasicrystals, are isomorphic (as graphs) to specific crystals of tableaux. This allows us to give a formula for the number of tableaux of shape $λ$ and maximal entry $n$. We also use this setting to give a constructive proof of a combinatorial formula for Kostka numbers $K^λ_μ$. We study the position of the quasicrystals within the crystal $B(λ)$, and show that they appear in dually positionned pairs, with the crystal anti-automorphism between them being given by a generalization of Schützenberger's evacuation. We introduce the notion of skeleton of the crystal $B(λ)$ given by replacing each subgraph $B(T_α)$ by the associated standard tableau of shape $λ$. We conjecture that its graph includes the dual equivalence graph for $λ$, introduced by Assaf, and that its subgraphs of tableaux with fixed number of descents have particular structures. Finally, we describe applications to plethysm, among which we give an algorithm to express any symmetric sum of fundamental quasisymmetric functions into the Schur basis, whose construction gives insight into the relationship between the two basis.