Γ 4 Let G be a finite connected graph on the vertex set 1, . . . , d allowing loops and w x having no multiple edge. Let K t , . . . , t denote the polynomial ring in d w x w x indeterminates over a field K and let K G be the subalgebra of K t , . . . , t Γ 4 generated by all quadratic monomials t
Polytope finite elements
β Scribed by P. Milbradt; T. Pick
- Publisher
- John Wiley and Sons
- Year
- 2008
- Tongue
- English
- Weight
- 524 KB
- Volume
- 73
- Category
- Article
- ISSN
- 0029-5981
- DOI
- 10.1002/nme.2149
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Maurras, J.F., The line-polytope of a finite affine plane, Discrete Mathematics 115 (1993) 2833286. Let A be an affine plane of order n and let P(A) be the convex hull of the characteristic vectors of the lines of A. We describe P(A) as the intersection of a hyperplane and tin' 1 half-spaces. In ad
In 1983 Barahona defined the class of cut polytopes; recently Padberg defined the class of Boolean quadric polytopes. We show that every Boolean quadric polytope is the image of a cut polytope under a bijective linear transformation, and so studying Boolean quadric polytopes reduces to studying spe