AbstractWe introduce the notion of a chopped and sliced cone in combinatorial geometry and prove a structure theorem expressing the number of integral points in a slice of such a cone by means of a vector partition function. We observe that this notion applies to weight multiplicities of Kac–Moody algebras and to Clebsch–Gordan coefficients for semisimple Lie algebras. This has algorithmic applications, as we demonstrate computing some explicit examples
AbstractFor any tree Γ, we introduce Γ-cones consisting of chambers and enumerate the number of cham...
We study the restricted category 0 for an affine Kac–Moody algebra at the critical level. In particu...
AbstractThe cut polytope Pc(G) of a graph G is the convex hull of the incidence vectors of all cuts ...
The author introduces the notion of a chopped and sliced cone and shows that the weight multipliciti...
The aim of this paper is to extend the so called slice analysis to a general case in which the codom...
AbstractWe use Gelfand–Tsetlin diagrams to write down the weight multiplicity function for the Lie a...
In this paper we summarize some known facts on slice topology in the quaternionic case, and we deepe...
The particular focus of this workshop was on the combinatorial aspects of representation theory. It ...
A halving line of a set of points is a line that divides the set of points into two equal parts. The...
We study facets of the cut coneC n , i.e., the cone of dimension 1/2n(n − 1) generated by the cuts o...
There the combinative cones and polyhedrons are studied. The series of problems of polyhedral combin...
AbstractFrom a topological space remove certain subspaces (cuts), leaving connected components (regi...
This book presents a course in the geometry of convex polytopes in arbitrary dimension, suitable for...
. Motivated by a connection with the factorization of multivariable polynomials, we study integral c...
Abstract. The polytope structure of the associahedron is decomposed into two categories, types and c...
AbstractFor any tree Γ, we introduce Γ-cones consisting of chambers and enumerate the number of cham...
We study the restricted category 0 for an affine Kac–Moody algebra at the critical level. In particu...
AbstractThe cut polytope Pc(G) of a graph G is the convex hull of the incidence vectors of all cuts ...
The author introduces the notion of a chopped and sliced cone and shows that the weight multipliciti...
The aim of this paper is to extend the so called slice analysis to a general case in which the codom...
AbstractWe use Gelfand–Tsetlin diagrams to write down the weight multiplicity function for the Lie a...
In this paper we summarize some known facts on slice topology in the quaternionic case, and we deepe...
The particular focus of this workshop was on the combinatorial aspects of representation theory. It ...
A halving line of a set of points is a line that divides the set of points into two equal parts. The...
We study facets of the cut coneC n , i.e., the cone of dimension 1/2n(n − 1) generated by the cuts o...
There the combinative cones and polyhedrons are studied. The series of problems of polyhedral combin...
AbstractFrom a topological space remove certain subspaces (cuts), leaving connected components (regi...
This book presents a course in the geometry of convex polytopes in arbitrary dimension, suitable for...
. Motivated by a connection with the factorization of multivariable polynomials, we study integral c...
Abstract. The polytope structure of the associahedron is decomposed into two categories, types and c...
AbstractFor any tree Γ, we introduce Γ-cones consisting of chambers and enumerate the number of cham...
We study the restricted category 0 for an affine Kac–Moody algebra at the critical level. In particu...
AbstractThe cut polytope Pc(G) of a graph G is the convex hull of the incidence vectors of all cuts ...