Results 21 to 30 of about 5,622,676 (84)
The enumeration of finite rings
Abstract Let p$p$ be a fixed prime. We show that the number of isomorphism classes of finite rings of order pn$p^n$ is pα$p^\alpha$, where α=427n3+O(n5/2)$\alpha =\frac{4}{27}n^3+\mathnormal {O}(n^{5/2})$. This result was stated (with a weaker error term) by Kruse and Price in 1969; a problem with their proof was pointed out by Knopfmacher in 1973.
Simon R. Blackburn, K. Robin McLean
wiley +1 more source
Weakly binary expansions of dense meet‐trees
Abstract We compute the domination monoid in the theory DMT$\mathsf {DMT}$ of dense meet‐trees. In order to show that this monoid is well‐defined, we prove weak binarity of DMT$\mathsf {DMT}$ and, more generally, of certain expansions of it by binary relations on sets of open cones, a special case being the theory DTR$\mathsf {DTR}$ from [7].
Rosario Mennuni
wiley +1 more source
On the extreme non‐Arens regularity of Banach algebras
Abstract As is well‐known, on an Arens regular Banach algebra all continuous functionals are weakly almost periodic. In this paper, we show that ℓ1‐bases which approximate upper and lower triangles of products of elements in the algebra produce large sets of functionals that are not weakly almost periodic.
Mahmoud Filali, Jorge Galindo
wiley +1 more source
Semigroups of order-decreasing transformations [PDF]
Let X be a totally ordered set and consider the semigroups of orderdecreasing (increasing) full (partial, partial one-to-one) transformations of X. In this Thesis the study of order-increasing full (partial, partial one-to-one) transformations has been
Umar, Abdullahi
core +2 more sources
Every group is a maximal subgroup of a naturally occurring free idempotent generated semigroup [PDF]
Gray and Ruskuc have shown that any group G occurs as the maximal subgroup of some free idempotent generated semigroup IG(E) on a biordered set of idempotents E, thus resolving a long standing open question. Given the group G, they make a careful choice for E and use a certain amount of well developed machinery.
Gould, Victoria, Yang, Dandan
openaire +3 more sources
Free idempotent generated semigroups: The word problem and structure via gain graphs [PDF]
Building on the previous extensive study of Yang, Gould and the present author, we provide a more precise insight into the group-theoretical ramifications of the word problem for free idempotent generated semigroups over finite biordered sets. We prove that such word problems are in fact equivalent to the problem of computing intersections of cosets of
openaire +2 more sources
Free idempotent generated semigroups [PDF]
The study of the free idempotent generated semigroup IG$(E)$ over a biordered set $E$ began with the seminal work of Nambooripad in the 1970s and has seen a recent revival with a number of new approaches, both geometric and combinatorial.
YANG, DANDAN
core +6 more sources
Free idempotent generated semigroups over bands and biordered sets with trivial products [PDF]
For any biordered set of idempotents [Formula: see text] there is an initial object [Formula: see text], the free idempotent generated semigroup over[Formula: see text], in the category of semigroups generated by a set of idempotents biorder-isomorphic to [Formula: see text].
Yang, Dandan +1 more
openaire +2 more sources
Automatic presentations for semigroups [PDF]
Special Issue: 2nd International Conference on Language and Automata Theory and Applications (LATA 2008)This paper applies the concept of FA-presentable structures to semigroups.
Oliver, Graham +4 more
core +2 more sources
Maximal subgroups of free idempotent generated semigroups over the full linear monoid [PDF]
We show that the rank r r component of the free idempotent generated semigroup of the biordered set of the full linear ...
Dolinka, Igor, Gray, Robert D.
openaire +4 more sources

