Results 11 to 20 of about 487 (185)
Orienteering with One Endomorphism. [PDF]
AbstractIn supersingular isogeny-based cryptography, the path-finding problem reduces to the endomorphism ring problem. Can path-finding be reduced to knowing just one endomorphism? It is known that a small degree endomorphism enables polynomial-time path-finding and endomorphism ring computation (in: Love and Boneh, ANTS XIV-Proceedings of the ...
Arpin S +5 more
europepmc +5 more sources
Analysis of endomorphisms [PDF]
In this expository article, we discuss the recent progress in the study of endomorphisms and automorphisms of the Cuntz algebras and, more generally graph C* -algebras (or Cuntz-Krieger algebras). In particular, we discuss the definition and properties of both the full and the restricted Weyl group of such an algebra.
CONTI, ROBERTO +2 more
openaire +3 more sources
Endomorphism Type of P(3m + 1,3)
There are six different classes of endomorphisms for a graph. The sets of these endomorphisms always form a chain under the inclusion of sets. In order to study these different endomorphisms more systematically, Böttcher and Knauer proposed the concept ...
Rui Gu, Hailong Hou
doaj +1 more source
On determinability of idempotent medial commutative quasigroups by their endomorphism semigroups; pp. 81–87 [PDF]
We extend the result of P. Puusemp (Idempotents of the endomorphism semigroups of groups. Acta Comment. Univ. Tartuensis, 1975, 366, 76â104) about determinability of finite Abelian groups by their endomorphism semigroups to finite idempotent medial ...
Alar Leibak, Peeter Puusemp
doaj +1 more source
Enumeration of m-endomorphisms [PDF]
To appear in Involve: A Journal of ...
Rubin, Louis, Rushton, Brian
openaire +3 more sources
A Variant of D’Alembert’s Functional Equation on Semigroups with Endomorphisms
Let S be a semigroup, and let φ, ψ: S → S be two endomorphisms (which are not necessarily involutive). Our main goal in this paper is to solve the following generalized variant of d’Alembert’s functional equation f(xϕ(y))+f(ψ(y)x)=2f(x)f(y), x,y ∈ S,
Akkaoui Ahmed +2 more
doaj +1 more source
Endomorphism Breaking in Graphs [PDF]
We introduce the endomorphism distinguishing number $D_e(G)$ of a graph $G$ as the least cardinal $d$ such that $G$ has a vertex coloring with $d$ colors that is only preserved by the trivial endomorphism. This generalizes the notion of the distinguishing number $D(G)$ of a graph $G$, which is defined for automorphisms instead of endomorphisms.As the ...
Wilfried Imrich +3 more
openaire +3 more sources
The Baer–Kaplansky Theorem for all abelian groups and modules
It is shown that the Baer–Kaplansky Theorem can be extended to all abelian groups provided that the rings of endomorphisms of groups are replaced by trusses of endomorphisms of corresponding heaps.
Simion Breaz, Tomasz Brzeziński
doaj +1 more source
On Stability of Endomorphisms [PDF]
In this note we prove a generalization of R. Mañé’s theorem. R. Mañé proved that C r
openaire +1 more source
Several open problems concerning Minkowski endomorphisms and Minkowski valuations are solved. More precisely, it is proved that all Minkowski endomorphisms are uniformly continuous but that there exist Minkowski endomorphisms that are not weakly-monotone. This answers questions posed repeatedly by various authors.
openaire +4 more sources

