Project Grant 2338532

CAREER: GRAPH PROFILES: COMPLEXITY AND COMPUTATIONS -MANY PROBLEMS IN ENGINEERING, SCIENCE, ECONOMICS, AND SOCIAL SCIENCES INVOLVE COMPLICATED SYSTEMS THAT CAN BE REPRESENTED AS GRAPHS. FOR EXAMPLE, ROAD NETWORKS, THE HUMAN BRAIN, SOCIAL NETWORKS, AND INTERACTIONS BETWEEN PROTEINS CAN ALL BE REPRESENTED AS GRAPHS. COMPUTING DIFFERENT PROPERTIES OF THESE GRAPHS YIELDS VALUABLE INFORMATION ABOUT THE ORIGINAL PROBLEMS, BUT IT IS DIFFICULT TO DO SO BECAUSE OF THE SIZE OF THE GRAPHS. ONE TECHNIQUE TO STUDY SUCH LARGE GRAPHS IS TO UNDERSTAND THEM LOCALLY BY DETERMINING HOW PREVALENT CERTAIN SMALL SUBSTRUCTURES ARE, FOR EXAMPLE THROUGH HOMOMORPHISM DENSITIES. THE OBJECTIVE OF THIS PROJECT IS TO FURTHER OUR UNDERSTANDING OF GRAPH PROFILES, OBJECTS THAT RECORD ALL POSSIBLE RELATIONSHIPS BETWEEN THESE LOCAL PATTERNS. THIS PROJECT ALSO SEEKS TO MAKE HIGHER-LEVEL MATH, IN PARTICULAR DISCRETE MATHEMATICS, ACCESSIBLE TO A GREATER SEGMENT OF THE POPULATION THROUGH AN EDUCATIONAL PLAN RESTING ON THREE PILLARS: DIVERSITY, PRISON EDUCATION, AND RESEARCH-BASED COURSES. THE RESEARCH COMPONENT OF THIS PROJECT WILL FOCUS ON FOUR DIRECTIONS: (1) TO COMPUTE GRAPH PROFILES, INCLUDING SOME IN MORE THAN TWO DIMENSIONS; (2) TO STUDY THE STRENGTHS AND LIMITATIONS OF DIFFERENT TECHNIQUES (E.G., (RATIONAL) SUMS OF SQUARES, SUMS OF NONNEGATIVE CIRCUITS) IN PROVING INEQUALITIES OVER GRAPH PROFILES; (3) TO BETTER UNDERSTAND FOR WHICH CLASSES OF INEQUALITIES CERTIFICATION OVER GRAPH PROFILES IS (UN)DECIDABLE; (4) TO BUILD THEORY AND COMPUTE TROPICALIZATIONS OF GRAPH PROFILES, WHICH ARE SIMPLER AND YET CAPTURE ALL VALID PURE BINOMIAL INEQUALITIES, AND TO USE THESE COMPUTATIONS TO RESOLVE PROBLEMS IN EXTREMAL GRAPH THEORY. THIS AWARD REFLECTS NSF'S STATUTORY MISSION AND HAS BEEN DEEMED WORTHY OF SUPPORT THROUGH EVALUATION USING THE FOUNDATION'S INTELLECTUAL MERIT AND BROADER IMPACTS REVIEW CRITERIA.- SUBAWARDS ARE NOT PLANNED FOR THIS AWARD.