English
Related papers

Related papers: Operahedron Lattices

200 papers

In this paper, we study the lattice properties of posets of torsion pairs in the module category of a family of representation-finite gentle algebras called tiling algebras, introduced by Coelho Simoes and Parsons. We present a…

Representation Theory · Mathematics 2016-09-13 Alexander Garver , Thomas McConville

A planar order is a special linear extension of the edge poset (partially ordered set) of a processive plane graph. The definition of a planar order makes sense for any finite poset and is equivalent to the one of a conjugate order. Here it…

Combinatorics · Mathematics 2023-08-21 Xuexing Lu

Problems related to projections on closed convex cones are frequently encountered in optimization theory and related fields. To study these problems, various unifying ideas have been introduced, including asymmetric vector-valued norms and…

Optimization and Control · Mathematics 2022-04-11 Jani Jokela

We introduce $\delta$-cliffs, a generalization of permutations and increasing trees depending on a range map $\delta$. We define a first lattice structure on these objects and we establish general results about its subposets. Among them, we…

Combinatorics · Mathematics 2022-04-11 Camille Combe , Samuele Giraudo

Every lattice is isomorphic to a lattice whose elements are sets of sets, and whose operations are intersection and an operation extending the union of two sets of sets A and B by the set of all sets in which the intersection of an element…

Logic · Mathematics 2007-05-23 K. Dosen

Using the notion of series parallel interval order, we propose a unified setting to describe Dyck lattices and Tamari lattices (two well known lattice structures on Catalan objects) in terms of basic notions of the theory of posets. As a…

Combinatorics · Mathematics 2010-07-13 Filippo Disanto , Luca Ferrari , Renzo Pinzani , Simone Rinaldi

A distributive lattice $L$ with minimum element $0$ is called decomposable if $a$ and $b$ are not comparable elements in $L$ then there exist $\overline{a},\overline{b}\in L$ such that $a=\overline{a}\vee(a\wedge b),…

Group Theory · Mathematics 2010-06-22 Xinmin Lu , Dongsheng Liu , Zhinan Qi , Hourong Qin

As algebraic semantics of the logic of quantum mechanics there are usually used orthomodular posets, i.e. bounded posets with a complementation which is an antitone involution and where the join of orthogonal elements exists and the…

Rings and Algebras · Mathematics 2019-11-14 Ivan Chajda , Miroslav Kolařík , Helmut Länger

Every reduced ring $R$ has a natural partial order defined by $a\le b$ if $a^2=ab$; it generalizes the natural order on a boolean ring. The article examines when $R$ is a lower semi-lattice in this order with examples drawn from weakly Baer…

Rings and Algebras · Mathematics 2018-02-21 W. D. Burgess , R. Raphael

Given a finite subset $A$ of a distributive lattice, its total orderization $to(A)$ is a natural transformation of $A$ into a totally ordered set. Recently, the author showed that multivariate maps on distributive lattices which remain…

Functional Analysis · Mathematics 2024-02-05 Christopher Michael Schwanke

For a lattice L, let Princ L denote the ordered set of principal congruences of L. In a pioneering paper, G. Gratzer characterized the ordered sets Princ L of finite lattices L; here we do the same for countable lattices. He also showed…

Rings and Algebras · Mathematics 2013-05-09 Gabor Czedli

We introduce a new class of lattices, the modernistic lattices, and their duals, the comodernistic lattices. We show that every modernistic or comodernistic lattice has shellable order complex. We go on to exhibit a large number of examples…

Combinatorics · Mathematics 2017-05-17 Jay Schweig , Russ Woodroofe

We investigate whether the set of subfit elements of a distributive semilattice is an ideal. This question was raised by the second author at the BLAST conference in 2022. We show that in general it has a negative solution, however if the…

General Topology · Mathematics 2025-03-26 Guram Bezhanishvili , James Madden , M. Andrew Moshier , Marcus Tressl , Joanne Walters-Wayland

The W-set of an element of a weak order poset is useful in the cohomological study of the closures of spherical subgroups in generalized flag varieties. We explicitly describe in a purely combinatorial manner the W-sets of the weak order…

Combinatorics · Mathematics 2014-09-16 Mahir Bilen Can , Michael Joyce , Benjamin Wyser

We prove that the acyclic reorientation poset of a directed acyclic graph $D$ is a lattice if and only if the transitive reduction of any induced subgraph of $D$ is a forest. We then show that the acyclic reorientation lattice is always…

Combinatorics · Mathematics 2025-06-30 Vincent Pilaud

We define and study the canonical complex of a finite semidistributive lattice $L$. It is the simplicial complex on the join or meet irreducible elements of $L$ which encodes each interval of $L$ by recording the canonical join…

Combinatorics · Mathematics 2023-11-14 Doriann Albertin , Vincent Pilaud

It is well known that the point group of the root lattice D_6 admits the icosahedral group as a maximal subgroup. The generators of the icosahedral group H_3, its roots and weights are determined in terms of those of D_6. Platonic and…

Metric Geometry · Mathematics 2020-12-14 Abeer Al-Siyabi , Nazife Ozdes Koca , Mehmet Koca

Let $\Lb$ be a lattice in a Euclidean space $E$, with kissing number $s$ and perfection rank $r$, that is, the rank in $\End^{\text{sym}}(E)$ of the set of orthogonal projections to minimal vectors of $\Lb$. This defines a space of…

Number Theory · Mathematics 2007-05-23 Anne-Marie Bergé Jacques Martinet

Rook matroids were recently introduced by the author and Alexandersson as matroids whose bases arise from certain restricted rook placements on a skew-shaped board. They were shown to be a subclass of transversal matroids and positroids. We…

Combinatorics · Mathematics 2025-09-29 Aryaman Jal

We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…

Logic in Computer Science · Computer Science 2017-01-12 Noam Zeilberger
‹ Prev 1 8 9 10 Next ›