Award Abstract # 1604458
Collaborative Research: Rocky Mountain - Great Plains Graduate Research Workshops in Combinatorics

NSF Org: DMS
Division Of Mathematical Sciences
Recipient: THE REGENTS OF THE UNIV. OF COLORADO
Initial Amendment Date: April 29, 2016
Latest Amendment Date: February 26, 2020
Award Number: 1604458
Award Instrument: Continuing Grant
Program Manager: Tomek Bartoszynski
tbartosz@nsf.gov
 (703)292-4885
DMS
 Division Of Mathematical Sciences
MPS
 Directorate for Mathematical and Physical Sciences
Start Date: May 1, 2016
End Date: January 31, 2020 (Estimated)
Total Intended Award Amount: $41,220.00
Total Awarded Amount to Date: $41,220.00
Funds Obligated to Date: FY 2016 = $11,000.00
FY 2017 = $21,220.00

FY 2018 = $9,000.00
History of Investigator:
  • Michael Ferrara (Principal Investigator)
    michael.ferrara@ucdenver.edu
  • Andrew Radcliffe (Co-Principal Investigator)
  • Ellen Gethner (Co-Principal Investigator)
  • Stephen Hartke (Co-Principal Investigator)
  • Florian Pfender (Co-Principal Investigator)
Recipient Sponsored Research Office: University of Colorado at Denver
13001 E 17TH PL STE F428
AURORA
CO  US  80045-2571
(303)724-0090
Sponsor Congressional District: 06
Primary Place of Performance: University of Colorado at Denver
1201 Larimer Street, Suite 4000
Denver
CO  US  80217-3364
Primary Place of Performance
Congressional District:
01
Unique Entity Identifier (UEI): MW8JHK6ZYEX8
Parent UEI: MW8JHK6ZYEX8
NSF Program(s): Combinatorics
Primary Program Source: 01001617DB NSF RESEARCH & RELATED ACTIVIT
01001718DB NSF RESEARCH & RELATED ACTIVIT

01001819DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 7556
Program Element Code(s): 797000
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.049

ABSTRACT

The Rocky Mountain-Great Plains Graduate Research Workshop in Combinatorics (GRWC), will be held in Laramie, WY (2016), Denver, CO (2017) and Ames, IA (2018), building upon successful NSF-funded workshops in 2014 and 2015. Each workshop will involve approximately 39 graduate students and postdoctoral researchers, and 10 or more faculty members in an intense two-week collaborative research experience. Participants will work to solve important, relevant problems from graph theory, enumeration, combinatorial matrix theory, finite geometry, and other modern sub-disciplines of combinatorics. Students will prepare open problems prior to the workshop under the guidance of faculty mentors from the organizing committee, which consists of faculty from Iowa State University, the University of Colorado Denver, the University of Denver, the University of Nebraska Lincoln, and the University of Wyoming. These problems, presented at the workshop by their proposers or hosted on the workshop's secure problem wiki, will be worked on by small groups of participating students, postdocs, and faculty. For more information about the GRWC, including a detailed description of the workshop format, please see the workshop website at http://sites.google.com/site/rmgpgrwc

The goal of the collaborations at the heart of the GRWC is to produce high-quality, publishable research on a variety of topics. Another longer-term goal of the workshop is to help student participants expand their professional research networks. A strong research network is often a crucial part of building a generative and sustainable research program, and establishing these connections at an early career stage can have a long-term positive effect on the quality, impact, and depth of a professional's research portfolio. Participation in the GRWC will allow students to cultivate a large professional network of peers from the combinatorics community with whom they will be able to interact and collaborate throughout their careers. The GRWC will also offer professional development workshops to help students and postdocs prepare for job searches and future careers in academia, industry, or government.

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.

Aida Abiad, Boris Brimkov, Aysel Erey, Lorinda Leshock, Xavier Martínez-Rivera, Suil O, Sung-Yell Song and Jason Williford "On the Wiener index, distance cospectrality and transmission regular graphs" Discrete Applied Math , v.230 , 2017 , p.1-10
Ayomikun Adeniran, Steve Butler, Colin Defant, Yibo Gao, Pamela E. Harris, Cyrus Hettle, Qingzhong Liang, Hayan Nam, Adam Volk "On the Genus of a quotient of a numerical semigroup" Semigroup Forum , v.98 , 2019 , p.690
Bennet Goeckner, Corbin Groothuis, Cyrus Hettle, Brian Kell, Pamela Kirkpatrick, Rachel Kirsch and Ryan Solava "Universal Partial Words over Non-Binary Alphabets" Theoretical Computer Science , v.713 , 2018 , p.55-65
Boris Brimkov, Jennifer Edmond, Robert Lazar, Bernard Lidický, Kacy Messerschmidt and Shanise Walker "Injective choosability of subcubic planar graphs with girth 6" Discrete Math , v.340 , 2017 , p.2538-2549
Jane Breen, Boris Brimkov, Joshua Carlson, Leslie Hogben, K.E. Perry and Carolyn Reinhart "Throttling for the game of Cops and Robbers on Graphs" Discrete Mathematics , v.341 , 2018 , p.2418
Michael Ferrara, William Kay, Lucas Kramer, Ryan R. Martin, Benjamin Reiniger, Heather Smith and Eric Sullivan "The Saturation Number of Induced Subposets of the Boolean Lattice" Discrete Math. , v.340 , 2017 , p.2479-2487
Minki Kim, Bernard Lidický, Tomá? Masa?ík, Florian Pfender "Notes on complexity of packing coloring" Information Processing Letters , v.137 , 2018 , p.6
Sam Spiro "Subset Parking Functions" J. Integer Sequences , v.22 , 2019

PROJECT OUTCOMES REPORT

Disclaimer

This Project Outcomes Report for the General Public is displayed verbatim as submitted by the Principal Investigator (PI) for this award. Any opinions, findings, and conclusions or recommendations expressed in this Report are those of the PI and do not necessarily reflect the views of the National Science Foundation; NSF has not approved or endorsed its content.

The Graduate Research Workshop in Combinatorics (GRWC) is a 2-week summer workshop for graduate students and postdocs in combinatorics, a branch of discrete mathematics.  The GRWC has been in existence from 2014, and this award provided funding for the 2016 GRWC at the University of Wyoming, the 2017 GRWC in Denver, CO (co-hosted by the University of Colorado Denver and the University of Denver), the 2018 GRWC at Iowa State University and the 2019 GRWC at the University of Kansas.  The goal of the workshop to support early-career mathematicians through individual and group mentoring, exposure to important research problems and cutting edge methods, and the development of a durable professional network of their peers.  

 

At each GRWC, teams of students, postdocs and faculty mentors collaborate on open research problems from across the discipline.  Students and postdocs also take part in professional development seminars on topics including careers in industry, government and academia, the grant writing process, equity in the mathematical sciences and more.  From 2016-2019 this award supported over 100 graduate students and postdocs as well as 12 faculty from U.S. institutions.  With additional support from other funders, the 2016-2019 workshops supported the training and mentoring of nearly 180 early-career mathematicians from over 50 institutions.  Teams from these workshops are responsible for 12 accepted or published research papers, with 19 additional papers under review and even more in progress.  Participants have also presented their work well over 100 times, including GRWC-organized sessions at 4 international meetings and talks at multiple national and regional conference and seminars.  


Last Modified: 02/29/2020
Modified by: Michael J Ferrara

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

Print this page

Back to Top of page