SearcharxivSearch

arXiv subjects

Volker Gebhardt

Publications and source records attributed to Volker Gebhardt.

At least 19 recordsLinked to original sources

Isomorphism of relative holomorphs and matrix similarity

Let $V$ be a finite-dimensional vector space over the field with $p$ elements, where $p$ is a prime number. Given arbitrary $\alpha,\beta\in \mathrm{GL}(V)$, we consider the semidirect products $V\rtimes\langle \alpha\rangle$ and $V\rtimes\langle \beta\rangle$, and show that if $V\rtimes\langle \alpha\rangle$ and $V\rtimes\langle \beta\rangle$ are isomorphic, then $\alpha$ must be similar to a power of $\beta$ that generates the same subgroup as $\beta$; that is, if $H$ and $K$ are cyclic subgroups of $\mathrm{GL}(V)$ such that $V\rtimes H\cong V\rtimes K$, then $H$ and $K$ must be conjugate subgroups of $\mathrm{GL}(V)$. If we remove the cyclic condition, there exist examples of non-isomorphic, let alone non-conjugate, subgroups $H$ and $K$ of $\mathrm{GL}(V)$ such that $V\rtimes H\cong V\rtimes K$. Even if we require that non-cyclic subgroups $H$ and $K$ of $\mathrm{GL}(V)$ be abelian, we may still have $V\rtimes H\cong V\rtimes K$ with $H$ and $K$ non-conjugate in $\mathrm{GL}(V)$, but in this case, $H$ and $K$ must at least be isomorphic. If we replace $V$ by a free module $U$ over ${\mathbf Z}/p^m{\mathbf Z}$ of finite rank, with $m>1$, it may happen that $U\rtimes H\cong U\rtimes K$ for non-conjugate cyclic subgroups of $\mathrm{GL}(U)$. If we completely abandon our requirements on $V$, a sufficient criterion is given for a finite group $G$ to admit non-conjugate cyclic subgroups $H$ and $K$ of $\mathrm{Aut}(G)$ such that $G\rtimes H\cong G\rtimes K$. This criterion is satisfied by many groups.

math.GR

A path-deformation framework for determining weighted genome rearrangement distance

Measuring the distance between two bacterial genomes under the inversion process is usually done by assuming all inversions to occur with equal probability. Recently, an approach to calculating inversion distance using group theory was introduced, and is effective for the model in which only very short inversions occur. In this paper, we show how to use the group-theoretic framework to establish minimal distance for any weighting on the set of inversions, generalizing previous approaches. To do this we use the theory of rewriting systems for groups, and exploit the Knuth--Bendix algorithm, the first time this theory has been introduced into genome rearrangement problems. The central idea of the approach is to use existing group theoretic methods to find an initial path between two genomes in genome space (for instance using only short inversions), and then to deform this path to optimality using a confluent system of rewriting rules generated by the Knuth--Bendix algorithm.

math.CO

Constructing unlabelled lattices

We present an improved orderly algorithm for constructing all unlabelled lattices up to a given size, that is, an algorithm that constructs the minimal element of each isomorphism class relative to some total order. Our algorithm employs a stabiliser chain approach for cutting branches of the search space that cannot contain a minimal lattice; to make this work, we grow lattices by adding a new layer at a time, as opposed to adding one new element at a time, and we use a total order that is compatible with this modified strategy. The gain in speed is between one and two orders of magnitude. As an application, we compute the number of unlabelled lattices on 20 elements.

math.CO

On parabolic subgroups of Artin-Tits groups of spherical type

We show that, in an Artin-Tits group of spherical type, the intersection of two parabolic subgroups is a parabolic subgroup. Moreover, we show that the set of parabolic subgroups forms a lattice with respect to inclusion. This extends to all Artin-Tits groups of spherical type a result that was previously known for braid groups. To obtain the above results, we show that every element in an Artin-Tits group of spherical type admits a unique minimal parabolic subgroup containing it. Also, the subgroup associated to an element coincides with the subgroup associated to any of its powers or roots. As a consequence, if an element belongs to a parabolic subgroup, all its roots belong to the same parabolic subgroup. We define the simplicial complex of irreducible parabolic subgroups, and we propose it as the analogue, in Artin-Tits groups of spherical type, of the celebrated complex of curves which is an important tool in braid groups, and more generally in mapping class groups. We conjecture that the complex of irreducible parabolic subgroups is $δ$-hyperbolic.

math.GR

On the penetration distance in Garside monoids

We prove that the exponential growth rate of the regular language of penetration sequences is smaller than the growth rate of the regular language of normal form words, if the acceptor of the regular language of normal form words is strongly connected. Moreover, we show that the latter property is satisfied for all irreducible Artin monoids of spherical type, extending a result by Caruso. Our results establish that the expected value of the penetration distance $pd(x,y)$ in an irreducible Artin monoid of spherical type is bounded independently of the length of $x$, if $x$ is chosen uniformly among all elements of given canonical length and $y$ is chosen uniformly among all atoms; the latter in particular explains observations made by Thurston in the context of the braid group, and it shows that all irreducible Artin monoids of spherical type exhibit an analogous behaviour. Our results also give an affirmative answer to a question posed by Dehornoy.

math.GR

Bacterial phylogeny in the Cayley graph

Many models of genome rearrangement involve operations (e.g. inversions and translocations) that are self-inverse, and hence generate a group acting on the space of genomes. This gives a correspondence between genome arrangements and the elements of a group, and consequently, between evolutionary paths and walks on the Cayley graph. Many common methods for phylogeny reconstruction rely on calculating the minimal distance between two genomes; this omits much of the other information available from the Cayley graph. In this paper we begin an exploration of some of this additional information, in particular describing the phylogeny as a Steiner tree within the Cayley graph, and exploring the "interval" between two genomes. While motivated by problems in systematic biology, many of these ideas are of independent group-theoretic interest.

math.GR

Zappa-Szép products of Garside monoids

A monoid $K$ is the internal Zappa-Szép product of two submonoids, if every element of $K$ admits a unique factorisation as the product of one element of each of the submonoids in a given order. This definition yields actions of the submonoids on each other, which we show to be structure preserving. We prove that $K$ is a Garside monoid if and only if both of the submonoids are Garside monoids. In this case, these factors are parabolic submonoids of $K$ and the Garside structure of $K$ can be described in terms of the Garside structures of the factors. We give explicit isomorphisms between the lattice structures of $K$ and the product of the lattice structures on the factors that respect the Garside normal forms. In particular, we obtain explicit natural bijections between the normal form language of $K$ and the product of the normal form languages of its factors.

math.GR

Group-theoretic models of the inversion process in bacterial genomes

The variation in genome arrangements among bacterial taxa is largely due to the process of inversion. Recent studies indicate that not all inversions are equally probable, suggesting, for instance, that shorter inversions are more frequent than longer, and those that move the terminus of replication are less probable than those that do not. Current methods for establishing the inversion distance between two bacterial genomes are unable to incorporate such information. In this paper we suggest a group-theoretic framework that in principle can take these constraints into account. In particular, we show that by lifting the problem from circular permutations to the affine symmetric group, the inversion distance can be found in polynomial time for a model in which inversions are restricted to acting on two regions. This requires the proof of new results in group theory, and suggests a vein of new combinatorial problems concerning permutation groups on which group theorists will be needed to collaborate with biologists. We apply the new method to inferring distances and phylogenies for published Yersinia pestis data.

math.GR

Normal forms of random braids

Analysing statistical properties of the normal forms of random braids, we observe that, except for an initial and a final region whose lengths are uniformly bounded (that is, the bound is independent of the length of the braid), the distributions of the factors of the normal form of sufficiently long random braids depend neither on the position in the normal form nor on the lengths of the random braids. Moreover, when multiplying a braid on the right, the expected number of factors in its normal form that are modified, called the "expected penetration distance", is uniformly bounded. We explain these observations by analysing the growth rates of two regular languages associated to normal forms of elements of Garside groups, respectively to the modification of a normal form by right multiplication. A universal bound on the expected penetration distance in a Garside group yields in particular an algorithm for computing normal forms that has linear expected running time.

math.GR

Algorithms for Garside calculus

Garside calculus is the common mechanism that underlies a certain type of normal form for the elements of a monoid, a group, or a category. Originating from Garside's approach to Artin's braid groups, it has been extended to more and more general contexts, the latest one being that of categories and what are called Garside families. One of the benefits of this theory is to lead to algorithms solving effectively the naturally occurring problems, typically the Word Problem. The aim of this paper is to present and solve these algorithmic questions in the new extended framework.

math.GR

Computing growth functions of braid monoids and counting vertex-labelled bipartite graphs

We derive a recurrence relation for the number of simple vertex-labelled bipartite graphs with given degrees of the vertices and use this result to obtain a new method for computing the growth function of the Artin monoid of type $A_{n-1}$ with respect to the simple elements (permutation braids) as generators. Instead of matrices of size $2^{n-1}\times 2^{n-1}$, we use matrices of size $p(n)\times p(n)$, where $p(n)$ is the number of partitions of $n$.

math.GR

Generating random braids

We present an algorithm to generate positive braids of a given length as words in Artin generators with a uniform probability. The complexity of this algorithm is polynomial in the number of strands and in the length of the generated braids. As a byproduct, we describe a finite state automaton accepting the language of lexicographically minimal representatives of positive braids that has the minimal possible number of states, and we prove that its number of states is exponential in the number of strands.

math.GR

Finite index subgroups of mapping class groups

Let $g\geq3$ and $n\geq0$, and let ${\mathcal{M}}_{g,n}$ be the mapping class group of a surface of genus $g$ with $n$ boundary components. We prove that ${\mathcal{M}}_{g,n}$ contains a unique subgroup of index $2^{g-1}(2^{g}-1)$ up to conjugation, a unique subgroup of index $2^{g-1}(2^{g}+1)$ up to conjugation, and the other proper subgroups of ${\mathcal{M}}_{g,n}$ are of index greater than $2^{g-1}(2^{g}+1)$. In particular, the minimum index for a proper subgroup of ${\mathcal{M}}_{g,n}$ is $2^{g-1}(2^{g}-1)$.

math.GT

The cyclic sliding operation in Garside groups

We present a new operation to be performed on elements in a Garside group, called cyclic sliding, which is introduced to replace the well known cycling and decycling operations. Cyclic sliding appears to be a more natural choice, simplifying the algorithms concerning conjugacy in Garside groups and having nicer theoretical properties. We show, in particular, that if a super summit element has conjugates which are 'rigid' (that is, which have a certain particularly simple structure), then the optimal way of obtaining such a rigid conjugate through conjugation by positive elements is given by iterated cyclic sliding.

math.GR

Solving the conjugacy problem in Garside groups by cyclic sliding

We present a solution to the conjugacy decision problem and the conjugacy search problem in Garside groups, which is theoretically simpler than the usual one, with no loss of efficiency. This is done by replacing the well known cycling and decycling operations by a new one, called cyclic sliding, which appears to be a more natural choice. We give an analysis of the complexity of our algorithm in terms of fundamental operations with simple elements, so our analysis is valid for every Garside group. This paper intends to be self-contained, not requiring any previous knowledge of prior algorithms, and includes all the details for the algorithm to be implemented on a computer.

math.GR

On the cycling operation in braid groups

The cycling operation is a special kind of conjugation that can be applied to elements in Artin's braid groups, in order to reduce their length. It is a key ingredient of the usual solutions to the conjugacy problem in braid groups. In their seminal paper on braid-cryptography, Ko, Lee et al. proposed the {\it cycling problem} as a hard problem in braid groups that could be interesting for cryptography. In this paper we give a polynomial solution to that problem, mainly by showing that cycling is surjective, and using a result by Maffre which shows that pre-images under cycling can be computed fast. This result also holds in every Artin-Tits group of spherical type. On the other hand, the conjugacy search problem in braid groups is usually solved by computing some finite sets called (left) ultra summit sets (left-USS), using left normal forms of braids. But one can equally use right normal forms and compute right-USS's. Hard instances of the conjugacy search problem correspond to elements having big (left and right) USS's. One may think that even if some element has a big left-USS, it could possibly have a small right-USS. We show that this is not the case in the important particular case of rigid braids. More precisely, we show that the left-USS and the right-USS of a given rigid braid determine isomorphic graphs, with the arrows reversed, the isomorphism being defined using iterated cycling. We conjecture that the same is true for every element, not necessarily rigid, in braid groups and Artin-Tits groups of spherical type.

math.GT

Conjugacy in Garside Groups III: Periodic braids

An element in Artin's braid group B_n is said to be periodic if some power of it lies in the center of B_n. In this paper we prove that all previously known algorithms for solving the conjugacy search problem in B_n are exponential in the braid index n for the special case of periodic braids. We overcome this difficulty by putting to work several known isomorphisms between Garside structures in the braid group B_n and other Garside groups. This allows us to obtain a polynomial solution to the original problem in the spirit of the previously known algorithms. This paper is the third in a series of papers by the same authors about the conjugacy problem in Garside groups. They have a unified goal: the development of a polynomial algorithm for the conjugacy decision and search problems in B_n, which generalizes to other Garside groups whenever possible. It is our hope that the methods introduced here will allow the generalization of the results in this paper to all Artin-Tits groups of spherical type.

math.GT