Results 1 to 10 of about 2,050 (70)

Hesitant Fuzzy Subalgebras, Ideals and Congruences on Autometrized Algebras [version 2; peer review: 2 approved, 1 approved with reservations] [PDF]

F1000Research
This paper introduces the study of hesitant fuzzy subalgebras of autometrized algebras, obtains some of their properties, and gives some examples. Next, we introduce the concept of the hesitant fuzzy ideal and examine some of its properties.
Gebrie Yeshiwas Tilahun
doaj   +2 more sources

Extended BCK-Ideal Based on Single-Valued Neutrosophic Hyper BCK-Ideals

Bulletin of the Section of Logic, 2023
This paper introduces the concept of single-valued neutrosophic hyper \(BCK\)-subalgebras as a generalization and alternative of hyper \(BCK\)-algebras and on any given nonempty set constructs at least one single-valued neutrosophic hyper \(BCK ...
Mohammad Hamidi
doaj   +1 more source

On tractability and congruence distributivity [PDF]

, 2007
Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi.
Emil Kiss, Matt Valeriote, Neil Immerman
core   +4 more sources

Combinatorial Hopf algebra structure on packed square matrices [PDF]

, 2015
We construct a new bigraded Hopf algebra whose bases are indexed by square matrices with entries in the alphabet $\{0, 1, ..., k\}$, $k \geq 1$, without null rows or columns.
Cheballah, Hayat, Giraudo, Samuele, Maurice, Rémi   +2 more
core   +5 more sources

Conservative constraint satisfaction re-revisited [PDF]

, 2014
Conservative constraint satisfaction problems (CSPs) constitute an important particular case of the general CSP, in which the allowed values of each variable can be restricted in an arbitrary way.
Bulatov, Andrei A.
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

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

Singly generated quasivarieties and residuated structures [PDF]

, 2019
A quasivariety K of algebras has the joint embedding property (JEP) iff it is generated by a single algebra A. It is structurally complete iff the free countably generated algebra in K can serve as A.
Anderson A. R., Bergman C., Chang C. C., Citkin A. I., Citkin A. I., Dywan Z., Esakia L. L., Esakia L. L., Galatos N., Gorbunov V. A., Jónsson B., Kuznetsov A. V., Magari R., Maltsev A. I., Maltsev A. I., Maltsev A. I., Minari P., Pogorzelski W. A., Pogorzelski W. A., Prucnal T., Rybakov V. V., Wroński A., Wroński A., Wroński A., Łoś J., Łoś J.   +25 more
core   +2 more sources

Admissibility in Finitely Generated Quasivarieties [PDF]

, 2013
Checking the admissibility of quasiequations in a finitely generated (i.e., generated by a finite set of finite algebras) quasivariety Q amounts to checking validity in a suitable finite free algebra of the quasivariety, and is therefore decidable ...
Metcalfe, George, Röthlisberger, Christoph   +1 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ří, Chen, Liang-Ting, Milius, Stefan, Urbat, Henning   +3 more
core   +2 more sources