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

推荐订阅源

小众软件
小众软件
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
WordPress大学
WordPress大学
月光博客
月光博客
Hugging Face - Blog
Hugging Face - Blog
博客园 - 聂微东
博客园 - 【当耐特】
博客园_首页
The Cloudflare Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Apple Machine Learning Research
Apple Machine Learning Research
Last Week in AI
Last Week in AI
酷 壳 – CoolShell
酷 壳 – CoolShell
大猫的无限游戏
大猫的无限游戏
雷峰网
雷峰网
量子位
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
T
Tailwind CSS Blog
IT之家
IT之家
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
GbyAI
GbyAI
V
Visual Studio Blog
F
Fortinet All Blogs
Martin Fowler
Martin Fowler

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}}$
Toric heaps, cyclic reducibility, and conjugacy in Coxete...
Shih-Wei Chao, Matthew Macauley · 2019-12-19 · via math.CO updates on arXiv.org

As a visualization of Cartier and Foata's "partially commutative monoid" theory, G.X. Viennot introduced "heaps of pieces" in 1986. These are essentially labeled posets satisfying a few additional properties. They naturally arise as models of reduced words in Coxeter groups. In this paper, we introduce a cyclic version, motivated by the idea of taking a heap and wrapping it into a cylinder. We call this object a "toric heap", as we formalize it as a labeled toric poset, which is a cyclic version of an ordinary poset. To define the concept of a toric extension, we develop a morphism in the category of toric heaps. We study toric heaps in Coxeter theory, in view of the fact that a cyclic shift of a reduced word is simply a conjugate by an initial or terminal generator. This allows us to formalize and study a framework of "cyclic reducibility" in Coxeter theory, and apply it to model conjugacy. We introduce the notion of "torically reduced", which is stronger than being cyclically reduced for group elements. This gives rise to a new class of elements called "torically fully commutative" (TFC), which are those that have a unique cyclic commutativity class, and comprise a strictly bigger class than the "cyclically fully commutative" (CFC) elements. We prove several cyclic analogues of results on fully commutative (FC) elements due to Stembridge. We conclude with how this framework fits into recent work in Coxeter groups, and we correct a minor flaw in a few recently published theorems.