Finite Representations of the braid group commutator subgroup

Abdelouahab Arouche

Home/Archive/arXiv

arXiv · 0704.1914

Finite Representations of the braid group commutator subgroup

Abdelouahab Arouche

View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the representations of the commutator subgroup K_{n} of the braid group B_{n} into a finite group . This is done through a symbolic dynamical system. Some experimental results enable us to compute the number of subgroups of K_{n} of a given (finite) index, and, as a by-product, to recover the well known fact that every representation of K_{n} into S_{r}, with n > r, must be trivial.

Explore related subjects

math.DS

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Abdelouahab Arouche. 2007-04-15. Finite Representations of the braid group commutator subgroup. https://arxiv.org/abs/0704.1914

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Dynamics of perturbed elliptical billiard tables

Dynamical billiards consist of a particle on a two-dimensional table, bouncing elastically off the boundary. The state of the system is given by two numbers: one describing the location along the curve where the bounce occurs, and another describing the incoming angle of the trajectory before the bounce. Tracking these numbers over successive bounces defines a two-dimensional area preserving map, and iterating this map gives a dynamical system first studied by Birkhoff. Although there are powerful theoretical results showing that generic (strictly convex) billiards exhibit chaotic dynamics, it is nevertheless difficult (if not impossible) to decide when a given billiard table is generic and one will often resort to numerical computations. In this paper, we employ the parameterization method to compute high order Taylor expansions of the local stable/unstable manifolds attached to periodic orbits of billiard maps. Globalizing appropriate fundamental domains locates transverse intersections, providing insight into the existence and location of chaotic invariant sets. A key step in implementing the parameterization method is computing the composition of a given polynomial with the (implicitly defined) billiard map, and we show that this can be done efficiently using the discrete Fourier transform (DFT). The DFT requires evaluating the composition on a disk in the complex plane, so that we must first extend the billiard table/map to a complex domain. This problem is addressed from a computational perspective.

math.DS↗

arXiv2026

Pressure for the space of average pseudo-orbits with block sub-additive potentials

In this paper, we introduce the concept of block sub-additive potentials and study pressures on spaces of average pseudo-orbits for $\mathbb{Z}_+$-actions generated by continuous surjections on compact metric spaces. Relative to each finite open cover, we define topological and measure-theoretic pressures and establish a local variational principle. We prove that the local topological pressure coincides with the local pressure of the induced sub-additive potential. For every invariant measure, the local measure-theoretic pressure is bounded above by the measure-theoretic pressure of the induced potential, and equality holds when the measure is ergodic. Moreover, the global topological and measure-theoretic pressures associated with block sub-additive potentials are shown to be the suprema of their local counterparts over finite open covers. Consequently, the global topological pressure coincides with the pressure of the induced sub-additive potential, yielding a global variational principle.

math.DS↗

arXiv2026

Topologically free minimal actions without dynamical comparison

We show the existence of a topologically free minimal action of $\mathbb F_\infty$ on the Cantor space that does not have dynamical comparison. Moreover, we show that this phenomenon can happen both in the presence and in the absence of invariant measures. We also show that strict comparison of the reduced crossed product C*-algebra does not imply dynamical comparison for minimal actions. Our technique involves constructing a monoid which is not almost unperforated, embedding it into a countable refinement monoid and then realising it as the type semigroup associated to a dynamical system.

math.DS↗