Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Special pages
Niidae Wiki
Search
Search
Appearance
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
Parity (mathematics)
(section)
Page
Discussion
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Page information
Appearance
move to sidebar
hide
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Group theory=== [[File:Rubiks revenge solved.jpg|thumb|left|[[Rubik's Revenge]] in solved state]] The [[parity of a permutation]] (as defined in [[abstract algebra]]) is the parity of the number of [[Transposition (mathematics)|transposition]]s into which the permutation can be decomposed.<ref>{{citation|title=Permutation Groups|volume=45|series=London Mathematical Society Student Texts|first=Peter J.|last=Cameron|author-link=Peter Cameron (mathematician)|publisher=Cambridge University Press|year=1999|isbn=9780521653787|pages=26β27|url=https://books.google.com/books?id=4bNj8K1omGAC&pg=PA26}}.</ref> For example (ABC) to (BCA) is even because it can be done by swapping A and B then C and A (two transpositions). It can be shown that no permutation can be decomposed both in an even and in an odd number of transpositions. Hence the above is a suitable definition. In [[Rubik's Cube]], [[Megaminx]], and other twisting puzzles, the moves of the puzzle allow only even permutations of the puzzle pieces, so parity is important in understanding the [[Configuration space (mathematics)|configuration space]] of these puzzles.<ref>{{citation|title=Adventures in Group Theory: Rubik's Cube, Merlin's Machine, and Other Mathematical Toys|first=David|last=Joyner|publisher=JHU Press|year=2008|isbn=9780801897269|contribution=13.1.2 Parity conditions|pages=252β253|url=https://books.google.com/books?id=iM0fco-_Ri8C&pg=PA252}}.</ref> The [[Feit–Thompson theorem]] states that a [[finite group]] is always solvable if its order is an odd number. This is an example of odd numbers playing a role in an advanced mathematical theorem where the method of application of the simple hypothesis of "odd order" is far from obvious.<ref>{{citation | last1 = Bender | first1 = Helmut | last2 = Glauberman | first2 = George | isbn = 978-0-521-45716-3 | location = Cambridge | mr = 1311244 | publisher = Cambridge University Press | series = London Mathematical Society Lecture Note Series | title = Local analysis for the odd order theorem | volume = 188 | year = 1994}}; {{citation | last = Peterfalvi | first = Thomas | isbn = 978-0-521-64660-4 | location = Cambridge | mr = 1747393 | publisher = Cambridge University Press | series = London Mathematical Society Lecture Note Series | title = Character theory for the odd order theorem | volume = 272 | year = 2000}}.</ref>
Summary:
Please note that all contributions to Niidae Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Encyclopedia:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Search
Search
Editing
Parity (mathematics)
(section)
Add topic