Related papers: Autometrized Lattice Ordered Monoids
We give a complete description of the congruence lattices of the following finite diagram monoids: the partition monoid, the planar partition monoid, the Brauer monoid, the Jones monoid (also known as the Temperley-Lieb monoid), the Motzkin…
Two fundamental constructions operating on residuated lattices and partially ordered monoids (pomonoids) are so-called nuclear images and conuclear images. Nuclear images allow us to construct many of the ordered algebras which arise in…
In this article we construct a combinatorial quasi-free differential graded model for the Orlik-Solomon algebra of supersolvable matroids, which generalizes in a matroidal setting the cdga of admissible graphs introduced by M. Kontsevich…
Let (L_i : i\in I) be a family of lattices in a nontrivial lattice variety V, and let \phi_i: L_i --> M, for i\in I, be isotone maps (not assumed to be lattice homomorphisms) to a common lattice M (not assumed to lie in V). We show that the…
Let L be a positive definite even lattice and V_L^+ be the fixed points of the lattice VOA V_L associated to L under an automorphism of V_L lifting the -1 isometry of L. For any positive rank, the full automotphism group of V_L^+ is…
A matroid is supersolvable if it has a maximal chain of flats each of which is modular. A matroid is saturated if every round flat is modular. In this article we present supersolvable saturated matroids as analogues to chordal graphs, and…
Divisibility monoids (resp. Garside monoids) are a natural algebraic generalization of Mazurkiewicz trace monoids (resp. spherical Artin monoids), namely monoids in which the distributivity of the underlying lattices (resp. the existence of…
We study a graded algebra D=D(L,G) defined by a finite lattice L and a subset G in L, a so-called building set. This algebra is a generalization of the cohomology algebras of hyperplane arrangement compactifications found in work of De…
We prove that the rank polynomial of the lattice of order ideals of a loop fence poset is unimodal. This poset arises as the poset of join-irreducibles in the lattice of good matchings of loop graphs associated with notched arcs.…
We extend the two-variable logic on data words with guarded regular binary predicates of the form $\widetilde{L}(x,y)$ that is true if positions $x$ and $y$ are in the same class and the factor strictly between $x$ and $y$ is in the regular…
We study a model of one-way quantum automaton where only measurement operations are allowed ($\mon$). We give an algebraic characterization of $\lmo(\Sigma)$, showing that the syntactic monoids of the languages in $\lmo(\Sigma)$ are exactly…
The construction of multigrid operators for disordered linear lattice operators, in particular the fermion matrix in lattice gauge theories, by means of algebraic multigrid and block LU decomposition is discussed. In this formalism, the…
We characterize, in terms of elementary properties, the abelian monoids which are direct limits of finite direct sums of monoids of the form $(Z/nZ)\sqcup\{0\}$ (where 0 is a new zero element), for positive integers $n$. The key properties…
In the present paper we define homogeneous algebraic systems. Particular cases of these systems are: semigroup (monoid, group) system. These algebraic systems were studied by J. Loday, A. Zhuchok, T. Pirashvili, N. Koreshkov. Quandle…
In this paper, we introduce a class of hypercompositional structures called dualizable L-mosaics. We prove that their category is equivalent to that formed by ortholattices and we formulate an algebraic property characterizing…
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…
This paper presents the first in a series of results that allow us to develop a theory providing finer control over the complexity of normalisation, and in particular of cut elimination. By considering atoms as self-dual non-commutative…
In this paper we consider some classical varieties of linear algebras over the field which has characteristic 0. For every considered variety we take a category of the finite generated free algebras of this variety. And for every this…
The Lie algebroids are generalization of the Lie algebras. They arise, in particular, as a mathematical tool in investigations of dynamical systems with the first class constraints. Here we consider canonical symmetries of Hamiltonian…
A preferential arrangement of a set is a total ordering of the elements of that set with ties allowed. A barred preferential arrangement is one in which the tied blocks of elements are ordered not only amongst themselves but also with…