scholarly journals Lattice structure of Grassmann-Tamari orders

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Thomas McConville
Keyword(s):  
Transitive Closure ◽  
Closure Operator ◽  
Lattice Structure ◽  
Algebraic Combinatorics ◽  
Uniform Lattice ◽  
Central Object ◽  
International Audience ◽  
Congruence Uniform

International audience The Tamari order is a central object in algebraic combinatorics and many other areas. Defined as the transitive closure of an associativity law, the Tamari order possesses a surprisingly rich structure: it is a congruence-uniform lattice. In this work, we consider a larger class of posets, the Grassmann-Tamari orders, which arise as an ordering on the facets of the non-crossing complex introduced by Pylyavskyy, Petersen, and Speyer. We prove that the Grassmann-Tamari orders are congruence-uniform lattices, which resolves a conjecture of Santos, Stump, and Welker. Towards this goal, we define a closure operator on sets of paths inside a rectangle, and prove that the biclosed sets of paths, ordered by inclusion, form a congruence-uniform lattice. We then prove that the Grassmann-Tamari order is a quotient lattice of the corresponding lattice of biclosed sets. L’ordre Tamari est un objet central dans la combinatoire algébrique et de nombreux autres domaines. Définie comme la fermeture transitive d’une loi d’associativité, l’ordre Tamari possède une structure étonnamment riche: il est un treillis congruence uniforme. Dans ce travail, nous considérons une classe plus large de posets, les ordres Grassmann-Tamari, qui découlent comme un ordre sur les facettes du complexe non-croisement introduit par Pylyavskyy, Petersen, et Speyer. Nous démontrons que les ordres Grassmann-Tamari sont treillis congruence uniformes, ce qui résout une conjecture de Santos, Stump, et Welker. Pour atteindre cet objectif, nous définissons un opérateur de fermeture sur des ensembles de chemins à l’intérieur d’un rectangle, et prouver que les ensembles bifermé de chemins, ordonné par inclusion, forment un réseau de congruence uniforme. Nous démontrons ensuite que l’ordre Grassmann-Tamari est un treillis quotient du treillis correspondant d’ensembles bifermés.

scholarly journals Partitions of an Integer into Powers

2001 ◽  
Vol DMTCS Proceedings vol. AA,... (Proceedings) ◽  
Author(s):  
Matthieu Latapy
Keyword(s):  
Distributive Lattice ◽  
Lattice Structure ◽  
Tree Structure ◽  
Dynamical Model ◽  
International Audience ◽  
Partitions Of Integers ◽  
Natural Way

International audience In this paper, we use a simple discrete dynamical model to study partitions of integers into powers of another integer. We extend and generalize some known results about their enumeration and counting, and we give new structural results. In particular, we show that the set of these partitions can be ordered in a natural way which gives the distributive lattice structure to this set. We also give a tree structure which allow efficient and simple enumeration of the partitions of an integer.

scholarly journals Poset topology and homological invariants of algebras arising in algebraic combinatorics

2014 ◽  
Vol DMTCS Proceedings vol. AT,... (Proceedings) ◽  
Author(s):  
Stuart Margolis ◽  
Franco Saliola ◽  
Benjamin Steinberg
Keyword(s):  
Commutative Algebra ◽  
Homological Algebra ◽  
Algebraic Combinatorics ◽  
Combinatorial Topology ◽  
International Audience ◽  
Homological Invariants ◽  
New Interpretation ◽  
Poset Topology

International audience We present a beautiful interplay between combinatorial topology and homological algebra for a class of monoids that arise naturally in algebraic combinatorics. We explore several applications of this interplay. For instance, we provide a new interpretation of the Leray number of a clique complex in terms of non-commutative algebra.

scholarly journals Brick polytopes, lattices and Hopf algebras

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Vincent Pilaud
Keyword(s):  
Hopf Algebra ◽  
Hopf Algebras ◽  
Transitive Closure ◽  
Weak Order ◽  
Binary Trees ◽  
International Audience ◽  
Congruence Classes

International audience Generalizing the connection between the classes of the sylvester congruence and the binary trees, we show that the classes of the congruence of the weak order on Sn defined as the transitive closure of the rewriting rule UacV1b1 ···VkbkW ≡k UcaV1b1 ···VkbkW, for letters a < b1,...,bk < c and words U,V1,...,Vk,W on [n], are in bijection with acyclic k-triangulations of the (n + 2k)-gon, or equivalently with acyclic pipe dreams for the permutation (1,...,k,n + k,...,k + 1,n + k + 1,...,n + 2k). It enables us to transport the known lattice and Hopf algebra structures from the congruence classes of ≡k to these acyclic pipe dreams, and to describe the product and coproduct of this algebra in terms of pipe dreams. Moreover, it shows that the fan obtained by coarsening the Coxeter fan according to the classes of ≡k is the normal fan of the corresponding brick polytope

scholarly journals Non-kissing complexes and tau-tilting for gentle algebras

2021 ◽  
Vol 274 (1343) ◽  
Author(s):  
Yann Palu ◽  
Vincent Pilaud ◽  
Pierre-Guy Plamondon
Keyword(s):  
Hasse Diagram ◽  
Uniform Lattice ◽  
Content Type ◽  
Gentle Algebras ◽  
Congruence Uniform ◽  
Kissing Complex ◽  
Tilting Complex

We interpret the support τ \tau -tilting complex of any gentle bound quiver as the non-kissing complex of walks on its blossoming quiver. Particularly relevant examples were previously studied for quivers defined by a subset of the grid or by a dissection of a polygon. We then focus on the case when the non-kissing complex is finite. We show that the graph of increasing flips on its facets is the Hasse diagram of a congruence-uniform lattice. Finally, we study its g \mathbf {g} -vector fan and prove that it is the normal fan of a non-kissing associahedron.

scholarly journals Lattice Structure of Some Closed Classes for Three-Valued Logic and Its Applications

Mathematics ◽  
2021 ◽  
Vol 10 (1) ◽  
pp. 94
Author(s):  
Elmira Yu. Kalimulina
Keyword(s):  
Heterogeneous Computing ◽  
Closure Operator ◽  
Lattice Structure ◽  
Point Of View ◽  
Theoretical Problem ◽  
Computing Systems ◽  
Dummy Variables ◽  
Finite Set ◽  
Heterogeneous Computing Systems ◽  
Class Of Functions

This paper provides a brief overview of modern applications of nonbinary logic models, where the design of heterogeneous computing systems with small computing units based on three-valued logic produces a mathematically better and more effective solution compared to binary models. For application, it is necessary to implement circuits composed of chipsets, the operation of which is based on three-valued logic. To be able to implement such schemes, a fundamentally important theoretical problem must be solved: the problem of completeness of classes of functions of three-valued logic. From a practical point of view, the completeness of the class of such functions ensures that circuits with the desired operations can be produced from an arbitrary (finite) set of chipsets. In this paper, the closure operator on the set of functions of three-valued logic that strengthens the usual substitution operator is considered. It is shown that it is possible to recover the sublattice of closed classes in the general case of closure of functions with respect to the classical superposition operator. The problem of the lattice of closed classes for the class of functions T2 preserving two is considered. The closure operators R1 for the functions that differ only by dummy variables are considered equivalent. This operator is withiin the scope of interest of this paper. A lattice is constructed for closed subclasses in T2={f|f(2,…,2)=2}, a class of functions preserving two.

scholarly journals Hopf algebra of permutation pattern functions

2014 ◽  
Vol DMTCS Proceedings vol. AT,... (Proceedings) ◽  
Author(s):  
Yannic Vargas
Keyword(s):  
Hopf Algebra ◽  
Hopf Algebras ◽  
Point Of View ◽  
Algebraic Combinatorics ◽  
Permutation Patterns ◽  
Permutation Pattern ◽  
International Audience ◽  
Pattern Functions

International audience We study permutation patterns from an algebraic combinatorics point of view. Using analogues of the classical shuffle and infiltration products for word, we define two new Hopf algebras of permutations related to the notion of permutation pattern. We show several remarkable properties of permutation patterns functions, as well their occurrence in other domains.

scholarly journals Finite-Element-Mesh Based Method for Modeling and Optimization of Lattice Structures for Additive Manufacturing

Materials ◽  
2018 ◽  
Vol 11 (11) ◽  
pp. 2073 ◽  
Author(s):  
Wenjiong Chen ◽  
Xiaonan Zheng ◽  
Shutian Liu
Keyword(s):  
Finite Element ◽  
Lattice Structure ◽  
Experimental Testing ◽  
Modeling Method ◽  
Finite Element Mesh ◽  
Size Optimization ◽  
Lattice Structures ◽  
Uniform Lattice ◽  
Element Mesh ◽  
Unit Cells

A parameterization modeling method based on finite element mesh to create complex large-scale lattice structures for AM is presented, and a corresponding approach for size optimization of lattice structures is also developed. In the modeling method, meshing technique is employed to obtain the meshes and nodes of lattice structures for a given geometry. Then, a parametric description of lattice unit cells based on the element type, element nodes and their connecting relationships is developed. Once the unit cell design is selected, the initial lattice structure can be assembled by the unit cells in each finite element. Furthermore, modification of lattice structures can be operated by moving mesh nodes and changing cross-sectional areas of bars. The graded and non-uniform lattice structures can be constructed easily based on the proposed modeling method. Moreover, a size optimization algorithm based on moving iso-surface threshold (MIST) method is proposed to optimize lattice structures for enhancing the mechanical performance. To demonstrate the effectiveness of the proposed method, numerical examples and experimental testing are presented, and experimental testing shows 11% improved stiffness of the optimized non-uniform lattice structure than uniform one.

scholarly journals Lattice of combinatorial Hopf algebras: binary trees with multiplicities

2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Jean-Baptiste Priez
Keyword(s):  
Hopf Algebra ◽  
Hopf Algebras ◽  
Lattice Structure ◽  
Binary Trees ◽  
Hook Length ◽  
Combinatorial Hopf Algebras ◽  
Combinatorial Hopf Algebra ◽  
International Audience ◽  
Comme Application ◽  
Premiere Partie

International audience In a first part, we formalize the construction of combinatorial Hopf algebras from plactic-like monoids using polynomial realizations. Thank to this construction we reveal a lattice structure on those combinatorial Hopf algebras. As an application, we construct a new combinatorial Hopf algebra on binary trees with multiplicities and use it to prove a hook length formula for those trees. Dans une première partie, nous formalisons la construction d’algèbres de Hopf combinatoires à partir d’une réalisation polynomiale et de monoïdes de type monoïde plaxique. Grâce à cette construction, nous mettons à jour une structure de treillis sur ces algèbres de Hopf combinatoires. Comme application, nous construisons une nouvelle algèbre de Hopf sur des arbres binaires à multiplicités et on l’utilise pour démontrer une formule des équerressur ces arbres.

scholarly journals New Hopf Structures on Binary Trees

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Stefan Forcey ◽  
Aaron Lauve ◽  
Frank Sottile
Keyword(s):  
Hopf Algebras ◽  
Homotopy Theory ◽  
Algebraic Combinatorics ◽  
Binary Trees ◽  
Independent Interest ◽  
Hopf Module ◽  
Möbius Inversion ◽  
International Audience ◽  
Higher Categories ◽  
Donne Lieu

International audience The multiplihedra $\mathcal{M}_{\bullet} = (\mathcal{M}_n)_{n \geq 1}$ form a family of polytopes originating in the study of higher categories and homotopy theory. While the multiplihedra may be unfamiliar to the algebraic combinatorics community, it is nestled between two families of polytopes that certainly are not: the permutahedra $\mathfrak{S}_{\bullet}$ and associahedra $\mathcal{Y}_{\bullet}$. The maps $\mathfrak{S}_{\bullet} \twoheadrightarrow \mathcal{M}_{\bullet} \twoheadrightarrow \mathcal{Y}_{\bullet}$ reveal several new Hopf structures on tree-like objects nestled between the Hopf algebras $\mathfrak{S}Sym$ and $\mathcal{Y}Sym$. We begin their study here, showing that $\mathcal{M}Sym$ is a module over $\mathfrak{S}Sym$ and a Hopf module over $\mathcal{Y}Sym$. An elegant description of the coinvariants for $\mathcal{M}Sym$ over $\mathcal{Y}Sym$ is uncovered via a change of basis-using Möbius inversion in posets built on the $1$-skeleta of $\mathcal{M}_{\bullet}$. Our analysis uses the notion of an $\textit{interval retract}$ that should be of independent interest in poset combinatorics. It also reveals new families of polytopes, and even a new factorization of a known projection from the associahedra to hypercubes. Les multiplièdres $\mathcal{M}_{\bullet} = (\mathcal{M}_n)_{n \geq 1}$ forment une famille de polytopes en provenant de l'étude des catégories supérieures et de la théorie de l'homotopie. Tandis que les multiplihèdres sont peu connus dans la communauté de la combinatoire algébrique, ils sont nichés entre deux familles des polytopes qui sont bien connus: les permutahèdres $\mathfrak{S}_{\bullet}$ et les associahèdres $\mathcal{Y}_{\bullet}$. Les morphismes $\mathfrak{S}_{\bullet} \twoheadrightarrow \mathcal{M}_{\bullet} \twoheadrightarrow \mathcal{Y}_{\bullet}$ dévoilent plusieurs nouvelles structures de Hopf sur les arbres binaires entre les algèbres de Hopf $\mathfrak{S}Sym$ et $\mathcal{Y}Sym$. Nous commençons son étude ici, en démontrant que $\mathcal{M}Sym$ est un module sur $\mathfrak{S}Sym$ et un module de Hopf sur $\mathcal{Y}Sym$. Une description élégante des coinvariants de $\mathcal{M}Sym$ sur $\mathcal{Y}Sym$ est trouvée par moyen d'une change de base―en utilisant une inversion de Möbius dans certains posets construits sur le $1$-squelette de $\mathcal{M}_{\bullet}$. Notre analyse utilise la notion d'$\textit{interval retract}$, qui devrait être intéressante par soi-même dans la théorie des ensembles partiellement ordonnés. Notre analyse donne lieu également à des nouvelles familles des polytopes, et même une nouvelle factorisation d'une projection connue des associahèdres aux hypercubes.

scholarly journals Structure of Stable Sand Piles Model

2006 ◽  
Vol DMTCS Proceedings vol. AG,... (Proceedings) ◽  
Author(s):  
Thi Ha Duong Phan ◽  
Thi Thu Huong Tran
Keyword(s):  
Lattice Structure ◽  
Stable Configuration ◽  
Recursive Structure ◽  
Evolution Rule ◽  
Generating Tree ◽  
International Audience ◽  
Sand Piles ◽  
Infinite Set

International audience In this paper we study a variant of the Sand Piles Model, where the evolution rule consists of the falling down of one grain to a random column and an avalanche to reach a stable configuration. We prove that the infinite set of all stable configurations have a lattice structure which is a sublattice of Young lattice. At the end, based on a discussion about avalanches, we construct a generating tree of this model and show its strongtly recursive structure.

Sign in / Sign up

Export Citation Format

Share Document