Dunkl operators, Bessel functions and the discriminant of a finite Coxeter group
Durchschnittsdarstellungen mit irreduziblen Komponenten in Ringen und in sogenannten Dualgruppen.
Dynamics of out on the boundary of outer space
Dynamics on Character Varieties and Malgrange irreducibility of Painlevé VI equation
We consider representations of the fundamental group of the four punctured sphere into . The moduli space of representations modulo conjugacy is the character variety. The Mapping Class Group of the punctured sphere acts on this space by symplectic polynomial automorphisms. This dynamical system can be interpreted as the monodromy of the Painlevé VI equation. Infinite bounded orbits are characterized: they come from -representations. We prove the absence of invariant affine structure (and invariant...
Dynamique des échanges d’intervalles des groupes de Higman-Thompson
Dans cet article, nous étudions la dynamique des échanges d’intervalles affines dont les pentes sont des puissances d’un même entier et dont les coupures et leurs images sont des rationnels. Nous montrons qu’une telle application a une dynamique très simple : toutes ses orbites sont propres et elle possède au moins une orbite périodique ou un cycle périodique. Comme corollaire de ce résultat, nous montrons que les éléments de distortion dans les groupes de Higman-Thompson sont ceux d’ordre...
Each regular code is included in a maximal regular code
Edge-Transitivity of Cayley Graphs Generated by Transpositions
Let S be a set of transpositions generating the symmetric group Sn (n ≥ 5). The transposition graph of S is defined to be the graph with vertex set {1, . . . , n}, and with vertices i and j being adjacent in T(S) whenever (i, j) ∈ S. In the present note, it is proved that two transposition graphs are isomorphic if and only if the corresponding two Cayley graphs are isomorphic. It is also proved that the transposition graph T(S) is edge-transitive if and only if the Cayley graph Cay(Sn, S) is edge-transitive....
Edon- – an efficient implementation of Edon- family of cryptographic hash functions
We have designed three fast implementations of a recently proposed family of hash functions Edon–. They produce message digests of length bits and project security of hash computations for finding collisions and hash computations for finding preimages and second preimages. The design is not the classical Merkle-Damgård but can be seen as wide-pipe iterated compression function. Moreover the design is based on using huge quasigroups of orders , and that are constructed by using only bitwise...
Efficient presentations of the group PSL(2, Z...) x PSL(2, Z...), for certain n, m.
Efficient separability in free groups.
E-free objects and E-locality for completely regular semigroups.
E-free objects in E-variétés of inverse rings.
Ein allgemeiner Sylowsatz in endlichen auflösbaren Gruppen.
Ein Analogon zur Fundamentalgruppe einer Riemann'schen Fläche im Zahlköperfall.
Ein Beispiel von Gruppen lineargebrochener Transformationen, deren Grenze eine Jordankurve ist.
Ein Beitrag zur abstrakten Primzahltheorie.
Ein fast-Jordan-Hölder Satz für Fastideale.
Ein Freiheitskriterium für pro-p-Gruppen mit Anwendung auf die Struktur der Brauer-Gruppe.
Ein gruppentheoretischer Aufbau der äquiformen Geometrie
Ein gruppentheoretisches Kriterium für die Lösbarkeit der Funktionalgleichung f(x + y) =F(f(x),f(y))