Related papers: Upho lattices II: ways of realizing a core
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…
In this paper we study the finite groups in which every element has prime power order, briefly them EPPO-groups. The classification of EPPO-groups is given including the cases of solvable, non-solvable and simple EPPO-groups. This paper is…
In one of our earlier works, we proposed to approximate Pareto fronts to multiobjective optimization problems by two-sided approximations, one from inside and another from outside of the feasible objective set, called, respectively, lower…
We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…
A theorem of Scott gives an upper bound for the normalized volume of lattice polygons with exactly $i>0$ interior lattice points. We will show that the same bound is true for the normalized volume of lattice polytopes of degree 2 even in…
We define the (dynamical) core of a topological polynomial (and the associated lamination). This notion extends that of the core of a unimodal interval map. Two explicit descriptions of the core are given: one related to periodic objects…
In this paper, we present several algorithms for dealing with graded components of Laurent polynomial rings. To be more precise, let $S$ be the Laurent polynomial ring $k[x_1,...,x_{r},x_{r+1}^{\pm 1},..., x_n^{\pm 1}]$, $k$ algebraicaly…
The Galois lattice is a graphic method of representing knowledge structures. The first basic purpose in this paper is to introduce a new class of Galois lattices, called graded Galois lattices. As a direct result, one can obtain the notion…
The interaction of matter with a quantized electromagnetic mode is considered. Representing a strong exciting field, the mode is assumed to contain a large number of photons. As a result, the material response is highly nonlinear: the…
We continue our work on the model theory of free lattices, solving two of the main open problems from our first paper on the subject. Our main result is that the universal (existential) theory of infinite free lattices is decidable. Our…
Given a finite dimensional representation $M$ of a finite dimensional algebra, two hierarchies of degenerations of $M$ are analyzed in the context of their natural orders: the poset of those degenerations of $M$ which share the top $M/JM$…
An orthogonality space is a set equipped with a symmetric, irreflexive relation called orthogonality. Every orthogonality space has an associated complete ortholattice, called the logic of the orthogonality space. To every poset, we…
A Leibniz class is a class of logics closed under the formation of term-equivalent logics, compatible expansions, and non-indexed products of sets of logics. We study the complete lattice of all Leibniz classes, called the Leibniz…
In this paper we discuss the notion of completeness of topologized posets and survey some recent results on closedness properties of complete topologized semilattices.
Given a symmetric monoidal category $C$ with product $\sqcup$, where the neutral element for the product is an initial object, we consider the poset of $\sqcup$-complemented subobjects of a given object $X$. When this poset has finite…
Preorder polytopes, defined from preorders on finite sets, are introduced and studied from a lattice point enumeration point of view. They naturally generalize arbor polytopes, recently introduced and studied by the second named author.…
We introduce an algorithm for computing closure systems derived from a family of implications on a set. Semilattices presentations are explored and used in conjunction with the algorithm to compute various types of lattices freely generated…
We investigate the construction of a Hausdorff uo-Lebesgue topology on a vector lattice from a Hausdorff (o)-Lebesgue topology on an order dense ideal, and what the properties of the topologies thus obtained are. When the vector lattice has…
We classify all varieties of aperiodic monoids with central idempotents whose subvariety lattice is finite or satisfies the descending chain condition or satisfies the ascending chain condition. It turns out that for varieties in this…
A matroid base polytope is a polytope in which each vertex has 0,1 coordinates and each edge is parallel to a difference of two coordinate vectors. Matroid base polytopes are described combinatorially by integral submodular functions on a…