Publications de Sylvie Corteel
   

Logiciels

• S. Corteel, A. Denise, I. Dutour, P. Zimmermannm, CS, CD logiciels libres de l'Inria, 2000.

Publications dans des journaux internationaux


• S. Corteel and J. Lovejoy, Overpartitions and the q-Bailey identity, Proc. Edinburgh Math. Soc., to appear. pdf
  
• S. Corteel and P. Nadeau, bijections for permutation tableaux, Europ Jal of Comb., to appear. pdf
  
• S. Corteel and O. Mallet, Overpartitions, lattice paths, and the Rogers-Ramanujan identities, Jal of Comb Theory Series A, 114 (2007), 1407–1437. pdf
• S. Corteel, I. Gessel, C.D. Savage and H.S. Wilf, The joint distribution of descent ad major statistics over restricted sets of permutations, Annals of Combinatorics, to appear. pdf
• G.E. Andrews, S. Corteel and C.D. Savage, On q-series identities arising from Lecture Hall partitions, Int. J. Number Theory, to appear. pdf
  
• S. Corteel, J. Lovejoy et O.  Mallet, An extension to overpartitions of the Rogers-Ramanujan identities for even moduli, J. Number Theory, to appear . pdf
• S. Corteel and L.K Williams, A Markov chain on permutations which projects to the PASEP. Int. Math. Res. Not. (2007) article ID rnm055
• S. Corteel and L.K. Williams, Tableaux combinatorics for the asymmetric exclusion process, Adv in App Maths, to appear.
• S. Corteel, G. Louchard and R. Pemantle, Common Intervals in Permutations, DMTCS, Vol 8 (2006) Combinatorics.
• S. Corteel, C.D. Savage and H.S. Wilf, A note on partitions and compositions defined by inequalities, Integers 5 (2005), no 1, A24, 11pp.
• S. Corteel, S. Lee and C.D. Savage, Five guidelines for partition analysis with applications to Lecture-Hall type theorems, Integers, to appear.
  
• S. Corteel, S. Lee and C.D. Savage, Enumeration of sequences constrained by the ratio of consecutive parts, Sem. Lothar. Combin. 54A (1005/06) Art. B54Aa, 12pp.
  
• S. Corteel, Crossings and alignements of permutations, Adv in App Maths, to appear.
• S. Corteel, W. Goh and P. Hitczenko, A local limit theorem in the theory of overpartitions, Algorithmica, to appear. pdf
• S. Corteel and J. Lovejoy, An iterative-bijective approach o generalizations of Schur's theorem, Europ Jal of Comb., 27 (1006) no 4, 496-512.  pdf
• S. Corteel and P. Hitczenko, Multiplicity and number of parts in overpartitions, Annals of Combinatorics, 8 (2004) 287-301. ps
• S. Corteel, M. Valencia-Pabon, J. Vera, Approximating the b-chromatic number, Discrete Applied Maths, 146 (2005) no 1, 106-110. xxx
• S. Corteel and C.D. Savage, Lecture Hall, q-series and truncated objects, Jal of Comb Theory Series A, 108 (2004) 217-245.
• S. Corteel, J. Lovejoy and A.J. Yee, Infinite Generating function and Frobenius partitions,  Mathematics and Computer Science III, 15--24, Trends Math., Birkauser, Basel, 2004.
• S. Corteel, A. Goupil and G. Schaeffer Content evaluation and class symmetric functions , Adv. in Maths, 188 (2004) 315-336.
• S. Corteel, Particle seas and basic hypergeometric series Advances in Applied Maths, 31 (2003), no 1, 199-214. ps
• S. Corteel and C. D. Savage, Plane Partition Diamonds and Generalizations , INTEGERS, Vol. 3, A9 (2003). 
• S. Corteel and J. Lovejoy, Overpartitions, Trans. of the Amer. Math. Soc, 356 (2004), 1623-1635. ps
• S. Corteel and C.D. Savage, The anti-lecture hall compositions, Discrete Mathematics, Vol. 263, Nos. 1-3(2003) 275-280 (Editor's choice). ps
• S. Corteel and C.D. Savage, Partitions and compositions defined by inequalities, Ramanujan journal, (2004) 8,  357-381.
• S. Corteel and D. Gouyou-Beauchamps, Enumerations of Sand Piles, Discrete Maths, 256 (2002) 3, 625-643. ps
• E. Canfield, S. Corteel, P. Hitczenko, Random Partitions with non negative rth difference, Adv in App Maths 27 (2001) 298-317.
• S. Corteel and J.K. Lovejoy, Frobenius Partitions and the combinatorics of Ramanujan's 1psi1 summation, Combin. Theory Ser. A , 97 (2002), no 1, 177-183.  ps
• S. Corteel, A. Denise and D. Gouyou-Beauchamps. Bijections for directed animals on infinite families of lattices. Annals of Combinatorics 4 (2000) 269-284.
• S. Corteel, M. Valencia-Pabon, D. Gardy, D. Barth and A. Denise, The Permutation-Path Coloring Problem on Trees, Theoretical Computer Science, 297 (2003) no 1-3, 119-143.
• A. Burnstein, S. Corteel, A. Postnikov and C.D. Savage, A note on a lattice path approach to counting partitions with minimum rank , Discrete Math, Vol. 249, Nos. 1-3 (2002) 31-39.
• S. Corteel, G. Rémond, G. Schaeffer and H. Thomas, The number of plane corner cuts. Adv. in Appl. Math. 23 (1999), no. 1, 49-53.
• S. Corteel, B. Pittel, C.D. Savage and H.S. Wilf, On the multiplicity of parts in a random partition. Random Structures Algorithms 14 (1999), no. 2, 185-197.
• E.R. Canfield, S. Corteel, C.D. Savage, Durfee polynomials. Electron. J. Combin. 5 (1998), no. 1, R32, 21 pp.
• S. Corteel, C.D. Savage and R. Venkatraman, A bijection for partitions with all ranks at least t. J. Combin. Theory Ser. A 83 (1998), no. 2, 202-220.
• S. Corteel, C.D. Savage, H.S. Wilf and D. Zeilberger, A pentagonal number sieve. J. Combin. Theory Ser. A 82 (1998), no. 2, 186-192.

Conférences internationales avec comité de lecture et actes
• Septembre 2006 : S. Corteel, J. Lovejoy et O.  Mallet, An extension to overpartitions of the Rogers-Ramanujan identities for even moduli, Fourth Colloquium on Mathematics and Computer Science, Nancy, France.
  
• Juin 2006 : S. Corteel and O. Mallet, Overpartitions, lattice paths, and the Rogers-Ramanujan identities, FPSAC2006, San-Diego (poster).
  
• Juin 2005 : R. Brak, S. Corteel, A. Rechnitzer, J. Essam, A combinatorial derivation of the PASEP algebra, FPSAC2005, Sicile (poster).
• Juin 2005 : S. Corteel, S. Lee and C.D. Savage, Enumeration of sequences constrained by the ratio of consecutive parts, FPSAC2005, Sicile (poster).
• Septembre 2004 : S. Corteel, G. Louchard and R. Pemantle, Common Intervals in Permutations, Third Colloquium on Mathematics and Computer Science, Vienne, Autriche Short  
• Septembre 2004 : S. Corteel, J. Lovejoy and A.J. Yee, Infinite Generating function and Frobenius partitions,  Third Colloquium on Mathematics and Computer Science, Vienne, Autriche.
• Juillet 2003 :  S. Corteel and J. Lovejoy, Overpartitions, FPSAC2003, Suede.
• Septembre 2002 :  A. Bergeron, S. Corteel and M. Raffinot, The algorithmic of Gene Teams, WABI2002, Rome, Italy.
• Juillet 2002 :  S. Corteel and C.D. Savage, Compositions and partitions defined by inequalities, FPSAC2002, Melbourne, Australia.
• April 2002 : Random partitions with non-negative rth differences, LATIN'2002, Cancun, Mexico.
• Septembre 2000 : S. Corteel and D. Gouyou-Beauchamps, Enumerations of Sand Piles, LACIM2000.
• Juin 2000 : S. Corteel, Séries génératrices exponentielles pour les ECO-systèmes signés (poster), FPSAC'00, Moscow, Russie, Lectures Notes in Computer Science, Springer, à paraître.
• Avril 2000 : D. Barth, S. Corteel, A. Denise, D. Gardy, and M. Valencia-Pabon, On the complexity of routing permutations on trees by arc-disjoint paths, LATIN'2000, Punta Del Este, Uruguay, Lectures Notes in Computer Science, Springer, à paraître.
• Juin 1998 : S. Corteel, C.D. Savage and R. Venkatraman, Bijections for partitions with minimal rank t (poster), FPSAC'98, Toronto, Canada, p 179-192.
• Juillet 1997 : E. R. Canfield, S. Corteel and C.D. Savage, Durfee Polynomials, FPSAC'97, Vienna, Austria, Volume 1, p 142-153.
 

        Conférences invitées

• Novembre 2004 : Additive Number theory, University of Florida, USA. slides pdf
  
• Février 2004 : Permutations, paths and Trees, Nankai University, Chine.