Related papers: Formal Concept Analysis and Homotopical Combinator…
We study the L-infinity-formality problem for the Hochschild complex of the universal enveloping algebra of some examples of Lie algebras such as Cartan-3-regular quadratic Lie algebras (for example semisimple Lie algebras and in more…
In this paper we primarily study monomial ideals and their minimal free resolutions by studying their associated LCM lattices. In particular, we formally define the notion of coordinatizing a finite atomic lattice P to produce a monomial…
Based on rectangle theory of formal concept and set covering theory, the concept reduction preserving binary relations is investigated in this paper. It is known that there are three types of formal concepts: core concepts, relative…
We realize the infinitesimal Abel-Jacobi map as a morphism of formal deformation theories, realized as a morphism in the homotopy category of differential graded Lie algebras. The whole construction is carried out in a general setting, of…
We investigate the complexity of the partial order relation of Young's lattice. The definable relations are characterized by establishing the maximal definability property modulo the single automorphism given by conjugation; consequently,…
We present a unified categorical framework that connects the syntactic Henkin construction for the first-order Completeness Theorem with Lawvere's Fixed-Point Theorem. Concretely, we define two canonical functors from the category of…
In Formal Concept Analysis, a base for a finite structure is a set of implications that characterizes all valid implications of the structure. This notion can be adapted to the context of Description Logic, where the base consists of a set…
The purpose of this article is to propose and investigate a partial order structure weaker than the lattice structure and which have nice properties regarding closure operators. We extend accordingly closed pattern mining and formal concept…
We develop the theory of mixed finite elements in terms of special inverse systems of complexes of differential forms, defined over cellular complexes. Inclusion of cells corresponds to pullback of forms. The theory covers for instance…
Purpose: To develop the algebraic foundation of finite commutative ternary $\Gamma$-semirings by identifying their intrinsic invariants, lattice organization, and radical behavior that generalize classical semiring and $\Gamma$-ring…
Let H be a connected reductive group over an algebraically closed field of characteristic zero, and let G be an abstract group. In this note we show that every homomorphism from the Grothendieck semiring of H to that of G which maps…
We describe the reduced formal context of the lattice of saturated transfer systems on a finite abelian group. As an application, we compute that there are 13,784,538,270,571 saturated transfer systems on the elementary abelian group…
Finite Lorentz groups acting on 4-dimensional vector spaces coordinatized by finite fields with a prime number of elements are represented as homomorphic images of countable, rational subgroups of the Lorentz group acting on real…
As the first part of the treatise on A General Theory of Concept Lattice (I-V), this work develops the general concept lattice for the problem concerning categorization of objects according to their properties. Unlike the conventional…
This is the second installment of an exposition of an ACL2 formalization of finite group theory. The first, which was presented at the 2022 ACL2 workshop, covered groups and subgroups, cosets, normal subgroups, and quotient groups,…
An l-group G is an abelian group equipped with a translation invariant lattice order. Baker and Beynon proved that G is finitely generated projective iff it is finitely presented. A unital l-group is an l-group G with a distinguished order…
The structures $\langle M,\subseteq^M\rangle$ arising as the inclusion relation of a countable model of sufficient set theory $\langle M,\in^M\rangle$, whether well-founded or not, are all isomorphic. These structures $\langle…
Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic has to be expressive enough to allow the formalization of…
A distributive lattice structure ${\mathbf M}(G)$ has been established on the set of perfect matchings of a plane bipartite graph $G$. We call a lattice {\em matchable distributive lattice} (simply MDL) if it is isomorphic to such a…
A unital $\ell$-group is an abelian group equipped with a translation invariant lattice-order and with a distinguished strong unit, i.e. an element whose positive integer multiples eventually dominate every element of $G$.If $X$ is a…