共查询到20条相似文献,搜索用时 46 毫秒
1.
Let W be a finite Coxeter group. We classify the reflection subgroups of W up to conjugacy and give necessary and sufficient conditions for the map that assigns to a reflection subgroup R of W the conjugacy class of its Coxeter elements to be injective, up to conjugacy. 相似文献
2.
Bernhard Mühlherr 《Designs, Codes and Cryptography》2000,21(1-3):189-189
3.
We obtain a number of results regarding the freeness of subgroupsof Coxeter groups, Artin groups and one-relator groups withtorsion. In the case of Coxeter groups, we also obtain resultson quasiconvexity and subgroup separability. 2000 MathematicsSubject Classification 20F65, 20F55, 20F36, 20F06. 相似文献
4.
5.
Let W be a finite Coxeter group, P a parabolic subgroup of W, and N W (P) the normalizer of P in W. We prove that every element in N W (P) is strongly real in N W (P), and that every irreducible complex character of N W (P) has Frobenius-Schur indicator 1. 相似文献
6.
Noel Brady Jonathan P. McCammond Bernhard Mühlherr Walter D. Neumann 《Geometriae Dedicata》2002,94(1):91-109
A Coxeter group is rigid if it cannot be defined by two nonisomorphic diagrams. There have been a number of recent results showing that various classes of Coxeter groups are rigid, and a particularly interesting example of a nonrigid Coxeter group has been given by Bernhard Mühlherr. We show that this example belongs to a general operation of diagram twisting. We show that the Coxeter groups defined by twisted diagrams are isomorphic, and, moreover, that the Artin groups they define are also isomorphic, thus answering a question posed by Charney. Finally, we show a number of Coxeter groups are reflection rigid once twisting is taken into account. 相似文献
7.
In the first part of the paper we give a characterization of groups generated by elements of fixed prime order p. In the second part we study the group G n (p) of n × n matrices with the pth power of the determinant equal to 1 over a field F containing a primitive pth root of 1. It is known that the group G n (2) of n × n matrices of determinant ± 1 over a field F and the group SL n (F) are generated by their involutions and that each element in these groups is a product of four involutions. We consider some subgroups G of G n (p) and study the following problems: Is G generated by its elements of order p? If so, is every element of G a product of k elements of order p for some fixed integer k? We show that G n (p) and SL n (F) are generated by their elements of order p and that the bound k exists and is equal to 4. We show that every universal p-Coxeter group has faithful two-dimensional representations over many fields F (including ? and ?). For a universal p-Coxeter group of rank ≥ 2 for p ≥ 3 or of rank ≥ 3 for p = 2 there is no bound k. 相似文献
8.
A new recursive procedure of the calculation of partition numbers function W(s, d
m
) is suggested. We find its zeroes and prove a lemma on the function parity properties. The explicit formulas of W(s, d
m
) and their periods (G) for the irreducible Coxeter groups and a list for the first twelve symmetric group
m
are presented. A least common multiple
(m) of the series of the natural numbers 1,2,...,m plays a role in the period (
m
) of W(s, d
m) in
m
. 相似文献
9.
Paul E. Schupp 《Geometriae Dedicata》2003,96(1):179-198
We show that all groups in a very large class of Coxeter groups are locally quasiconvex and have a uniform membership problem solvable in quadratic time. If a group in the class satisfies a further hypothesis it is subgroup separable and relevant homomorphisms are also calculable in quadratic time. The algorithm also decides if a finitely generated subgroup has finite index. 相似文献
10.
11.
For a Coxeter group W, X a subset of W and a positive root, we define the negative orbit of under X to be {w · | w X} –, where – is the set of negative roots. Here we investigate the sizes of such sets as varies in the case when W is a finite Coxeter group and X is a conjugacy class of W. 相似文献
12.
We prove that certain hyperbolic Coxeter groups are separable on their geometrically finite subgroups. 相似文献
13.
We call an element of a Coxeter group fully covering (or a fully covering element) if
its length is equal to the number of the elements it covers in the Bruhat ordering. It is easy to see
that the notion of fully covering is a generalization of the notion of a 321-avoiding permutation
and that a fully covering element is a fully commutative element. Also, we call a Coxeter group
bi-full if its fully commutative elements coincide with its fully covering elements. We show that
the bi-full Coxeter groups are the ones of type
An,
Dn,
En with no restriction
on n. In other words,
Coxeter groups of type E9,
E10,.... are also bi-full. According to a result of Fan, a Coxeter group
is a simply-laced FC-finite Coxeter group if and only if it is a bi-full Coxeter group.AMS Subject Classification: 06A07, 20F55. 相似文献
14.
Olga Varghese 《Discrete Mathematics》2019,342(7):2100-2105
Graph products of groups and Coxeter groups are defined via vertex-edge-labeled graphs. We show that if the graph has a special shape, then the corresponding group is coherent, i.e. every finitely generated subgroup is finitely presented. 相似文献
15.
S.M.Robati 《Algebra Colloquium》2020,(2):193-198
Let G be a group,and let (→Γ)C(G) be a digraph whose vertices are the non-trivial conjugacy classes of G and there is an arc from a vertex C to a vertex C'if an... 相似文献
16.
A. G. Erschler 《Functional Analysis and Its Applications》2005,39(4):317-320
We prove that for an arbitrary function ρ of subexponential growth there exists a group G of intermediate growth whose growth function satisfies the inequality v G,S (n) ? ρ(n) for all n. For every prime p, one can take G to be a p-group; one can also take a torsion-free group G. We also discuss some generalizations of this assertion. 相似文献
17.
John R. Stembridge 《Journal of Algebraic Combinatorics》1996,5(4):353-385
Let W be a Coxeter group. We define an element w ε W to be fully commutative if any reduced expression for w can be obtained from any other by means of braid relations that only involve commuting generators. We give several combinatorial characterizations of this property, classify the Coxeter groups with finitely many
fully commutative elements, and classify the parabolic quotients whose members are all fully commutative. As applications
of the latter, we classify all parabolic quotients with the property that (1) the Bruhat ordering is a lattice, (2) the Bruhat
ordering is a distributive lattice, (3) the weak ordering is a distributive lattice, and (4) the weak ordering and Bruhat
ordering coincide.
Partially supported by NSF Grants DMS-9057192 and DMS-9401575. 相似文献
18.
19.
Gerhard RÖhrle 《Geometriae Dedicata》1997,66(1):51-64
The principal aim of this paper is to show that every maximal parabolic subgroup P of a classical reductive algebraic group G operates with a finite number of orbits on its unipotent radical. This is a consequence of the fact that each parabolic subgroup of a group of type A
n
whose unipotent radical is of nilpotent class at most two has this finiteness property. 相似文献
20.
Q. Mushtaq 《Southeast Asian Bulletin of Mathematics》2001,25(2):309-312
In this paper we are interested in triangle groups (j, k, l) where j = 2 and k = 3. The groups (j, k, l) can be considered as factor groups of the modular group PSL(2, Z) which has the presentation x, y : x2 = y3 = 1. Since PSL(2,q) is a factor group of Gk,l,m if -1 is a quadratic residue in the finite field Fq, it is therefore worthwhile to look at (j, k, l) groups as subgroups of PSL(2, q) or PGL(2, q). Specifically, we shall find a condition in form of a polynomial for the existence of groups (2, 3, k) as subgroups of PSL(2, q) or PGL(2, q).Mathematics Subject Classification: Primary 20F05 Secondary 20G40. 相似文献