000 03506nam a22005415i 4500
001 978-3-642-17333-2
003 DE-He213
005 20140220083750.0
007 cr nn 008mamaa
008 110829s2011 gw | s |||| 0|eng d
020 _a9783642173332
_9978-3-642-17333-2
024 7 _a10.1007/978-3-642-17333-2
_2doi
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aCOM031000
_2bisacsh
082 0 4 _a004.0151
_223
100 1 _aKitaev, Sergey.
_eauthor.
245 1 0 _aPatterns in Permutations and Words
_h[electronic resource] /
_cby Sergey Kitaev.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2011.
300 _aXXII, 494 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aMonographs in Theoretical Computer Science. An EATCS Series,
_x1431-2654
505 0 _aChap. 1, What Is a Pattern in a Permutation or a Word? -- Chap. 2, Why Such patterns? A Few Motivation Points -- Chap. 3, More Motivation Points -- Chap. 4, Bijections Between 321- and 132-Avoiding Permutations -- Chap. 5, Consecutive Patterns -- Chap. 6, Classical Patterns and POPs -- Chap. 7, VPs, BVPs and BPs -- Chap. 8, Miscellaneous on Patterns in Permutations and Words -- Chap. 9, Extending Research on Patterns in Permutations and Words to Other Domains -- App. A, Useful Notions and Facts -- App. B, Some Algebraic Background -- Bibliography -- Index.
520 _aThere has been considerable interest recently in the subject of patterns in permutations and words, a new branch of combinatorics with its roots in the works of Rotem, Rogers, and Knuth in the 1970s. Consideration of the patterns in question has been extremely interesting from the combinatorial point of view, and it has proved to be a useful language in a variety of seemingly unrelated problems, including the theory of Kazhdan—Lusztig polynomials, singularities of Schubert varieties, interval orders, Chebyshev polynomials, models in statistical mechanics, and various sorting algorithms, including sorting stacks and sortable permutations. The author collects the main results in the field in this up-to-date, comprehensive reference volume. He highlights significant achievements in the area, and points to research directions and open problems. The book will be of interest to researchers and graduate students in theoretical computer science and mathematics, in particular those working in algebraic combinatorics and combinatorics on words. It will also be of interest to specialists in other branches of mathematics, theoretical physics, and computational biology.
650 0 _aComputer science.
650 0 _aInformation theory.
650 0 _aBioinformatics.
650 0 _aAlgebra.
650 0 _aCombinatorics.
650 1 4 _aComputer Science.
650 2 4 _aTheory of Computation.
650 2 4 _aCombinatorics.
650 2 4 _aMathematics of Computing.
650 2 4 _aAlgebra.
650 2 4 _aComputational Biology/Bioinformatics.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642173325
830 0 _aMonographs in Theoretical Computer Science. An EATCS Series,
_x1431-2654
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-17333-2
912 _aZDB-2-SCS
999 _c107237
_d107237