Anamorphism - Revision history

en>Eschnett: /* Anamorphisms in category theory */

2014-08-21T01:39:54Z

Anamorphisms in category theory

← Older revision		Revision as of 03:39, 21 August 2014
Line 1:		Line 1:
	The '''Birkhoff polytope''' ''B''<sub>''n''</sub>, also called the '''assignment polytope''', the '''polytope of doubly stochastic matrices''', or the '''perfect matching polytope''' of the [[complete bipartite graph]] <math>K_{n,n}</math>,<ref name="z">{{citation \|last=Ziegler \|first=Günter M. \|authorlink=Günter M. Ziegler \|title=Lectures on Polytopes \|edition=7th printing of 1st \|series=Graduate Texts in Mathematics \|volume=152 \|origyear=2006 \|year=2007 \|publisher=Springer \|location=New York \|isbn=978-0-387-94365-7 \|page=20}}</ref> is the [[convex polytope]] in '''R'''<sup>''N''</sup> (where ''N'' = ''n''²) whose points are the [[doubly stochastic matrix\|doubly stochastic matrices]], i.e., the {{nowrap\|''n'' × ''n''}} matrices whose entries are non-negative real numbers and whose rows and columns each add up to 1.		The writer is recognized by the title of Figures Wunder. She is a librarian but she's always wanted her personal company. For a while I've been in South Dakota and my parents live nearby. One of the extremely very best issues in the world for me is to do aerobics and I've been performing it for fairly a while.<br><br>Feel free to surf to my webpage - [http://www.youporn-nederlandse.com/user/CMidgett std testing at home]

	~~== Properties ==~~
	~~===Vertices===~~
	The Birkhoff polytope has ''n''! vertices, one for each permutation on ''n'' items.<ref name="z"/> This follows from the [[Birkhoff–von Neumann theorem]], which states that the [[extreme point]]s of the Birkhoff polytope are the [[permutation matrices]], and therefore that any doubly stochastic matrix may be represented as a convex combination of permutation matrices; this was stated in a 1946 paper by [[Garrett Birkhoff]],<ref>{{citation \| last = Birkhoff \| first = Garrett \| authorlink=Garrett Birkhoff \|title = Tres observaciones sobre el algebra lineal [Three observations on linear algebra] \| journal = Univ. Nac. Tucumán. Revista A. \| volume = 5 \| year = 1946 \| pages = 147–151 \| mr = 0020547 }}.</ref> but equivalent results in the languages of [[projective configuration]]s and of [[regular graph\|regular]] [[bipartite graph]] [[Matching (graph theory)\|matching]]s, respectively, were shown much earlier in 1894 in [[Ernst Steinitz]]'s thesis and in 1916 by [[Dénes Kőnig]].<ref>{{citation \| last = Kőnig \| first = Dénes \| authorlink = Dénes Kőnig \| title ~~= Gráfok és alkalmazásuk a determinánsok és a halmazok elméletére \| journal = Matematikai és Természettudományi Értesítő \| volume = 34 \| year = 1916 \| pages = 104–119}}.</ref>~~

	~~===Edges===~~
	~~The edges~~ of ~~the Birkhoff polytope correspond to pairs of permutations differing by a cycle:~~
	~~: <math>(\sigma,\omega)</math> such that <math>\sigma^{-1}\omega</math> is a cycle~~.
	~~This implies that the [[Graph (mathematics)\|graph]] of ''B''<sub>''n''</sub>~~ is a ~~[[Cayley graph]] of the symmetric group~~ '~~'S''<sub>''n''</sub>~~. ~~This also implies that the graph of ''B''<sub>''3''</sub> is~~ a ~~[[complete graph]]~~ '~~'K''<sub>''6''</sub>,~~ and ~~thus ''B''<sub>''3''</sub> is a [[neighborly polytope]]~~.

	~~===Facets===~~
	~~The Birkhoff polytope lies within an {{nowrap\|(''n''<sup>2</sup> − 2''n'' + 1)-}}dimensional [[affine subspace]]~~ of the ~~''n''<sup>2</sup>-dimensional space of all {{nowrap\|''n'' × ''n''}} matrices: this subspace is determined by~~ the ~~linear equality constraints~~
	~~that the sum of each row and of each column be one. Within this subspace, it is defined by ''n''<sup>2</sup> [[linear inequality\|linear inequalities]], one~~ for ~~each coordinate of the matrix, specifying that the coordinate be non-negative.~~
	~~Therefore, it has exactly ''n''<sup>2</sup> [[facet (geometry)\|facets]].<ref name="z"/>~~

	~~=== Symmetries ===~~
	~~The Birkhoff polytope ''B''<sub>''n''</sub>~~ is ~~both [[vertex-transitive]]~~ and ~~[[Isohedral_figure\|facet-transitive]] (i.e. the [[Dual polyhedron\|dual polytope]] is vertex-transitive). It is not [[regular polytope\|regular]] for~~ '~~'n>2''.~~

	~~===Volume===~~
	~~An outstanding problem is to find the volume of the Birkhoff polytopes. This has~~ been ~~done~~ for ~~''n'' ≤ 10~~.<~~ref~~>~~The [http://www.math.binghamton.edu/dennis/Birkhoff/volumes.html Volumes of Birkhoff polytopes] for ''n'' ≤ 10.~~<~~/ref~~> ~~It is known~~ to ~~be equal~~ to the volume of a polytope associated with standard [[Young tableau]]x.<ref>{{citation \|authorlink=Igor Pak \|first=Igor \|last=Pak \|title=Four questions on Birkhoff polytope \|journal=Annals of Combinatorics \|volume=4 \|year=2000 \|pages=83–90 \|doi=10.1007/PL00001277}}.</ref> A combinatorial formula for all ''n'' was given in 2007.<ref>{{cite arxiv \|title=Formulas for the volumes of the polytope of doubly-stochastic matrices and its faces \|first1=Jesus A. \|last1=De Loera \|first2=Fu \|last2=Liu \|first3=Ruriko \|last3=Yoshida \|year=2007 \|eprint=math.CO/0701866}}.</ref> The following [[asymptotic formula]] was found by
	[[Rodney Canfield]] and [[Brendan McKay]]:<ref>{{cite arxiv \|first1=E. Rodney \|last1=Canfield \|authorlink2=Brendan McKay \|first2=Brendan D. \|last2=McKay \|title=The asymptotic volume of the Birkhoff polytope \|year=2007 \|eprint=0705.2422}}.</ref>
	~~:<math>\mathop{\mathrm{vol}}(B_n) \, = \, \exp\left( - (n-1)^2\ln n + n^2 - (n - \frac{1}{2})\ln(2\pi) + \frac{1}{3} + o(1) \right) .</math>~~

	~~== Generalizations ==~~
	*The Birkhoff polytope is a special case of the [[transportation polytope]], a polytope of nonnegative rectangular matrices with given row and column sums. The integer points in these polytopes are called [[contingency table]]s; they play an important role in [[Bayesian statistics]].
	*The Birkhoff polytope is a special case of the [[matching polytope]], defined as a convex hull of the [[perfect matching]]s in a finite graph. The description of facets in this generality was given by [[Jack Edmonds]] (1965), and is related to [[Edmonds's matching algorithm]].

	~~==See also==~~
	* [[Permutohedron]]

	~~==References==~~
	~~{{reflist}}~~

	~~==Additional reading==~~
	* Matthias Beck and Dennis Pixton (2003), The Ehrhart polynomial of the Birkhoff polytope, <cite>[[Discrete and Computational Geometry]]</cite>, Vol. 30, pp. 623–637. The volume of ''B''<sub>9</sub>.

	~~==External links==~~
	* [http://www.~~math~~.~~binghamton.edu/dennis~~/~~Birkhoff~~/ ~~Birkhoff polytope] Web site by Dennis Pixton and Matthias Beck, with links to articles and volumes.~~

	~~[[Category:Polytopes]]~~
	~~[[Category:Matrices]~~]

en>TAnthony: /* History */Update deprecated cite parameter (coauthors) using AWB

2013-12-17T05:16:48Z

History: Update deprecated cite parameter (coauthors) using AWB

← Older revision		Revision as of 07:16, 17 December 2013
Line 1:		Line 1:
	~~Let me initial start~~ by ~~introducing myself~~. My name is ~~Boyd Butts even though it~~ is not the title on ~~my beginning certificate~~. ~~To gather coins~~ is 1 of the ~~issues I adore most~~. ~~Hiring~~ is ~~her working day occupation now but she'~~s ~~usually needed her personal company~~. ~~For a while she~~'s ~~been in South Dakota~~.<br><br>~~Here is my homepage ::~~ [http://~~jewelrycase~~.co.kr/xe/~~Ring~~/~~11593 at home std test~~]		The '''Birkhoff polytope''' ''B''<sub>''n''</sub>, also called the '''assignment polytope''', the '''polytope of doubly stochastic matrices''', or the '''perfect matching polytope''' of the [[complete bipartite graph]] <math>K_{n,n}</math>,<ref name="z">{{citation \|last=Ziegler \|first=Günter M. \|authorlink=Günter M. Ziegler \|title=Lectures on Polytopes \|edition=7th printing of 1st \|series=Graduate Texts in Mathematics \|volume=152 \|origyear=2006 \|year=2007 \|publisher=Springer \|location=New York \|isbn=978-0-387-94365-7 \|page=20}}</ref> is the [[convex polytope]] in '''R'''<sup>''N''</sup> (where ''N'' = ''n''²) whose points are the [[doubly stochastic matrix\|doubly stochastic matrices]], i.e., the {{nowrap\|''n'' × ''n''}} matrices whose entries are non-negative real numbers and whose rows and columns each add up to 1.

			== Properties ==
			===Vertices===
			The Birkhoff polytope has ''n''! vertices, one for each permutation on ''n'' items.<ref name="z"/> This follows from the [[Birkhoff–von Neumann theorem]], which states that the [[extreme point]]s of the Birkhoff polytope are the [[permutation matrices]], and therefore that any doubly stochastic matrix may be represented as a convex combination of permutation matrices; this was stated in a 1946 paper by [[Garrett Birkhoff]],<ref>{{citation \| last = Birkhoff \| first = Garrett \| authorlink=Garrett Birkhoff \|title = Tres observaciones sobre el algebra lineal [Three observations on linear algebra] \| journal = Univ. Nac. Tucumán. Revista A. \| volume = 5 \| year = 1946 \| pages = 147–151 \| mr = 0020547 }}.</ref> but equivalent results in the languages of [[projective configuration]]s and of [[regular graph\|regular]] [[bipartite graph]] [[Matching (graph theory)\|matching]]s, respectively, were shown much earlier in 1894 in [[Ernst Steinitz]]'s thesis and in 1916 by [[Dénes Kőnig]].<ref>{{citation \| last = Kőnig \| first = Dénes \| authorlink = Dénes Kőnig \| title = Gráfok és alkalmazásuk a determinánsok és a halmazok elméletére \| journal = Matematikai és Természettudományi Értesítő \| volume = 34 \| year = 1916 \| pages = 104–119}}.</ref>

			===Edges===
			The edges of the Birkhoff polytope correspond to pairs of permutations differing by a cycle:
			: <math>(\sigma,\omega)</math> such that <math>\sigma^{-1}\omega</math> is a cycle.
			This implies that the [[Graph (mathematics)\|graph]] of ''B''<sub>''n''</sub> is a [[Cayley graph]] of the symmetric group ''S''<sub>''n''</sub>. This also implies that the graph of ''B''<sub>''3''</sub> is a [[complete graph]] ''K''<sub>''6''</sub>, and thus ''B''<sub>''3''</sub> is a [[neighborly polytope]].

			===Facets===
			The Birkhoff polytope lies within an {{nowrap\|(''n''<sup>2</sup> − 2''n'' + 1)-}}dimensional [[affine subspace]] of the ''n''<sup>2</sup>-dimensional space of all {{nowrap\|''n'' × ''n''}} matrices: this subspace is determined by the linear equality constraints
			that the sum of each row and of each column be one. Within this subspace, it is defined by ''n''<sup>2</sup> [[linear inequality\|linear inequalities]], one for each coordinate of the matrix, specifying that the coordinate be non-negative.
			Therefore, it has exactly ''n''<sup>2</sup> [[facet (geometry)\|facets]].<ref name="z"/>

			=== Symmetries ===
			The Birkhoff polytope ''B''<sub>''n''</sub> is both [[vertex-transitive]] and [[Isohedral_figure\|facet-transitive]] (i.e. the [[Dual polyhedron\|dual polytope]] is vertex-transitive). It is not [[regular polytope\|regular]] for ''n>2''.

			===Volume===
			An outstanding problem is to find the volume of the Birkhoff polytopes. This has been done for ''n'' ≤ 10.<ref>The [http://www.math.binghamton.edu/dennis/Birkhoff/volumes.html Volumes of Birkhoff polytopes] for ''n'' ≤ 10.</ref> It is known to be equal to the volume of a polytope associated with standard [[Young tableau]]x.<ref>{{citation \|authorlink=Igor Pak \|first=Igor \|last=Pak \|title=Four questions on Birkhoff polytope \|journal=Annals of Combinatorics \|volume=4 \|year=2000 \|pages=83–90 \|doi=10.1007/PL00001277}}.</ref> A combinatorial formula for all ''n'' was given in 2007.<ref>{{cite arxiv \|title=Formulas for the volumes of the polytope of doubly-stochastic matrices and its faces \|first1=Jesus A. \|last1=De Loera \|first2=Fu \|last2=Liu \|first3=Ruriko \|last3=Yoshida \|year=2007 \|eprint=math.CO/0701866}}.</ref> The following [[asymptotic formula]] was found by
			[[Rodney Canfield]] and [[Brendan McKay]]:<ref>{{cite arxiv \|first1=E. Rodney \|last1=Canfield \|authorlink2=Brendan McKay \|first2=Brendan D. \|last2=McKay \|title=The asymptotic volume of the Birkhoff polytope \|year=2007 \|eprint=0705.2422}}.</ref>
			:<math>\mathop{\mathrm{vol}}(B_n) \, = \, \exp\left( - (n-1)^2\ln n + n^2 - (n - \frac{1}{2})\ln(2\pi) + \frac{1}{3} + o(1) \right) .</math>

			== Generalizations ==
			*The Birkhoff polytope is a special case of the [[transportation polytope]], a polytope of nonnegative rectangular matrices with given row and column sums. The integer points in these polytopes are called [[contingency table]]s; they play an important role in [[Bayesian statistics]].
			*The Birkhoff polytope is a special case of the [[matching polytope]], defined as a convex hull of the [[perfect matching]]s in a finite graph. The description of facets in this generality was given by [[Jack Edmonds]] (1965), and is related to [[Edmonds's matching algorithm]].

			==See also==
			* [[Permutohedron]]

			==References==
			{{reflist}}

			==Additional reading==
			* Matthias Beck and Dennis Pixton (2003), The Ehrhart polynomial of the Birkhoff polytope, <cite>[[Discrete and Computational Geometry]]</cite>, Vol. 30, pp. 623–637. The volume of ''B''<sub>9</sub>.

			==External links==
			* [http://www.math.binghamton.edu/dennis/Birkhoff/ Birkhoff polytope] Web site by Dennis Pixton and Matthias Beck, with links to articles and volumes.

			[[Category:Polytopes]]
			[[Category:Matrices]]

94.208.75.106: /* Anamorphisms on lists */

2012-06-18T19:53:21Z

Anamorphisms on lists

New page

Let me initial start by introducing myself. My name is Boyd Butts even though it is not the title on my beginning certificate. To gather coins is 1 of the issues I adore most. Hiring is her working day occupation now but she's usually needed her personal company. For a while she's been in South Dakota.<br><br>Here is my homepage :: [http://jewelrycase.co.kr/xe/Ring/11593 at home std test]