Results 61 to 70 of about 6,864 (172)
Monoid Varieties with Extreme Properties
Finite monoids that generate monoid varieties with uncountably many subvarieties seem rare, and, surprisingly, no finite monoid is known to generate a monoid variety with countably infinitely many subvarieties.
Lee, Edmond W. H., Jackson, Marcel
core +1 more source
Characterizing Topologically Dense Injective Acts and Their Monoid Connections
In this paper, we explore the concept of topologically dense injectivity of monoid acts. It is shown that topologically dense injective acts constitute a class strictly larger than the class of ordinary injective ones.
Masoomeh Hezarjaribi Dastaki +2 more
doaj +1 more source
Topological Structures Induced by General Fuzzy Automata Based on Lattice-ordered Monoid
The fundamental role of algebraic properties in the development of the basics of computer science has led researchers to study the concepts of fuzzy automaton separatedness, connectedness, and reversibility on a large scale.In this paper, the general ...
khadijeh abolpour
doaj
The asymptotic Mahler measure of Gaussian periods
Abstract We construct a sequence of cyclotomic integers (Gaussian periods) of particularly small Mahler measure/height. We study the asymptotics of their Mahler measure as a function of their conductor, to find that the growth rate is the (multivariate) Mahler measure of a family of log Calabi–Yau varieties of increasing dimension.
Gunther Cornelissen +2 more
wiley +1 more source
Ideals of Lattice Ordered Monoid
In this project the notion of an ideal of a lattice ordered monoid A is introduced. The notion of congruence relations on a lattice ordered monoid (l-monoid) A is also introduced and its relation with ideals of A is investigated.
Alemu, Baye
core +1 more source
Abstract This paper investigates the maximal subgroups of a free projection‐generated regular ∗$*$‐semigroup PG(P)${{\textsf {PG}}}(P)$ over a projection algebra P$P$, and their relationship to the maximal subgroups of the free idempotent‐generated semigroup IG(E)${{\textsf {IG}}}(E)$ over the corresponding biordered set E=E(P)$E = {{\textsf {E}}}(P)$.
James East +3 more
wiley +1 more source
The Order of Generalized Hypersubstitutions of Type τ=(2)
The order of hypersubstitutions, all idempotent elements on the monoid of all hypersubstitutions of type τ=(2) were studied by K. Denecke and Sh. L. Wismath and all idempotent elements on the monoid of all hypersubstitutions of type τ=(2,2) were studied ...
Wattapong Puninagool +1 more
doaj +1 more source
Computing Bonds Between Formal Contexts
ABSTRACT The notion of bond was introduced as a technique to aggregate information from multiple datasets without modifying the information already present in each of the datasets. This notion has been extended to several fuzzy frameworks, including the residuated lattice setting, which we also consider in this paper.
Roberto G. Aragón +2 more
wiley +1 more source
In this work, we construct a homotopy theory for a class of intersection graphs arising from topological monoids. We introduce the M-intersection graph of a τe-monoid, where the vertices correspond to proper τe-submonoids and adjacency is defined by ...
Maryam F. Alshammari +2 more
doaj +1 more source
Oppenheim–Schur inequalities for causal products
Abstract We establish a class of Oppenheim–Schur‐type inequalities for the convolutional Jury product of positive semidefinite matrices. These results extend the classical Schur and Oppenheim inequalities associated with the Hadamard product to a causal convolutional setting.
Dominique Guillot +2 more
wiley +1 more source

