Computing the diameter of Coxeter groups

This thesis addresses the problem of computing the minimal and maximal diameter of the Cayley graph of Coxeter groups. We first present and assert relevant parts of polytope theory and related Coxeter theory. After this, a method of contracting the orthogonal projections of a polytope from Rd onto R2 and R3, d ¸ 3 is presented. This method is the Equality Set Projection algorithm that requires a constant number of linearprogramming problems per facet of the projection in the absence of degeneracy. The ESP algorithm allows us to compute also projected geometric diameters of high-dimensional polytopes. A representation set of projected polytopes is presented to illustrate the methods adopted in this thesis.

Signature, positive Hopf plumbing and the Coxeter transformation

By a theorem of A'Campo, the eigenvalues of certain Coxeter transformations are positive real or lie on the unit circle. By optimally bounding the signature of tree-like positive Hopf plumbings from below by the genus, we prove that at least two thirds of them lie on the unit circle. In contrast, we show that for divide links, the signature cannot be linearly bounded from below by the genus.

Fundamental domains for proper affine actions of Coxeter groups in three dimensions

We study proper actions of groups $G \cong \Z/2\Z \ast \Z/2\Z \ast \Z/2\Z$ on affine space of three real dimensions. Since $G$ is nonsolvable, work of Fried and Goldman implies that it preserves a Lorentzian metric. A subgroup $\Gamma < G$ of index two acts freely, and $\R^3/\Gamma$ is a Margulis spacetime associated to a hyperbolic surface $\Sigma$. When $\Sigma$ is convex cocompact, work of Danciger, Gu{\'e}ritaud, and Kassel shows that the action of $\Gamma$ admits a polyhedral fundamental domain bounded by crooked planes. We consider under what circumstances the action of $G$ also admits a crooked fundamental domain. We show that it is possible to construct actions of $G$ that fail to admit crooked fundamental domains exactly when the extended mapping class group of $\Sigma$ fails to act transitively on the top-dimensional simplices of the arc complex of $\Sigma$. We also provide explicit descriptions of the moduli space of $G$ actions that admit crooked fundamental domains.

Practical parallel coset enumeration

Coset enumeration is a most important procedure for investigating finitely presented groups. We present a practical parallel procedure for coset enumeration on shared memory processors. The shared memory architecture is particularly interesting because such parallel computation is both faster and cheaper. The lower cost comes when the program requires large amounts of memory, and additional CPU's. allow us to lower the time that the expensive memory is being used. Rather than report on a suite of test cases, we take a single, typical case, and analyze the performance factors in-depth. The parallelization is achieved through a master-slave architecture. This results in an interesting phenomenon, whereby the CPU time is divided into a sequential and a parallel portion, and the parallel part demonstrates a speedup that is linear in the number of processors. We describe an early version for which only 40% of the program was parallelized, and we describe how this was modified to achieve 90% parallelization while using 15 slave processors and a master. In the latter case, a sequential time of 158 seconds was reduced to 29 seconds using 15 slaves.

A linear optimization technique for graph pebbling

Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge of a graph takes two pebbles from one endpoint and places one pebble at the other endpoint; the other pebble is lost in transit as a toll. It has been shown that deciding whether a supply can meet a demand on a graph is NP-complete. The pebbling number of a graph is the smallest t such that every supply of t pebbles can satisfy every demand of one pebble. Deciding if the pebbling number is at most k is NP 2 -complete. In this paper we develop a tool, called theWeight Function Lemma, for computing upper bounds and sometimes exact values for pebbling numbers with the assistance of linear optimization. With this tool we are able to calculate the pebbling numbers of much larger graphs than in previous algorithms, and much more quickly as well. We also obtain results for many families of graphs, in many cases by hand, with much simpler and remarkably shorter proofs than given in previously existing arguments (certificates typically of size at most the number of vertices times the maximum degree), especially for highly symmetric graphs. Here we apply theWeight Function Lemma to several specific graphs, including the Petersen, Lemke, 4th weak Bruhat, Lemke squared, and two random graphs, as well as to a number of infinite families of graphs, such as trees, cycles, graph powers of cycles, cubes, and some generalized Petersen and Coxeter graphs. This partly answers a question of Pachter, et al., by computing the pebbling exponent of cycles to within an asymptotically small range. It is conceivable that this method yields an approximation algorithm for graph pebbling.

Brisure de symétrie par la réduction des groupes de Lie simples à leurs sous-groupes de Lie réductifs maximaux

Dans ce travail, nous exploitons des propriétés déjà connues pour les systèmes de poids des représentations afin de les définir pour les orbites des groupes de Weyl des algèbres de Lie simples, traitées individuellement, et nous étendons certaines de ces propriétés aux orbites des groupes de Coxeter non cristallographiques. D'abord, nous considérons les points d'une orbite d'un groupe de Coxeter fini G comme les sommets d'un polytope (G-polytope) centré à l'origine d'un espace euclidien réel à n dimensions. Nous introduisons les produits et les puissances symétrisées de G-polytopes et nous en décrivons la décomposition en des sommes de G-polytopes. Plusieurs invariants des G-polytopes sont présentés. Ensuite, les orbites des groupes de Weyl des algèbres de Lie simples de tous types sont réduites en l'union d'orbites des groupes de Weyl des sous-algèbres réductives maximales de l'algèbre. Nous listons les matrices qui transforment les points des orbites de l'algèbre en des points des orbites des sous-algèbres pour tous les cas n<=8 ainsi que pour plusieurs séries infinies des paires d'algèbre-sous-algèbre. De nombreux exemples de règles de branchement sont présentés. Finalement, nous fournissons une nouvelle description, uniforme et complète, des centralisateurs des sous-groupes réguliers maximaux des groupes de Lie simples de tous types et de tous rangs. Nous présentons des formules explicites pour l'action de tels centralisateurs sur les représentations irréductibles des algèbres de Lie simples et montrons qu'elles peuvent être utilisées dans le calcul des règles de branchement impliquant ces sous-algèbres.

ON CLOSED GEODESICS IN THE LEAF SPACE OF SINGULAR RIEMANNIAN FOLIATIONS

In this paper we prove the existence of closed geodesics in the leaf space of some classes of singular Riemannian foliations (s.r.f.), namely s.r.fs. that admit sections or have no horizontal conjugate points. We also investigate the shortening process with respect to Riemannian foliations.

Presentazioni di gruppi con generatori e relazioni

La struttura di gruppo è una delle strutture algebriche più semplici e importanti della matematica. Un gruppo si può descrivere in vari modi: uno dei più interessanti è la presentazione per generatori e relazioni. Sostanzialmente presentare un gruppo per generatori e relazioni significa dire quali specifiche ”regole di calcolo” e semplificazione valgono nel gruppo in considerazione oltre a quelle che derivano dagli assiomi di gruppo. Questo porta in particolare alla definizione di gruppo libero. Un gruppo libero non ha regole di calcolo oltre quelle derivanti dagli assiomi di gruppo. Ogni gruppo è un quoziente di un gruppo libero su un appropriato insieme di generatori per un sottogruppo normale, generato dalle relazioni. In questa tesi si ricordano le definizioni più importanti ed elementari della teoria dei gruppi e si passa in seguito a discutere il gruppo libero e le presentazioni di gruppi con generatori e relazioni, dando alcuni esempi. La tesi si conclude illustrando l’algoritmo di Coxeter e Todd, per enumerare le classi laterali di un sottogruppo quando si ha un gruppo presentato per generatori e relazioni.

Cutting Arcs For Torus Links And Trees

Among all torus links, we characterise those arising as links of simple plane curve singularities by the property that their fibre surfaces admit only a finite number of cutting arcs that preserve fibredness. The same property allows a characterisation of Coxeter-Dynkin trees (i.e., An , Dn , E6 , E7 and E8 ) among all positive tree-like Hopf plumbings.

Valerian does not appear to reduce symptoms for patients with chronic insomnia in general practice using a series of randomised n-of-I trials

Objectives: To investigate the effectiveness of valerian for the management of chronic insomnia in general practice. Design: Valerian versus placebo in a series of n-of-1 trials, in Queensland, Australia. Results: Of 42 enrolled patients, 24 (57%) had sufficient data for inclusion into the n-of-1 analysis. Response to valerian was fair for 23 (96%) participants evaluating their 'energy level in the previous day' but poor or modest for all 24 (100%) participants' response to 'total sleep time' and for 23 (96%) participants' response to 'number of night awakenings' and 'morning refreshment'. As a group, the proportion of treatment successes ranged from 0.35 (95% CI 0.23, 0.47) to 0.55 (95% CI 0.43, 0.67) for the six elicited outcome sleep variables. There was no significant difference in the number (P = 0.06), distribution (P = 1.00) or severity (P = 0.46) of side effects between valerian and placebo treatments. Conclusions: Valerian was not shown to be appreciably better than placebo in promoting sleep or sleep-related factors for any individual patient or for all patients as a group. (C) 2003 Elsevier Ltd. All rights reserved.

Sexual abuse in childhood and sexual dysfunction in adulthood: An Australian population-based study

This study examined self-reported adult sexual functioning in individuals reporting a history of childhood sexual abuse (CSA) in a representative sample of the Australian population. A sample of 1793 persons, aged 18-59 years, were randomly selected from the electoral roll for Australian states and territories in April 2000. Respondents were interviewed about their health status and sexual experiences, including unwanted sexual experiences before the age of 16 years. More than one-third of women and approximately one-sixth of men reported a history of CSA. Women were more likely than men to report both non-penetrative and penetrative experiences of CSA. For both sexes, there was a significant association between CSA and symptoms of sexual dysfunction. In assessing the specific nature of the relationship between sexual abuse and sexual dysfunction, statistically significant associations were, in general, evident for women only. CSA was not associated with the level of physical or emotional satisfaction respondents experienced with their sexual activity. The total number of lifetime sexual partners was significantly and positively associated with CSA for females, but not for males; however, the number of sexual partners in the last year was not related to CSA. CSA in the Australian population is common and contributes to significant impairment in the sexual functioning of adults, especially women. These consequences appear not to extend to the other areas of sexual activity considered in this study.

Sexual partner preferences: evolutionary imperative, emotional attachment or hedonism?

Data are taken from a representative sample of the Australian population to determine the qualities that are desired in a sexual partner. These qualities are considered in three categories: those reflecting the perceived reproductive value of the partner (evolutionary imperative), the emotional attachment to a partner and the pure pleasure associated with having sex. Subjects completed a telephone-based survey 876 males; 908 females; aged 18-59). The qualities respondents report they most desire in a sexual partner are that the person is someone who cares about them, and whom they love. They also rank highly the criterion that their partner should enjoy sex, and much less highly that they themselves should enjoy the sex. Evolutionary imperatives are ranked fairly low as criteria sought in a sexual partner. Males and females generally expressed similar preferences in a sexual partner, as do persons in different age groups, and persons in different marital status categories. Heterosexual males appear to place a higher emphasis on the physical appearance of a partner when compared with non-heterosexuals. [PUBLICATION ABSTRACT]