Sergi Elizalde

نویسنده

  • Sergi Elizalde
چکیده

My main area of research is combinatorics. I like not only its beauty as a subject but also its wide applicability throughout mathematics and science. I have diverse mathematical interests, and combinatorics is the bridge that connects them. Even though I have a predilection for enumerative questions, I have also worked on algebraic combinatorics, computational biology, number theory, and combinatorial commutative algebra. In general, I am interested in the connections of combinatorics with other fields such as algebra, biology, geometry, probability, and computer science. I have acquired a broad background by working on different problems, and taking courses in different areas. I enjoy learning new problems and trying to solve them using combinatorial techniques. I finished my Ph.D. thesis at MIT in June of 2004, under the supervision of Professor Richard Stanley. After graduating I spent the year 2004-2005 as a postdoctoral fellow at MSRI, in Berkeley. In the fall I took part in the programs on Hyperplane Arrangements and Applications in the fall, and Probability, Algorithms and Statistical Physics in the spring. At the same time I worked with Professor Bernd Sturmfels on combinatorial problems arising from computational biology. During the months of May and June of 2005 I did a postdoctoral stay at the Institut MittagLeffler in Sweden, as part of the special program on Algebraic Combinatorics. As of July of 2005 I am a John Wesley Young Research Instructor at Dartmouth College. Here my research has been on enumerative problems concerning generalized triangulations and also pattern-avoiding permutations. I have benefited from being around Professor Peter Winkler, and I am currently also working with Professor Rosa Orellana on a problem in algebraic combinatorics. In the rest of this statement I will describe with more detail my research accomplishments in different areas, as well as future directions of my research (indicated by a vertical bar in the margin).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bijections for Refined Restricted Permutations Sergi Elizalde and Igor Pak

We present a bijection between 321and 132-avoiding permutations that preserves the number of fixed points and the number of excedances. This gives a simple combinatorial proof of recent results of Robertson, Saracino and Zeilberger [8], and the first author [3]. We also show that our bijection preserves additional statistics, which extends the previous results.

متن کامل

A Simple and Unusual Bijection for Dyck Paths and Its Consequences Sergi Elizalde and Emeric Deutsch

In this paper we introduce a new bijection from the set of Dyck paths to itself. This bijection has the property that it maps statistics that appeared recently in the study of pattern-avoiding permutations into classical statistics on Dyck paths, whose distribution is easy to obtain. We also present a generalization of the bijection, as well as several applications of it to enumeration problems...

متن کامل

Clusters, generating functions and asymptotics for consecutive patterns in permutations

Article history: Received 27 January 2012 Accepted 9 August 2012 Available online 5 September 2012 MSC: primary 05A05 secondary 05A15, 06A07

متن کامل

Bijections for refined restricted permutations

We present a bijection between 321and 132-avoiding permutations that preserves the number of fixed points and the number of excedances. This gives a simple combinatorial proof of recent results of Robertson et al. (Ann. Combin. 6 (2003) 427), and Elizalde (Proc. FPSAC 2003). We also show that our bijection preserves additional statistics, which extends the

متن کامل

Inversion polynomials for 321-avoiding permutations: addendum

This addendum contains results about the inversion number and major index polynomials for permutations avoiding 321 which did not fit well into the original paper. In particular, we consider symmetry, unimodality, behavior modulo 2, and signed enumeration.

متن کامل

An involution on lattice paths between two boundaries

We give an involution on the set of lattice paths from (0, 0) to (a, b) with steps N = (0, 1) and E = (1, 0) that lie between two boundaries T and B, which proves that the statistics ‘number of E steps shared with T ’ and ‘number of E steps shared with B’ have a symmetric joint distribution on this set. This generalizes a result of Deutsch for the case of Dyck paths.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006