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

推荐订阅源

B
Blog
A
About on SuperTechFans
Microsoft Security Blog
Microsoft Security Blog
Y
Y Combinator Blog
罗磊的独立博客
J
Java Code Geeks
人人都是产品经理
人人都是产品经理
MongoDB | Blog
MongoDB | Blog
The GitHub Blog
The GitHub Blog
G
Google Developers Blog
U
Unit 42
Microsoft Azure Blog
Microsoft Azure Blog
博客园 - Franky
Jina AI
Jina AI
F
Fortinet All Blogs
H
Help Net Security
B
Blog RSS Feed
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Last Week in AI
Last Week in AI
博客园 - 司徒正美
云风的 BLOG
云风的 BLOG
M
MIT News - Artificial intelligence
C
Check Point Blog
GbyAI
GbyAI

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 Affine Tamari Lattice
Grant Barkley, Colin Defant · 2025-02-11 · via math.CO updates on arXiv.org

Given a fixed integer $n\geq 2$, we construct two new finite lattices that we call the cyclic Tamari lattice and the affine Tamari lattice. The cyclic Tamari lattice is a sublattice and a quotient lattice of the cyclic Dyer lattice, which is the infinite lattice of translation-invariant total orders under containment of inversion sets. The affine Tamari lattice is a quotient of the Dyer lattice, which in turn is a quotient of the cyclic Dyer lattice and is isomorphic to the collection of biclosed sets of the root system of type $\widetilde{A}_{n-1}$ under inclusion. We provide numerous combinatorial and algebraic descriptions of these lattices using translation-invariant total orders, translation-invariant binary in-ordered trees, noncrossing arc diagrams, torsion classes, triangulations, and translation-invariant noncrossing partitions. The cardinalities of the cyclic and affine Tamari lattices are the Catalan numbers of types $B_n$ and $D_n$, respectively. We show that these lattices are self-dual and semidistributive, and we describe their decompositions coming from the Fundamental Theorem of Finite Semidistributive Lattices. We also show that the rowmotion operators on these lattices have well-behaved orbit structures, which we describe via the cyclic sieving phenomenon. Our new combinatorial framework allows us to prove that the lengths of maximal green sequences for the completed path algebra of the oriented $n$-cycle are precisely the integers in the interval $[2n-1,\binom{n+1}{2}]$.