Related papers: Length in the Cremona group
In this paper, we introduce plane permutations, i.e. pairs $\mathfrak{p}=(s,\pi)$ where $s$ is an $n$-cycle and $\pi$ is an arbitrary permutation, represented as a two-row array. Accordingly a plane permutation gives rise to three distinct…
The goal of this paper is to construct and describe certain arithmetic subgroups of the automorphism group of a partially commutative group. More precisely, given an arbitrary finite graph $\Gamma$ we construct an arithmetic subgroup…
Group lattices (Cayley digraphs) of a discrete group are in natural correspondence with differential calculi on the group. On such a differential calculus geometric structures can be introduced following general recipes of noncommutative…
We study random typical minimal factorizations of the $n$-cycle into transpositions, which are factorizations of $(1, \ldots,n)$ as a product of $n-1$ transpositions. By viewing transpositions as chords of the unit disk and by reading them…
In constrast to discretized space-time approximations to continuum quantum field theories, discretized velocity space approximations to continuum quantum field theories are investigated. A four-momentum operator is given in terms of bare…
The palindromic length of a finite word $w$ is defined as the minimal number of palindromes such that their product is $w$. Clearly, this function may take different values depending on if we consider $w$ as an element a free semigroup or…
In "On the asymptotics of the growth of 2-step nilpotent groups" (J. London Math. Soc. (2), 58 (1998)), we remarked that, contrary to 2-step nilpotent simply connected Lie groups, in 3-step nilpotent simply connected Lie groups it is…
A (left) group code of length n is a linear code which is the image of a (left) ideal of a group algebra via an isomorphism from FG to Fn which maps G to the standard basis of Fn. Many classical linear codes have been shown to be group…
It is known that all degenerations of the complex projective plane into a surface with only quotient singularities are controlled by the positive integer solutions $(a,b,c)$ of the Markov equation $$x^2+y^2+z^2=3xyz.$$ It turns out that…
Determining the length of short conjugators in a group can be considered as an effective version of the conjugacy problem. The conjugacy length function provides a measure for these lengths. We study the behaviour of conjugacy length…
We study the birational self-maps of the projective plane over finite fields that induce permutations on the set of rational points. As a main result, we prove that no odd permutation arises over a non-prime finite field of characteristic…
A quasiantichain is a lattice consisting of a maximum, a minimum, and the atoms of the lattice. The width of a quasiantichian is the number of atoms. For a positive integer $w$ ($\ge 3$), a quasiantichain of width $w$ is denoted by…
The truncation operation facilitates the articulation and analysis of several aspects of the structure of archimedean vector lattices; we investigate two such aspects in this article. We refer to archimedean vector lattices equipped with a…
We establish the existence of a symmetry within the Gromov-Witten theory of $\mathbb{CP}^n$ and its blowup along points. The nature of this symmetry is encoded in the Cremona transform and its resolution, which lives on the toric variety of…
We prove that the plane Cremona group over a perfect field with at least one Galois extension of degree 8 is a non-trivial amalgam, and that it admits a surjective morphism to a free product of groups of order two.
We obtain a sharp bound for p-elementary subgroups in the plane Cremona group over an arbitrary perfect field.
The classical Hurwitz numbers count the fixed-length transitive transposition factorizations of a permutation, with a remarkable product formula for the case of minimum length (genus $0$). We study the analogue of these numbers for…
The Morimoto theorem states that each connected abelian complex Lie group $A$ can be decomposed into the direct product of a group on which all holomorphic functions are constant, finitely many copies of $\mathbb{C}^\times$ and a vector…
Szemeredi's regularity lemma is an important tool in graph theory which has applications throughout combinatorics. In this paper we prove an analogue of Szemeredi's regularity lemma in the context of abelian groups and use it to derive some…
A finite set can be supplied with a group structure which can then be used to select (classes of) differential calculi on it via the notions of left-, right- and bicovariance. A corresponding framework has been developed by Woronowicz, more…