Related papers: Linear extensions and order-preserving poset parti…

Hypergraphic polytopes $\Delta_{\mathbb{H}}$ arise as Minkowski sums of simplices indexed by the hyperedges of a hypergraph $\mathbb{H}$. Orienting the $1$-skeleton of such a polytope by a certain generic linear functional gives rise to the…

We consider embeddings of a finite complex in a sphere. We give a homotopy theoretic classification of such embeddings in a wide range.

We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along…

We study a certain poset on the free monoid on a countable alphabet. This poset is determined by the fact that its total extensions are precisely the standard term orders. We also investigate the poset classifying degree-compatible standard…

Given a group $G$, its lattice of subgroups $\mathcal{L}(G)$ can be viewed as a simplicial complex in a natural way. The inclusion of $1_G, G \in \mathcal{L}(G)$ implies that $\mathcal{L}(G)$ is contractible, and so we study the topology of…

Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…

In this paper, we compute the posets of wide subcategories and ICE-closed subcategories from the lattice of torsion classes in an abelian length category in a purely lattice-theoretical way, by using the kappa map in a completely…

We characterize numerical semigroups for which the poset of its ideal class monoid is a lattice, and study the irreducible elements of such a lattice with respect to union, intersection, infimum and supremum.

We build on the recent characterisation of congruences on the infinite twisted partition monoids $\mathcal{P}_{n}^\Phi$ and their finite $d$-twisted homomorphic images $\mathcal{P}_{n,d}^\Phi$, and investigate their algebraic and…

Lattice discretizations of continuous manifolds are common tools used in a variety of physical contexts. Conventional discrete approximations, however, cannot capture all aspects of the original manifold, notably its topology. In this paper…

Following G. Gr\"atzer and E. Knapp (2007), a slim semimodular lattice, SPS lattice for short, is a finite planar semimodular lattice having no $M_3$ as a sublattice. An SPS lattice is a slim rectangular lattice if it has exactly two doubly…

Finite smooth digraphs, that is, finite directed graphs without sources and sinks, can be partially ordered via pp-constructability. We give a complete description of this poset and, in particular, we prove that it is a distributive…

A careful study is made of embeddings of posets which have a convex range. We observe that such embeddings share nice properties with the homomorphisms of more restrictive categories; for example, we show that every order embedding between…

For a partially ordered set P, let Co(P) denote the lattice of all order-convex subsets of P. For a positive integer n, we denote by SUB(LO) (resp., SUB(n)) the class of all lattices that can be embedded into a product of lattices of convex…

Let ${\cal PO}_n$ be the semigroup of all order-preserving partial transformations of a finite chain. It is shown that there exist bijections between the set of certain lattice paths in the Cartesian plane that start at $(0,0)$, end at…

Let $G$ be a finite group. Let $U_1,U_2,\dots$ be a sequence of orthogonal representations in which any irreducible representation of $\oplus_{n \geq 1} U_n$ has infinite multiplicity. Let $V_n=\oplus_{i=1}^n U_n$ and $S(V_n)$ denote the…

We prove that a space whose topological complexity equals 1 is homotopy equivalent to some odd-dimensional sphere. We prove a similar result, although not in complete generality, for spaces X whose higher topological complexity TC_n(X) is…

The matching complex $\mathsf{M}(G)$ of a graph $G$ is a simplicial complex whose simplices are matchings in $G$. These complexes appear in various places and found applications in many areas of mathematics including computational geometry,…

Given an underlying undirected simple graph, we consider the set of all acyclic orientations of its edges. Each of these orientations induces a partial order on the vertices of our graph and, therefore, we can count the number of linear…

For positive integers k,n, we investigate the simplicial complex NM_k(n) of all graphs G on vertex set [n] such that every matching in G has size less than k. This complex (along with other associated cell complexes) is found to be homotopy…