Publication

Kaleidoscopic groups: permutation groups constructed from dendrite homeomorphisms

Nicolas Monod
2019
Journal Articles

Abstract

Given a transitive permutation group, a fundamental object for studying its higher transitivity properties is the permutation action of its isotropy subgroup. We reverse this relationship and introduce a universal construction of infinite permutation groups that takes as input a given system of imprimitivity for its isotropy subgroup.

Official source

https://infoscience.epfl.ch/entities/publication/a207613b-6cf3-4049-a19f-fa8a25732905

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Nicolas Monod
2019
Journal Articles

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/a207613b-6cf3-4049-a19f-fa8a25732905

About this result

Related concepts (31)

Permutation group

In mathematics, a permutation group is a group G whose elements are permutations of a given set M and whose group operation is the composition of permutations in G (which are thought of as bijective functions from the set M to itself). The group of all permutations of a set M is the symmetric group of M, often written as Sym(M). The term permutation group thus means a subgroup of the symmetric group. If M = {1, 2, ..., n} then Sym(M) is usually denoted by Sn, and may be called the symmetric group on n letters.

Group action

In mathematics, a group action on a space is a group homomorphism of a given group into the group of transformations of the space. Similarly, a group action on a mathematical structure is a group homomorphism of a group into the automorphism group of the structure. It is said that the group acts on the space or structure. If a group acts on a structure, it will usually also act on objects built from that structure. For example, the group of Euclidean isometries acts on Euclidean space and also on the figures drawn in it.

Symmetric group

In abstract algebra, the symmetric group defined over any set is the group whose elements are all the bijections from the set to itself, and whose group operation is the composition of functions. In particular, the finite symmetric group defined over a finite set of symbols consists of the permutations that can be performed on the symbols. Since there are ( factorial) such permutation operations, the order (number of elements) of the symmetric group is .

Related publications (31)

High-throughput screening of Weyl semimetals

Nicola Marzari, Davide Campi, Davide Grassano

Topological Weyl semimetals represent a novel class of nontrivial materials, where band crossings with linear dispersions take place at generic momenta across reciprocal space. These crossings give rise to low -energy properties akin to those of Weyl fermi ...

Amer Physical Soc2024

Topological photonic transport in disordered scattering networks

Zhechen Zhang

This Ph.D. thesis unveils the unique topological phenomena occurring in such networks, focusing on the intricate interplay between their Floquet topology, the presence of disorder, and their unitary scattering at microscopic and macroscopic scales. Using t ...

EPFL2024

Multiplicity-free Representations of Algebraic Groups

Donna Testerman, Martin W. Liebeck

Let K be an algebraically closed field of characteristic zero, and let G be a connected reductive algebraic group over K. We address the problem of classifying triples (G, H, V ), where H is a proper connected subgroup of G, and V is a finitedimensional ir ...

Amer Mathematical Soc2024