Пермутација (математика) — разлика између измена

Садржај обрисан Садржај додат
Спашавам 1 извора и означавам 0 мртвим. #IABot (v2.0beta9)
.
Ред 77:
 
== Нотација ==
Постоје две главне нотације за пермутације.<ref>{{citation|title=The Genesis of the Abstract Group Concept: A Contribution to the History of the Origin of Abstract Group Theory|first=Hans|last=Wussing|publisher=Courier Dover Publications|year=2007|isbn=9780486458687|page=94|url=https://books.google.com/books?id=Xp3JymnfAq4C&pg=PA94|quote=Cauchy used his permutation notation—in which the arrangements are written one below the other and both are enclosed in parentheses—for the first time in 1815.}}</ref>
Постоје две главне нотације за пермутације.
 
У релационој нотацији довољно је само исписати ''природно'' уређење елемената који се пермутују у првом реду, а ново уређење у другом реду (први пример доле):
Ред 120:
</div>
 
<!--== ИзвориРеференце ==
{{reflist}}-->
 
== Литература ==
{{refbegin|230em}}
* {{citation|first=Kenneth P.|last=Bogart|title=Introductory Combinatorics|edition=2nd|year=1990|publisher=Harcourt Brace Jovanovich|isbn=0-15-541576-X}}
* -{Miklos{citation|first=Miklós|last=Bóna|author-link=Miklós Bona. "Bóna|title=Combinatorics of Permutations",|publisher= Chapman Hall-CRC. {{page|year=2004|idisbn=ISBN 1-58488-434-7|pages=}}}-.
* -{[[Donald Knut]]h. ''The Art of Computer Programming'', Volume&nbsp;4: ''Generating All Tuples and Permutations'', Fascicle&nbsp;2, first printing. Addison-Wesley. {{page|year=2005|id=ISBN 0-201-85393-0|pages=}}}-.
* {{citation|first=Miklos|last=Bona|title=Combinatorics of Permutations|edition=2nd|year=2012|publisher=CRC Press|isbn=978-1-4398-5051-0}}
* -{[[Donald Knut]]h. ''The Art of Computer Programming'', Volume&nbsp;3: ''Sorting and Searching'', Second Edition. Addison-Wesley. {{page|year=1998|id=ISBN 0-201-89685-0|pages=}}. Section 5.1: Combinatorial Properties of Permutations, pp.11-72}-.
* {{citation|first=Richard A.|last=Brualdi|title=Introductory Combinatorics|edition=5th|publisher=Prentice-Hall|year=2010|isbn=978-0-13-602040-0}}
* {{citation|first=Peter J.|last=Cameron|title=Combinatorics: Topics, Techniques, Algorithms|year=1994|publisher=Cambridge University Press|isbn=0-521-45761-0}}
* {{citation|first=Robert D.|last=Carmichael|title=Introduction to the theory of Groups of Finite Order|year=1956|origyear=1937|publisher=Dover|isbn=0-486-60300-8}}
* {{citation|first=Larry J.|last=Gerstein|title=Discrete Mathematics and Algebraic Structures|year=1987|publisher=W.H. Freeman and Co.|isbn=0-7167-1804-9}}
* {{citation|first=Marshall, Jr.|last=Hall|author-link=Marshall Hall (mathematician)|title=The Theory of Groups|year=1959|publisher=MacMillan}}
* {{citation|last=Humphreys|first=J. F.|title=A course in group theory|publisher=Oxford University Press|year=1996|isbn=978-0-19-853459-4|url={{Google books|plainurl=y|id=2p3_ngEACAAJ|page=84|text=conjugate permutations have the same cycle type}}}}
* {{citation|first=Donald|last=Knuth|series=The Art of Computer Programming|volume=3|title=Sorting and Searching|year=1973}} This book mentions the Lehmer code (without using that name) as a variant ''C''<sub>1</sub>,...,''C''<sub>''n''</sub> of inversion tables in exercise 5.1.1−7 (p.&nbsp;19), together with two other variants.
* {{citation|first=Donald|last=Knuth|author-link=Donald Knuth|series=[[The Art of Computer Programming]]|volume=4|title=Generating All Tuples and Permutations|publisher=Addison–Wesley|year=2005|isbn=0-201-85393-0}} Fascicle&nbsp;2, first printing.
* {{ citation | first1 = Neal H. | last1 = McCoy | year = 1968 | title = Introduction To Modern Algebra, Revised Edition | publisher = [[Allyn and Bacon]] | location = Boston | lccn = 68015225 }}
* {{ citation | first1 = Evar D. | last1 = Nering | year = 1970 | title = Linear Algebra and Matrix Theory | edition = 2nd | publisher = [[John Wiley & Sons|Wiley]] | location = New York | lccn = 76091646 }}
* {{citation|first=Joseph J.|last=Rotman|title=Advanced Modern Algebra|year=2002|publisher=Prentice-Hall|isbn=0-13-087868-5}}
* {{citation|last=Stedman|first=Fabian|authorlink=Fabian Stedman|title=Campanalogia|year=1677|place=London}} The publisher is given as "W.S." who may have been William Smith, possibly acting as agent for the [[Ancient Society of College Youths|Society of College Youths]], to which society the "Dedicatory" is addressed. ''In quotations the original long "S" has been replaced by a modern short "s".''
* {{citation|first=Norman L.|last=Biggs|title=Discrete Mathematics|edition=2nd|year=2002|publisher=Oxford University Press|isbn=0-19-850717-8}}
* {{citation | last1=Foata | first1=Dominique | last2=Schutzenberger | first2=Marcel-Paul | title=Théorie Géométrique des Polynômes Eulériens | publisher=Springer-Verlag | location=Berlin, Heidelberg | series=Lecture Notes in Mathematics | volume=138 | year=1970 | isbn=978-3-540-04927-2 | url=http://irma.math.unistra.fr/~foata/paper/pub14.html}}. The link is to a freely available retyped (LaTeX'ed) and revised version of the text originally published by Springer-Verlag.
* -{[[{citation|first=Donald Knut]]h. ''|last=Knuth|series=The Art of Computer Programming'', Volume&nbsp;|volume=3: ''|title=Sorting and Searching'', |edition=Second Edition. Addison-Wesley. {{page|publisher=Addison–Wesley|year=1998|idisbn=ISBN 0-201-89685-0|pagesref=none}}. Section 5.1: Combinatorial Properties of Permutations, pp.11-72}-&nbsp;11–72.
{{refend}}