Add to ORKGAbstract. Let Φ be a root system and let Γ ⊆ Φ. In this short paper, we prove that Γ contains a Z-basis of the lattice that it generates. 1
AbstractLet Φ be an irreducible root system and Δ be a base for Φ; it is well known that any root in...
International audienceLet Γ be a Coxeter graph, let W be its associated Coxeter group, and let G be ...
International audienceLet Γ be a Coxeter graph, let W be its associated Coxeter group, and let G be ...
A polynomial time algorithm is presented that given a rational approximation to a lattice in real n-...
The convex hull of the roots of a classical root lattice is called a root polytope. We determine exp...
The convex hull of the roots of a classical root lattice is called a root polytope. We determine exp...
Let Σ be a root system. ∆ ⊏ Σ a base and Σ+ the set of positive roots. We prove the following two pr...
This paper begins with a survey of the known results about root systems. There follows the definitio...
AbstractIn this note we show that root lattices are all and only those lattices in which the set of ...
We tackle several problems related to a finite irreducible crystallographic root system Φ in the rea...
We tackle several problems related to a finite irreducible crystallographic root system Φ in the rea...
Let R be an indecomposable root system. It is well known that any root is part of a basis B of R. Bu...
Let R be an indecomposable root system. It is well known that any root is part of a basis B of R. Bu...
Let Φ be an irreducible root system (sometimes we denote Φ by Φ(X) to indicate its type X). Choose a...
AbstractLet R be an indecomposable root system. It is well known that any root is part of a basis B ...
AbstractLet Φ be an irreducible root system and Δ be a base for Φ; it is well known that any root in...
International audienceLet Γ be a Coxeter graph, let W be its associated Coxeter group, and let G be ...
International audienceLet Γ be a Coxeter graph, let W be its associated Coxeter group, and let G be ...
A polynomial time algorithm is presented that given a rational approximation to a lattice in real n-...
The convex hull of the roots of a classical root lattice is called a root polytope. We determine exp...
The convex hull of the roots of a classical root lattice is called a root polytope. We determine exp...
Let Σ be a root system. ∆ ⊏ Σ a base and Σ+ the set of positive roots. We prove the following two pr...
This paper begins with a survey of the known results about root systems. There follows the definitio...
AbstractIn this note we show that root lattices are all and only those lattices in which the set of ...
We tackle several problems related to a finite irreducible crystallographic root system Φ in the rea...
We tackle several problems related to a finite irreducible crystallographic root system Φ in the rea...
Let R be an indecomposable root system. It is well known that any root is part of a basis B of R. Bu...
Let R be an indecomposable root system. It is well known that any root is part of a basis B of R. Bu...
Let Φ be an irreducible root system (sometimes we denote Φ by Φ(X) to indicate its type X). Choose a...
AbstractLet R be an indecomposable root system. It is well known that any root is part of a basis B ...
AbstractLet Φ be an irreducible root system and Δ be a base for Φ; it is well known that any root in...
International audienceLet Γ be a Coxeter graph, let W be its associated Coxeter group, and let G be ...
International audienceLet Γ be a Coxeter graph, let W be its associated Coxeter group, and let G be ...