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

推荐订阅源

S
SegmentFault 最新的问题
爱范儿
爱范儿
博客园 - Franky
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
WordPress大学
WordPress大学
宝玉的分享
宝玉的分享
雷峰网
雷峰网
酷 壳 – CoolShell
酷 壳 – CoolShell
IT之家
IT之家
有赞技术团队
有赞技术团队
美团技术团队
Last Week in AI
Last Week in AI
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
大猫的无限游戏
大猫的无限游戏
The Cloudflare Blog
Jina AI
Jina AI
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
Engineering at Meta
Engineering at Meta
T
Tailwind CSS Blog
J
Java Code Geeks
Martin Fowler
Martin Fowler
I
InfoQ
小众软件
小众软件
MongoDB | Blog
MongoDB | 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}}$
The sandpile model on the complete split graph: $q,t$-Sch...
Henri Derycke, Mark Dukes, Yvan Le Borgne · 2024-02-23 · via math.CO updates on arXiv.org

This paper studies sorted recurrent configurations of the Abelian sandpile model on the complete split graph. We introduce two natural toppling processes, CTI and ITC toppling, on the recurrent configurations and use these to define two toppling delay statistics, wtopple$_{CTI}$ and wtopple$_{ITC}$. These new toppling delay statistics are time-weighted sums for the number of vertices that topple during each iteration of the toppling processes. We then introduce the bivariate $q,t$-CTI and $q,t$-ITC polynomials that are the generating functions of the bistatistics (level,wtopple$_{ITC}$) and (level,wtopple$_{CTI}$), where level is the well-established sandpile level statistic. We prove the bistatistic (level,wtopple$_{ITC}$) maps to a bistatistic (area,bounce) on Schröder paths that was introduced by Egge, Haglund, Killpatrick and Kremer (2003). This establishes equality of the $q,t$-ITC polynomial and the $q,t$-Schröder polynomial of those same authors. This connection allows us to relate the $q,t$-ITC polynomial to the theory of symmetric functions and also establishes symmetry of the $q,t$-ITC polynomials. We conjecture equality of the $q,t$-CTI and $q,t$-ITC polynomials. We also present and prove a characterization of sorted recurrent configurations as a new class of polyominoes that we call sawtooth polyominoes. The CTI and ITC toppling processes on sorted recurrent configurations are proven to correspond to bounce paths within the polyominoes. The main difference between the two bounce paths is the initial direction in which they travel. In addition to this, and building on the results of Aval, D'Adderio, Dukes, and Le Borgne (2016), we present a cycle lemma for a slight extension of stable configurations that allows for an enumeration of sorted recurrent configurations within the framework of the sandpile model.