Corner detection - Revision history

en>Serviscope Minor: /* Formalization */ Removed "expert supervision" comment. I've never seen this used.

2015-01-08T14:47:44Z

Formalization: Removed "expert supervision" comment. I've never seen this used.

← Older revision		Revision as of 16:47, 8 January 2015
Line 1:		Line 1:
	~~Her~~ name is ~~Felicidad Ahmad~~. ~~To keep birds~~ is ~~1 of the things he loves most~~. ~~My job~~ is ~~a manufacturing and distribution officer and~~ I'~~m performing pretty good financially. Years in~~ the ~~past we moved to Arizona but my spouse desires us to transfer~~.<br><br>~~Feel free to surf to my webpage~~ [http://~~www~~.~~jvawest~~.~~com/UserProfile/tabid~~/~~152~~/~~userId~~/~~2157/Default.aspx cars warranty~~]		The individual who wrote the article is called Jayson Hirano and he totally digs that name. He is an information officer. Ohio is where her home is. What I adore performing is soccer but I don't have the time lately.<br><br>My blog - [http://cspl.postech.ac.kr/zboard/Membersonly/144571 accurate psychic predictions]

193.1.149.101: /* Formalization */

2014-02-27T14:34:20Z

Formalization

← Older revision		Revision as of 16:34, 27 February 2014
Line 1:		Line 1:
	~~{{DISPLAYTITLE:Fox ''n''-coloring}}~~		Her name is Felicidad Ahmad. To keep birds is 1 of the things he loves most. My job is a manufacturing and distribution officer and I'm performing pretty good financially. Years in the past we moved to Arizona but my spouse desires us to transfer.<br><br>Feel free to surf to my webpage [http://www.jvawest.com/UserProfile/tabid/152/userId/2157/Default.aspx cars warranty]
	~~In the [[mathematics\|mathematical]] field of [[knot theory]], '''Fox ''n''-coloring'''~~ is ~~a method of specifying a representation of a [[knot group]] (or a [[link group]]) onto the dihedral group of order ''n'' where ''n''~~ is ~~an odd integer by coloring arcs in a [[link diagram]] (the representation itself is also often called a Fox ''n''-coloring). [[Ralph Fox]] discovered this method (and the special case~~ of ~~[[tricolorability]]) "in an effort to make~~ the ~~subject accessible to everyone" when~~ he ~~was explaining knot theory to undergraduate students at Haverford College in 1956~~. ~~Fox ''n''-coloring~~ is ~~an example of a conjugation [[quandle]].~~

	~~==Definition==~~
	Let ''L'' be a link, and let ''π'' be the fundamental group of its complement. A representation <math>\rho</math> of ''π'' onto <math>D_{2n}</math> the dihedral group of order ''2n'' is called a Fox ''n''-coloring (or simply an ''n''-coloring) of ''L''. A link ''L'' which admits such a representation is said to be '''''n''-colorable''', and <math>\rho</math> is called an ''n''-coloring of ''L''. Such representations of link groups had been considered in the context of covering spaces since Reidemeister in 1929.

	~~The link group is generated paths from a basepoint in <math>S^3</math> to the boundary of a tubular neighbourhood of the link, around~~ a ~~meridian of the tubular neighbourhood,~~ and back to the basepoint. By surjectivity of the representation these generators must map to reflections of a regular ''n''-gon. Such reflections correspond to elements <math>ts^i</math> of the dihedral group, where ''t'' is a reflection and '~~'s'' is a generating (<math>2\pi/n</math>) rotation of the ''n''-gon~~. ~~The generators of the link group given above are~~ in bijective correspondence with arcs of a [[link diagram]], and if a generator maps to <math>ts^i\in D_{2p}</math> we color the corresponding arc <math>i\in \mathbb{Z}/p\mathbb{Z}</math>. This is called a Fox ''n''-coloring of the link diagram, and it satisfies the following properties:

	*At least two colors are used (by surjectivity of <math>\rho</math>).
	*Around a crossing, the average of the colors of the undercrossing arcs equals the color of the overcrossing arc (because <math>\rho</math> is a representation of the link group).

	A ''n''-colored link yields a [[3-manifold]] ''M'' by taking the (irregular) [[dihedral covering]] of the 3-sphere branched over ''L'' with [[monodromy]] given by <math>\rho</math>. By a theorem of Montesinos and Hilden, and closed oriented 3-manifold may be obtained this way for some knot ''K'' any <math>\rho</math> some [[Tricolorability\|tricoloring]] of ''K''. This is no longer true when ''n'' is greater than three.

	~~==Number of colorings==~~
	~~The number of distinct Fox ''n''-colorings of a link ''L'', denoted~~

	~~:<math>\mathrm{col}_n(L),</math>~~

	~~is an invariant of the link, which is easy to calculate by hand on any link diagram by coloring arcs according to~~ the ~~coloring rules. When counting colorings, by convention~~ we ~~also consider the case where all arcs are given the same color, and call such a coloring trivial.~~

	~~[[Image:Trefoil tricolorings.svg\|thumb\|All possible tricolorings of the trefoil knot.]]~~

	~~For example, the standard minimal crossing diagram of the [[Trefoil knot]] has 9 distinct tricolorings as seen in the figure:~~
	* 3 "trivial" colorings (every arc blue, red, or green)
	* 3 colorings with the ordering Blue→Green→Red
	* 3 colorings with the ordering Blue→Red→Green

	The set of Fox 'n'-colorings of a link forms an abelian group <math>C_n(K)\,</math>, where the sum of two ''n''-colorings is the ''n''-coloring obtained by strandwise addition. This group splits as a direct sum
	~~:<math>C_n(K) \cong \mathbb Z_n \oplus C_n^0(K)\,</math>,~~
	~~where the first summand corresponds~~ to ~~the ''n'' trivial (constant) colors, and nonzero elements of <math>C_n^0(K)</math> summand correspond to nontrivial ''n''-colorings (''modulo'' translations obtained by adding a constant~~ to ~~each strand)~~.

	~~If <math>\#</math> is the [[connected sum]] operator and <math>L_1</math> and <math>L_2</math> are links, then~~
	~~:: <math>\mathrm{col}_n(L_1) \mathrm{col}_n(L_2) = n \mathrm{col}_n(L_1 \# L_2).</math>~~

	~~==Generalization to ''G''-coloring==~~
	~~Let ''L'' be a link, and let ''π'' be the fundamental group of its complement, and let ''G'' be a group. A [[homomorphism]] <math>\rho</math> of ''π'' to ''G'' is called a ''G''-coloring of ''L''.~~
	A ''G''-coloring of a knot diagram is an induced assigning an element of ''G'' to the strands of ''L'' such that, at each crossing, if ''c'' is the element of ''G'' assigned to the overcrossing strand and if ''a'' and ''b'' are the elements of ''G'' assigned to the two undercrossing strands, then ''a = c<sup>-1</sup> b c'' or ''b = c<~~sup~~>-1<~~/sup~~> ~~a c'', depending on the orientation of the overcrossing strand. If the group ''G'' is dihedral of order ''2n'', this diagrammatic representation of a ''G''-coloring reduces~~ to ~~a Fox ''n''-coloring. The [[torus knot]] T(3,5) has only constant ''n''-colorings, but for the group ''G'' equal~~ to ~~the alternating group ''A''<sub>5</sub>, T(3,5) has non-constant ''G''-colorings.~~

	~~==Further reading==~~

	* R.H. Crowell, R.H. Fox, "An Introduction to Knot Theory", Ginn and Co., Boston, 1963. {{MathSciNet \|id=0146828}}
	* R.H. Fox, ''[http://~~homepages.math~~.~~uic~~.~~edu~~/~~~kauffman~~/~~QuickTrip.pdf A quick trip through knot theory]'', in: M.K. Fort (Ed.), "Topology of 3-Manifolds and Related Topics", Prentice-Hall, NJ, 1961, pp. 120–167. {{MathSciNet \|id=0140099}}~~
	* R.H. Fox, ''Metacyclic invariants of knots and links'', Canadian Journal of Mathematics 22 (1970) 193–201. {{MathSciNet \|id=0261584}}
	*[[J.H. Przytycki]], ''[http://~~front.math.ucdavis.edu~~/~~math.GT~~/~~0608172 3-coloring and other elementary invariants of knots.]'' Banach Center Publications, Vol. 42, "Knot Theory", Warszawa, 1998, 275–295.~~
	*[[K. Reidemeister]], ''Knotten und verkettungen'', Math. ~~Z. 29 (1929), 713-729. {{MathSciNet \|id=1545033}}~~

	~~[[Category:Knot theory]~~]

en>Yobot: /* The multi-scale Harris operator */Reference before punctuation using AWB (9585)

2013-11-07T16:21:04Z

The multi-scale Harris operator: Reference before punctuation using AWB (9585)

← Older revision		Revision as of 18:21, 7 November 2013
Line 1:		Line 1:
	Ed is ~~what people call me~~ and ~~my wife doesn~~'t ~~like~~ it ~~at all~~. ~~To perform lacross~~ is the ~~thing I love most~~ of all. ~~My spouse~~ and ~~I live in Kentucky~~. ~~Office supervising~~ is ~~my profession~~.<br><br>~~My page~~ ... ~~psychic readers~~ ([http://m-~~card~~.co.kr/xe/~~mcard_2013_promote01~~/~~29877 m~~-~~card~~.co.kr])		{{DISPLAYTITLE:Fox ''n''-coloring}}
			In the [[mathematics\|mathematical]] field of [[knot theory]], '''Fox ''n''-coloring''' is a method of specifying a representation of a [[knot group]] (or a [[link group]]) onto the dihedral group of order ''n'' where ''n'' is an odd integer by coloring arcs in a [[link diagram]] (the representation itself is also often called a Fox ''n''-coloring). [[Ralph Fox]] discovered this method (and the special case of [[tricolorability]]) "in an effort to make the subject accessible to everyone" when he was explaining knot theory to undergraduate students at Haverford College in 1956. Fox ''n''-coloring is an example of a conjugation [[quandle]].

			==Definition==
			Let ''L'' be a link, and let ''π'' be the fundamental group of its complement. A representation <math>\rho</math> of ''π'' onto <math>D_{2n}</math> the dihedral group of order ''2n'' is called a Fox ''n''-coloring (or simply an ''n''-coloring) of ''L''. A link ''L'' which admits such a representation is said to be '''''n''-colorable''', and <math>\rho</math> is called an ''n''-coloring of ''L''. Such representations of link groups had been considered in the context of covering spaces since Reidemeister in 1929.

			The link group is generated paths from a basepoint in <math>S^3</math> to the boundary of a tubular neighbourhood of the link, around a meridian of the tubular neighbourhood, and back to the basepoint. By surjectivity of the representation these generators must map to reflections of a regular ''n''-gon. Such reflections correspond to elements <math>ts^i</math> of the dihedral group, where ''t'' is a reflection and ''s'' is a generating (<math>2\pi/n</math>) rotation of the ''n''-gon. The generators of the link group given above are in bijective correspondence with arcs of a [[link diagram]], and if a generator maps to <math>ts^i\in D_{2p}</math> we color the corresponding arc <math>i\in \mathbb{Z}/p\mathbb{Z}</math>. This is called a Fox ''n''-coloring of the link diagram, and it satisfies the following properties:

			*At least two colors are used (by surjectivity of <math>\rho</math>).
			*Around a crossing, the average of the colors of the undercrossing arcs equals the color of the overcrossing arc (because <math>\rho</math> is a representation of the link group).

			A ''n''-colored link yields a [[3-manifold]] ''M'' by taking the (irregular) [[dihedral covering]] of the 3-sphere branched over ''L'' with [[monodromy]] given by <math>\rho</math>. By a theorem of Montesinos and Hilden, and closed oriented 3-manifold may be obtained this way for some knot ''K'' any <math>\rho</math> some [[Tricolorability\|tricoloring]] of ''K''. This is no longer true when ''n'' is greater than three.

			==Number of colorings==
			The number of distinct Fox ''n''-colorings of a link ''L'', denoted

			:<math>\mathrm{col}_n(L),</math>

			is an invariant of the link, which is easy to calculate by hand on any link diagram by coloring arcs according to the coloring rules. When counting colorings, by convention we also consider the case where all arcs are given the same color, and call such a coloring trivial.

			[[Image:Trefoil tricolorings.svg\|thumb\|All possible tricolorings of the trefoil knot.]]

			For example, the standard minimal crossing diagram of the [[Trefoil knot]] has 9 distinct tricolorings as seen in the figure:
			* 3 "trivial" colorings (every arc blue, red, or green)
			* 3 colorings with the ordering Blue→Green→Red
			* 3 colorings with the ordering Blue→Red→Green

			The set of Fox 'n'-colorings of a link forms an abelian group <math>C_n(K)\,</math>, where the sum of two ''n''-colorings is the ''n''-coloring obtained by strandwise addition. This group splits as a direct sum
			:<math>C_n(K) \cong \mathbb Z_n \oplus C_n^0(K)\,</math>,
			where the first summand corresponds to the ''n'' trivial (constant) colors, and nonzero elements of <math>C_n^0(K)</math> summand correspond to nontrivial ''n''-colorings (''modulo'' translations obtained by adding a constant to each strand).

			If <math>\#</math> is the [[connected sum]] operator and <math>L_1</math> and <math>L_2</math> are links, then
			:: <math>\mathrm{col}_n(L_1) \mathrm{col}_n(L_2) = n \mathrm{col}_n(L_1 \# L_2).</math>

			==Generalization to ''G''-coloring==
			Let ''L'' be a link, and let ''π'' be the fundamental group of its complement, and let ''G'' be a group. A [[homomorphism]] <math>\rho</math> of ''π'' to ''G'' is called a ''G''-coloring of ''L''.
			A ''G''-coloring of a knot diagram is an induced assigning an element of ''G'' to the strands of ''L'' such that, at each crossing, if ''c'' is the element of ''G'' assigned to the overcrossing strand and if ''a'' and ''b'' are the elements of ''G'' assigned to the two undercrossing strands, then ''a = c<sup>-1</sup> b c'' or ''b = c<sup>-1</sup> a c'', depending on the orientation of the overcrossing strand. If the group ''G'' is dihedral of order ''2n'', this diagrammatic representation of a ''G''-coloring reduces to a Fox ''n''-coloring. The [[torus knot]] T(3,5) has only constant ''n''-colorings, but for the group ''G'' equal to the alternating group ''A''<sub>5</sub>, T(3,5) has non-constant ''G''-colorings.

			==Further reading==

			* R.H. Crowell, R.H. Fox, "An Introduction to Knot Theory", Ginn and Co., Boston, 1963. {{MathSciNet \|id=0146828}}
			* R.H. Fox, ''[http://homepages.math.uic.edu/~kauffman/QuickTrip.pdf A quick trip through knot theory]'', in: M.K. Fort (Ed.), "Topology of 3-Manifolds and Related Topics", Prentice-Hall, NJ, 1961, pp. 120–167. {{MathSciNet \|id=0140099}}
			* R.H. Fox, ''Metacyclic invariants of knots and links'', Canadian Journal of Mathematics 22 (1970) 193–201. {{MathSciNet \|id=0261584}}
			*[[J.H. Przytycki]], ''[http://front.math.ucdavis.edu/math.GT/0608172 3-coloring and other elementary invariants of knots.]'' Banach Center Publications, Vol. 42, "Knot Theory", Warszawa, 1998, 275–295.
			*[[K. Reidemeister]], ''Knotten und verkettungen'', Math. Z. 29 (1929), 713-729. {{MathSciNet \|id=1545033}}

			[[Category:Knot theory]]

70.247.162.84: link

2012-08-31T12:53:47Z

link

New page

Ed is what people call me and my wife doesn't like it at all. To perform lacross is the thing I love most of all. My spouse and I live in Kentucky. Office supervising is my profession.<br><br>My page ... psychic readers ([http://m-card.co.kr/xe/mcard_2013_promote01/29877 m-card.co.kr])