Karger's algorithm: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Qwertyus
en>Ecnerwala
→‎Analysis: Fixed math.
 
(One intermediate revision by one other user not shown)
Line 1: Line 1:
A '''convex lattice polytope''' (also called '''Z-polyhedron''' or '''Z-polytope''') is a [[geometry|geometric]] object playing an important role in [[discrete geometry]] and [[combinatorial commutative algebra]]. It is a [[polytope]] in a Euclidean space '''R'''<sup>n</sup> which is a [[convex hull]] of finitely many points in the [[integer lattice]] '''Z'''<sup>n</sup> &sub; '''R'''<sup>n</sup>. Such objects are prominently featured in the theory of [[toric variety|toric varieties]], where they correspond to polarized projective toric varieties.
I would like to introduce myself to you, I am Andrew and my spouse doesn't like it at all. For a while I've been in Mississippi but now I'm considering other choices. Credit authorising is how he makes money. To perform lacross is something he would by no means give up.<br><br>Feel free to surf to my web site ... psychic love readings [[http://kjhkkb.net/xe/notice/374835 Going in kjhkkb.net]]
 
== Examples ==
* An ''n''-dimensional [[simplex]] &Delta; in '''R'''<sup>n+1</sup> is the convex hull of ''n''+1 points that do not lie on a single affine hyperplane. The simplex is a convex lattice polytope if (and only if) the vertices have integral coordinates. The corresponding toric variety is the ''n''-dimensional [[projective space]] '''P'''<sup>n</sup>.
* The [[unit cube]] in '''R'''<sup>n</sup>, whose vertices are the ''2''<sup>n</sup> points all of whose coordinates are ''0'' or ''1'', is a convex lattice polytope. The corresponding toric variety is the [[Segre embedding]] of the ''n''-fold product of the projective line '''P'''<sup>1</sup>.
* In the special case of two-dimensional convex lattice polytopes in '''R'''<sup>2</sup>, they are also known as '''convex lattice polygons'''.
* In [[algebraic geometry]], an important instance of lattice polytopes called the '''Newton polytopes''' are the convex hulls of the set <math>A</math> which consists of all the exponent vectors appearing in a collection of monomials. For example, consider the polynomial of the form <math>axy+bx^2+cy^5+d</math> with <math>a,b,c,d \neq 0</math> has a lattice equal to the triangle
:<math>{\rm conv}(\{(1,1),(2,0),(0,5),(0,0)\}).\ </math>
 
== See also ==
 
* [[Normal polytope]]
* [[Pick's theorem]]
* [[Ehrhart polynomial]]
* [[Integer points in convex polyhedra]]
 
== References ==
* Ezra Miller, [[Bernd Sturmfels]], ''Combinatorial commutative algebra''. Graduate Texts in Mathematics, 227. Springer-Verlag, New York, 2005. xiv+417 pp. ISBN 0-387-22356-8
 
{{geometry-stub}}
[[Category:Polytopes]]
[[Category:Lattice points]]

Latest revision as of 23:39, 28 May 2014

I would like to introduce myself to you, I am Andrew and my spouse doesn't like it at all. For a while I've been in Mississippi but now I'm considering other choices. Credit authorising is how he makes money. To perform lacross is something he would by no means give up.

Feel free to surf to my web site ... psychic love readings [Going in kjhkkb.net]