Related papers: The reduced ring order and lower semi-lattices
We introduce a partial order structure on the set of interval orders of a given size, and prove that such a structure is in fact a lattice. We also provide a way to compute meet and join inside this lattice. Finally, we show that, if we…
Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…
We present an adaptation of two recent low-rank approximation technique proposed for first-order model reduction systems to the second-order systems. The resulting reduced order models are guaranteed to keep the second order structure which…
We explicitly describe the divisor class groups and semidualizing modules for ladder determinantal rings with coefficients in an arbitrary normal domain for arbitrary ladders, not necessarily connected, and all sizes of minors.
We associate reduced and full C*-algebras to arbitrary rings and study the inner structure of these ring C*-algebras. As a result, we obtain conditions for them to be purely infinite and simple. We also discuss several examples.…
We study rings of real-valued continuous functions in terms of pseudocomplementation conditions on various lattices attached to their prime spectrum. We fully characterize pseudocomplementation in all cases and have an almost complete…
We consider various collections of functions from the Baire space X into itself naturally arising in (effective) descriptive set theory and general topology, including computable (equivalently, recursive) functions, contraction mappings,…
We classify surjective lattice homomorphisms $W\to W'$ between the weak orders on finite Coxeter groups. Equivalently, we classify lattice congruences $\Theta$ on $W$ such that the quotient $W/\Theta$ is isomorphic to $W'$. Surprisingly,…
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…
Defining P* to be the complete lattice of upsets (ordered by reverse inclusion) of a poset P we give necessary and sufficient conditions on a subset S of P* for P to admit a meet-completion e from P to Q where e preserves the infimum of an…
A partially ordered set P is representable if there is a bounded distributive lattice such that its ordered set of prime ideals is order-isomorphic to P. We show that if the order components of a poset P are representable, then so is P.…
A rook placement is a subset of a root system consisting of positive roots with pairwise non-positive inner products. To each rook placement in a root system one can assign the coadjoint orbit of the Borel subgroup of a reductive algebraic…
For a Dedekind domain $R$ with field of fractions $K$ a classical $R$-order in a semisimple $K$-algebra $A$ is an $R$-projective $R$-subalgebra $\Lambda$ of $A$ such that $K\Lambda=A$. We study differential graded $K$-algebras which are…
We define a natural lattice structure on all subsets of a finite root system that extends the weak order on the elements of the corresponding Coxeter group. For crystallographic root systems, we show that the subposet of this lattice…
In this paper, nil extensions of some special type of ordered semigroups, such as, simple regular ordered semigroups, left simple and right regular ordered semigroup. Moreover, we have characterized complete semilattice decomposition of all…
For a lattice L with 0 and 1, let Princ L denote the ordered set of principal congruences of L. For {0,1}-sublattices A subseteq B of L, congruence generation defines a natural map from Princ A to Princ B. In this way, we obtain a small…
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…
We prove that the poset of $q$-decreasing words equipped with the componentwise order forms a lattice. We enumerate the join-irreducible elements for arbitrary $q>0$, and for any positive rational number $q$, we determine the number of…
Answering a question by Honsell and Plotkin, we show that there are two equations between lambda terms, the so-called subtractive equations, consistent with lambda calculus but not simultaneously satisfied in any partially ordered model…
In this paper we initiate the study of racks from the combined perspective of combinatorics and finite group theory. A rack R is a set with a self-distributive binary operation. We study the combinatorics of the partially ordered set {\cal…