English
Related papers

Related papers: $\downarrow$-posets

200 papers

We completely determine all lower-modular elements of the lattice of all semigroup varieties. As a corollary, we show that a lower-modular element of this lattice is modular.

Group Theory · Mathematics 2010-05-03 V. Yu. Shaprynskii , B. M. Vernikov

In this paper we study maximal chains in certain lattices constructed from powers of chains by iterated lax colimits in the $2$-category of posets. Such a study is motivated by the fact that in lower dimensions, we get some familiar…

Combinatorics · Mathematics 2020-10-06 Zurab Janelidze , Helmut Prodinger , Francois van Niekerk

Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being…

Combinatorics · Mathematics 2020-12-23 Matthew McDevitt , Nik Ruskuc

A partial order $\prec$ on $[n]$ is naturally labelled (NL) if $x\prec y$ implies $x<y$. We establish a bijection between {3, 2+2}-free NL posets and 12-34-avoiding permutations, determine functional equations satisfied by their generating…

Combinatorics · Mathematics 2024-12-20 David Bevan , Gi-Sang Cheon , Sergey Kitaev

Let A be an associative algebra with identity over a field k. An atomistic subsemiring R of the lattice of subspaces of A, endowed with the natural product, is a subsemiring which is a closed atomistic sublattice. When R has no zero…

Rings and Algebras · Mathematics 2017-01-03 Daniel S. Sage

This paper studies topological properties of the lattices of non-crossing partitions of types A and B and of the poset of injective words. Specifically, it is shown that after the removal of the bottom and top elements (if existent) these…

Combinatorics · Mathematics 2011-04-13 Myrto Kallipoliti , Martina Kubitzke

A poset is called upper homogeneous, or "upho," if all of its principal order filters are isomorphic to the whole poset. In previous work of the first author, it was shown that each (finite-type N-graded) upho lattice has associated to it a…

Combinatorics · Mathematics 2026-01-29 Sam Hopkins , Joel B. Lewis

Earlier an arbitrary poset $P$ was proved to be isomorphic to the collection of subsets of a space $M$ with two closures which are closed in the first closure and open in the other. As a space $M$ for this representation an algebraic dual…

General Topology · Mathematics 2007-05-23 R. Breslav , A. Stavrova , R. R. Zapatrin

Laplante-Anfossi associated to each rooted plane tree a polytope called an operahedron. He also defined a partial order on the vertex set of an operahedron and asked if the resulting poset is a lattice. We answer this question in the…

Combinatorics · Mathematics 2024-02-21 Colin Defant , Andrew Sack

We develop a hierarchy of semilattice bases (S-bases) for frames. For a given (unbounded) meet-semilattice $A$, we analyze the interval in the coframe of sublocales of the frame of downsets of $A$ formed by all frames with the S-base $A$.…

General Topology · Mathematics 2024-04-24 G. Bezhanishvili , F. Dashiell , A. Razafindrakoto , J. Walters-Wayland

We show that the separative quotient of the poset (P(L),\subset) of isomorphic suborders of a countable scattered linear order L is \sigma-closed and atomless. So, under the CH, all these posets are forcing-equivalent (to P(\omega)/Fin).

Logic · Mathematics 2017-09-26 Milos S. Kurilic

We describe four natural operad structures on the vector space generated by isomorphism classes of finite posets. The three last ones are set-theoretical and can be seen as a simplified version of the first, the same way the NAP operad…

Combinatorics · Mathematics 2016-09-30 Frédéric Fauvet , Loïc Foissy , Dominique Manchon

Using the operators of taking upper and lower cones in a poset with a unary operation, we define operators M(x,y) and R(x,y) in the sense of multiplication and residuation, respectively, and we show that by using these operators, a general…

Logic · Mathematics 2018-09-27 Ivan Chajda , Helmut Länger

We survey all known examples of finite posets whose order polynomials have product formulas, and we propose the heuristic that these are the same posets with good dynamical behavior. Here the dynamics in question are the actions of…

Combinatorics · Mathematics 2024-08-09 Sam Hopkins

The purpose of this paper is to study the generalization of inverse semigroups (without order). An ordered semigroup S is called an inverse ordered semigroup if for every a 2 S, any two inverses of a are H-related. We prove that an ordered…

Group Theory · Mathematics 2019-05-13 A. Jamadar , K. Hansda

A classical tensor product $A \,\otimes\, B$ of complete lattices $A$ and $B$, consisting of all down-sets in $A \times B$ that are join-closed in either coordinate, is isomorphic to the complete lattice $Gal(A,B)$ of Galois maps from $A$…

Category Theory · Mathematics 2016-12-20 Marcel Erné , Jorge Picado

A toric arrangement is an arrangement of subtori of codimension one in a real or complex torus. The poset of layers is the set of connected components of non-empty intersections of these subtori, partially ordered by reverse inclusion. In…

Combinatorics · Mathematics 2017-08-25 Matthias Lenz

For each composition $\vec{c}$ we show that the order complex of the poset of pointed set partitions $\Pi^{\bullet}_{\vec{c}}$ is a wedge of spheres of the same dimension with the multiplicity given by the number of permutations with…

Combinatorics · Mathematics 2013-12-10 Richard Ehrenborg , JiYoon Jung

In a totally ordered set the notion of sorting a finite sequence is defined through a suitable permutation of the sequence's indices. In this paper we prove a simple formula that explicitly describes how the elements of a sequence are…

Discrete Mathematics · Computer Science 2013-06-03 Jens Gerlach

We define toric partial orders, corresponding to regions of graphic toric hyperplane arrangements, just as ordinary partial orders correspond to regions of graphic hyperplane arrangements. Combinatorially, toric posets correspond to finite…

Combinatorics · Mathematics 2012-11-20 Mike Develin , Matthew Macauley , Victor Reiner
‹ Prev 1 8 9 10 Next ›