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

推荐订阅源

博客园 - 三生石上(FineUI控件)
S
SegmentFault 最新的问题
Jina AI
Jina AI
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
IT之家
IT之家
美团技术团队
V
Visual Studio Blog
人人都是产品经理
人人都是产品经理
博客园 - 叶小钗
有赞技术团队
有赞技术团队
GbyAI
GbyAI
宝玉的分享
宝玉的分享
腾讯CDC
M
MIT News - Artificial intelligence
博客园 - 【当耐特】
Google DeepMind News
Google DeepMind News
月光博客
月光博客
MyScale Blog
MyScale Blog
Last Week in AI
Last Week in AI
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
博客园 - 司徒正美
Recent Announcements
Recent Announcements
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}}$
On structural connections between sandpile monoids and we...
Roozbeh Hazrat, Tran Giang Nam · 2024-12-08 · via math.CO updates on arXiv.org

In this article, we establish the relations between a sandpile graph, its sandpile monoid and the weighted Leavitt path algebra associated with it. Namely, we show that the lattice of all idempotents of the sandpile monoid $\text{SP}(E)$ of a sandpile graph $E$ is both isomorphic to the lattice of all nonempty saturated hereditary subsets of $E$, the lattice of all order-ideals of $\text{SP}(E)$ and the lattice of all ideals of the weighted Leavitt path algebra $L_{K}(E, ω)$ generated by vertices. Also, we describe the sandpile group of a sandpile graph $E$ via archimedean classes of $\text{SP}(E)$, and prove that all maximal subgroups of $\text{SP}(E)$ are exactly the Grothendieck groups of these archimedean classes. Finally, we give the structure of the Leavitt path algebra $L_{K}(E)$ of a sandpile graph $E$ via a finite chain of graded ideals being invariant under every graded automorphism of $L_{K}(E)$, and completely describe the structure of $L_{K}(E)$ such that the lattice of all idempotents of $\text{SP}(E)$ is a chain. Consequently, we completely describe the structure of the weighted Leavitt path algebra of a sandpile graph $E$ such that $\text{SP}(E)$ has exactly two idempotents.