COMS

Papers are solicited describing original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, randomized, parameterized, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, random graphs, diagram methods, and support of these concepts by suitable implementations. The scope of WG includes all applications of graph-theoretic concepts in Computer Science, including data structures, data bases, programming languages, computational geometry, tools for software construction, communications, computing on the web, models of the web and scale-free networks, mobile computing, concurrency, computer architectures, VLSI, artificial intelligence, graphics, CAD, operations research, and pattern recognition.

There will be a special talk on Yahya?s mathematical achievements, a movie documenting his battle against environmental destruction in his native Mauritania as well as a themed conference dinner.

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.