Related papers: Finite transducers for divisibility monoids
For a finite lattice L, the congruence lattice Con L of L can be easily computed from the partially ordered set J(L) of join-irreducible elements of L and the join-dependency relation D\_L on J(L). We establish a similar version of this…
A distributive lattice with zero is completely normal if its prime ideals form a root system under set inclusion.Every such lattice admits a binary operation (x,y) \mapsto x-y satisfying the rules x \leq y\vee (x-y) and (x-y) \wedge (y-x)=0…
A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating…
Generalizing a well known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the nodes of T correspond to minors of M that are either 3-connected or circuits or cocircuits,…
The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…
For a given complete lattice L, we investigate whether L can be decomposed as a direct product of directly indecomposable lattices. We prove that this is the case if every element of L is a join of join-irreducible elements and dually, thus…
There is a longstanding conjecture, due to Gregory Cherlin and Boris Zilber, that all simple groups of finite Morley rank are simple algebraic groups. One of the major theorems in the area is Borovik's trichotomy theorem. The "trichotomy"…
A subunit in a monoidal category is a subobject of the monoidal unit for which a canonical morphism is invertible. They correspond to open subsets of a base topological space in categories such as those of sheaves or Hilbert modules. We…
We study the problem when every matrix over a division ring is representable as either the product of traceless matrices or the product of semi-traceless matrices, and also give some applications of such decompositions. Specifically, we…
We generalize the well-studied notion of a modular pair of a finite matroid to arbitrary families of sets in infinite matroids, and use it to develop the theory of infinite matroids in several as-yet-unexplored areas. Our results include a…
In this paper we study structural properties of residuated lattices that are idempotent as monoids. We provide descriptions of the totally ordered members of this class and obtain counting theorems for the number of finite algebras in…
The problem of determining the representation type of the full transformation monoid was resolved by Ponizovskii, Putcha, and Ringel. In this paper, we present a similar result for the monoid of binary relations, a partial result for the…
The aim of this paper is to develop a theory of finite transformation monoids and in particular to study primitive transformation monoids. We introduce the notion of orbitals and orbital digraphs for transformation monoids and prove a…
It is shown that the lattices of flats of boolean representable simplicial complexes are always atomistic, but semimodular if and only if the complex is a matroid. A canonical construction is introduced for arbitrary finite atomistic…
The positive existential theories of the sets $M_n(\mathbb N)$ without parameters build an inclusion lattice isomorhic with the lattice of divisibility. All these sets are algorithmically undecidable. In further sections some easier…
A split of a polytope is a (necessarily regular) subdivision with exactly two maximal cells. A polytope is totally splittable if each triangulation (without additional vertices) is a common refinement of splits. This paper establishes a…
We define and explore semireflection monoids on a finite-dimensional vector space. These are monoids generated by semireflections: linear maps fixing a subspace of codimension 1. We mostly focus on the case of projection monoids (where the…
We study algebraic and arithmetic properties of submonoids (resp. subrings) of factorial monoids (resp. factorial domains) whose non-invertible elements all lie in the conductor. This continues earlier work of Baeth, Cisto, et al.. On our…
Each restriction semigroup is proved to be embeddable in a factorisable restriction monoid, or, equivalently, in an almost factorisable restriction semigroup. It is also established that each restriction semigroup has a proper cover which…
We generalize Carlitz' result on the number of self reciprocal monic irreducible polynomials over finite fields by showing that similar explicit formula hold for the number of irreducible polynomials obtained by a fixed quadratic…