Related papers: Complete Valuations on Finite Distributive Lattice…
A residuated poset is a structure $\langle A,\le,\cdot,\backslash,/,1 \rangle$ where $\langle A,\le \rangle$ is a poset and $\langle A,\cdot,1 \rangle$ is a monoid such that the residuation law $x\cdot y\le z\iff x\le z/y\iff y\le…
The set of weights of a finite-dimensional representation of a reductive Lie algebra has a natural poset structure ("weight poset"). Studying certain combinatorial problems related to antichains in weight posets, we realised that the best…
Let $A$ be a basic finite-dimensional algebra and denote by $\operatorname{tors} A$ the collection of all all torsion classes of $A$. It has been proved in \cite{Demonet} that $\operatorname{tors} A$ is always a completely semidistributive…
In this work we investigate the transfer of fundamental order and completeness properties between truncated Riesz spaces and their unitizations. Specifically, we provide characterizations and equivalences for several notions of…
We study the computational problem of checking whether a quantified conjunctive query (a first-order sentence built using only conjunction as Boolean connective) is true in a finite poset (a reflexive, antisymmetric, and transitive directed…
We outline the theory of sets with distributive operations: multishelves and multispindles, with examples provided by semi-lattices, lattices and skew lattices. For every such a structure we define multi-term distributive homology and show…
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…
Poset-theoretic generalizations of set-theoretic committee constructions are presented. The structure of the corresponding subposets is described. Sequences of irreducible fractions associated to the principal order ideals of finite bounded…
Let $G$ be an acylic directed graph. For each vertex $g \in G$, we define an involution on the independent sets of $G$. We call these involutions flips, and use them to define a new partial order on independent sets of $G$. Trim lattices…
We initiate a systematic study of the perfection of affine group schemes of finite type over fields of positive characteristic. The main result intrinsically characterises and classifies the perfections of reductive groups, and obtains a…
We prove that an irreducible lattice acting on a product of two or more locally finite, biregular trees is finitely generated.
We analyze the periodicity of optimal long products of matrices. A set of matrices is said to have the finiteness property if the maximal rate of growth of long products of matrices taken from the set can be obtained by a periodic product.…
We consider finitary approximations of the (embedding) Ramsey property. Using a class of homogeneous reducts of random ordered hypergraphs, we prove that these properties form a strict hierarchy. We also show that every class of finite…
Properties of several sorts of lattices of convex subsets of R^n are examined. The lattice of convex sets containing the origin turns out, for n>1, to satisfy a set of identities strictly between those of the lattice of all convex subsets…
In this paper, we study dot-product sets and $k$-simplices in vector spaces over finite rings. We show that if $E$ is sufficiently large then the dot-product set of $E$ covers the whole ring. In higher dimensional cases, if $E$ is…
We prove that every finite distributive lattice is isomorphic to a final segment of the d.c.e. Turing degrees (i.e., the degrees of differences of computably enumerable sets). As a corollary, we are able to infer the undecidability of the…
We say that two partial orders on $[n]$ are compatible if there exists a partial order that refines both of them. This compatibility relation induces a natural set system structure between the collection $\mathcal{F}$ of all partial orders…
A finite ranked poset is called a symmetric chain order if it can be written as a disjoint union of rank-symmetric, saturated chains. If $P$ is any symmetric chain order, we prove that $P^n/\mathbb{Z}_n$ is also a symmetric chain order,…
The main scope of this paper is to introduce valuation semirings in general and discrete valuation semirings in particular. In order to do that, first we define valuation maps and investigate them. Then we define valuation semirings with…
Dimension is a standard and well-studied measure of complexity of posets. Recent research has provided many new upper bounds on the dimension for various structurally restricted classes of posets. Bounded dimension gives a succinct…