scholarly journals Does the Frobenius endomorphism always generate a direct summand in the endomorphism monoids of fields of prime characteristic?

1984 ◽  
Vol 30 (3) ◽  
pp. 335-356 ◽  
Author(s):  
Péter Pröhle
Keyword(s):  
Direct Summand ◽  
Cyclic Group ◽  
Infinite Order ◽  
Main Lemma ◽  
Endomorphism Monoid ◽  
Prime Characteristic ◽  
Cancellative Monoid ◽  
Endomorphism Monoids ◽  
Technical Base ◽  
Frobenius Endomorphism

Let r be a given prime. Then a monoid M is the endomorphism monoid of a field of characteristic r if and only if either M is a finite cyclic group or M is a right cancellative monoid and M has an element of infinite order in its centre. The main lemma is the technical base of the present and other papers.

Idempotent rank in endomorphism monoids of finite independence algebras

2007 ◽  
Vol 137 (2) ◽  
pp. 303-331 ◽  
Author(s):  
R. Gray
Keyword(s):  
Proper Ideal ◽  
Endomorphism Monoid ◽  
Endomorphism Monoids ◽  
Idempotent Rank

In 1992, Fountain and Lewin showed that any proper ideal of an endomorphism monoid of a finite independence algebra is generated by idempotents. Here the ranks and idempotent ranks of these ideals are determined. In particular, it is shown that when the algebra has dimension greater than or equal to three the idempotent rank equals the rank.

scholarly journals On Finite Groups With ‘Hidden’ Primes

1971 ◽  
Vol 12 (3) ◽  
pp. 287-300 ◽  
Author(s):  
L. G. Kovács ◽  
Joachim Neubüser ◽  
B. H. Neumann
Keyword(s):  
Finite Group ◽  
Prime Number ◽  
Cyclic Group ◽  
Finite Groups ◽  
Infinite Order ◽  
Proper Subset ◽  
Minimal Set ◽  
Minimal Sets ◽  
Starting Point

The starting point of this investigation was a question put to us by Martin B. Powell: If the prime number p divides the order of the finite group G, must there be a minimal set of generators of G that contains an element whose order is divisible by p? A set of generators of G is minimal if no set with fewer elements generates G. A minimal set of generators is clearly irredundant, in the sense that no proper subset of it generates G; an irredundant set of generators, however, need not be minimal, as is easily seen from the example of a cyclic group of composite (or infinite) order. Powell's question can be asked for irredundant instead of minimal sets of generators; it turns out that the answer is not the same in these two cases. A different formulation, together with some notation, may make the situation clearer.

scholarly journals A universality result for endomorphism monoids of some ultrahomogeneous structures

2012 ◽  
Vol 55 (3) ◽  
pp. 635-656 ◽  
Author(s):  
Igor Dolinka ◽  
Dragan Mašulović
Keyword(s):  
Endomorphism Monoid ◽  
Sufficient Condition ◽  
Urysohn Space ◽  
Endomorphism Monoids ◽  
General Sufficient Condition ◽  
Countably Infinite ◽  
New Applications

AbstractWe devise a fairly general sufficient condition ensuring that the endomorphism monoid of a countably infinite ultrahomogeneous structure (i.e. a Fraïssé limit) embeds all countable semigroups. This approach not only provides us with a framework unifying the previous scattered results in this vein, but actually yields new applications for endomorphism monoids of the (rational) Urysohn space and the countable universal ultrahomogeneous semilattice.

Unicyclic graphs with regular endomorphism monoids

2016 ◽  
Vol 08 (02) ◽  
pp. 1650020 ◽  
Author(s):  
Xiaobin Ma ◽  
Dein Wong ◽  
Jinming Zhou
Keyword(s):  
Unicyclic Graph ◽  
Endomorphism Monoid ◽  
Unicyclic Graphs ◽  
Endomorphism Monoids ◽  
Odd Cycle ◽  
Open Question

The motivation of this paper comes from an open question: which graphs have regular endomorphism monoids? In this paper, we give a definitely answer for unicyclic graphs, proving that a unicyclic graph [Formula: see text] is End-regular if and only if, either [Formula: see text] is an even cycle with 4, 6 or 8 vertices, or [Formula: see text] contains an odd cycle [Formula: see text] such that the distance of any vertex to [Formula: see text] is at most 1, i.e., [Formula: see text]. The join of two unicyclic graphs with a regular endomorphism monoid is explicitly described.

scholarly journals The Bergman property for endomorphism monoids of some Fraïssé limits

2014 ◽  
Vol 26 (2) ◽  
Author(s):  
Igor Dolinka
Keyword(s):  
Semigroup Theory ◽  
Sufficient Conditions ◽  
Permutation Groups ◽  
Endomorphism Monoid ◽  
Order Structure ◽  
First Order ◽  
Endomorphism Monoids ◽  
Countably Infinite

AbstractBased on an idea of Y. Péresse and some results of Maltcev, Mitchell and Ruškuc, we present sufficient conditions under which the endomorphism monoid of a countably infinite ultrahomogeneous first-order structure has the Bergman property. This property has played a prominent role both in the theory of infinite permutation groups and, more recently, in semigroup theory. As a byproduct of our considerations, we establish a criterion for a countably infinite ultrahomogeneous structure to be homomorphism-homogeneous.

ENDOMORPHISMS OF DISTRIBUTIVE LATTICES WITH A QUANTIFIER

2007 ◽  
Vol 17 (07) ◽  
pp. 1349-1376 ◽  
Author(s):  
M. E. ADAMS ◽  
W. DZIOBIAK
Keyword(s):  
Boolean Lattice ◽  
Distributive Lattices ◽  
Endomorphism Monoid ◽  
Proper Class ◽  
Endomorphism Monoids

Let V be a non-trivial variety of bounded distributive lattices with a quantifier, as introduced by Cignoli in [7]. It is shown that if V does not contain the 4-element bounded Boolean lattice with a simple quantifier, then V contains non-isomorphic algebras with isomorphic endomorphism monoids, but there are always at most two such algebras. Further, it is shown that if V contains the 4-element bounded Boolean lattice with a simple quantifier, then it is finite-to-finite universal (in the categorical sense) and, as a consequence, for any monoid M, there exists a proper class of non-isomorphic algebras in V for which the endomorphism monoid of every member is isomorphic to M.

scholarly journals Pseudocomplemented distributive lattices with small endomorphism monoids

1983 ◽  
Vol 28 (3) ◽  
pp. 305-318 ◽  
Author(s):  
M.E. Adams ◽  
V. Koubek ◽  
J. Sichler
Keyword(s):  
The Other ◽  
Distributive Lattices ◽  
Endomorphism Monoid ◽  
Proper Class ◽  
Lattice Of Varieties ◽  
Endomorphism Monoids ◽  
Other Hand ◽  
Image Position

By a result of K.B. Lee, the lattice of varieties of pseudo-complemented distributive lattices is the ω + 1 chainwhere B−1, B0, B1 are the varieties formed by all trivial, Boolean, and Stone algebras, respectively. General theorems on relative universality proved in the present paper imply that there is a proper class of non-isomorphic algebras in B3 with finite endomorphism monoids, while every infinite algebra from B2 has infinitely many endomorphisms. The variety B4 contains a proper class of non-isomorphic algebras with endomorphism monoids consisting of the identity and finitely many right zeros; on the other hand, any algebra in B3 with a finite endomorphism monoid of this type must be finite.

scholarly journals Kleene algebras are almost universal

1986 ◽  
Vol 34 (3) ◽  
pp. 343-373 ◽  
Author(s):  
M. E. Adams ◽  
H. A. Priestley
Keyword(s):  
Boolean Algebras ◽  
Endomorphism Monoid ◽  
Single Element ◽  
Proper Class ◽  
Kleene Algebra ◽  
Endomorphism Monoids ◽  
De Morgan Algebras ◽  
Universal Variety

This paper studies endomorphism monoids of Kleene algebras. The main result is that these algebras form an almost universal variety k, from which it follows that for a given monoid M there is a proper class of non-isomorphic Kleene algebras with endomorphism monoid M+ (where M+ denotes the extension of M by a single element that is a right zero in M+). Kleene algebras form a subvariety of de Morgan algebras containing Boolean algebras. Previously it has been shown the latter are uniquely determined by their endomorphisms, while the former constitute a universal variety, containing, in particular, arbitrarily large finite rigid algebras. Non-trivial algebras in K always have non-trivial endomorphisms (so that universality of K is ruled out) and unlike the situation for de Morgan algebras the size of End(L) for a finite Kleene algebra L necessarily increases as |L| does. The paper concludes with results on endomorphism monoids of algebras in subvarieties of the variety of MS-algebras.

On Endomorphism Monoids of Finite Kleene Algebras

2019 ◽  
Vol 26 (03) ◽  
pp. 507-518
Author(s):  
Jie Fang ◽  
Zhongju Sun
Keyword(s):  
Priestley Duality ◽  
Endomorphism Monoid ◽  
Endomorphism Monoids ◽  
Injective Endomorphism

An endomorphism monoid of an algebra [Formula: see text] is said to be a band if every endomorphism on [Formula: see text] is an idempotent, and it is said to be a demi-band if every non-injective endomorphism on [Formula: see text] is an idempotent. We precisely determine finite Kleene algebras whose endomorphism monoids are demi-bands and bands via Priestley duality.

COGNITIVIZATION — THE NEXT STAGE OF INFORMATIZATION OF EDUCATION

2018 ◽  
pp. 5-11
Author(s):  
A. S. Christochevskaya ◽  
S. A. Christochevsky
Keyword(s):  
Comparative Analysis ◽  
Learning Resources ◽  
Technical Base ◽  
Initial Stage ◽  
New Knowledge ◽  
Good Material ◽  
E Learning ◽  
New Material ◽  
High Level ◽  
Paper Method

Informatization of education has been going on for 30 years. During this time, a good material and technical base appeared in schools, there are repositories of e-learning resources to which teachers have access. However, it is difficult to use these e-learning resources due to their too large number and not always high level. It is advisable to introduce a system of reviews and recommendations, to conduct a comparative analysis, as well as to make reviews of resources on a particular subject/topic. In addition, the demand for e-learning resources is affected by the fact that education authorities encourage not so much the use of e-learning resources as their development by the teacher himself. In general, the load on teachers has increased instead of the promised saving of time and effort when using the e-learning resources. At the same time, many e-learning resources are not very effective, since they do not meet the requirements of cognitiveness (they contribute not to learning, but to simple memorization of the material). It is necessary to explore the process of learning new material: this will allow you to create cognitive e-learning resources and other resources that would help you with equal probability to successfully acquire new knowledge for students belonging to different psycho-types. At the initial stage of the study of any subject, it is more expedient to use the usual “paper” method, that is, a textbook and not overload the student’s brain with excessive information. Only when he has mastered the basic provisions, we can turn to e-learning resources, bearing in mind that they must be cognitive, that is, they are aimed at logical perception and rapid intuitive learning, only in this case e-learning resources can be considered effective. The conclusion is formulated that cognitiveness is the next stage of informatization of education after the stage of electronization.

Sign in / Sign up

Export Citation Format

Share Document