Examples of using Coxeter in English and their translations into Ukrainian
{-}
-
Colloquial
-
Ecclesiastic
-
Computer
H S M Coxeter.
Coxeter Du Val Flather.
MacDonald Coxeter.
The Coxeter- James Prize.
The Tutte- Coxeter.
Coxeter M S Longuet- Higgins.
Paracompact Coxeter.
Coxeter Frucht and Powers.
The last two correspond to the A2 and H2 Coxeter planes.
The Tutte- Coxeter is one of the 13 such graphs.
There are many infinite hyperbolic Coxeter groups.
Paracompact Coxeter groups of rank 3 exist as limits to the compact ones.
The first and third correspond to the A2 and B2 Coxeter planes.
The automorphism group of the Coxeter graph is a group of order 336.
The second and third correspond to the B2 and A2 Coxeter planes.
All Coxeter group Schläfli matrices are symmetric because their root vectors are normalized.
The highest paracompact hyperbolic Coxeter group is rank 10.
In"The Fifty-Nine Icosahedra" Coxeter, Du Val, Flather and Petrie record five rules suggested by Miller.
Examples are Penrose graphical notation and Coxeter- Dynkin diagrams.
Hypercompact Coxeter groups in three dimensional space or higher differ from two dimensional groups in one essential respect.
Since 1978, the Canadian Mathematical Society have awarded the Coxeter- James Prize in his honor.
As Coxeter showed, any path of up to five edges in the Tutte- Coxeter graph is equivalent to any other such path by one such automorphism.
And complex diagrammaticnotations such as Penrose graphical notation and Coxeter- Dynkin diagrams.
We use the following definition: A Coxeter group with connected diagram is hyperbolic if it is neither of finite nor affine type, but every proper connected subdiagram is of finite or affine type.
John Conway devised a terminology for stellated polygons,polyhedra and polychora(Coxeter 1974).
Coxeter studied the linear hyperbolic coxeter groups in his 1954 paper Regular Honeycombs in hyperbolic space, which included two rational solutions in hyperbolic 4-space:= and=.
A more complex extendedversion of LCF notation was provided by Coxeter, Frucht, and Powers in later work.
Based on this construction, Coxeter showed that the Tutte- Coxeter graph is a symmetric graph; it has a group of 1440 automorphisms, which may be identified with the automorphisms of the group of permutations on six elements(Coxeter 1958b).
All of these fundamental reflective domains, both simplices and nonsimplices, are often called Coxeter polytopes or sometimes less accurately Coxeter polyhedra.
There are 7 convex uniform polyhedra that can be constructed from this symmetry group and 3 from its alternation subsymmetries,each with a uniquely marked up Coxeter- Dynkin diagram.