text-only page produced automatically by Usablenet Assistive Skip all navigation and go to page content Skip top navigation and go to directorate navigation Skip top navigation and go to page navigation
National Science Foundation
Awards
design element
Search Awards
Recent Awards
Presidential and Honorary Awards
About Awards
Grant Policy Manual
Grant General Conditions
Cooperative Agreement Conditions
Special Conditions
Federal Demonstration Partnership
Policy Office Website



Award Abstract #1147247

Collaborative Research: SI2-SSE: Sage-Combinat: Developing and Sharing Open Source Software for Algebraic Combinatorics

NSF Org: OAC
Office of Advanced Cyberinfrastructure (OAC)
divider line
Initial Amendment Date: June 19, 2012
divider line
Latest Amendment Date: June 19, 2012
divider line
Award Number: 1147247
divider line
Award Instrument: Standard Grant
divider line
Program Manager: Rajiv Ramnath
OAC Office of Advanced Cyberinfrastructure (OAC)
CSE Direct For Computer & Info Scie & Enginr
divider line
Start Date: June 1, 2012
divider line
End Date: May 31, 2016 (Estimated)
divider line
Awarded Amount to Date: $216,626.00
divider line
Investigator(s): Anne Schilling anne@math.ucdavis.edu (Principal Investigator)
divider line
Sponsor: University of California-Davis
OR/Sponsored Programs
Davis, CA 95618-6134 (530)754-7700
divider line
NSF Program(s): OFFICE OF MULTIDISCIPLINARY AC,
OPERATIONS RESEARCH,
DYNAMICAL SYSTEMS,
Software Institutes,
CDS&E-MSS
divider line
Program Reference Code(s): 1253, 5514, 7433, 7478, 7683, 8004, 8005
divider line
Program Element Code(s): 1253, 5514, 7478, 8004, 8069

ABSTRACT

Sage is an open source general purpose mathematical software system that has developed explosively within the last six years. Sage-Combinat is a subproject whose mission is "to improve Sage as an extensible toolbox for computer exploration in (algebraic) combinatorics, and foster code sharing between researchers in this area". There is a long tradition of software packages for algebraic combinatorics. These have been crucial in the development of combinatorics since the 1960s. The originality of the Sage-Combinat project lies in successfully addressing the following simultaneous objectives. It offers a wide variety of interoperable and extensible tools, integrated in a general purpose mathematical software package, as needed for daily computer exploration in algebraic combinatorics; it is developed by a community of researchers spread around the world and across institutions; and it is open source and depends only on open source software. Among the proposers, Stein is founder and lead developer of Sage while Bump, Musiker, and Schilling are strong contributors to Sage-Combinat. Hivert and ThiŽery (Paris-Sud, Orsay), founders and lead developers of Sage-Combinat, are both strongly affiliated with this project. Some of the research areas addressed in this project include symmetric functions, in particular Macdonald polynomials for arbitrary Cartan types and their nonsymmetric analogues, crystals, rigged configurations and combinatorial R-matrices, affine Weyl groups and Hecke algebras, cluster algebras, and posets.



The project will develop Sage-Combinat in areas relevant to the ongoing research of the participants, together with relevant underlying infrastructure. The project will include three Sage Days workshops, and will be affiliated with a third scheduled workshop at ICERM. These workshops include a strong outreach component and have been a potent tool for connecting researchers and recruiting Sage users and developers. The grant will also fund a dedicated software development and computation server for Sage-Combinat, to be hosted in the Sage computation farm in Seattle. Emphasis will be placed on the development of thematic tutorials that will make the code accessible to new users. The proposal will also fund graduate student RA support, curriculum development, and other mentoring.


PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH

Note:  When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).

Some links on this page may take you to non-federal websites. Their policies may differ from this site.


(Showing: 1 - 10 of 16)
  Show All

Jennifer Morse, Anne Schilling. "A combinatorial formula for fusion coefficients," DMTCS proc, v.AR, 2012, p. 735-744.

Patricia Hersh, Anne Schilling. "Symmetric Chain Decomposition for Cyclic Quotients of Boolean Algebras and Relation to Cyclic Crystals," Int Math Res Notices, v.2013, 2012, p. 463-473. 

Arvind Ayyer, Steven Klee, Anne Schilling. "Combinatorial Markov chains on linear extensions," J. Algebraic Combinatorics, 2013. 

Cristian Lenart, Satoshi Naito, Daisuke Sagaki, Anne Schilling, Mark Shimozono. "A uniform model for Kirillov-Reshetikhin crystals I: Lifting the parabolic quantum Bruhat graph," International Mathematics Research Notices, v.2014, 2014. 

Cristian Lenart, Satoshi Naito, Daisuke Sagaki, Anne Schilling, Mark Shimozono. "A uniform model for Kirillov-Reshetikhin crystals. Extended abstract.," DMCTS proc, v.AS, 2013, p. 25. 

Maurice Pouzet, Nicolas M. Thiery. "Some relational structures with polynomial growth and their associated algebras I: Quasi-polynomiality of the profile," Electronic Journal of Combinatorics, v.20, 2013, p. 1077.

Anne Schilling, Travis Scrimshaw. "Crystal structure on rigged configurations and the filling map," Electronic J. Combinatorics, v.22, 2015, p. P1.73. 

Arvind Ayyer, Anne Schilling, Benjamin Steinberg, Nicolas M. Thiery. "Directed nonabelian sandpile models on trees," Communications Math. Physics, v.335, 2015, p. 1065. 

Arvind Ayyer, Anne Schilling, Benjamin Steinberg, Nicolas M. Thiery. "Markov chains, R-trivial monoids and representation theory," International Journal of Algebra and Computation, v.25, 2015, p. 69. 

Arvind Ayyer, Steven Klee, Anne Schilling. "Markov chains for promotion operators," Fields Institute Communications, v.71, 2014, p. 285. 


(Showing: 1 - 10 of 16)
  Show All




 

Please report errors in award information by writing to: awardsearch@nsf.gov.

 

 

Print this page
Back to Top of page
  RESEARCH AREAS   FUNDING   AWARDS   DOCUMENT LIBRARY   NEWS   ABOUT NSF  
Website Policies  |  Budget and Performance  |  Inspector General  |  Privacy  |  FOIA  |  No FEAR Act  |  USA.gov
Accessibility  |  Plain Language  |  Contact
National Science Foundation Logo
National Science Foundation, 4201 Wilson Boulevard, Arlington, Virginia 22230, USA
Tel: (703) 292-5111, FIRS: (800) 877-8339 | TDD: (800) 281-8749
  Text Only Version