Matematicas Discretas.

Sebastian Bejos *

13 de agosto de 2014

1. Contenido Tematico

1 Combinatoria biyectiva

2 Teora enumerativa de Polya

3 Conjuntos parcialmente ordenados

2. Bibliografa Basica

1 N. Biggs, Discrete Mathematics, Oxford University Press, Second Edition, 2002.

2 M. Bona, Introduction to Enumerative Combinatorics, The Walter Rudin Student Series in AdvancedMathematics, Mc Graw Hill, 2007.

3 J. Matousek, J. Nesetril, Invitation to Discrete Mathematics, Second Edition, Oxford University Press,2008.

4 D. Mazur, Combinatorics A Guided Tour, The Mathematical Association of America, 2010.

5 F. Roberts, B. Tesman, Applied Combinatorics, CRC Press, Second Edition, 2009.

3. Bibliografa Complementaria

1 M. Bona, Combinatorics of Permutations, Discrete Mathematics and its Applications, CRC Press, SecondEdition, 2012.

2 N. Loehr, Bijective Combinatorics, Discrete Mathematics and its Applications, CRC Press, 2011.

3 S. Nagpaul, S. Jain, Topics in Applied Abstract Algebra, The Brooks/Cole Series in Advanced Mathematics,American Mathematical Society, 2004.

4 R. Stanley , Enumerative Combinatorics Second Edition Volume I, Cambridge Studies in Advanced Mat-hematics, 2011.

5 W.Trotter, Combinatorics and Partially Ordered Sets, The Johns Hopkins University Press, 1992.

4. Criterios de Evaluacion y Acreditacion

Regular

1 Tareas 45 % (3 tareas 15 % cada una)

2 Examenes 45 % (3 examenes 15 % cada uno)

3 Participaciones 10 %

Primera Vuelta

1 Examen Final 100 %

Segunda Vuelta

1 Examen Final 100 %

Para acreditar la materia el alumno debera promediar al menos 6 en la fase regular, en la primera o segundavuelta.

*Laboratorio de Algoritmos para la Robotica LAR, Cubculo 015, Centro de Desarrollo Tecnologico, UNAM. Correo electronicojbejos@uxmcc2.iimas.unam.mx

1