Results 21 to 30 of about 6,775 (103)
The Lattice of Congruences of a Finite Line Frame [PDF]
, 2017 Let $\mathbf{F}=\left\langle F,R\right\rangle $ be a finite Kripke frame. A congruence of $\mathbf{F}$ is a bisimulation of $\mathbf{F}$ that is also an equivalence relation on F.
Areces, Carlos +3 more
core +2 more sources
Partial maps with domain and range: extending Schein's representation [PDF]
, 2009 The semigroup of all partial maps on a set under the operation of composition admits a number of operations relating to the domain and range of a partial map. Of particular interest are the operations R and L returning the identity on the domain of a map
Jackson, Marcel, Stokes, Tim E.
core +2 more sources
The Universal Theory of First Order Algebras and Various Reducts [PDF]
, 2015 First order formulas in a relational signature can be considered as operations on the relations of an underlying set, giving rise to multisorted algebras we call first order algebras.
Valby, Lawrence
core +1 more source
The complexity of the list homomorphism problem for graphs [PDF]
, 2010 We completely classify the computational complexity of the list H-colouring problem for graphs (with possible loops) in combinatorial and algebraic terms: for every graph H the problem is either NP-complete, NL-complete, L-complete or is first-order ...
Egri, Laszlo +3 more
core +4 more sources
Eilenberg Theorems for Free [PDF]
, 2017 Eilenberg-type correspondences, relating varieties of languages (e.g. of finite words, infinite words, or trees) to pseudovarieties of finite algebras, form the backbone of algebraic language theory.
Adámek, Jiří +3 more
core +2 more sources
Bipolar complex fuzzy subalgebras and ideals of BCK/BCI-algebras
Journal of Decision Analytics and Intelligent Computing, 2023 The conception of the bipolar complex fuzzy set (BCFS) is one of the fundamental and significant modifications of the fuzzy set (FS) to tackle the tricky and awkward information. BCFS has a rich and wider structure and has been utilized in various fields.
Tahir Mahmood, U. Rehman
semanticscholar +1 more source
Datatype Laws Without Signatures [PDF]
, 1996 Using the well-known categorical notion of `functor' one may define the concept of datatype (algebra) without being forced to introduce a signature, that is, names and typings for the individual sorts (types) and operations involved.
Fokkinga, Maarten M.
core +3 more sources
The Subpower Membership Problem for Finite Algebras with Cube Terms
, 2019 The subalgebra membership problem is the problem of deciding if a given element belongs to an algebra given by a set of generators. This is one of the best established computational problems in algebra.
Bulatov, Andrei +2 more
core +1 more source
Hopf Algebras of m-permutations, (m+1)-ary trees, and m-parking functions
, 2020 The m-Tamari lattice of F. Bergeron is an analogue of the clasical Tamari order defined on objects counted by Fuss-Catalan numbers, such as m-Dyck paths or (m+1)-ary trees.
Novelli, J. -C., Thibon, J. -Y.
core +3 more sources
Jordan homomorphisms and T‐ideals
Journal of the London Mathematical Society, Volume 113, Issue 2, February 2026.Abstract Let A$A$ and B$B$ be associative algebras over a field F$F$ with char(F)≠2${\rm char}(F)\ne 2$. Our first main result states that if A$A$ is unital and equal to its commutator ideal, then every Jordan epimorphism φ:A→B$\varphi:A\rightarrow B$ is the sum of a homomorphism and an antihomomorphism. Our second main result concerns (not necessarily
Matej Brešar, Efim Zelmanov
wiley +1 more source