Search the Conference Calendar
Browse by subject
|
Conference Management Software Our Conference Management Software (COMS) can be used for online:
- registration
- payment
- paper submission
- review process
- paper selection
- production of the book of abstracts
Read more ...
Try our demo online
Meetings/Workshops on Graph Theory and Combinatorics in the United States (USA)
Conference-Service.com offers, as part of our business activities, a directory of upcoming scientific and technical meetings. The calendar is published for the convenience of conference participants and we strive to support conference organisers who need to publish their upcoming events.
Although great care is being taken to ensure the correctness of all entries, we cannot accept any liability that may arise from the presence, absence or incorrectness of any particular information on this website. Always check with the meeting organiser before making arrangements to participate in an event!
Meeting organisers can submit meetings free of charge for inclusion into the listing.
Select a location: Australia (1) - Canada (7) - Estonia (1) - Finland (1) - France (2) - Germany (2) - Greece (1) - Iceland (1) - India (2) - Israel (1) - Japan (1) - Spain (1) - Turkey (1) - United Kingdom (2) - United States (3) - ALL COUNTRIES (27)
| 1.Atlanta Lecture Series in Combinatorics and Graph Theory V | | Dates | 25 Feb 2012 → 26 Feb 2012 | [ID=430496]  | | Location | Atlanta, GA, United States | | Weblink | http://www.mathcs.emory.edu/rg/ALSV |
| 2.25th Cumberland Conference on Combinatorics, Graph Theory, and Computing | | Dates | 10 May 2012 → 12 May 2012 | [ID=446121]  | | Location | East Tennessee State University, Johnson City, United States | | Abstract | This will be the 25th anniversary of this popular spring conference. | | Weblink | http://www.etsu.edu/cas/math/cumberland/ |
| 3.ICERM Semester Program: Automorphic Forms, Combinatorial Representation Theory and Multiple Dirichlet Series | | Dates | 28 Jan 2013 → 03 May 2013 | [ID=444390]  | | Location | Providence, RI, United States | | Abstract | L-functions 'vast generalizations of the Riemann zeta function' are fundamental objects of study in number theory. In the 1980's the idea emerged that it could be useful to tie together a family of related L-functions in one variable to create a "double Dirichlet series," which could be used to study the average behavior of the original family of L-functions. Double Dirichlet series soon became multiple Dirichlet series. It has gradually emerged that the local structure of these multiple Dirichlet series shows a rich connection to combinatorial representation theory. This program will explore this interface between automorphic forms and combinatorial representation theory, and will develop computational tools for facilitating investigations. On the automorphic side, Whittaker functions on p-adic groups and their covers are the fundamental objects. Whittaker functions and their relatives are expressible in terms of combinatorial structures on the associated L-group, its flag variety, or Schubert varieties. In the combinatorial theory crystal graphs, Demazure characters, the Schubert calculus and Kazhdan-Lusztig theory all enter.
Recent progress in combinatorial representation theory has been facilitated by the development of computer programs by the Sage-Combinat group within the open-source mathematical software Sage. These tools have evolved in response to the research needs of the developers, but through a disciplined development process are general enough to have already found applications beyond their original intent. A major component of the program will be the further development and application of these resources, and it is hoped that they may be used to investigate the connection to multiple Dirichlet series and related combinatorics. | | Weblink | http://icerm.brown.edu/sp-s13 | | Contact | Email: nicole_henrichs@icerm.brown.edu | | Related subject(s) | General Mathematical Research | | | |
View all listed conferences in the United States (USA).
Last updated: 20 November 2011
|