English
Related papers

Related papers: The Affine Tamari Lattice

200 papers

A mixed lattice is a partially ordered set with two mixed partial orderings that are linked by asymmetric upper and lower envelopes. These notions generalize the join and meet operations of a lattice. In the present paper, we study…

Group Theory · Mathematics 2025-02-20 Jani Jokela

The aim of this work is focused on linearizing and found the Lax Pairs of the algebraic complete integrability (a.c.i) Toda lattice associated with the twisted affine Lie algebra \(a_4^{\left(2\right)}\). Firstly, we recall that our case of…

Exactly Solvable and Integrable Systems · Physics 2025-01-07 Bruce Lionnel Lietap Ndi , Djagwa Dehainsala , Joseph Dongho

In this paper, we define a property, trimness, for lattices. Trimness is a not-necessarily-graded generalization of distributivity; in particular, if a lattice is trim and graded, it is distributive. Trimness is preserved under taking…

Combinatorics · Mathematics 2007-05-23 Hugh Thomas

We introduce a new poset structure on Dyck paths where the covering relation is a particular case of the relation inducing the Tamari lattice. We prove that the transitive closure of this relation endows Dyck paths with a lattice structure.…

Combinatorics · Mathematics 2025-05-16 Jean-Luc Baril , Sergey Kirgizov , Mehdi Naima

In this paper, we explain how the Tamari lattice arises in the context of the representation theory of quivers, as the poset whose elements are the torsion classes of a directed path quiver, with the order relation given by inclusion.

Representation Theory · Mathematics 2011-10-14 Hugh Thomas

The Cambrian lattices, introduced in (Reading, 2006), generalize the Tamari lattice to any choice of Coxeter element in any finite Coxeter group. They are further generalized to the m-Cambrian lattices (Stump, Thomas, Williams, 2015).…

Combinatorics · Mathematics 2025-04-21 Clément Chenevière , Wenjie Fang , Corentin Henriet

Let A be a connected hereditary artin algebra. We show that the set of functorially finite torsion classes of A-modules is a lattice if and only if A is either representation-finite (thus a Dynkin algebra) or A has only two simple modules.…

Representation Theory · Mathematics 2014-02-07 Claus Michael Ringel

For a positive integer n, we denote by SUB (resp., SUBn) the class of all lattices that can be embedded into the lattice Co(P) of all order-convex subsets of a partially ordered set P (resp., P of length at most n). We prove the following…

General Mathematics · Mathematics 2007-05-23 Marina V. Semenova , Friedrich Wehrung

We show how cyclic $(f,\sigma,\delta)$-codes over finite rings canonically induce a $\mathbb{Z}$-lattice in $\mathbb{R}^N$ by using certain quotients of orders in nonassociative division algebras defined using the skew polynomial $f$. This…

Information Theory · Computer Science 2021-04-13 Susanne Pumpluen

In this paper we systematically study a simple class of translation-symmetry protected topological orders in quantum spin systems using slave-particle approach. The spin systems on square lattice are translation invariant, but may break any…

Strongly Correlated Electrons · Physics 2013-05-29 Su-Peng Kou , Xiao-Gang Wen

We elaborate on the notion of a filtration of an operad defined in terms of a lattice-valued operad serving as an indexing object. That covers ordinary integer-indexed filtrations of associative algebras and operads as a special case, yet…

Rings and Algebras · Mathematics 2024-11-01 Denis Bashkirov

A vertical 2-sum of a two-coatom lattice $L$ and a two-atom lattice $U$ is obtained by removing the top of $L$ and the bottom of $U$, and identifying the coatoms of $L$ with the atoms of $U$. This operation creates one or two nonisomorphic…

Combinatorics · Mathematics 2020-07-08 Jukka Kohonen

One fruitful motivating principle of much research on the family of integrable systems known as ``Toda lattices'' has been the heuristic assumption that the periodic Toda lattice in an affine Lie algebra is directly analogous to the…

solv-int · Physics 2008-02-03 M. Quinn , S. F. Singer

This paper primarily studies monomial ideals by their associated lcm-lattices. It first introduces notions of weak coordinatizations of finite atomic lattices which have weaker hypotheses than coordinatizations and shows the…

Combinatorics · Mathematics 2019-01-04 Peng He , Xue-ping Wang

We introduce new combinatorial objects, the interval- posets, that encode intervals of the Tamari lattice. We then find a combinatorial interpretation of the bilinear operator that appears in the functional equation of Tamari intervals…

Combinatorics · Mathematics 2015-02-27 Viviane Pons , Grégory Chatel

We define and study noncommutative crossing partitions which are a generalization of non-crossing partitions. By introducing a new cover relation on binary trees, we show that the partially ordered set of noncommutative crossing partitions…

Combinatorics · Mathematics 2022-11-22 Keiichi Shigechi

We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among FINITE graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the…

Logic · Mathematics 2021-04-01 Gábor Czédli

For each complete meet-semilattice $M$, we define an operator $\mathsf{Pop}_M:M\to M$ by \[\mathsf{Pop}_M(x)=\bigwedge(\{y\in M:y\lessdot x\}\cup\{x\}).\] When $M$ is the right weak order on a symmetric group, $\mathsf{Pop}_M$ is the…

Combinatorics · Mathematics 2022-01-03 Colin Defant

A series of integral lattices parametrised by integers $k,m,n$ are introduced and investigated, where $n$ is the rank of the lattice, including the root lattices described in a uniform way and unimodular lattices such as the Niemeier…

Combinatorics · Mathematics 2024-04-08 Atsushi Matsuo , Hiroki Shimakura

It is well known by analysts that a concept lattice has an exponential size in the data. Thus, as soon as he works with real data, the size of the concept lattice is a fundamental problem. In this chapter, we propose to investigate factor…

Discrete Mathematics · Computer Science 2015-11-20 Jean-François Viaud , Karell Bertet , Christophe Demko , Rokia Missaoui