Related papers: Congruence Filter Pairs, Adjoints and Leibniz Hier…
We introduce combinatorial objects named matricubes that provide a generalization of the theory of matroids. As matroids provide a combinatorial axiomatization of hyperplane arrangements, matricubes provide a combinatorial axiomatization of…
Given a lattice $\mathbb{L}$ and a class $K$ of algebraic structures, we say that $\mathbb{L}$ \emph{forces nilpotency} in $K$ if every algebra $\mathbf{A} \in K$ whose congruence lattice $\mathrm{Con} (\mathbf{A})$ is isomorphic to…
Fair termination is the property of programs that may diverge "in principle" but that terminate "in practice", i.e. under suitable fairness assumptions concerning the resolution of non-deterministic choices. We study a conservative…
In this paper, we study three representations of lattices by means of a set with a binary relation of compatibility in the tradition of Plo\v{s}\v{c}ica. The standard representations of complete ortholattices and complete perfect Heyting…
We provide the set of filters (saturated submonoids) in a commutative monoid with a topology (like the spectrum of a ring) and study the resulting spaces.
Let $(C,o)$ be a complex analytic isolated curve singularity of arbitrary large embedded dimension. Its lattice cohomology ${\mathbb H}^*=\oplus_{q\geq 0}{\mathbb H}^q$ was introduced by \'Agoston and the author, each ${\mathbb H}^q$ is a…
We introduce and study several combinatorial properties of a class of symmetric polynomials from the point of view of integrable vertex models in finite lattice. We introduce the $L$-operator related with the $U_q(sl_2)$ $R$-matrix, and…
In this paper we combine many of the standard and more recent algebraic techniques for testing isomorphism of finite groups (GpI) with combinatorial techniques that have typically been applied to Graph Isomorphism. In particular, we show…
We introduce a novel model-theoretic framework inspired from graph modification and based on the interplay between model theory and algorithmic graph minors. The core of our framework is a new compound logic operating with two types of…
Grothendieck's theory of dessins provides a bridge between algebraic numbers and combinatorics. This paper adds a new concept, called 'bias', to the bridge. This produces: (i) from a biased plane tree the construction of a sequence of…
In this paper, we show that given a weakly dicomplemented lattice (WDL) $\mathcal{L}=(L; \vee, \wedge, ^{\Delta}, ^{\nabla}, 0, 1)$, $^{\Delta}$ induces a structure of a dual weakly complemented lattice in the lattice $(F(L), \subseteq)$ of…
In this paper we study a cohomology theory of compatible Leibniz algebra. We construct a graded Lie algebra whose Maurer-Cartan elements characterize the structure of compatible Leibniz algebras. Using this, we study cohomology,…
The filter quotient construction is a particular instance of a filtered colimit of categories. It has primarily been considered in the context of categorical logic, where it has been used effectively to construct non-trivial models, for…
In a previous paper, a tableau calculus has been presented, which constitute a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work extends such a calculus to multi-modal…
Flow polytopes of acyclic oriented graphs arise naturally in combinatorial optimization, and the study of their volumes and triangulations has revealed intriguing connections across combinatorics, geometry, algebra, and representation…
The paper is devoted to classification problem of finite dimensional complex none Lie filiform Leibniz algebras. The motivation to write this paper is an unpublished yet result of J.R.Gomez, B.A.Omirov on necessary and sufficient conditions…
In this article we show that hybrid type-logical grammars are a fragment of first-order linear logic. This embedding result has several important consequences: it not only provides a simple new proof theory for the calculus, thereby…
A general procedure of affinization of linear algebra structures is illustrated by the case of Leibniz algebras. Specifically, the definition of an affine Leibniz bracket, that is, a bi-affine operation on an affine space that at each…
In [A. Day, Filter monads, continuous lattices and closure systems, Can. J. Math. 27 (1975) 50--59], Day showed that continuous lattices are precisely the algebras of the open filter monad over the category of $T_0$ spaces. The aim of this…
We identify multirole logic as a new form of logic in which conjunction/disjunction is interpreted as an ultrafilter on some underlying set of roles and the notion of negation is generalized to endomorphisms on this set. We formulate both…