Results 1 
6 of
6
Convex hull realizations of the multiplihedra
, 2007
"... Abstract. We present a simple algorithm for determining the extremal points in Euclidean space whose convex hull is the n th polytope in the sequence known as the multiplihedra. This answers the open question of whether the multiplihedra could be realized as convex polytopes. Contents ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
Abstract. We present a simple algorithm for determining the extremal points in Euclidean space whose convex hull is the n th polytope in the sequence known as the multiplihedra. This answers the open question of whether the multiplihedra could be realized as convex polytopes. Contents
unknown title
"... This proposal is about combinatorial algebra, with a geometrical flavor. Together with students and collaborators I have been developing a diverse family of graded algebras and coalgebras, modules and comodules, often with Hopf and differential structures. Their common feature is that all are based ..."
Abstract
 Add to MetaCart
This proposal is about combinatorial algebra, with a geometrical flavor. Together with students and collaborators I have been developing a diverse family of graded algebras and coalgebras, modules and comodules, often with Hopf and differential structures. Their common feature is that all are based upon recursive sequences of convex polytopes. The key point of interest in each case is to see how the algebraic structure reflects the combinatorial structure, and vice versa. We are building upon the foundations laid by many other researchers, especially GianCarlo Rota, who most clearly saw the strength of this approach. The historical examples of Hopf algebras SSym and QSym, the MalvenutoReutenauer Hopf algebra and the quasisymmetric functions, can be defined using graded bases of permutations and boolean subsets respectively. Loday and Ronco used the fact that certain binary trees can represent both sorts of combinatorial objects to discover the Hopf algebra YSym lying between them. Chapoton capitalized on the fact that the three graded bases could actually be described as the vertex sets of polytope sequences, and defined larger algebras on the faces of the permutohedra, associahedra and cubes. The polytope sequences we study include those familiar examples as well as newer families such as the graph multiplihedra and composihedra. Simultaneously with our study of Hopf algebras we
Project description: Geometric combinatorial Hopf algebras and modules
"... In 2008 several researchers made exciting advances in the application of algebra and combinatorics to particle physics. The crucial mathematical ingredients included Hopf Algebras and subalgebras, in regard to the specific physical principle of renormalization in quantum electrodynamics and chromody ..."
Abstract
 Add to MetaCart
In 2008 several researchers made exciting advances in the application of algebra and combinatorics to particle physics. The crucial mathematical ingredients included Hopf Algebras and subalgebras, in regard to the specific physical principle of renormalization in quantum electrodynamics and chromodynamics. Renormalization refers to the addition of counterterms to a sequence of divergent integrals for probability
Cofree compositions of coalgebras
"... Abstract. We develop the notion of the composition of two coalgebras, which arises naturally in higher category theory and the theory of species. We prove that the composition of two cofree coalgebras is cofree and give conditions which imply that the composition is a onesided Hopf algebra. These c ..."
Abstract
 Add to MetaCart
Abstract. We develop the notion of the composition of two coalgebras, which arises naturally in higher category theory and the theory of species. We prove that the composition of two cofree coalgebras is cofree and give conditions which imply that the composition is a onesided Hopf algebra. These conditions hold when one coalgebra is a graded Hopf operad D and the other is a connected graded coalgebra with coalgebra map to D. We conclude by discussing these structures for compositions with bases the vertices of multiplihedra, composihedra, and hypercubes. Résumé.
Marked tubes and the graph multiplihedron SATYAN DEVADOSS
"... Given a graph G, we construct a convex polytope whose face poset is based on marked subgraphs of G. Dubbed the graph multiplihedron, we provide a realization using integer coordinates. Not only does this yield a natural generalization of the multiplihedron, but features of this polytope appear in wo ..."
Abstract
 Add to MetaCart
Given a graph G, we construct a convex polytope whose face poset is based on marked subgraphs of G. Dubbed the graph multiplihedron, we provide a realization using integer coordinates. Not only does this yield a natural generalization of the multiplihedron, but features of this polytope appear in works related to quilted disks, bordered Riemann surfaces and operadic structures. Certain examples of graph multiplihedra are related to Minkowski sums of simplices and cubes and others to the permutohedron. 52B11; 18D50, 55P48 1