000			03414nam a22004095i 4500
001			299610
003			MX-SnUAN
005			20200713064625.0
007			cr nn 008mamaa
008			150903s2009 gw | o |||| 0|eng d
020			_a9783642019609 _99783642019609
024	7		_a10.1007/9783642019609 _2doi
035			_avtls000353214
039		9	_a201509030509 _bVLOAD _c201405060317 _dVLOAD _y201402180939 _zstaff
040			_aMX-SnUAN _bspa _cMX-SnUAN _erda
050		4	_aQA164-167.2
100	1		_aKlin, Mikhail. _eeditor. _9336633
245	1	0	_aAlgorithmic Algebraic Combinatorics and Gröbner Bases / _cedited by Mikhail Klin, Gareth A. Jones, Aleksandar Juriši?, Mikhail Muzychuk, Ilia Ponomarenko.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2009.
300			_axii, 311 páginas _brecurso en línea.
336			_atexto _btxt _2rdacontent
337			_acomputadora _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_aarchivo de texto _bPDF _2rda
500			_aSpringer eBooks
505	0		_aTutorials -- Loops, Latin Squares and Strongly Regular Graphs: An Algorithmic Approach via Algebraic Combinatorics -- Siamese Combinatorial Objects via Computer Algebra Experimentation -- Using Gröbner Bases to Investigate Flag Algebras and Association Scheme Fusion -- Enumerating Set Orbits -- The 2-dimensional Jacobian Conjecture: A Computational Approach -- Research Papers -- Some Meeting Points of Gröbner Bases and Combinatorics -- A Construction of Isomorphism Classes of Oriented Matroids -- Algorithmic Approach to Non-symmetric 3-class Association Schemes -- Sets of Type (d 1,d 2) in Projective Hjelmslev Planes over Galois Rings -- A Construction of Designs from PSL(2,q) and PGL(2,q), q=1 mod 6, on q+2 Points -- Approaching Some Problems in Finite Geometry Through Algebraic Geometry -- Computer Aided Investigation of Total Graph Coherent Configurations for Two Infinite Families of Classical Strongly Regular Graphs.
520			_aThis collection of tutorial and research papers introduces readers to diverse areas of modern pure and applied algebraic combinatorics and finite geometries with a special emphasis on algorithmic aspects and the use of the theory of Gröbner bases. Topics covered include coherent configurations, association schemes, permutation groups, Latin squares, the Jacobian conjecture, mathematical chemistry, extremal combinatorics, coding theory, designs, etc. Special attention is paid to the description of innovative practical algorithms and their implementation in software packages such as GAP and MAGMA. Readers will benefit from the exceptional combination of instructive training goals with the presentation of significant new scientific results of an interdisciplinary nature.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aJones, Gareth A. _eeditor. _9336634
700	1		_aJuriši?, Aleksandar. _eeditor. _9336635
700	1		_aMuzychuk, Mikhail. _eeditor. _9307940
700	1		_aPonomarenko, Ilia. _eeditor. _9336636
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9783642019593
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-01960-9 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c299610 _d299610