000			03747nam a22004695i 4500
001			u374764
003			SIRSI
005			20160812084250.0
007			cr nn 008mamaa
008			110210s2010 gw | s |||| 0|eng d
020			_a9783642144448 _9978-3-642-14444-8
040			_cMX-MeUAM
050		4	_aQA164-167.2
082	0	4	_a511.6 _223
100	1		_aBárány, Imre. _eeditor.
245	1	3	_aAn Irregular Mind _h[recurso electrónico] : _bSzemerédi is 70 / _cedited by Imre Bárány, József Solymosi, Gábor Sági.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010.
300			_a758 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aBolyai Society Mathematical Studies, _x1217-4696 ; _v21
505	0		_aUniversality, Tolerance, Chaos and Order -- Super-Uniformity of The Typical Billiard Path -- Percolation on Self-Dual Polygon Configurations -- On Exponential Sums in Finite Fields -- An Estimate of Incomplete Mixed Character Sums -- Crossings Between Curves With Many Tangencies -- An Arithmetic Regularity Lemma, An Associated Counting Lemma, and Applications -- Yet Another Proof Of Szemerédi's Theorem -- Online Linear Discrepancy of Partially Ordered Sets -- On The Triangle Removal Lemma For Subgraphs of Sparse Pseudorandom Graphs -- Almost All F-Free Graphs Have The Erdös-Hajnal Property -- Regularity Partitions and The Topology of Graphons -- Extremal Problems for Sparse Graphs -- Squares In Sumsets -- Are There Arbitrarily Long Arithmetic Progressions In The Sequence of Twin Primes? -- Dirac-Type Questions For Hypergraphs — A Survey (Or More Problems For Endre To Solve) -- Towards A Noncommutative Plünnecke-Type Inequality -- Quasirandom Multitype Graphs -- Pseudorandomness In Computer Science and In Additive Combinatorics -- To The Polymath Project and “Density Hales-Jewett and Moser Numbers” -- Polymath and The Density Hales-Jewett Theorem -- Density Hales-Jewett and Moser Numbers -- My Early Encounters With Szemerédi.
520			_aSzemerédi's influence on today's mathematics, especially in combinatorics, additive number theory, and theoretical computer science, is enormous. This volume is a celebration of Szemerédi's achievements and personality, on the occasion of his seventieth birthday. It exemplifies his extraordinary vision and unique way of thinking. A number of colleagues and friends, all top authorities in their fields, have contributed their latest research papers to this volume. The topics include extension and applications of the regularity lemma, the existence of k-term arithmetic progressions in various subsets of the integers, extremal problems in hypergraphs theory, and random graphs, all of them beautiful, Szemerédi type mathematics. It also contains published accounts of the first two, very original and highly successful Polymath projects, one led by Tim Gowers and the other by  Terry Tao.
650		0	_aMathematics.
650		0	_aField theory (Physics).
650		0	_aCombinatorics.
650	1	4	_aMathematics.
650	2	4	_aCombinatorics.
650	2	4	_aField Theory and Polynomials.
700	1		_aSolymosi, József. _eeditor.
700	1		_aSági, Gábor. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642144431
830		0	_aBolyai Society Mathematical Studies, _x1217-4696 ; _v21
856	4	0	_zLibro electrónico _uhttp://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-3-642-14444-8
596			_a19
942			_cLIBRO_ELEC
999			_c202644 _d202644