Printed Program and Abstracts

Sponsored by the SIAM Activity Group on Algebraic Geometry

The purpose of the SIAM Activity Group on Algebraic Geometry is to bring together researchers who use algebraic geometry in industrial and applied mathematics. “Algebraic geometry” is interpreted broadly to include at least: algebraic geometry, commutative algebra, noncommutative algebra, symbolic and numeric computation, algebraic and geometric combinatorics, representation theory, and algebraic topology. These methods have already seen applications in: biology, coding theory, cryptography, combustion, computational geometry, computer graphics, quantum computing, control theory, geometric design, complexity theory, machine learning, nonlinear partial differential equations, optimization, robotics, and statistics.

We welcome participation from both theoretical mathematical areas and application areas not on this list which fall under this broadly interpreted notion of algebraic geometry and its applications.

Society for Industrial and Applied Mathematics 3600 Market Street, 6th Floor Philadelphia, PA 19104-2688 USA Telephone: +1-215-382-9800 Fax: +1-215-386-7999 Conference E-mail: [email protected] Conference Web: www.siam.org/meetings/ Membership and Customer Service: (800) 447-7426 (USA & Canada) or +1-215-382-9800 (worldwide) www.siam.org/meetings/ag17 2 SIAM Conference on Applied Algebraic Geometry

Table of Contents SIAM Registration Desk Corporate/Institutional Members The Aerospace Corporation The SIAM registration desk is located Air Force Office of Scientific Research Program-At-A-Glance… in the Skiles Building - Bottom (0-th) Amazon ...... Separate handout Floor. It is open during the following General Information...... 2 hours: Aramco Services Company Get-togethers...... 4 Monday, July 31 Bechtel Marine Propulsion Laboratory Invited Plenary Presentations...... 5 7:00 AM – 4:00 PM The Boeing Company Prize ...... 8 CEA/DAM Program Schedule...... 11 Tuesday, August 1 Department of National Defence (DND/ Poster Session...... 20 7:30 AM – 4:00 PM CSEC) Abstracts...... 65 DSTO- Defence Science and Speaker and Organizer Index...... 150 Wednesday, August 2 Technology Organisation Conference Budget…Inside Back Cover 7:30 AM – 4:00 PM Hewlett-Packard Campus Map...... Back Cover Huawei FRC French R&D Center Thursday, August 3 IBM Corporation 7:30 AM – 4:00 PM IDA Center for Communications Organizing Committee Friday, August 4 Research, La Jolla Co-Chairs 7:30 AM - 4:00 PM IDA Center for Communications David A. Cox Research, Princeton Amherst College, USA Child Care Institute for Defense Analyses, Center Serkan Hosten for Computing Sciences San Francisco State University, USA For local child care resources, please Lawrence Berkeley National Laboratory use: Lawrence Livermore National Labs Local Organizers Friend of Family: +1-770-725-2748 Lockheed Martin Greg Blekherman TLC: +1-770-410-4774 Los Alamos National Laboratory Georgia Institute of Technology, USA Max-Planck-Institute for Dynamics of Anton Leykin Complex Technical Systems Georgia Institute of Technology, USA Corporate Members Mentor Graphics Josephine Yu and Affiliates National Institute of Standards and Georgia Institute of Technology, USA SIAM corporate members provide Technology (NIST) their employees with knowledge about, National Security Agency (DIRNSA) access to, and contacts in the applied Naval PostGrad Organizing Committee mathematics and computational sciences Oak Ridge National Laboratory, Alicia Dickenstein community through their membership managed by UT-Battelle for the Universidad de Buenos Aires, Argentina benefits. Corporate membership is more Department of Energy than just a bundle of tangible products Hoon Hong Sandia National Laboratories North Carolina State University, USA and services; it is an expression of Schlumberger-Doll Research Teresa Krick support for SIAM and its programs. United States Department of Energy Universidad de Buenos Aires, Argentina SIAM is pleased to acknowledge its corporate members and sponsors. U.S. Army Corps of Engineers, Engineer Kristin Lauter In recognition of their support, non- Research and Development Center Microsoft Research, USA member attendees who are employed by US Naval Research Labs Lek-Heng Lim the following organizations are entitled University of Chicago, USA to the SIAM member registration rate. List current June 2017. Dmitriy Morozov Lawrence Berkeley National Laboratory, USA Frank Sottile Texas A&M University, USA Thorsten Theobald Goethe-Universitaet, Frankfurt, Germany Ruriko Yoshida Naval Postgraduate School, USA SIAM Conference on Applied Algebraic Geometry 3

Funding Agency AG membership. Contact SIAM Registration Fee Includes SIAM and the conference organizing Customer Service for details. • Admission to all technical sessions committee wish to extend their thanks Free Student Memberships are available • Business Meeting (open to SIAG/AG and appreciation to the U.S. National to students who attend an institution that members) is an Academic Member of SIAM, are Science Foundation for its support of this • Coffee breaks daily conference. members of Student Chapters of SIAM, or are nominated by a Regular Member • Room set-ups and audio/visual of SIAM. equipment • Welcome Reception and Poster Go to www.siam.org/joinsiam to join Session online or download an application form, or contact SIAM Customer Service: Telephone: +1-215-382-9800 Job Postings (worldwide); or 800-447-7426 (U.S. and Please visit http://jobs.siam.org to view Canada only) the job postings available. Join SIAM and save! Fax: +1-215-386-7999 Leading the applied E-mail: [email protected] mathematics community . . . Postal mail: Society for Industrial and Ap- Important Notice to Poster plied Mathematics, 3600 Market Street, 6th SIAM members save up to $65 on floor, Philadelphia, PA Presenters full registration for the 2017 SIAM 19104-2688 USA The poster session is scheduled for Conference on Applied Algebraic Monday, July 31 from 5:00 PM – 7:00 Geometry! Join your peers in PM. Poster presenters are expected supporting the premier professional Standard Audio/Visual to set up their poster material on the society for applied mathematicians and Set-Up in Meeting Rooms provided 4’ x 8’ poster boards in the computational scientists. SIAM members Klaus Advanced Computing Building by receive subscriptions to SIAM Review, SIAM does not provide computers for Monday, July 31 by 5:00 PM, the official SIAM News and SIAM Unwrapped, any speaker. When giving an electronic start time of the session. Posters must and enjoy substantial discounts on presentation, speakers must provide be removed by 7:00 PM, the end of the SIAM books, journal subscriptions, and their own computers. SIAM is not poster session. conference registrations. responsible for the safety and security of speakers’ computers.

If you are not a SIAM member and paid The Plenary Session Room will have SIAM Books and Journals the Non-Member or Non-Member two (2) screens, one (1) data projector SIAM books are available at a discounted Mini Speaker/Organizer rate to attend and one (1) overhead projector. All price during the conference. Titles the conference, you can apply the other concurrent/breakout rooms will on Display forms are available with difference between what you paid have one (1) screen and one (1) data instructions on how to place a book and what a member would have paid projector. The data projectors support order. ($65 for a Non-Member and $35 for a both VGA and HDMI connections. Non-Member Mini Speaker/Organizer) Presenters requiring an alternate towards a SIAM membership. Contact connection must provide their own SIAM Customer Service for details. adaptor.

If you are a SIAM member, it only costs Internet Access $15 to join the SIAM Activity Group Georgia Tech provides Eduroam on its on Algebraic Geometry (SIAG/AG). As campus. If your institution participates a SIAG/AG member, you are eligible in Eduroam, please connect to this for an additional $15 discount on this network. If not, you will be provided conference, so if you paid the SIAM a temporary code to use wifi. Please member rate to attend the conference, inquire at the registration desk for you might be eligible for a free SIAG/ additional information. 4 SIAM Conference on Applied Algebraic Geometry

Conference Sponsor any other reason not related to scientific merit. This philosophy extends from SIAM confer- Advocate: ences, to its publications, and to its governing structures and bodies. We expect all members of SIAM and participants in SIAM activities to work towards this commitment.

Please Note Name Badges SIAM is not responsible for the safety A space for emergency contact and security of attendees’ computers. Do information is provided on the back of not leave your personal electronic devices your name badge. Help us help you in unattended. Please remember to turn off the event of an emergency! your cell phones and other devices during sessions.

Comments? Comments about SIAM meetings are Recording of Presentations encouraged! Please send to: Cynthia Audio and video recording of presentations at Phillips, SIAM Vice President for SIAM meetings is prohibited without the writ- Programs ([email protected]). ten permission of the presenter and SIAM.

Get-togethers Social Media SIAM is promoting the use of social Welcome Reception and Poster Session media, such as Facebook and Twitter, in Monday, July 31 order to enhance scientific discussion at its 5:00 PM – 7:00 PM meetings and enable attendees to connect with each other prior to, during and after conferences. If you are tweeting about Business Meeting a conference, please use the designated (open to SIAG/AG members) hashtag to enable other attendees to keep Thursday, August 3 up with the Twitter conversation and to 5:15 PM – 6:15 PM allow better archiving of our conference discussions. The hashtag for this meeting is #SIAMAG17. Statement on Inclusiveness SIAM’s Twitter handle is As a professional society, SIAM is com- @TheSIAMNews. mitted to providing an inclusive climate that encourages the open expression and exchange of ideas, that is free from all forms of discrimination, harassment, and retalia- tion, and that is welcoming and comfortable to all members and to those who participate in its activities. In pursuit of that commit- ment, SIAM is dedicated to the philosophy of equality of opportunity and treatment for all participants regardless of gender, gender identity or expression, sexual orientation, race, color, national or ethnic origin, religion or religious belief, age, marital status, dis- abilities, veteran status, field of expertise, or SIAM Conference on Applied Algebraic Geometry 5

Invited Plenary Speakers

** All Invited Plenary Presentations will take place in Clough Undergraduate Learning Commons – 152**

Monday, July 31 8:30 AM – 9:30 AM IP1 Uses of Algebraic Geometry and Representation Theory in Complexity Theory Joseph M. Landsberg, Texas A&M University, USA

1:30 PM – 2:30 PM IP2 On the Stability of Solutions in Numerical Algebraic Geometry Carlos Beltrán, Universidad de Cantabria, Spain

Tuesday, August 1 8:30 AM – 9:30 AM IP3 Algebraic Geometry for Geometric Modeling Ragni Piene, University of Oslo, Norway

1:30 PM – 2:30 PM IP4 Polynomial Dynamical Systems, Toric Differential Inclusions, and the Global Attractor Conject Gheorghe Craciun, University of Wisconsin, Madison, USA 6 SIAM Conference on Applied Algebraic Geometry

SIAM Activity Group on Applied Algebraic Geometry (SIAG/AG) www.siam.org/activity/ag

A GREAT WAY TO GET INVOLVED! Collaborate and interact with mathematicians and applied scientists whose work involves applied algebraic geometry.

ACTIVITIES INCLUDE: • Special Sessions at SIAM meetings • Biennial conference • SIAG/Algebraic Geometry Early Career Prize • SIAG/AG Wiki

BENEFITS OF SIAG/AG MEMBERSHIP: • Listing in the SIAG’s online membership directory • Additional $15 discount on registration at the SIAM Conference on Applied Algebraic Geometry • Electronic communications about recent developments in your specialty • Electronic newsletter • Eligibility for candidacy for SIAG/AG office • Participation in the selection of SIAG/AG officers

ELIGIBILITY: • Be a current SIAM member. COST: • $15 per year • Student members can join 2 activity groups for free!

2016-17 SIAG/AG OFFICERS Chair: Agnes Szanto, NC State University Vice Chair: Jan Draisma, Universitaet Bern Program Director: Serkan Hosten, San Francisco State University Secretary: Jonathan Hauenstein, University of Notre Dame

TO JOIN:

SIAG/AG: my.siam.org/forms/join_siag.htm SIAM: www.siam.org/joinsiam SIAM Conference on Applied Algebraic Geometry 7

Invited Plenary Speakers

** All Invited Plenary Presentations will take place in Clough Undergraduate Learning Commons – 152**

Wednesday, August 2 8:30 AM – 9:30 AM IP5 Stochastic Geometry with Topological Flavor Herbert Edelsbrunner, IST Austria, Klosterneuburg, Austria

1:30 PM – 2:30 PM IP6 Curves with Complex Multiplication and Applications to Cryptography Bianca Viray, University of Washington, USA

Thursday, August 3 8:30 AM – 9:30 AM IP7 Gaussian Graphical Models from an Algebraic, Geometric and Combinatorial Perspective Caroline Uhler, Massachusetts Institute of Technology, USA

1:30 PM – 2:30 PM IP8 Open Problems in Finite Frame Theory Dustin Mixon, Air Force Institute of Technology, USA 8 SIAM Conference on Applied Algebraic Geometry

Invited Plenary Speakers

** All Invited Plenary Presentations will take place in Clough Undergraduate Learning Commons – 152**

Friday, August 4 8:30 AM – 9:30 AM IP9 Caratheodory Style Theorems for Discrete Optimization and Game Theory Jesús A. De Loera, University of California, Davis, USA

1:30 PM – 2:30 PM IP10 Talk Title To Be Announced Jean-Charles Faugère, Inria Paris-Rocquencourt, France

Prize Lecture

** The Prize Lecture will take place in Clough Undergraduate Learning Commons – 152**

Wednesday, August 2 5:15 PM – 6:00 PM SP1 SIAG/AG Early Career Prize Lecture: A Brief History of Smale’s 17th Problem Pierre Lairez, Inria Saclay Ile-de-France, France SIAM Conference on Applied Algebraic Geometry 9 10 SIAM Conference on Applied Algebraic Geometry

Notes SIAM Conference on Applied Algebraic Geometry 11

Program Schedule 12 SIAM Conference on Applied Algebraic Geometry

Monday, July 31 Monday, July 31 Monday, July 31 IP1 MS1 Uses of Algebraic Applications of Registration Geometry and Computational Algebraic 7:00 AM-4:00 PM Representation Theory in Geometry to Cryptology - Room:Skiles Building - Bottom (0-th) Floor Complexity Theory Part I of III 8:30 AM-9:30 AM 10:00 AM-12:00 PM Welcome Remarks Room:Clough Undergraduate Learning Room:Skiles Building - 249 Commons - 152 For Part 2 see MS11 8:20 AM-8:30 AM Chair: Lek-Heng Lim, University of The goal of this minisymposium is to Room:Clough Undergraduate Learning Chicago, USA bring together experts in cryptology and Commons - 152 I will discuss two central problems in in computational algebraic geometry complexity theory and how they can to discuss the interaction of recent be approached geometrically. In 1968, developments in algebraic computations Strassen discovered that the usual and related problems arising in algorithm for multiplying matrices is cryptology. A particular focus is put on not the optimal one, which motivated algorithms for counting points on curves a vast body of research to determine defined over finite fields, on algorithms just how efficiently nxn matrices can for solving polynomial systems over finite be multiplied. The standard algorithm fields, and on computational methods for uses on the order of n3 arithmetic post-quantum cryptography. operations, but thanks to this research, Organizer: Alessio Caminata it is conjectured that asymptotically, it University of Barcelona, Spain is nearly as easy to multiply matrices Organizer: Maike Massierer as it is to add them, that is that one University of New South Wales, Australia can multiply matrices using close to n2 multiplications. In 1978 L. Valiant Organizer: Pierre-Jean proposed an algebraic version of the Spaenlehauer famous P v. NP problem. This was Inria, France modified by Mulmuley and Sohoni 10:00-10:25 Practical Post-quantum to a problem in algebraic geometry: Cryptography Geometric Complexity Theory (GCT), Tanja Lange, Technische Universiteit which rephrases Valiant’s question in Eindhoven, The Netherlands terms of inclusions of orbit closures. 10:30-10:55 Code-based Hybrid I will discuss matrix multiplication, Encryption, Revisited GCT, and the geometry involved, Edoardo Persichetti, Florida Atlantic including: secant varieties, dual University, USA varieties, minimal free resolutions, and 11:00-11:25 Computation of Isogenies the Hilbert scheme of points. and Frobenius Joseph M. Landsberg Cyril Hugounenq, Laboratoire de Texas A&M University, USA Mathématiques de Versailles, France 11:30-11:55 Efficient Compression of SIDH Public Keys Craig Costello, Microsoft Research, USA; Coffee Break David Jao, University of Waterloo, Canada; 9:30 AM-10:00 AM Patrick Longa and Michael Naehrig, Microsoft Research, USA; Joost Renes, Room:Skiles Building Radboud University Nijmegen, The Netherlands; David Urbanik, University of Waterloo, Canada SIAM Conference on Applied Algebraic Geometry 13

Monday, July 31 Monday, July 31 Monday, July 31 MS2 MS3 MS4 Algebraic and Geometric Newton-Okounkov Bodies New Trends in Polynomial Methods in Discrete and Khovanskii Bases - Part System Solving and Optimization - Part I of II I of II Applications - Part I of III 10:00 AM-12:00 PM 10:00 AM-12:00 PM 10:00 AM-12:00 PM Room:Skiles Building - 268 Room:Skiles Building - 255 Room:Skiles Building - 254 For Part 2 see MS12 For Part 2 see MS22 For Part 2 see MS14 Ideas from algebra, number theory, and The theory of Newton-Okounkov bodies Polynomial systems arise in numerous geometry and topology have influenced generalizes that of Newton Polytopes, areas of mathematics and computer the way we think about algorithms for giving a conceptual framework for science, such as control theory, geometric solving optimization problems with root counts to systems of functions in modeling, biochemistry, coding theory and discrete constraints, i.e. integer, mixed terms of volumes and mixed volumes cryptology, to name a few. Efficient and integer and combinatorial problems. of convex Newton-Okounkov bodies. reliable solvers for polynomial systems E.g., New methods such as Groebner While the asymptotic definition of these are in the epicentre of applied algebraic bases gave an impulse for the design bodies is not particularly constructive, geometry and computer algebra. Available of new augmentation algorithms for when they admit a Khovanskii tools for recovering the solutions include integer programs. Similarly convex basis, they are polyhedral. Having a Groebner bases, characteristic sets, geometry arguments are used in the Khovanskii basis enables other methods multivariate resultants as well as symbolic- investigation of mixed integer programs. based on polyhedra to be used. While numeric methods and subdivision-based Today non-linear constraints present in Newton-Okounkov bodies arose to solve solvers. Among the challenges which occur models highlight the importance of using questions from pure mathematics they in the process is reliable root isolation, methods from algebra and geometry too. have significant potential in applications. certification and approximation, treatment In this symposium we discuss several These include providing a foundation for of singular solutions, the exploitation of fascinating instances of such tools of root counts for polynomial systems from structure coming from specific applications analysis. applications, the use of these root counts as well as the development of reliable Organizer: Jesus De Loera and Khovanskii bases for solving, and a software. The minisymposium will host University of California, Davis, USA host of algorithmic questions involving presentations related to state-of-the-art computing/determining Newton- solution strategies for these problems, 10:00-10:25 Understanding Deep Okounkov bodies and Khovanskii bases. theoretical and algorithmic advances as Neural Networks with Rectified Linear Units The purpose of this minisymposium is to well as emerging application areas. Amitabh Basu, Raman Arora, Poorya Mianjy, explore some of these opportunities and Organizer: Angelos Mantzaflaris to advertise this to the wider community and Anirbit Mukherjee, Johns Hopkins RICAM, Austrian Academy of Sciences, Austria University, USA of applied algebraic geometry. Organizer: Elias Tsigaridas 10:30-10:55 Discrete Quantitative Helly Organizer: Frank Sottile INRIA Paris, France Number Texas A&M University, USA 10:00-10:25 Resultant Formulations for Gennadiy Averkov, Universität Magdeburg, 10:00-10:25 Newton-Okounkov Germany Structured Polynomials and System Bodies and Khovanskii Bases for Solving Applications 11:00-11:25 Using Linear Symmetries in Angelos Mantzaflaris, RICAM, Austrian Integer Convex Optimization Frank Sottile, Texas A&M University, USA Academy of Sciences, Austria; Elias Frieder Ladisch, University of Rostock, 10:30-10:55 Flag Varieties of Type A, Tsigaridas, INRIA Paris, France Germany String Polytopes, and Superpotentials 10:30-10:55 Dedekind Zeta Functions 11:30-11:55 Sparse Solutions of Integer Lara Bossinger, University of Cologne, and Complex Dimension Programs Germany J. Maurice Rojas and Yuyu Zhu, Texas A&M Iskander Aliev, Cardiff University, United 11:00-11:25 Computing Toric University, USA Kingdom Degenerations of Flag Varieties 11:00-11:25 Computing the Annihilator Arising from Tropical Geometry of Sequences Fatemeh Mohammadi, Technische Hamid Rahkooy, University of Waterloo, Universität Berlin, Germany Canada 11:30-11:55 Volumes of Newton- 11:30-11:55 Real Solving of Bivariate Okounkov Bodies of Hessenberg Real Equation Systems Varieties and their Cohomology Rings Jinsan Cheng, Chinese Academy of Sciences, Hiraki Abe, McMaster University, Canada China 14 SIAM Conference on Applied Algebraic Geometry

Monday, July 31 Monday, July 31 Monday, July 31 MS5 MS6 MS7 From Approximation Theory Polyhedral and Identifiability of Biological to Tensor Decomposition - Combinatorial Biology - and Statistical Models - Part I of II Part I of IV Part I of II 10:00 AM-11:30 AM 10:00 AM-11:30 AM 10:00 AM-12:00 PM Room:Skiles Building - 270 Room:Skiles Building - 005 Room:Skiles Building - 006 For Part 2 see MS15 For Part 2 see MS16 For Part 2 see MS17 This minisymposium studies the We explore the role that combinatorial A model is identifiable if its underlying connections among sparse interpolation, and polyhedral structures play in parameters can be recovered from exponential analysis, rational understanding biological phenomenon. accurate observations. Identifiability is a approximation, orthogonal polynomials, The rapid grown in technology, means crucial property for a model for it to be generalized eigenvalue computation that the sophistication of the algorithms deployed in data analysis, as this insures and tensor decompositions. We are used to analyze discrete biological data that parameter recovery procedures aiming at a discussion among experts lags behind the availability of data. based on the model and the particular from the domains that are involved. Discrete mathematicians are encouraged observations are valid. When the model This connection may have an impact to attend this session, to learn about is not identifiability, changes to the model on a large number of applications in applications of their tools to biology. parametrization or the observations need computational science and engineering. Biologists are encourage to attend to to be made. Identifiability analysis of Organizer: Wen-shin Lee ensure that mathematicians are focused many models can be made using tools on problems that remain relevant in the from differential algebra, algebraic University of Antwerp, Belgium rapidly developing biological landscape. geometry, combinatorics, and differential Organizer: Annie Cuyt Mathematical objects such as convex geometry. This minisymposium will University of Antwerp, Belgium polyhedral, cell complexes, trees and highlight these applications. Organizer: Mariya Ishteva networks can be used to understand a Organizer: Seth Sullivant wide range of biological phenomena. Vrije Universiteit Brussel, Belgium North Carolina State University, USA This session will feature exploration Organizer: Ivan Markovsky of RNA secondary structures, neural Organizer: Nicolette Meshkat Vrije Universiteit Brussel, Belgium codes, genome rearrangements as well Santa Clara University, USA 10:00-10:25 Tensor Decompositions as bacterial, gene, and species evolution. 10:00-10:25 Structural Identifiability of and Related Problems These applications show demonstrate Biological Models Mariya Ishteva, Vrije Universiteit Brussel, how topics traditionally confined to Nicolette Meshkat, Santa Clara University, Belgium the pure mathematical cannon help USA 10:30-10:55 Symmetric Tensor explore living organisms. In addition, 10:30-10:55 Geometric Classification Approximation this session will examine how biology of Structural and Practical Non- Ramin Goudarzi Karim and Carmeliza generates novel mathematical questions identifiability Navasca, University of Alabama at and objects, such as the structure of Mark K. Transtrum, Brigham Young Birmingham, USA varieties associated to Markov models University, USA 11:00-11:25 Decoupling Multivariate of evolution, or the enumeration of gene 11:00-11:25 Identifiability of a Vector Functions using Tensors trees under the coalescent model. Generalized Hodgkin–Huxley Model Philippe Dreesen, Mariya Ishteva, and Johan Olivia Walch, University of Michigan, USA Schoukens, Vrije Universiteit Brussel, Organizer: Joseph P. Rusinko Belgium Hobart and William Smith Colleges, USA 11:30-11:55 Structural and Practical Identifiability in Multistage Clonal 10:00-10:25 Quartet Trees in Expansion Models of Cancer Phylogenomics Marisa Eisenberg, University of Michigan, Joseph P. Rusinko, Hobart and William Smith USA Colleges, USA 10:30-10:55 The Binary Jukes-Cantor Model with a Molecular Clock Jane Coons, North Carolina State University, USA 11:00-11:25 Recursive Linear Programming on the Balanced Minimal Evolution Polytope Stefan Forcey, William Sands, and Logan Keefe, University of Akron, USA SIAM Conference on Applied Algebraic Geometry 15

Monday, July 31 Monday, July 31 Monday, July 31 MS8 MS9 MS10 Algebraic Vision - Part I of II Algebra and Geometry in Symbolic Combinatorics - 10:00 AM-12:00 PM Frame Theory - Part I of II Part I of III Room:Skiles Building - 202 10:00 AM-12:00 PM 10:00 AM-12:00 PM For Part 2 see MS18 Room:Skiles Building - 271 Room:Skiles Building - 168 Algebraic vision aims to explore the For Part 2 see MS19 For Part 2 see MS20 foundations of problems in computer Frame theory studies special vector In recent years algorithms and vision using algebraic methods. The arrangements which arise in numerous software have been developed that lectures in this session showcase recent signal processing applications. Over allow researchers to discover and results in this area. the last decade, the need for frame- verify combinatorial identities as well Organizer: Rekha Thomas theoretic research has grown alongside as understand analytic and algebraic University of Washington, USA the emergence of new methods in signal properties of generating functions. processing. Modern advances in frame The interaction of combinatorics Organizer: Max Lieblich theory involve techniques from algebraic and symbolic computation has had a University of Washington, USA geometry, semidefinite programming, beneficial impact on both fields. This Organizer: Matthew Trager algebraic and geometric combinatorics, minisymposium will feature 12 speakers Inria and École Normale Supérieure, France and representation theory. This describing recent research combining 10:00-10:25 Generalized Camera minisymposium will explore a multitude these areas. Models and Multi-view Geometry of these algebraic and geometric Organizer: Manuel Kauers Matthew Trager, Inria and École Normale developments in frame theory. Johannes Kepler University, Austria Supérieure, France Organizer: Nate Strawn Organizer: Michael Singer 10:30-10:55 The Multidegree of the Duke University, USA Multi-image Variety North Carolina State University, USA Laura Escobar, University of Illinois at Organizer: Dustin Mixon Organizer: Shaoshi Chen Air Force Institute of Technology, USA Urbana-Champaign, USA North Carolina State University, USA 11:00-11:25 Two Hilbert Schemes in Organizer: Emily King Organizer: Stephen Melczer Computer Vision Universität Bremen, Germany University of Waterloo, Canada Lucas van Meter, University of Washington, 10:00-10:25 An Overview of 10:00-10:25 Rational Solutions of Linear USA Applications of Algebra and Mahler Equations Geometry to Frame Theory 11:30-11:55 Distortion Varieties Frédéric Chyzak, Inria and École Normale Bernd Sturmfels, Max Planck Institute Nate Strawn, Georgetown University, USA Supérieure de Lyon, France; Thomas Leipzig, Germany and University of 10:30-10:55 New Bounds for Dreyfus, Université Lyon I, France; California, Berkeley, USA Equiangular Lines and Spherical Two- Philippe Dumas, Inria, France; Marc distance Sets Mezzarobba, Inria and Universite Lyon, Wei-Hsuan Yu, Michigan State University, AriC, LIP, France USA 10:30-10:55 Extreme Diagonally and 11:00-11:25 Equiangular Tight Frames Antidiagonally Symmetric Alternating from Association Schemes Sign Matrices of Odd Order Joseph Iverson, University of Maryland, Arvind Ayyer, Indian Institute of Science, USA; John Jasper, University of Cincinnati, Bangalore, India; Roger Behrend, Cardiff USA; Dustin Mixon, Air Force Institute of University, United Kingdom; Ilse Fischer, Technology, USA University of Vienna, Austria 11:30-11:55 Classifying Complex 11:00-11:25 Can You Count Genus 2 Equiangular Tight Frames by Surfaces in 3-Manifolds? Computational Algebraic Geometry Stavros Garoufalidis, Georgia Institute of Ferenc Szöllosi, Aalto University, Finland Technology, USA 11:30-11:55 Desingularization in Several Variables Manuel Kauers, Johannes Kepler University, Austria 16 SIAM Conference on Applied Algebraic Geometry

Monday, July 31 Monday, July 31 4:00-4:25 Accelerating Point- counting Algorithms using Explicit Lunch Break Coffee Break Endomorphisms 12:00 PM-1:30 PM 2:30 PM-3:00 PM Benjamin Smith, INRIA and Ecole Polytechnique, France Attendees on their own Room:Skiles Building 4:30-4:55 Improvements to Point Counting on Hyperelliptic Curves of Genus Two Sean F. Ballentine, University of Maryland, IP2 MS11 USA; Aurore Guillevic, Inria Nancy - On the Stability of Solutions Applications of Grand Est, France; Elisa Lorenzo Garcia, Université de Rennes 1, France; Chloe in Numerical Algebraic Computational Algebraic Geometry to Cryptology - Martindale, Universiteit Leiden, The Geometry Netherlands; Maike Massierer, University Part II of III 1:30 PM-2:30 PM of New South Wales, Australia; Benjamin 3:00 PM-5:00 PM Smith, INRIA and Ecole Polytechnique, Room:Clough Undergraduate Learning France; Jaap Top, University of Groningen, Commons - 152 Room:Skiles Building - 249 Netherlands Chair: Teresa Krick, Universidad de Buenos For Part 1 see MS1 Aires, Argentina For Part 3 see MS21 The goal of this minisymposium is to In the last years a number of results bring together experts in cryptology and concerning the stability properties of in computational algebraic geometry the solutions to problems in Algebraic to discuss the interaction of recent Geometry have proved that (in different developments in algebraic computations situations) the so called condition number and related problems arising in of a pair (problem instance, solution) cryptology. A particular focus is put on can be expected to be quite small. The algorithms for counting points on curves condition number of such a pair measures defined over finite fields, on algorithms the variation of the solution when the for solving polynomial systems over problem instance is perturbed. This talk finite fields, and on computational will use its more geometrical denition methods for post-quantum cryptography. which sheds light on its properties and shows that it is often a measure of Organizer: Alessio Caminata complexity. I will present some classical, University of Barcelona, Spain some recent and some new results on Organizer: Maike Massierer the expected value of powers of the University of New South Wales, Australia condition number in different situations. Organizer: Pierre-Jean In particular, I will mention new results concerning the stability of the polynomial Spaenlehauer eigenvalue problem and that of sparse Inria, France or lacunary polynomial solving. These 3:00-3:25 Short Generators without results follow from the use of classical Quantum Computers: The Case of Algebraic Geometry theorems combined Multiquadratics with tehcniques from integration in Daniel J. Bernstein, University of Ilinois at manifolds. There will be no much need Chicago, USA of previous knowledge on any of these 3:30-3:55 Improving Complexity areas to follow the conference. This work Bounds for Hyperelliptic Point- summarizes a considerable number of counting papers by different people, including my Simon Abelard, Université de Lorraine, coauthors D. Armentano, P. Burgisser, France; Pierrick Gaudry, CNRS, France; Pierre-Jean Spaenlehauer, Inria, France F. Cucker, J. P. Dedieu, J. G. Criado del Rey, A. Leykin, G. Malajovich, L. M. Pardo and M. Shub. Carlos Beltrán Universidad de Cantabria, Spain

continued in next column SIAM Conference on Applied Algebraic Geometry 17

Monday, July 31 Monday, July 31 Monday, July 31 MS12 MS13 MS14 Algebraic and Geometric Algorithms and Complexity New Trends in Polynomial Methods in Discrete in Real Algebraic Geometry System Solving and Optimization - Part II of II - Part I of II Applications - Part II of III 3:00 PM-5:00 PM 3:00 PM-5:00 PM 3:00 PM-5:00 PM Room:Skiles Building - 268 Room:Skiles Building - 255 Room:Skiles Building - 254 For Part 1 see MS2 For Part 2 see MS23 For Part 1 see MS4 Ideas from algebra, number theory, and This minisymposium aims to present For Part 3 see MS45 geometry and topology have influenced recent algorithmic and complexity results Polynomial systems arise in numerous the way we think about algorithms for on real (and complex) polynomials and areas of mathematics and computer solving optimization problems with systems of polynomials. Some of the science, such as control theory, geometric discrete constraints, i.e. integer, mixed topics are root finding, connectivity modeling, biochemistry, coding theory integer and combinatorial problems. algorithms, complexity of semi-algebraic and cryptology, to name a few. Efficient E.g., New methods such as Groebner sets, applications, etc. and reliable solvers for polynomial systems are in the epicentre of applied bases gave an impulse for the design Organizer: Eric Schost of new augmentation algorithms for algebraic geometry and computer University of Waterloo, Canada integer programs. Similarly convex algebra. Available tools for recovering geometry arguments are used in the Organizer: Mohab Safey El Din the solutions include Groebner bases, investigation of mixed integer programs. Université Pierre et Marie Curie, France characteristic sets, multivariate resultants Non-linear constraints present in models 3:00-3:25 On the Complexity of as well as symbolic-numeric methods and highlight the importance of using Deciding Connectivity Queries. subdivision-based solvers. Among the methods from algebra and geometry too. Algorithms and Implementations challenges which occur in the process is In this symposium we discuss several Eric Schost, University of Waterloo, Canada reliable root isolation, certification and fascinating instances of such tools of 3:30-3:55 On the Complexity of Root approximation, treatment of singular analysis. Clustering solutions, the exploitation of structure coming from specific applications as Organizer: Jesus De Loera Chee K. Yap, Courant Institute of Mathematical Sciences, New York well as the development of reliable University of California, Davis, USA University, USA software. The minisymposium will host 3:00-3:25 Some Cut-generating 4:00-4:25 Computing Real Radicals of presentations related to state-of-the-art Functions for Second-order Conic Set Polynomial Ideals solution strategies for these problems, Santanu Dey, Georgia Institute of Technology, Zhihong Yang, University of Chinese theoretical and algorithmic advances as USA Academy of Sciences, China; Lihong Zhi, well as emerging application areas. 3:30-3:55 Fast Submodular Function Academia Sinica, China Minimization Organizer: Angelos Mantzaflaris 4:30-4:55 Gram Spectrahedra Deeparnab Chakrabarty, Dartmouth College, RICAM, Austrian Academy of Sciences, Daniel Plaumann, Technische Universität USA Austria Dortmund, Germany 4:00-4:25 Automated Discovery Organizer: Elias Tsigaridas of Cutting Plane Theorems and INRIA Paris, France Semialgebraic Proofs 3:00-3:25 Semidefinite Programming Matthias Koeppe and Yuan Zhou, University and Numerical Algebraic Geometry of California, Davis, USA Jonathan Hauenstein, Alan Liddell, and Yi 4:30-4:55 Ordered Sets in Discrete Zhang, University of Notre Dame, USA Optimization 3:30-3:55 Univariate Homotopy Akshay Gupte, Clemson University, USA Continuation via Interval Arithmetic Michael A. Burr, Fordham University, USA 4:00-4:25 Polynomial System Solving and Analytic Combinatorics in Several Variables Stephen Melczer, University of Waterloo, Canada 4:30-4:55 Polynomial System Solving and Numerical Linear Algebra Simon Telen and Marc Van Barel, Katholieke Universiteit Leuven, Belgium 18 SIAM Conference on Applied Algebraic Geometry

Monday, July 31 Monday, July 31 3:30-3:55 Efficient Quartet Systems MaLyn Lawhorn, Winthrop University, USA MS15 MS16 4:00-4:25 Enumeration of Gene Tree From Approximation Theory Polyhedral and Configurations in Species Trees to Tensor Decomposition - Combinatorial Biology - Part Filippo Disanto, Stanford University, USA Part II of II II of IV 4:30-4:55 New Perspectives on Rooted Trees and Parameter Spaces 3:00 PM-4:30 PM 3:00 PM-5:00 PM Patricio Gallardo, University of Georgia, USA; Noah Giansiracusa, Swarthmore Room:Skiles Building - 270 Room:Skiles Building - 005 College, USA; Kenny Ascher, Brown For Part 1 see MS5 For Part 1 see MS6 University, USA; Evangelos Routis, Institute This minisymposium studies the For Part 3 see MS26 for the Physics and Mathematics of the connections among sparse interpolation, We explore the role that combinatorial Universe, Japan exponential analysis, rational and polyhedral structures play in approximation, orthogonal polynomials, understanding biological phenomenon. generalized eigenvalue computation The rapid grown in technology, means and tensor decompositions. We are that the sophistication of the algorithms aiming at a discussion among experts used to analyze discrete biological data from the domains that are involved. lags behind the availability of data. This connection may have an impact Discrete mathematicians are encouraged on a large number of applications in to attend this session, to learn about computational science and engineering. applications of their tools to biology. Organizer: Wen-shin Lee Biologists are encourage to attend to ensure that mathematicians are focused University of Antwerp, Belgium on problems that remain relevant in the Organizer: Annie Cuyt rapidly developing biological landscape. University of Antwerp, Belgium Mathematical objects such as convex Organizer: Mariya Ishteva polyhedral, cell complexes, trees and Vrije Universiteit Brussel, Belgium networks can be used to understand a wide range of biological phenomena. Organizer: Ivan Markovsky This session will feature exploration Vrije Universiteit Brussel, Belgium of RNA secondary structures, neural 3:00-3:25 From Pade Approximation codes, genome rearrangements as well to Tensor Decomposition as bacterial, gene, and species evolution. Annie Cuyt and Wen-shin Lee, University of These applications show demonstrate Antwerp, Belgium how topics traditionally confined to 3:30-3:55 A Tensor Decomposition the pure mathematical cannon help Method for Inverse Source Problems explore living organisms. In addition, Takaaki Nara and Tenyu Go, University of this session will examine how biology Tokyo, Japan generates novel mathematical questions 4:00-4:25 Computing Structured and objects, such as the structure of Matrix Factorizations with Applications varieties associated to Markov models in Tensor Decompositions and Blind of evolution, or the enumeration of gene Source Separation trees under the coalescent model. Ignat Domanov, Otto Debals, and Lieven De Lathauwer, Katholieke Universiteit Organizer: Joseph P. Rusinko Leuven, Belgium Hobart and William Smith Colleges, USA 3:00-3:25 Predicting Ecological Function in the Microbiome using Spectral Properties of Interacting Clades Russell Y. Neches, University of California, Davis, USA

continued in next column SIAM Conference on Applied Algebraic Geometry 19

Monday, July 31 Monday, July 31 Monday, July 31 MS17 MS18 MS19 Identifiability of Biological Algebraic Vision - Algebra and Geometry in and Statistical Models - Part Part II of II Frame Theory - Part II of II II of II 3:00 PM-5:00 PM 3:00 PM-5:00 PM 3:00 PM-4:30 PM Room:Skiles Building - 202 Room:Skiles Building - 271 Room:Skiles Building - 006 For Part 1 see MS8 For Part 1 see MS9 For Part 1 see MS7 Algebraic vision aims to explore the Frame theory studies special vector A model is identifiable if its underlying foundations of problems in computer arrangements which arise in numerous parameters can be recovered from vision using algebraic methods. The signal processing applications. Over accurate observations. Identifiability is a lectures in this session showcase recent the last decade, the need for frame- crucial property for a model for it to be results in this area. theoretic research has grown alongside the emergence of new methods in signal deployed in data analysis, as this insures Organizer: Rekha Thomas that parameter recovery procedures processing. Modern advances in frame University of Washington, USA based on the model and the particular theory involve techniques from algebraic observations are valid. When the model Organizer: Max Lieblich geometry, semidefinite programming, is not identifiability, changes to the model University of Washington, USA algebraic and geometric combinatorics, parametrization or the observations need Organizer: Matthew Trager and representation theory. This minisymposium will explore a multitude to be made. Identifiability analysis of Inria and École Normale Supérieure, France many models can be made using tools of these algebraic and geometric 3:00-3:25 Fast Groebner Basis Solvers developments in frame theory. from differential algebra, algebraic for Computer Vision geometry, combinatorics, and differential Zuzana Kukelova, Czech Technical Organizer: Nate Strawn geometry. This minisymposium will University, Prague, Czech Republic Duke University, USA highlight these applications. 3:30-3:55 Minimal Problems for the Organizer: Emily King Organizer: Seth Sullivant Calibrated Trifocal Variety Universität Bremen, Germany North Carolina State University, USA Joe Kileel, University of California, Berkeley, USA Organizer: Dustin Mixon Organizer: Nicolette Meshkat Air Force Institute of Technology, USA Santa Clara University, USA 4:00-4:25 Multi-focal Tensors from Invariant Differential Forms, and Line 3:00-3:25 Polytopes in Frame Theory 3:00-3:25 Algebraic Identifiability of Envelopes for Structure-from-Motion and Representation Theory Gaussian Mixtures James Mathews, Stony Brook University, Christoph Pegel, Universität Bremen, Carlos Amendola Ceron, Technische USA Germany Universität Berlin, Germany 4:30-4:55 The Nearest Point to a 3:30-3:55 Spark Deficient Gabor 3:30-3:55 Identifiability of Species Variety Problem, Near the Variety Frames Phylogenies under a Modified Diego Cifuentes, Massachusetts Institute of Romanos D. Malikiosis, Technische Coalescent Technology, USA Universität Berlin, Germany Colby Long, Ohio State University, USA 4:00-4:25 On the Structure of Maximal 4:00-4:25 Identifiability of a 2nd Degree Levenschtein Frames Multispecies Coalescent Model for John Haas, University of Missouri, USA; the Evolution of k-mer Distances on a Dustin Mixon and Nathaniel Hammen, Air Phylogenetic Tree Force Institute of Technology, USA Chris Durden, North Carolina State 4:30-4:55 Equality Conditions for the University, USA Levenstein Bounds in Projective Space John Haas, University of Missouri, USA; Nathaniel Hammen and Dustin Mixon, Air Force Institute of Technology, USA 20 SIAM Conference on Applied Algebraic Geometry

Monday, July 31 Monday, July 31 Matroidal Root Structure of Skew Polynomials over Finite Fields PP1 Travis A. Baumbaugh and Felice MS20 Manganiello, Clemson University, USA Welcome Reception and Symbolic Combinatorics - The Positive Bergman Complex of An Part II of III Poster Session Oriented Matroid with Valuation 3:00 PM-5:00 PM 5:00 PM-7:00 PM Marcel Celaya and Josephine Yu, Georgia Institute of Technology, USA Room:Klaus Advanced Computing Building Room:Skiles Building - 168 ReactionNetworks.m2 - A Package For Part 1 see MS10 for Algebraic Systems Biology For Part 3 see MS30 Sampling and Persistence Diagrams Cvetelina Hill, Georgia Institute of In recent years algorithms and Kathryn H. Heal, Harvard University, USA Technology, USA; Elizabeth Gross, San software have been developed that Sixty-four Curves of Degree Six Jose State University, USA; Timothy Duff, Georgia Institute of Technology, USA allow researchers to discover and Nidhi Kaihnsa and Mario Kummer, Max verify combinatorial identities as well Planck Institute for Mathematics in the Tensor Diagrams and Chebyshev as understand analytic and algebraic Sciences, Germany; Daniel Plaumann, Polynomials properties of generating functions. Technische Universität Dortmund, Lisa Lamberti, ETH Zürich, Switzerland The interaction of combinatorics Germany; Mahsa Sayyary and Bernd Solving Polynomial System Using and symbolic computation has had a Sturmfels, Max Planck Institute for Package Monodromy Solver beneficial impact on both fields. This Mathematics in the Sciences, Germany Kisun Lee, Georgia Institute of Technology, minisymposium will feature 12 speakers The Covering Problem via Convex USA describing recent research combining Algebraic Geometry Computations over Local Rings in these areas. Leonardo M. Mito and Gabriel Haeser, Macaulay2 University of São Paulo, Brazil Organizer: Manuel Kauers Mahrud Sayrafi, University of California, Berkeley, USA; Michael Stillman, Cornell Johannes Kepler University, Austria Maximum Likelihood Estimate Homotopy Tracking for Toric Models University, USA; David Eisenbud, Organizer: Michael Singer Evan Nash, Ohio State University, USA; Mathematical Sciences Research Institute, North Carolina State University, USA Carlos Amendola, Technische Universität USA Organizer: Shaoshi Chen Berlin, Germany; Nathan Bliss, University Identifying Clusters of in-Control and of Ilinois at Chicago, USA; Serkan North Carolina State University, USA Out-of-Control Parts in Manufacturing Hosten, San Francisco State University, Processes Using Numerical Algebraic Organizer: Stephen Melczer USA; Jose I. Rodriguez, University of Geometry and Nonparametric University of Waterloo, Canada Chicago, USA Regression 3:00-3:25 On the Enumeration of S-Arithmetic Groups in Quantum Sara Shirinkam and Adel Alaeddini, Compacted Trees Computing University of Texas, San Antonio, USA; Elizabeth Gross, San Jose State Bernhard Gittenberger, Technische Sebastian Schoennenbeck, RWTH Aachen University, USA Universitaet Wien, Germany University, Germany; Vadym Kliuchnikov, Microsoft Research, USA 3:30-3:55 Multivariate Algebraic Generating Functions: Asymptotics Gram Determinants of Real Binary and Examples Tensors Torin Greenwood, Georgia Institute of Anna Seigal, University of California, Technology, USA Berkeley, USA 4:00-4:25 Congruences Connecting Mixing Behavior of a Family of Modular Forms and Truncated Random Walks Corresponding to an Hypergeometric Series Integer Sequence Armin Straub, University of South Alabama, Caprice Stanley, North Carolina State USA University, USA 4:30-4:55 3-Dimensional Lattice Walks Metric Reconstruction Via Optimal and Related Groups Transport Ronghua Wang, Johannes Kepler University, Henry Adams, Colorado State University, Austria; Qinghu Hou and kang Du, USA; Florian Frick, Cornell University, Tianjin University, China USA; Michal Adamaszek, University of Copenhagen, Denmark Identifying Species Hybridization Network Features from Gene Tree Quartets Hector Banos, University of Alaska, Fairbanks, USA

continued in next column SIAM Conference on Applied Algebraic Geometry 21

Tuesday, August 1 Tuesday, August 1 Tuesday, August 1 MS21 MS22 Applications of Newton-Okounkov Bodies Registration Computational Algebraic and Khovanskii Bases - Part 7:30 AM-4:00 PM Geometry to Cryptology - II of II Room:Skiles Building - Bottom (0-th) Floor Part III of III 10:00 AM-11:30 AM 10:00 AM-12:00 PM Room:Skiles Building - 006 Room:Skiles Building - 249 For Part 1 see MS3 Remarks For Part 2 see MS11 The theory of Newton-Okounkov bodies 8:20 AM-8:30 AM The goal of this minisymposium is to generalizes that of Newton Polytopes, giving a conceptual framework for root Room:Clough Undergraduate Learning bring together experts in cryptology counts to systems of functions in terms Commons - 152 and in computational algebraic geometry to discuss the interaction of volumes and mixed volumes of convex of recent developments in algebraic Newton-Okounkov bodies. While the computations and related problems asymptotic definition of these bodies IP3 arising in cryptology. A particular is not particularly constructive, when focus is put on algorithms for counting they admit a Khovanskii basis, they Algebraic Geometry for points on curves defined over finite are polyhedral. Having a Khovanskii Geometric Modeling fields, on algorithms for solving basis enables other methods based on 8:30 AM-9:30 AM polynomial systems over finite fields, polyhedra to be used. While Newton- and on computational methods for post- Okounkov bodies arose to solve Room:Clough Undergraduate Learning quantum cryptography. questions from pure mathematics they Commons - 152 have significant potential in applications. Organizer: Alessio Caminata Chair: Frank Sottile, Texas A&M University, These include providing a foundation for University of Barcelona, Spain USA root counts for polynomial systems from Organizer: Maike Massierer applications, the use of these root counts Geometric modeling studies University of New South Wales, Australia and Khovanskii bases for solving, and a mathematical methods for constructing host of algorithmic questions involving objects in computer graphics and Organizer: Pierre-Jean computing/determining Newton- computer aided design. From early on, Spaenlehauer Okounkov bodies and Khovanskii bases. low degree polynomials and simple Inria, France The purpose of this minisymposium is to algebro-geometric tools were used. 10:00-10:25 Security Considerations explore some of these opportunities and The advances of speed and memory of for Galois Non-dual RLWE Families to advertise this to the wider community computer systems now permit the use Hao Chen and Kristin Lauter, Microsoft of applied algebraic geometry. of more tools from algebraic geometry. Research, USA; Katherine Stange, In particular, the building blocks of the University of Colorado Boulder, USA Organizer: Frank Sottile constructions could include pieces of 10:30-10:55 Multivariate Public Key Texas A&M University, USA real, affine algebraic curves, surfaces, Cryptosystems - Candidates for 10:00-10:25 Introduction to Khovanskii and threefolds, or higher degree splines, the Next Generation Post-quantum Bases, Valuations and Newton- or toric varieties. In this talk, I will Standards Okounkov Bodies discuss various examples, drawing on Jintai Ding, University of Cincinnati, USA Kiumars Kaveh, University of Pittsburgh, USA results from the EU networks GAIA and 11:00-11:25 Cyclic SRP - SAGA. Cryptanalysis of the SRP Encryption 10:30-10:55 Khovanskii Bases and Ragni Piene Scheme Tropical Geometry Albrecht R. Petzoldt, National Institute of Chris Manon, George Mason University, University of Oslo, Norway Standards and Technology, USA USA 11:30-11:55 Solving Degree of 11:00-11:25 Initial Degenerations of Multivariate Polynomial Systems and the Grassmannian Castelnuovo-Mumford Regularity Dan Corey, Yale University, USA Coffee Break Alessio Caminata, University of Barcelona, Spain; Elisa Gorla, University of 9:30 AM-10:00 AM Neuchatel, Switzerland Room:Skiles Building 22 SIAM Conference on Applied Algebraic Geometry

Tuesday, August 1 Tuesday, August 1 Tuesday, August 1 MS23 MS24 MS25 Algorithms and Complexity Symmetry and Structure in Decomposition and in Real Algebraic Algebraic Computation - Identifiability of Real and Geometry - - Part II of II Part I of II Complex Tensors - 10:00 AM-12:00 PM 10:00 AM-12:00 PM Part I of II Room:Skiles Building - 255 Room:Skiles Building - 254 10:00 AM-12:00 PM For Part 1 see MS13 For Part 2 see MS34 Room:Skiles Building - 270 This minisymposium aims to The concept of symmetry arises both For Part 2 see MS46 present recent algorithmic and in nature, science, and art. From a Tensors and their decompositions have complexity results on real (and computational perspective, symmetry found application in a wide variety of complex) polynomials and systems of allows to reduce the complexity of applications such as algebraic statistics, polynomials. Some of the topics are problems or organize their resolution. chemometrics, machine learning and root finding, connectivity algorithms, This idea appears in different guises and signal processing, among others. Many complexity of semi-algebraic sets, in different contexts, for a variety of popular ways of sparsely representing applications, etc. applications. The minisymposium aims tensors, such as the tensor rank, Waring, Organizer: Eric Schost to present such instances. Chow, Hierarchical Tucker and Tensor University of Waterloo, Canada Organizer: Cordian Riener Trains decompositions, naturally admit the structure of projective algebraic Organizer: Mohab Safey El Din Universität Konstanz, Germany varieties over the complex field. Université Pierre et Marie Curie, France Organizer: Evelyne Hubert Considering these decompositions Inria Méditerranée, France 10:00-10:25 On the Davenport- over the reals, they become either real Mahler Bound 10:00-10:25 Multivariate Symmetric projective algebraic varieties or semi- Daniel Perrucci and Paula Escorcielo, Interpolation and Subresultants algebraic sets. This minisymposium Universidad de Buenos Aires, Argentina Agnes Szanto, North Carolina State features talks on the properties of real University, USA 10:30-10:55 A Framework for and complex tensor decompositions and Investigating Multistationarity in 10:30-10:55 Fourier Transforms their interconnections. Messi Biochemical Systems of Polytopes, Ehrhart and Solid Xiaoxiao Tang, Texas A&M University, Angle Sums for Real Polytopes, and Organizer: Luca Chiantini USA Symmetric Simplices Università di Siena, Italy 11:00-11:25 Real Intersection Sinai Robins, University of Sao Paulo, Brazil Organizer: Giorgio Ottaviani Between a Low-degree Curve and a 11:00-11:25 A Tale of Two Cones with University of Firenze, Italy Sparse Hypersurface Symmetry Organizer: Nick Sebastien Tavenas, University of Savoy, Charu Goel and Salma Kuhlmann, France Universität Konstanz, Germany; Bruce Vannieuwenhoven Katholieke Universiteit Leuven, Belgium 11:30-11:55 Improved Bounds Reznick, University of Illinois at Urbana- for Equivariant Betti Numbers of Champaign, USA 10:00-10:25 Identifiability for Skew Symmetric Semi-algebraic Sets 11:30-11:55 Modules over FI-algebras Symmetric Tensors Cordian Riener, Universität Konstanz, Robert Krone, Queen’s University, Alessandra Bernardi, Università di Torino, Germany; Saugata Basu, Purdue Canada; Jan Draisma, University of Italy; Davide Vanzo, University of University, USA Bern, Switzerland; Alexei Krasilnikov, Firenze, Italy Universidade de Brasília, Brazil 10:30-10:55 Points of High Rank Jaroslaw Buczynski, University of Warsaw, Poland 11:00-11:25 Taking a Step from the Waring Rank Toward the Chow Rank Hirotachi Abo, University of Idaho, USA; Nick Vannieuwenhoven, Katholieke Universiteit Leuven, Belgium 11:30-11:55 Real Identifiability vs Complex Identifiability Cristiano Bocci, Elena Angelini, and Luca Chiantini, Università di Siena, Italy SIAM Conference on Applied Algebraic Geometry 23

Tuesday, August 1 10:30-10:55 Polyhedral Complexes in Tuesday, August 1 Phylogenetics and Gene Interaction MS26 Studies MS27 Alex Gavryushkin, ETH Zürich, Switzerland Polyhedral and Minisymposium on Statistics 11:00-11:25 The Structure of the and Applied Algebraic Combinatorial Biology - Branching Polytopes for {RNA} Part III of IV Structures Topology - Part I of II 10:00 AM-12:00 PM Svetlana Poznanović, Clemson University, 10:00 AM-12:00 PM USA; Christine Heitsch and Fidel Barrera- Room:Skiles Building - 005 Cruz, Georgia Institute of Technology, USA Room:Skiles Building - 202 For Part 2 see MS16 11:30-11:55 Complexity of Models for For Part 2 see MS37 For Part 4 see MS56 Genome Rearrangement A burgeoning area of research in Applied We explore the role that combinatorial Istvan Miklos, Renyi Institute, Hungary; Topology has been Stochastic Analysis and polyhedral structures play in Heather C. Smith, Georgia Institute of and Modeling of topological summaries understanding biological phenomenon. Technology, USA of data; we will term this research area The rapid grown in technology, means as TDA. TDA generates interest across that the sophistication of the algorithms mathematics, statistics, computer science, used to analyze discrete biological data and electrical engineering communities. lags behind the availability of data. Applications of TDA range from Discrete mathematicians are encouraged neuroscience, to networks analysis, to to attend this session, to learn about genetics, and more. One of the many applications of their tools to biology. challenges in modern data analysis is the Biologists are encourage to attend to ubiquity of high-dimensional data with ensure that mathematicians are focused growing complexity. A central challenge on problems that remain relevant in the in modeling these data is representing rapidly developing biological landscape. them in a way that is amenable to Mathematical objects such as convex classical methods of statistical analysis. polyhedral, cell complexes, trees and For example, many of the problems can networks can be used to understand a be formalized in the following general wide range of biological phenomena. settings: a collection of noisy scientific This session will feature exploration data are observed in a high-dimensional of RNA secondary structures, neural ambient space, but are in fact generated by codes, genome rearrangements as well a stochastic process that is concentrated as bacterial, gene, and species evolution. around a lower-dimensional space. These applications show demonstrate Recovering the lower-dimensional system how topics traditionally confined to is extremely challenging. TDA focuses the pure mathematical cannon help on recovering topological summaries, explore living organisms. In addition, facilitating the detection of subtle features this session will examine how biology missed by other approaches. The proposed generates novel mathematical questions minisymposium focuses on statistical and and objects, such as the structure of probabilistic aspects of TDA. We will varieties associated to Markov models exhibit talks that range from asymptotic of evolution, or the enumeration of gene properties of topological estimators to trees under the coalescent model. applied case studies in cancer biology and Organizer: Joseph P. Rusinko geometric morphometrics. These talks Hobart and William Smith Colleges, USA will also relate the relatively new theory and methodology to more classic theory 10:00-10:25 Polyhedra, Sampling such as extrema of random fields and Algorithms for Random Polygons, and Applications to Ring Polymer Models estimates of contours. Clayton Shonkwiler, Colorado State Organizer: Brittany Fasy University, USA Montana State University, USA Organizer: Sayan Mukherjee Duke University, USA

continued on next page continued in next column 24 SIAM Conference on Applied Algebraic Geometry

Tuesday, August 1 Tuesday, August 1 Tuesday, August 1 MS27 MS28 MS29 Minisymposium on Statistics Algebraic Methods in Applications of Algebra to and Applied Algebraic Rigidity Theory - Part I of II Signal Processing and Digital Topology - Part I of II 10:00 AM-12:00 PM Imaging - Part I of II 10:00 AM-12:00 PM Room:Skiles Building - 268 10:00 AM-12:00 PM continued For Part 2 see MS38 Room:Skiles Building - 271 The classical subject of study in rigidity For Part 2 see MS39 theory is a framework consisting of 10:00-10:25 The Consistency of Gibbs Many problems in this increasingly finitely many rigid bars attached at Posteriors and the Thermodynamic digital world can be studied through the Formalism universal joints, and the fundamental tools of algebra and algebraic geometry, Sayan Mukherjee, Duke University, USA question is to determine if a framework and can be encoded in the language of is rigid or flexible. More general tensors. This minisymposium is focused 10:30-10:55 The DTM-signature for a frameworks involve other types Geometric Comparison of Metric- on problems arising in applications of measure Spaces from Samples of geometric constraints and arise tensors to signal processing and digital Claire Brecheteau, Inria, France in applications including robotics, imaging. Mathematicians have studied computer-aided design, and structural tensors through tools of algebraic 11:00-11:25 Topological Similarity of biology. Our goal is to bring together Random Cell Complexes geometry, uncovering connections to researchers with complementary interests Benjamin Schweinhart, Ohio State many classical problems. Practitioners in applied algebraic geometry, rigidity University, USA have studied tensors through iterative theory, algebraic matroids, and matrix algorithmic methods. There is an 11:30-11:55 Pseudo-multidimensional completion problems to share methods increasing need to understand these Persistence and its Applications and problems. algorithms from an algebraic viewpoint, Giseon Heo, University of Alberta, Canada; Catalina Betancourt, University of Iowa, Organizer: Jessica Sidman and to understand the boundary cases USA; Rachel Neville, Colorado State Mount Holyoke College, USA (when and why the algorithms fail). Unfortunately there is still a lack of University, USA; Matthew Pietrosa, Organizer: Louis Theran University of Alberta, Canada; Mimi communication between mathematicians University of St. Andrews, United Kingdom Tsuruga, University of California, Davis, and engineers in this area. Through USA; Isabel Darcy, University of Iowa, Organizer: Meera Sitharam this minisymposium we will showcase USA University of Florida, USA applications of algebraic geometry to 10:00-10:25 Surveying Applications of problems in the digital world, interchange Rigidity Theory our terminology, tools, and related results Audrey St. John, Mount Holyoke College, in a common language. Our goal is that USA this activity will help the participants 10:30-10:55 Algebraic Geometry and to learn new tools, techniques and Mechanism Science: Recent Results applications as well as to identify new and Open Problems interdisciplinary collaborations. Hans-Peter Schröcker, University of Organizer: Cristiano Bocci Innsbruck, Austria Università di Siena, Italy 11:00-11:25 Grassmannians, Invariant Theory and the Bracket Algebra in Organizer: Cameron L. Rigidity Theory Farnsworth Will Traves, US Naval Academy, USA; Yonsei University, South Korea Jessica Sidman, Mount Holyoke College, Organizer: Luke Oeding USA Auburn University, USA 11:30-11:55 The Pure Condition 10:00-10:25 A Rectangular Relaxation Through the Lens of the Algebraic for Multi-D Filter Bank Design using Matroid Laurent Polynomials Zvi H. Rosen, University of Pennsylvania, Cameron L. Farnsworth and Youngmi Hur, USA Yonsei University, South Korea

continued on next page SIAM Conference on Applied Algebraic Geometry 25

10:30-10:55 Low Rank Tensor Tuesday, August 1 Tuesday, August 1 Approximation via Sparse Optimization for Video Processing MS30 MS31 Carmeliza Navasca, University of Alabama at Birmingham, USA; Xioafei Wang, Symbolic Combinatorics - Algebraic Geometry Northeast University, China Part III of III Methods for Discrete 11:00-11:25 Global Optimality in Matrix 10:00 AM-12:00 PM Dynamical Systems - and Tensor Factorization Part I of II Rene Vidal, Johns Hopkins University, USA Room:Skiles Building - 168 10:00 AM-12:00 PM 11:30-11:55 A New Generation of For Part 2 see MS20 Brain-computer Interfaces Driven by In recent years algorithms and Room:Skiles Building - 170 software have been developed that Discovery of Latent EEG-fMRI Linkages For Part 2 see MS41 using Tensor Decomposition allow researchers to discover and Mathematical methods for prediction Gopikrishna Desphande, Auburn University, verify combinatorial identities as well and control of the behavior of USA; D Rangaprakash, University of as understand analytic and algebraic biological networks are diverse and California, Los Angeles, USA; Luke properties of generating functions. draw from a wide variety of fields. Oeding, Auburn University, USA; Andrzej The interaction of combinatorics Discrete dynamical systems have been Cichocki, RIKEN Brain Science Institute, and symbolic computation has had a increasingly successful in modeling Japan; Xiaoping P. Hu, University of beneficial impact on both fields. This biological networks and algebraic California, Riverside, USA minisymposium will feature 12 speakers geometry has been identified as a describing recent research combining powerful tool for studying them. Many these areas. theoretical results have been developed Organizer: Manuel Kauers on their structural and dynamical Johannes Kepler University, Austria properties but numerous open problems Organizer: Michael Singer still remain. This minisymposium will North Carolina State University, USA focus on both current developments and open questions on application Organizer: Shaoshi Chen of methods in algebraic geometry North Carolina State University, USA for construction and analysis of Organizer: Stephen Melczer discrete dynamical system models. University of Waterloo, Canada It will cover applications to a wide 10:00-10:25 Asymptotic Enumeration range of problems, many of which of Weighted Lattice Paths in mathematical biology. The goal Marni Mishna, Simon Fraser University, is to bring together mathematicians Canada working in algebraic geometry who focus on discrete mathematical biology 10:30-10:55 Hermite Reduction in Logarithmic and Exponential and related areas, to promote active Extensions interaction and exchange of ideas, and Ziming Li, Chinese Academy of Sciences, to identify open problems and strategies China for addressing them. We will attract a diverse group of participants including 11:00-11:25 New Advances in Enumerating Lattice Walks through senior and junior researchers; in Rational Diagonals addition, women mathematicians will be Stephen Melczer, University of Waterloo, significantly represented. Canada Organizer: Elena S. Dimitrova 11:30-11:55 The Method of Differential Clemson University, USA Approximation in Enumerative Organizer: Matthew Macauley Combinatorics Clemson University, USA Jay Pantone, Dartmouth College, USA Organizer: David Murrugarra University of Kentucky, USA

continued on next page 26 SIAM Conference on Applied Algebraic Geometry

Tuesday, August 1 Tuesday, August 1 Tuesday, August 1 MS31 CP1 IP4 Algebraic Geometry Solving Equations Polynomial Dynamical Methods for Discrete 10:00 AM-11:30 AM Systems, Toric Differential Inclusions, and the Global Dynamical Systems - Room:Skiles Building - 171 Attractor Conject Part I of II Chair: Jonathan Hauenstein, University of 10:00 AM-12:00 PM Notre Dame, USA 1:30 PM-2:30 PM 10:00-10:25 Computing Real Equilibria Room:Clough Undergraduate Learning continued of Kuramoto Model Commons - 152 Owen Coss and Hoon Hong, North Chair: Alicia Dickenstein, Universidad de Carolina State University, USA; Jonathan 10:00-10:25 Algebraic Methods for Buenos Aires, Argentina the Control of Boolean Networks Hauenstein, University of Notre Dame, Polynomial dynamical systems (i.e., David Murrugarra, University of Kentucky, USA; Daniel Molzahn, Argonne National USA Laboratory, USA systems of differential equations with 10:30-10:55 Solving the Polynomial polynomial right-hand sides) appear in 10:30-10:55 Emergent Dynamics from many important problems in mathematics Network Connectivity: A Minimal Equations by Algorithms of Power and applications. For example, Hilbert’s Model Geometry Alexander D. Bruno, Keldysh Institute for 16th problem involves counting limit Carina Curto, Pennsylvania State University, USA Applied Mathematics, RAS, Russia; cycles of two-dimensional polynomial Alexander B. Batkhin, Keldysh Institute dynamical systems (and is still largely 11:00-11:25 Algebraic Geometry of of Applied Mathematics of RAS, Russia unsolved). Also, some of the best known K-canalizing Functions and Moscow Institute of Physics and chaotic dynamical systems (such as Qijun He, Virginia Tech, USA Technology, Russia the Lorenz system) are polynomial 11:30-11:55 Reverse-engineering 11:00-11:25 Effective Methods for dynamical systems. In applications, Threshold Networks From Boolean Proving the Consistency of Differential biological interaction networks and Data Equations chemical reaction networks often give Abdul Salam Jarrah, American University of Richard S. Gustavson, City University of New rise to polynomial dynamical systems. Sharjah, United Arab Emirates York Graduate Center, USA; Omar Leon The Global Attractor Conjecture was Sanchez, University of Manchester, United formulated in the 1970s, and claims Kingdom that the solutions of a large class of polynomial systems (called toric dynamical systems) converge to a Lunch Break globally attracting point. In particular, according to this conjecture, toric 12:00 PM-1:30 PM dynamical systems cannot give rise to Attendees on their own limit cycles or chaotic dynamics. We introduce toric differential inclusions, which are piecewise constant differential inclusions with right-hand side given by polyhedral cones, and discuss about how toric dynamical systems can be embedded into toric differential inclusions, and this embedding can be used to prove the Global Attractor Conjecture. The proof uses n-dimensional polyhedral fans, polyhedral partitions and convex geometry. We will also discuss about some connections with the Boltzmann equation, and applications of these results to understanding robustness and homeostasis in biological interaction networks. Gheorghe Craciun University of Wisconsin, Madison, USA SIAM Conference on Applied Algebraic Geometry 27

Tuesday, August 1 Tuesday, August 1 Tuesday, August 1 Coffee Break MS33 MS34 2:30 PM-3:00 PM Algorithms and Symmetry and Structure in Room:Skiles Building Implementation in Algebraic Computation - Numerical Algebraic Part II of II MS32 Geometry - Part I of II 3:00 PM-5:00 PM 3:00 PM-5:00 PM Real Algebraic Geometry Room:Skiles Building - 254 and Optimization - Room:Skiles Building - 255 For Part 1 see MS24 For Part 2 see MS44 The concept of symmetry arises both Part I of III The foundation of algebraic geometry in nature, science, and art. From a 3:00 PM-5:00 PM is the problem of solving systems computational perspective, symmetry allows to reduce the complexity of Room:Skiles Building - 249 of polynomial equations. Numerical methods can be used to perform problems or organize their resolution. For Part 2 see MS43 algebraic geometric computations This idea appears in different guises and The minisymposium presents recent forming the field of numerical algebraic in different contexts, for a variety of developments in the interplay of real geometry which continues to advance applications. The minisymposium aims to algebraic geometry and optimization. rapidly. The continuing progress present such instances. Topics include positive polynomials, in computer hardware and software sums of squares, sums of non-negative Organizer: Cordian Riener has enabled new algorithms and circuits, semidefinite and geometric Universität Konstanz, Germany implementations. Examples include programming, polynomial optimization, irreducible decompositions in multi- Organizer: Evelyne Hubert signomial optimization, growth of projective spaces, and numerical Inria Méditerranée, France polynomial functions, symmetries, and techniques for computing discrete objects 3:00-3:25 Separating Invariants and spectrahedra. such as polytopes. This session will Applications Organizer: Thorsten Theobald feature recent progress in algorithms and Emilie Dufresne, University of Nottingham, Goethe Universität Frankfurt, Germany implementations of theoretical advances United Kingdom Organizer: Timo de Wolff in numerical algebraic geometry. 3:30-3:55 Rational Invariants for Orthogonal Equivalence of Texas A&M University, USA Organizer: Tianran Chen Homogeneous Polynomials 3:00-3:25 Symmetric Sums of Squares Auburn University Montgomery, USA Paul Görlach, Max Planck Institute for Annie Raymond, University of Washington, 3:00-3:25 The Method of Gauss- Mathematics in the Sciences, Germany; USA; James Saunderson, Monash Newton to Compute Power Series Evelyne Hubert, Inria Méditerranée, France University, Australia; Mohit Singh, Georgia Solutions of Polynomial Homotopies 4:00-4:25 Local Invariant Sets of Institute of Technology, USA; Rekha Nathan Bliss and Jan Verschelde, University Polynomial and Analytic Vector Field Thomas, University of Washington, USA of Ilinois at Chicago, USA Niclas Kruff, RWTH Aachen University, 3:30-3:55 Current Key Problems 3:30-3:55 Numerical Irreducible Germany on Sums of Nonnegative Circuit Decomposition for Likelihood 4:30-4:55 Symmetry Preserving Polynomials Equations Lagrange-hermite Interpolation Timo de Wolff, Texas A&M University, USA Jose I. Rodriguez, University of Chicago, Evelyne Hubert, Inria Méditerranée, France; USA 4:00-4:25 Optimization with Invariance Cordian Riener, Universität Konstanz, Constraints 4:00-4:25 Hybridization of Bertini and Germany Amir Ali Ahmadi, Princeton University, USA; the RegularChains Maple Library Oktay Gunluk, IBM T.J. Watson Research Jesse W. Drendel, Colorado State University, Center, USA USA 4:30-4:55 On Coercivity of Polynomials 4:30-4:55 Least Squares Modeling in Tomas Bajbar, Goethe Universität Frankfurt, Numerical Algebraic Computation Germany Zhonggang Zeng, Northeastern Illinois University, USA 28 SIAM Conference on Applied Algebraic Geometry

Tuesday, August 1 Tuesday, August 1 Tuesday, August 1 MS35 MS36 MS37 Tensors: from Algebra to Biological Algebraic Minisymposium on Statistics Applications - Part I of IV Statistics - Part I of III and Applied Algebraic 3:00 PM-5:00 PM 3:00 PM-5:00 PM Topology - Part II of II Room:Skiles Building - 270 Room:Skiles Building - 005 3:00 PM-5:00 PM For Part 2 see MS57 For Part 2 see MS47 Room:Skiles Building - 202 Tensors are a rapidly growing area Algebraic statistics is a growing research For Part 1 see MS27 of research in mathematics. Their area, and has recently been applied A burgeoning area of research in Applied theoretical study involves algebraic and to several different problems from Topology has been Stochastic Analysis geometric tools, and they are closely biology. One of the primary biological and Modeling of topological summaries linked to applications in data science, application areas is phylogenetics, the of data; we will term this research area statistics and more. This minisymposium study of evolutionary histories of sets as TDA. TDA generates interest across gathers researchers who use algebraic of organisms. The improvement of mathematics, statistics, computer science, methods to study tensors, and connect genetic sequencing technologies has and electrical engineering communities. this insight to applications. We will hear led to a exponential increase in the Applications of TDA range from talks on the spectral theory of tensors, amount of evolutionary data, requiring neuroscience, to networks analysis, to a range of tensor decomposition and and allowing for new mathematical and genetics, and more. One of the many representation, computational studies statistics methods for its analysis. This challenges in modern data analysis is the of tensors, as well as connections to minisymposium will bring together ubiquity of high-dimensional data with biological data analysis and machine researchers who apply algebraic statistics growing complexity. A central challenge learning. techniques, interpreted very broadly, to a in modeling these data is representing Organizer: Elina Robeva variety of biological problems. them in a way that is amenable to Massachusetts Institute of Technology, USA Organizer: Megan Owen classical methods of statistical analysis. For example, many of the problems Lehman College, CUNY, USA Organizer: Anna Seigal can be formalized in the following University of California, Berkeley, USA Organizer: Ruriko Yoshida general settings: a collection of noisy 3:00-3:25 On a Proof of the Set- Naval Postgraduate School, USA scientific data are observed in a high- theoretic Version of the Salmon 3:00-3:25 Introduction to Biological dimensional ambient space, but are in Conjecture - Part I Algebraic Statistics fact generated by a stochastic process Shmuel Friedland, University of Illinois, Megan Owen, Lehman College, CUNY, USA that is concentrated around a lower- Chicago, USA 3:30-3:55 Toric Ideals of Neural Codes dimensional space. Recovering the 3:30-3:55 On a Proof of the Set- Nida K. Obatake, Texas A&M University, lower-dimensional system is extremely theoretic Version of the Salmon USA; Elizabeth Gross, San Jose State challenging. TDA focuses on recovering Conjecture - Part II University, USA; Nora Youngs, Colby topological summaries, facilitating Shmuel Friedland, University of Illinois, College, USA the detection of subtle features missed Chicago, USA 4:00-4:25 Genome-wide by other approaches. The proposed 4:00-4:25 Tensor Network Ranks Phylogenomic Analysis Method Using minisymposium focuses on statistical and Ke Ye and Lek-Heng Lim, University of Likelihood Ratios probabilistic aspects of TDA. We will Chicago, USA Qiwen Kang, Christopher Schardl, and Neil exhibit talks that range from asymptotic 4:30-4:55 Multi-tensor Decompositions Moore, University of Kentucky, USA; properties of topological estimators to for Personalized Cancer Diagnostics Ruriko Yoshida, Naval Postgraduate applied case studies in cancer biology and Prognostics School, USA and geometric morphometrics. These Orly Alter, University of Utah, USA 4:30-4:55 Dimensionality Reduction via talks will also relate the relatively new Tropical Geometry theory and methodology to more classic Ruriko Yoshida, Naval Postgraduate School, theory such as extrema of random fields USA; Xu Zhang, University of Kentucky, and estimates of contours. USA Organizer: Brittany Fasy Montana State University, USA Organizer: Sayan Mukherjee Duke University, USA

continued on next page SIAM Conference on Applied Algebraic Geometry 29

3:00-3:25 Topological Summaries of Tuesday, August 1 Tuesday, August 1 Tumor Images Improve Prediction of Disease Free Survival in Glioblastoma Multiforme MS38 MS39 Lorin Crawford, Duke University, USA; Algebraic Methods in Applications of Algebra to Anthea Monod and Andrew Chen, Rigidity Theory - Part II of II Signal Processing and Digital Columbia University, USA; Sayan Mukherjee, Duke University, USA; Raul 3:00 PM-5:00 PM Imaging - Part II of II Rabadan, Columbia University, USA Room:Skiles Building - 268 3:00 PM-5:00 PM 3:30-3:55 Approximation and For Part 1 see MS28 Room:Skiles Building - 271 Geometry of the Reach The classical subject of study in rigidity For Part 1 see MS29 Eddie Aamari, Universite de Paris-Sud, theory is a framework consisting of Many problems in this increasingly digital France; Jisu Kim, Carnegie Mellon finitely many rigid bars attached at University, USA; Frédéric Chazal, Inria world can be studied through the tools of universal joints, and the fundamental Saclay Ile-de-France, France; Bertrand algebra and algebraic geometry, and can Michel, École centrale de Nantes, France; question is to determine if a framework be encoded in the language of tensors. Alessandro Rinaldo and Larry Wasserman, is rigid or flexible. More general This minisymposium is focused on Carnegie Mellon University, USA frameworks involve other types problems arising in applications of tensors of geometric constraints and arise 4:00-4:25 The Geometry of to signal processing and digital imaging. in applications including robotics, Synchronization Problems and Mathematicians have studied tensors Learning Group Actions computer-aided design, and structural through tools of algebraic geometry, Tingran Gao, Duke University, USA; Jacek biology. Our goal is to bring together uncovering connections to many classical Brodzki, University of Southampton, researchers with complementary interests problems. Practitioners have studied United Kingdom; Sayan Mukherjee, Duke in applied algebraic geometry, rigidity tensors through iterative algorithmic University, USA theory, algebraic matroids, and matrix methods. There is an increasing need 4:30-4:55 The Least Squares Klein Bottle completion problems to share methods to understand these algorithms from an For Image Patches and problems. algebraic viewpoint, and to understand Brad Nelson and Gunnar Carlsson, Stanford Organizer: Jessica Sidman the boundary cases (when and why the University, USA Mount Holyoke College, USA algorithms fail). Unfortunately there is still a lack of communication between Organizer: Louis Theran mathematicians and engineers in this University of St. Andrews, United Kingdom area. Through this minisymposium we Organizer: Meera Sitharam will showcase applications of algebraic University of Florida, USA geometry to problems in the digital world, 3:00-3:25 Body-and-cad Rigidity interchange our terminology, tools, and Jessica Sidman, Mount Holyoke College, related results in a common language. USA Our goal is that this activity will help the participants to learn new tools, techniques 3:30-3:55 Generic Global and Universal Rigidity and applications as well as to identify new Louis Theran, University of St. Andrews, interdisciplinary collaborations. United Kingdom Organizer: Cristiano Bocci 4:00-4:25 Tropical Geometry for Università di Siena, Italy Rigidity Theory and Matrix Completion Organizer: Cameron L. Daniel I. Bernstein, North Carolina State University, USA Farnsworth Yonsei University, South Korea 4:30-4:55 Discriminants and Exceptional Configurations of Bar- Organizer: Luke Oeding and-joint Frameworks Auburn University, USA Zvi H. Rosen, University of Pennsylvania, 3:00-3:25 Identifiability: The Uniqueness USA; Jessica Sidman, Mount Holyoke of the Reconstruction College, USA; Louis Theran, University Luca Chiantini, Università di Siena, Italy of St. Andrews, United Kingdom; Cynthia 3:30-3:55 Algebraic Geometry in Vinzant, North Carolina State University, Wavelet Construction USA Youngmi Hur, Yonsei University, South Korea

continued on next page 30 SIAM Conference on Applied Algebraic Geometry

Tuesday, August 1 Tuesday, August 1 3:00-3:25 Mogami Constructions of Manifolds from Trees of Tetrahedra MS39 MS40 Bruno Benedetti, University of Miami, USA Applications of Algebra to Symmetric Simplicial 3:30-3:55 Equivariant Matroid Theory Emanuele Delucchi, University of Fribourg, Signal Processing and Digital Complexes and Polytopes - Switzerland Imaging - Part II of II Part I of III 4:00-4:25 Low Rank Vector Bundles 3:00 PM-5:00 PM 3:00 PM-5:00 PM and Simplicial Complexes with Symmetry continued Room:Skiles Building - 168 Chris Peterson, Colorado State University, For Part 2 see MS51 USA This session features talks related 4:00-4:25 Modelling User Feedback in 4:30-4:55 The Convex Hull of Two Recommender Systems: Tensor-based to group actions on cell complexes, Circles in R3 Approach convex bodies, etc. in discrete geometry, Evan D. Nash, Ohio State University, USA; Evgeny Frolov and Ivan Oseledets, Skolkovo topological combinatorics, computational Ata F. Pir, Frank Sottile, and Li Ying, Institute of Science and Technology, Russia topology, and nearby areas. Sample Texas A&M University, USA topics include (but are not limited to) (i) 4:30-4:55 Identifiability of An X-rank Decomposition of Polynomial Maps symmetric simplicial complexes, which appear in topological combinatorics Pierre Comon, Gipsa-Lab, France; Yang Qi, University of Chicago, USA; Konstantin such as in the evasiveness conjecture or Usevich, Gipsa-Lab, France intersection problems of Tverberg-type (ii) Vietoris-Rips and Cech simplicial complexes arising from metric spaces with group actions (iii) symmetric polytopes and orbitopes, such as cyclic polytopes and Caratheodory orbitopes (iv) Dirichlet sterohedra (polyhedra which tile space under the action of a group of motions). Our goal would be to consolidate these topics that study simplicial complexes and convex bodies with group actions and employ combinatorial-geometric reasoning in the presence of symmetries. These are closely related and more connections have recently been established. For instance, symmetric polytopes recently appeared in the study of Cech complexes of the circle. Thus we feel that now would be the right time and SIAM AG17 would be the right venue to bring together the experts in the area to foster collaborations and provide an opportunity for participants to learn about the relevant methods employed by researchers working on related problems. Organizer: Henry Adams Colorado State University, USA Organizer: Florian Frick Cornell University, USA

continued in next column SIAM Conference on Applied Algebraic Geometry 31

Tuesday, August 1 3:30-3:55 Model-dependent and Tuesday, August 1 Model-independent Control of MS41 Biological Network Models CP2 Jorge Zanudo, Reka Albert, and Gang Yang, Algebraic Geometry Pennsylvania State University, USA Coding Theory Methods for Discrete 4:00-4:25 On the Perfect 3:00 PM-5:00 PM Dynamical Systems - Part II Reconstruction of the Topology of Room:Skiles Building - 171 of II Dynamic Networks Chair: David Cox, Amherst College, USA 3:00 PM-5:00 PM Alan Veliz-Cuba, University of Dayton, USA 4:30-4:55 Model Selection Strategies 3:00-3:25 On the Remaining Heuristics Room:Skiles Building - 170 in Biological Network Inference via of the DLP Algorithm in Small For Part 1 see MS31 Groebner Bases Characteristic Mathematical methods for prediction Brandilyn Stigler, Southern Methodist Giacomo Micheli, University of Oxford, and control of the behavior of biological University, USA United Kingdom networks are diverse and draw from a 3:30-3:55 Multi-point AG Codes on wide variety of fields. Discrete dynamical the GK Maximal Curve systems have been increasingly successful Daniele Bartoli, University of Perugia, Italy; in modeling biological networks and Maria Montanucci, Università degli Studi algebraic geometry has been identified as della Basilicata, Italy; Giovanni Zini, Universita’ di Ferrara, Italy a powerful tool for studying them. Many theoretical results have been developed on 4:00-4:25 F4[v]-Double Cyclic Codes their structural and dynamical properties Srinivasulu Bathala and Maheshanand but numerous open problems still remain. Bhaintwal, Indian Institute of Technology This minisymposium will focus on both Roorkee, India current developments and open questions 4:30-4:55 Layered Codes Through on application of methods in algebraic Multilinear Algebra geometry for construction and analysis Iwan Duursma, University of Illinois at of discrete dynamical system models. Urbana-Champaign, USA It will cover applications to a wide range of problems, many of which in are mathematical biology. The goal is to Intermission bring together mathematicians working in algebraic geometry who focus on discrete 5:00 PM-5:15 PM mathematical biology and related areas, to promote active interaction and exchange of ideas, and to identify open problems SIAGA Journal Presentation and strategies for addressing them. We (Presenter: Bernd Sturmfels, will attract a diverse group of participants University of California, Berkeley) including senior and junior researchers; in addition, women mathematicians will be 5:15 PM-6:15 PM significantly represented. Room:Clough Undergraduate Learning Organizer: Elena S. Dimitrova Commons - 152 Clemson University, USA Organizer: Matthew Macauley Clemson University, USA Organizer: David Murrugarra University of Kentucky, USA 3:00-3:25 Turing, a Software Package with Crowd-sourcing Capabilities for the Analysis of Finite Polynomial Dynamical Systems Reinhard Laubenbacher, University of Connecticut Health Center, USA

continued in next column 32 SIAM Conference on Applied Algebraic Geometry

Wednesday, Wednesday, August 2 Wednesday, August 2 August 2 MS42 MS43 Algebraic Coding for Real Algebraic Geometry Storage Applications - and Optimization - Part II of Registration Part I of II III 7:30 AM-4:00 PM 10:00 AM-12:00 PM 10:00 AM-12:00 PM Room:Skiles Building - Bottom (0-th) Floor Room:Skiles Building - 202 Room:Skiles Building - 249 For Part 2 see MS53 For Part 1 see MS32 Efficient coding of data for applications For Part 3 see MS54 ´ Remarks in distributed storage gives rise to new The minisymposium presents recent problems in coding theory. The main topic developments in the interplay of real 8:20 AM-8:30 AM of the minisymposium is that of algebro- algebraic geometry and optimization. Room:Clough Undergraduate Learning geometric methods in data coding that Topics include positive polynomials, Commons - 152 support efficient recovery of data stored sums of squares, sums of non-negative on failed nodes in the system. Recently, circuits, semidefinite and geometric codes on algebraic curves have been programming, polynomial optimization, shown to enable local recovery of the signomial optimization, growth of IP5 data, and current research is focused on polynomial functions, symmetries, and Stochastic Geometry with constructions and properties of locally spectrahedra. recoverable codes from different families Topological Flavor Organizer: Thorsten Theobald of curves and higher-dimensional varieties. Goethe Universität Frankfurt, Germany 8:30 AM-9:30 AM We plan to cover these constructions in several talks of the symposium. Recent Organizer: Timo de Wolff Room:Clough Undergraduate Learning research in coding for storage also Texas A&M University, USA Commons - 152 includes algebraic constructions of codes 10:00-10:25 Factorizations of PSD Chair: Dmitriy Morozov, Lawrence Berkeley that perform local recovery based on a Matrix Polynomials and their Smith National Laboratory, USA small part of a codeword (regenerating Normal Forms Mapping the simplices of a Delaunay codes), as well as locality properties of Christoph Hanselka, University of Auckland, mosaic to their radii, we generically get known families of algebraic codes, starting New Zealand; Rainer Sinn, Georgia Institute of Technology, USA a (generalized) discrete Morse function. with the classic Reed-Solomon codes. The Assuming a stationary Poisson point symposium will include talks on local 10:30-10:55 Relative Entropy process, we extend classic results in repair of this and other related families Relaxations for Signomial Optimization stochastic geometry and compute the such as codes on Hermitian curves. Venkat Chandrasekaran, California Institute expected number of critical simplices of Technology, USA; Parikshit Shah, Organizer: Anthony Varilly Yahoo! Research, USA and intervals in the discrete gradient Alvarado as functions of the maximum radius. 11:00-11:25 Infeasible Subsystems of Rice University, USA We obtain similar results for Delaunay Spectrahedral Systems mosaics under the Fisher information Organizer: Alexander Barg Kai Kellner, Goethe Universität Frankfurt, Germany; Marc Pfetsch, Technische metric, for weighted Delaunay mosaics, University of Maryland, USA Universität Darmstadt, Germany; Thorsten and for other related complexes. 10:00-10:25 Algebraic Problems in Theobald, Goethe Universität Frankfurt, Error Correcting Codes Motivated by Herbert Edelsbrunner Germany Distributed Storage Applications IST Austria, Klosterneuburg, Austria Alexander Barg, University of Maryland, USA 11:30-11:55 Reciprocal Linear Spaces Mario Kummer, Universität Leipzig, 10:30-10:55 Examples of Locally Germany; Cynthia Vinzant, North Carolina Recoverable Codes Arising from Galois State University, USA Coffee Break Covers of Curves 9:30 AM-10:00 AM Dani Hulzebos, University of Groningen, The Netherlands Room:Skiles Building 11:00-11:25 Multi-cyclic Locally Repairable Code Kenneth Chum, Chinese University of Hong Kong, Hong Kong 11:30-11:55 Locally Recoverable Codes with Multiple Recovery Sets: A General Fiber Product Construction Beth Malmskog, Villanova University, USA SIAM Conference on Applied Algebraic Geometry 33

Wednesday, August 2 Wednesday, August 2 11:00-11:25 The Number of Embeddings of a Laman Graph MS44 MS45 Matteo Gallet, RICAM, Austrian Academy of Sciences, Austria; Jose Capco, University Algorithms and New Trends in Polynomial of Linz, Austria; Georg Grasegger, Implementation in System Solving and Johann-Radon Institute (RICAM), Austria; Numerical Algebraic Applications - Part III of III Christoph Koutschan, RICAM, Austrian Academy of Sciences, Austria; Niels Geometry - Part II of II 10:00 AM-12:00 PM Lubbes, Johann-Radon Institute (RICAM), Austria; Josef Schicho, University of Linz, 10:00 AM-12:00 PM Room:Skiles Building - 254 Austria Room:Skiles Building - 255 For Part 2 see MS14 Polynomial systems arise in numerous 11:30-11:55 On the Connection For Part 1 see MS33 Between Lexicographic Groebner areas of mathematics and computer The foundation of algebraic geometry Bases and Triangular Sets science, such as control theory, is the problem of solving systems Chenqi Mou, Beihang University, China of polynomial equations. Numerical geometric modeling, biochemistry, methods can be used to perform coding theory and cryptology, to name algebraic geometric computations a few. Efficient and reliable solvers forming the field of numerical for polynomial systems are in the algebraic geometry which continues epicentre of applied algebraic geometry to advance rapidly. The continuing and computer algebra. Available progress in computer hardware and tools for recovering the solutions software has enabled new algorithms include Groebner bases, characteristic and implementations. Examples sets, multivariate resultants as well include irreducible decompositions in as symbolic-numeric methods and multi-projective spaces, and numerical subdivision-based solvers. Among the techniques for computing discrete challenges which occur in the process is objects such as polytopes. This reliable root isolation, certification and session will feature recent progress approximation, treatment of singular in algorithms and implementations solutions, the exploitation of structure of theoretical advances in numerical coming from specific applications as algebraic geometry. well as the development of reliable software. The minisymposium will host Organizer: Tianran Chen presentations related to state-of-the-art Auburn University Montgomery, USA solution strategies for these problems, 10:00-10:25 Numerical Challenges theoretical and algorithmic advances as to Successful Decomposition of Real well as emerging application areas. Algebraic Surfaces Dani Brake, University of Notre Dame, USA Organizer: Angelos Mantzaflaris 10:30-10:55 A Dynamic Enumeration RICAM, Austrian Academy of Sciences, Approach for Computing Tropical Prevarieties Austria Anders Jensen, Aarhus University, Denmark; Organizer: Elias Tsigaridas Jeff Sommars and Jan Verschelde, INRIA Paris, France University of Ilinois at Chicago, USA 10:00-10:25 Radical Varieties 11:00-11:25 Homotopies for David Sevilla, University of Extremadura, Overdetermined Systems with Spain Applications in Computer Vision Margaret Regan and Jonathan Hauenstein, 10:30-10:55 Detecting Projective Symmetries and Equivalences of University of Notre Dame, USA; Sameer Rational Curves by Solving Polynomial Agarwal, Google, Inc., USA Systems of Equations 11:30-11:55 A Linear Homotopy Michael Hauer and Bert Juettler, University Method for Finding Generalized of Linz, Austria Tensor Eigenpairs Lixing Han, University of Michigan-Flint, USA

continued in next column 34 SIAM Conference on Applied Algebraic Geometry

Wednesday, August 2 Wednesday, August 2 Wednesday, August 2 MS46 MS47 MS48 Decomposition and Biological Algebraic Algebra and Combinatorics Identifiability of Real and Statistics - Part II of III of Graphical Models - Part I Complex Tensors - 10:00 AM-12:00 PM of II Part II of II Room:Skiles Building - 005 10:00 AM-12:00 PM 10:00 AM-12:00 PM For Part 1 see MS36 Room:Skiles Building - 006 Room:Skiles Building - 270 For Part 3 see MS58 For Part 2 see MS59 Algebraic statistics is a growing research For Part 1 see MS25 A graphical model is a multivariate area, and has recently been applied Tensors and their decompositions have statistical model in which the nodes of to several different problems from found application in a wide variety of the graph represent random variables and biology. One of the primary biological applications such as algebraic statistics, the (missing) edges encode conditional application areas is phylogenetics, the chemometrics, machine learning and (in)dependence relations amongst these study of evolutionary histories of sets signal processing, among others. Many variables. Such statistical models have of organisms. The improvement of popular ways of sparsely representing a wide variety of applications including genetic sequencing technologies has tensors, such as the tensor rank, Waring, various problems in biology and machine led to a exponential increase in the Chow, Hierarchical Tucker and Tensor learning. The inherent combinatorial amount of evolutionary data, requiring Trains decompositions, naturally admit and algebraic structure of graphical and allowing for new mathematical and the structure of projective algebraic models can be used to better understand statistics methods for its analysis. This varieties over the complex field. important statistical problems such as minisymposium will bring together Considering these decompositions model selection and identifiability. This researchers who apply algebraic over the reals, they become either real minisymposium will focus on recent statistics techniques, interpreted very projective algebraic varieties or semi- developments in the combinatorial and broadly, to a variety of biological algebraic sets. This minisymposium algebraic aspects of model selection and problems. features talks on the properties of real and parameter identifiability for graphical complex tensor decompositions and their Organizer: Megan Owen models. Applications to causality, interconnections Lehman College, CUNY, USA biology, and machine learning will be considered. Organizer: Luca Chiantini Organizer: Ruriko Yoshida Università di Siena, Italy Naval Postgraduate School, USA Organizer: Liam Solus KTH Royal Institute of Technology, Sweden Organizer: Giorgio Ottaviani 10:00-10:25 Properties of Tree-valued Dimensionality Reduction 10:00-10:25 Combinatorics of Bayesian University of Firenze, Italy Gill Grindstaff and Thérèse Wu, The Networks Organizer: Nick University of Texas at Austin, USA Liam Solus, KTH Royal Institute of Technology, Sweden; Adityanarayanan Vannieuwenhoven 10:30-10:55 Asymptotic Distributions Radhakrishnan, Massachusetts Institute of Katholieke Universiteit Leuven, Belgium of Sample Means on Piece-wise Technology, USA; Lenka Matejovicova, Linear Stratified Spaces 10:00-10:25 On Critical Rank-k Institute of Science and Technology, Chen Shen, Florida State University, USA Approximations to Tensors Austria; Caroline Uhler and Yuhao Wang, Jan Draisma, University of Bern, Switzerland; 11:00-11:25 Tropical Fermat-Weber Massachusetts Institute of Technology, USA Giorgio Ottaviani and Alicia Tocino Points Sánchez, University of Firenze, Italy 10:30-10:55 Latent Tree Models and the Bo Lin, University of California, Berkeley, Em Algorithm USA; Ruriko Yoshida, Naval Postgraduate 10:30-10:55 Hadamard Hector D. Banos Cervantes, University of School, USA Decompositions of Matrices Alaska, USA Alessandro Oneto, Inria Sophia Antipolis, 11:30-11:55 Tensors and Algebra Give 11:00-11:25 Parameter Identification in France Interpretable Groups for Crosstalk Directed Graphical Models Mechanisms in Breast Cancer 11:00-11:25 Decomposing Tensors into Mathias Drton, University of Washington, Anna Seigal, University of California, Frames USA Elina Robeva, Massachusetts Institute of Berkeley, USA; Mariano Beguerisse- Technology, USA Díaz, University of Oxford, United 11:30-11:55 Identifiability in Kingdom; Birgit Schoeberl, Merrimack Monomolecular Reaction Networks 11:30-11:55 Monomials: Complex vs Pharmaceuticals, USA; Mario Niepel, Luis David Garcia Puente, Sam Houston State Real Rank and Waring Loci Harvard Medical School, USA; Heather University, USA; Elizabeth Gross, San Jose Enrico Carlini, Politecnico di Torino, Italy Harrington, University of Oxford, United State University, USA; Heather Harrington, Kingdom University of Oxford, United Kingdom; Nicolette Meshkat, Santa Clara University, USA; Anne Shiu, Texas A&M University, USA SIAM Conference on Applied Algebraic Geometry 35

Wednesday, August 2 Wednesday, August 2 11:00-11:25 Robust Permanence of Polynomial Dynamical Systems MS49 MS50 James Brunner and Gheorghe Craciun, University of Wisconsin, Madison, USA Multivariate Splines and Algebraic Methods for 11:30-11:55 Joining and Decomposing Algebraic Geometry - Analyzing Biological Reaction Networks Part I of III Interaction Networks - Nicolette Meshkat, Santa Clara University, 10:00 AM-12:00 PM Part I of IV USA; Elizabeth Gross, San Jose State University, USA; Heather Harrington, Room:Skiles Building - 268 10:00 AM-12:00 PM University of Oxford, United Kingdom; For Part 2 see MS60 Room:Skiles Building - 271 Anne Shiu, Texas A&M University, USA The focus of the proposed For Part 2 see MS61 minisymposium is on problems in This minisymposium focuses on tools approximation theory that may be studied from algebraic geometry and beyond that using techniques from commutative can aid the study of biological interaction algebra and algebraic geometry. Research networks. Such systems frequently interests of the participants relevant to arise in systems biology and range from the minisymposium fall broadly under ODEs defined by biochemical reaction multivariate spline theory, interpolation, systems to models from ecology. Topics and geometric modeling. For instance, a of interest range from conditions for main problem of interest is to study the permanence, persistence, and multiple Hilbert function and algebraic structure equilibria to questions of parameter of the spline module; recently there identifiability. The ODEs under study have been several advances on this front are often defined by polynomial or using notions from algebraic geometry. rational functions. Hence algebra and Nevertheless this problem remains algebraic geometry are increasingly elusive in low degree; the dimension of making important contributions, and the space of piecewise cubics on a planar this minisymposium will be a venue for triangulation (especially relevant for exchanges on the latest developments in applications) is still unknown in general! this area. Organizer: Michael DiPasquale Organizer: Carsten Conradi Oklahoma State University, USA Hochschule Karlsruhe Technik und Organizer: Frank Sottile Wirtschaft, Germany Texas A&M University, USA Organizer: Gheorghe Craciun 10:00-10:25 Algebraic Methods in University of Wisconsin, Madison, USA Spline Theory Organizer: Anne Shiu Michael DiPasquale, Oklahoma State Texas A&M University, USA University, USA 10:00-10:25 Algebraic Approaches to 10:30-10:55 Semialgebraic Splines Biological Interaction Networks Frank Sottile, Texas A&M University, USA; Carsten Conradi, Hochschule Karlsruhe Sun Lanyin, Dalian University of Science Technik und Wirtschaft, Germany and Technology, China; Michael Di Pasquale, Oklahoma State University, USA 10:30-10:55 Reactant Subspaces and Positive Equilibria of Power Law Kinetic 11:00-11:25 Subdivision and Spline Systems Spaces Dylan Antonio Talabis, University of the Tatyana Sorokina, Towson University, USA; Philippines Los Baños, Philippines; Carlene Hal Schenck, University of Illinois, USA Arceo, University of the Philippines 11:30-11:55 Geometric Realizations of Diliman, Philippines; Editha Jose, the Space of Splines on a Simplicial University of the Philippines Los Baños, Complex Philippines; Angelyn R. Lao, De La Salle Nelly Villamizar, Swansea University, United University, Philippines; Eduardo Mendoza, Kingdom Ludwig-Maximilians-Universität München, Germany

continued in next column 36 SIAM Conference on Applied Algebraic Geometry

Wednesday, August 2 10:00-10:25 Convex Geometry and Wednesday, August 2 Compactified Jacobians MS51 Farbod Shokrieh, Cornell University, USA MS52 Symmetric Simplicial 10:30-10:55 Hyperplane Equipartitions Applied and Computational Plus Constraints Topology - Part I of III Complexes and Polytopes - Steven Simon, Bard College, USA Part II of III 10:00 AM-12:00 PM 11:00-11:25 A Characterization of 10:00 AM-12:00 PM Simplicial Manifolds with g2 ≤ 2 Room:Skiles Building - 170 Hailun Zheng, University of Washington, USA Room:Skiles Building - 168 For Part 2 see MS63 Applied and computational topology For Part 1 see MS40 11:30-11:55 Obstructions to Graph For Part 3 see MS62 Homomorphisms combines ideas from topology, geometry, This session features talks related Anton Dochtermann, Texas State University, statistics and computer science to address USA to group actions on cell complexes, problems pertaining to the analysis of convex bodies, etc. in discrete geometry, data. In the last decade, it has rapidly topological combinatorics, computational developed as a vibrant field of research topology, and nearby areas. Sample attracting scientists across several topics include (but are not limited to) (i) communities. This minisymposium symmetric simplicial complexes, which will provide a forum for discussion appear in topological combinatorics and dissemination of recent advances such as in the evasiveness conjecture or addressing computational challenges intersection problems of Tverberg-type and foundational questions. In addition, (ii) Vietoris-Rips and Cech simplicial applications to computational biology, complexes arising from metric spaces dynamical systems and signal analysis with group actions (iii) symmetric will be presented. polytopes and orbitopes, such as cyclic Organizer: Jose Perea polytopes and Caratheodory orbitopes Michigan State University, USA (iv) Dirichlet sterohedra (polyhedra Organizer: Justin Curry which tile space under the action of University of Pennsylvania, USA a group of motions). Our goal would be to consolidate these topics that 10:00-10:25 Induced Dynamics in the study simplicial complexes and convex Space of Persistence Diagrams bodies with group actions and employ Francis Motta, Duke University, USA combinatorial-geometric reasoning in 10:30-10:55 Cliques and Cavities in the presence of symmetries. These are Neuroscience closely related and more connections Ann Sizemore and Chad Giusti, University of have recently been established. For Pennsylvania, USA instance, symmetric polytopes recently 11:00-11:25 Persistence-based appeared in the study of Cech complexes Summaries for Metric Graphs of the circle. Thus we feel that now Ellen Gasparovic, Union College, USA would be the right time and SIAM 11:30-11:55 Persistence-based AG17 would be the right venue to bring Summaries for Metric Graphs -- together the experts in the area to foster Revisited collaborations and provide an opportunity Radmila Sazdanovic, North Carolina State for participants to learn about the relevant University, USA methods employed by researchers working on related problems. Organizer: Henry Adams Lunch Break Colorado State University, USA 12:00 PM-1:30 PM Organizer: Florian Frick Attendees on their own Cornell University, USA

continued in next column SIAM Conference on Applied Algebraic Geometry 37

Wednesday, August 2 Wednesday, August 2 Wednesday, August 2 SIAGA Editorial Board MS53 MS54 Meeting Algebraic Coding for Real Algebraic Geometry 12:00 PM-1:30 PM Room: Skiles Building–006 Storage Applications - and Optimization - Part II of II Part III of III IP6 3:00 PM-5:00 PM 3:00 PM-5:00 PM Room:Skiles Building - 202 Room:Skiles Building - 249 Curves with Complex For Part 1 see MS42 For Part 2 see MS43 Multiplication and Efficient coding of data for applications The minisymposium presents recent Applications to in distributed storage gives rise to new developments in the interplay of real Cryptography problems in coding theory. The main topic algebraic geometry and optimization. of the minisymposium is that of algebro- Topics include positive polynomials, sums 1:30 PM-2:30 PM geometric methods in data coding that of squares, sums of non-negative circuits, Room:Clough Undergraduate Learning support efficient recovery of data stored semidefinite and geometric programming, Commons - 152 on failed nodes in the system. Recently, polynomial optimization, signomial Chair: Anthony Varilly Alvarado, Rice codes on algebraic curves have been optimization, growth of polynomial University, USA shown to enable local recovery of the functions, symmetries, and spectrahedra. data, and current research is focused on Organizer: Thorsten Theobald There are many advantages to using constructions and properties of locally Goethe Universität Frankfurt, Germany cryptosystems based on elliptic curves or recoverable codes from different families genus 2 curves. However, implementation of curves and higher-dimensional varieties. Organizer: Timo de Wolff of these cryptosystems requires a curve We plan to cover these constructions in Texas A&M University, USA over a finite field F where the number of several talks of the symposium. Recent 3:00-3:25 Complexity in Polynomial F-rational points on the Jacobian is prime research in coding for storage also Optimization with Integer Variables (or a prime times a small cofactor). I will includes algebraic constructions of codes Robert Hildebrand, IBM T.J. Watson Research explain how the problem of finding such that perform local recovery based on a Center, USA curves leads to questions about reductions small part of a codeword (regenerating 3:30-3:55 Gram Spectrahedra of curves with complex multiplication codes), as well as locality properties of Lynn Chua, University of California, Berkeley, and conversely, how structural results known families of algebraic codes, starting USA; Daniel Plaumann, Technische about curves with complex multiplication with the classic Reed-Solomon codes. The Universität Dortmund, Germany; Rainer affect algorithms for constructing symposium will include talks on local Sinn, Georgia Institute of Technology, cryptographically useful curves. repair of this and other related families USA; Cynthia Vinzant, North Carolina State Bianca Viray such as codes on Hermitian curves. University, USA University of Washington, USA Organizer: Anthony Varilly 4:00-4:25 Constrained Optimization via SONC Polynomials Alvarado Mareike Dressler, Goethe Universität Rice University, USA Frankfurt, Germany Organizer: Alexander Barg 4:30-4:55 Deriving Convex Hull Forms Coffee Break University of Maryland, USA of Special Symmetric Multilinear 2:30 PM-3:00 PM 3:00-3:25 Evaluation Codes from Polynomials Algebraic Surfaces over a Finite Field Yibo Xu, Warren Adams, and Akshay Gupte, Room:Skiles Building John B. Little, College of the Holy Cross, USA Clemson University, USA 3:30-3:55 Optimal Locally Recoverable Codes from Algebraic Surfaces Anthony Varilly Alvarado, Rice University, USA 4:00-4:25 Hierarchical Locally Recoverable Codes on Algebraic Curves Sean F. Ballentine, University of Maryland, USA 4:30-4:55 Recent Results on Codes for Distributed Storage Vijay Kumar, Indian Institute of Science, Bangalore, India 38 SIAM Conference on Applied Algebraic Geometry

Wednesday, August 2 Wednesday, August 2 3:30-3:55 Reconstructing Complex Cellular Mixtures from Heterogeneous MS55 MS56 Tissue Samples Russell Schwartz, Carnegie Mellon University, Applications of Numerical Polyhedral and USA Algebraic Geometry Combinatorial Biology - 4:00-4:25 An Algebraic Approach to in Math, Science, and Part IV of IV Categorical Data Fusion for Population Engineering - Part I of II 3:00 PM-5:00 PM Size Estimation Ann Johnston, Pennsylvania State University, 3:00 PM-5:00 PM Room:Skiles Building - 254 USA; Sonja Petrovic, Illinois Institute of Room:Skiles Building - 255 For Part 3 see MS26 Technology, USA; Aleksandra Slavkovic, Pennsylvania State University, USA For Part 2 see MS66 We explore the role that combinatorial Numerical algebraic geometry is driven and polyhedral structures play in 4:30-4:55 A Convex Realization of by applications. The need to solve understanding biological phenomenon. Neural Codes on Grids polynomial systems is strong, especially The rapid grown in technology, means Robert L. Williams, Texas A&M University, USA in fields such as smart grid networks, that the sophistication of the algorithms chemical reaction networks, kinematics used to analyze discrete biological data and robotics, quantum and string theory, lags behind the availability of data. algebraic statistics, and many others. Discrete mathematicians are encouraged With continuing advances in computer to attend this session, to learn about hardware and theory and algorithms applications of their tools to biology. in numerical algebraic geometry, the Biologists are encourage to attend to scope of problems we can solve will ensure that mathematicians are focused also evolve. This session features talks on problems that remain relevant in the discussing the application of theory, rapidly developing biological landscape. algorithms, and software in numerical Mathematical objects such as convex algebraic geometry to problems across polyhedral, cell complexes, trees and mathematics, science, and engineering. networks can be used to understand a wide range of biological phenomena. Organizer: Dani Brake This session will feature exploration University of Notre Dame, USA of RNA secondary structures, neural 3:00-3:25 Model Selection for Gaussian codes, genome rearrangements as well Mixtures with Numerical Algebraic as bacterial, gene, and species evolution. Geometry These applications show demonstrate Adel Alaeddini, University of Texas, San how topics traditionally confined to Antonio, USA; Elizabeth Gross, San Jose the pure mathematical cannon help State University, USA; Sara Shirinkam, University of Texas, San Antonio, USA explore living organisms. In addition, this session will examine how biology 3:30-3:55 Certification via Liaison generates novel mathematical questions Pruning and objects, such as the structure of Nickolas Hein, Benedictine College, USA varieties associated to Markov models 4:00-4:25 Computational Algebraic of evolution, or the enumeration of gene Geometry Methods in Machine trees under the coalescent model. Learning Dhagash Mehta, United Technologies Organizer: Joseph P. Rusinko Research Center, USA Hobart and William Smith Colleges, USA 4:30-4:55 Reduced Basis Homotopy 3:00-3:25 Valid Plane Trees and RNA Method for Computing Multiple Elizabeth Drellich, Swarthmore College, Solutions of Nonlinear PDEs USA; Julianna Tymoczko and Francis Wenrui Hao, Pennsylvania State University, Black, Smith College, USA USA

continued in next column SIAM Conference on Applied Algebraic Geometry 39

Wednesday, August 2 Wednesday, August 2 Wednesday, August 2 MS57 MS58 MS59 Tensors: from Algebra to Biological Algebraic Algebra and Combinatorics Applications - Part II of IV Statistics - Part III of III of Graphical Models - 3:00 PM-4:30 PM 3:00 PM-5:00 PM Part II of II Room:Skiles Building - 270 Room:Skiles Building - 005 3:00 PM-5:00 PM For Part 1 see MS35 For Part 2 see MS47 Room:Skiles Building - 006 For Part 3 see MS68 Algebraic statistics is a growing research For Part 1 see MS48 Tensors are a rapidly growing area of area, and has recently been applied A graphical model is a multivariate research in mathematics. Their theoretical to several different problems from statistical model in which the nodes of study involves algebraic and geometric biology. One of the primary biological the graph represent random variables and tools, and they are closely linked to application areas is phylogenetics, the the (missing) edges encode conditional applications in data science, statistics study of evolutionary histories of sets (in)dependence relations amongst these and more. This minisymposium gathers of organisms. The improvement of variables. Such statistical models have researchers who use algebraic methods genetic sequencing technologies has a wide variety of applications including to study tensors, and connect this insight led to a exponential increase in the various problems in biology and machine to applications. We will hear talks on amount of evolutionary data, requiring learning. The inherent combinatorial the spectral theory of tensors, a range of and allowing for new mathematical and and algebraic structure of graphical tensor decomposition and representation, statistics methods for its analysis. This models can be used to better understand computational studies of tensors, as well minisymposium will bring together important statistical problems such as as connections to biological data analysis researchers who apply algebraic statistics model selection and identifiability. This and machine learning. techniques, interpreted very broadly, to a minisymposium will focus on recent Organizer: Elina Robeva variety of biological problems. developments in the combinatorial and Massachusetts Institute of Technology, USA Organizer: Megan Owen algebraic aspects of model selection and Organizer: Anna Seigal Lehman College, CUNY, USA parameter identifiability for graphical models. Applications to causality, University of California, Berkeley, USA Organizer: Ruriko Yoshida biology, and machine learning will be 3:00-3:25 Symmetric Tensor Nuclear Naval Postgraduate School, USA considered. Norms 3:00-3:25 An Invariants-Based Method Jiawang Nie, University of California, San for Efficient Identification of Hybrid Organizer: Liam Solus Diego, USA Species under the Coalescent Model KTH Royal Institute of Technology, Sweden 3:30-3:55 The Condition Number of Julia Chifman, American University, USA 3:00-3:25 Totally Positive Graphical Models Join Decompositions 3:30-3:55 Finite Phylogenetic Paul Breiding, Technische Universität Complexity and Combinatorics of Caroline Uhler, Massachusetts Institute Berlin, Germany; Nick Vannieuwenhoven, Tables of Technology, USA; Piotr Zwiernik, Katholieke Universiteit Leuven, Belgium Emanuele Ventura, Aalto University, Finland University of California, Berkeley, USA; Steffen Lauritzen, University of 4:00-4:25 Connectedness of Tensor 4:00-4:25 Bounds on the Expected Size Copenhagen, Denmark Ranks of the Maximum Agreement Subtree 3:30-3:55 Computing the ML Degree of Lek-Heng Lim, Ke Ye, and Yang Qi, Seth Sullivant, North Carolina State Hierarchical Log-linear Models University of Chicago, USA; Pierre Comon, University, USA Gipsa-Lab, France Serkan Hosten, San Francisco State University, 4:30-4:55 Stochastic Safety Radius on USA NJ and BME Methods for Small Trees 4:00-4:25 Matrix Schubert Varieties and Jing Xi, University of Wisconsin, Stout, USA; Gaussian Conditional Independence Jin Xie, University of Kentucky, USA; Models Ruriko Yoshida, Naval Postgraduate School, Alex Fink, Queen Mary, University of USA; Stefan Forcey, University of Akron, London, United Kingdom; Jenna Rajchgot, USA University of Saskatchewan, Canada; Seth Sullivant, North Carolina State University, USA 4:30-4:55 Bayesian Networks and Generalized Permutohedra Fatemeh Mohammadi, Technische Universität Berlin, Germany; Caroline Uhler, Massachusetts Institute of Technology, USA; Charles Wang and Josephine Yu, Georgia Institute of Technology, USA 40 SIAM Conference on Applied Algebraic Geometry

Wednesday, August 2 Wednesday, August 2 3:30-3:55 Regions of Multistationarity in Chemical Reaction Networks MS60 MS61 Alicia Dickenstein, Universidad de Buenos Aires, Argentina; Frédéric Bihan, Multivariate Splines and Algebraic Methods for University of Savoy, France; Magalí Algebraic Geometry - Analyzing Biological Giaroli, Universidad de Buenos Aires, Part II of III Interaction Networks - Argentina Part II of IV 4:00-4:25 Graphical Equilibria for 3:00 PM-4:30 PM Deterministic and Stochastic Reaction Room:Skiles Building - 268 3:00 PM-5:00 PM Networks For Part 1 see MS49 Room:Skiles Building - 271 Daniele Cappelletti, University of Wisconsin, Madison, USA For Part 3 see MS71 For Part 1 see MS50 The focus of the proposed For Part 3 see MS72 4:30-4:55 Towards Quasi-stationary minisymposium is on problems in This minisymposium focuses on tools Distributions for a Class of Reaction approximation theory that may be studied from algebraic geometry and beyond that Networks using techniques from commutative can aid the study of biological interaction Mads C. Hansen, University of Copenhagen, Denmark algebra and algebraic geometry. Research networks. Such systems frequently interests of the participants relevant to arise in systems biology and range from the minisymposium fall broadly under ODEs defined by biochemical reaction multivariate spline theory, interpolation, systems to models from ecology. Topics and geometric modeling. For instance, a of interest range from conditions for main problem of interest is to study the permanence, persistence, and multiple Hilbert function and algebraic structure equilibria to questions of parameter of the spline module; recently there identifiability. The ODEs under study have been several advances on this front are often defined by polynomial or using notions from algebraic geometry. rational functions. Hence algebra and Nevertheless this problem remains algebraic geometry are increasingly elusive in low degree; the dimension of making important contributions, and the space of piecewise cubics on a planar this minisymposium will be a venue for triangulation (especially relevant for exchanges on the latest developments in applications) is still unknown in general! this area. Organizer: Michael DiPasquale Organizer: Carsten Conradi Oklahoma State University, USA Hochschule Karlsruhe Technik und Organizer: Frank Sottile Wirtschaft, Germany Texas A&M University, USA Organizer: Gheorghe Craciun 3:00-3:25 Smooth Splines on Surfaces University of Wisconsin, Madison, USA with General Topology Organizer: Anne Shiu Bernard Mourrain, Inria Sophia Antipolis, Texas A&M University, USA France 3:00-3:25 Identifying Parameter 3:30-3:55 Spaces of Splines, Vector Regions for Multistationarity Bundles, and Reflexive Sheaves Carsten Wiuf and Elisenda Feliu, University Peter F. Stiller, Texas A&M University, USA of Copenhagen, Denmark; Carsten Conradi, 4:00-4:25 Splines on Lattices and Hochschule Karlsruhe Technik und Equivariant Cohomology of Certain Wirtschaft, Germany; Maya Mincheva, Affine Springer Fibers Northern Illinois University, USA Julianna Tymoczko, Smith College, USA

continued in next column SIAM Conference on Applied Algebraic Geometry 41

Wednesday, August 2 3:30-3:55 Non-acyclicity of Coset Wednesday, August 2 Lattices and Generation of Finite MS62 Groups MS63 Russ Woodroofe, Mississippi State University, Symmetric Simplicial USA Applied and Computational Complexes and Polytopes - 4:00-4:25 Some Relatives of Matroid Topology - Part II of III Part III of III Polytopes 3:00 PM-5:00 PM Jose Samper, University of Miami, USA 3:00 PM-4:30 PM Room:Skiles Building - 170 Room:Skiles Building - 168 For Part 1 see MS52 For Part 2 see MS51 For Part 3 see MS74 This session features talks related Applied and computational topology to group actions on cell complexes, combines ideas from topology, geometry, convex bodies, etc. in discrete geometry, statistics and computer science to address topological combinatorics, computational problems pertaining to the analysis of topology, and nearby areas. Sample data. In the last decade, it has rapidly topics include (but are not limited to) (i) developed as a vibrant field of research symmetric simplicial complexes, which attracting scientists across several appear in topological combinatorics communities. This minisymposium such as in the evasiveness conjecture or will provide a forum for discussion intersection problems of Tverberg-type and dissemination of recent advances (ii) Vietoris-Rips and Cech simplicial addressing computational challenges complexes arising from metric spaces and foundational questions. In addition, with group actions (iii) symmetric applications to computational biology, polytopes and orbitopes, such as cyclic dynamical systems and signal analysis polytopes and Caratheodory orbitopes will be presented. (iv) Dirichlet sterohedra (polyhedra Organizer: Jose Perea which tile space under the action of Michigan State University, USA a group of motions). Our goal would be to consolidate these topics that Organizer: Justin Curry study simplicial complexes and convex University of Pennsylvania, USA bodies with group actions and employ 3:00-3:25 Gromov-Hausdorff Limit of combinatorial-geometric reasoning in the Wasserstein Spaces on Point Clouds presence of symmetries. These are closely Nicolas Garcia Trillos, Brown University, related and more connections have USA recently been established. For instance, 3:30-3:55 Topological Deep Learning symmetric polytopes recently appeared in of Biomolecular Data the study of Cech complexes of the circle. Guowei Wei, Michigan State University, USA Thus we feel that now would be the right 4:00-4:25 Sheaves and Numerical time and SIAM AG17 would be the right Analysis venue to bring together the experts in the Michael Robinson, American University, USA area to foster collaborations and provide 4:30-4:55 Topological Rhythm an opportunity for participants to learn Hierarchy Quantification in Musical about the relevant methods employed by Audio researchers working on related problems. Chris Tralie, Duke University, USA Organizer: Henry Adams Colorado State University, USA Organizer: Florian Frick Cornell University, USA 3:00-3:25 Chromatic Numbers of Simplicial Manifolds Frank H. Lutz, Technische Universität Berlin, Germany

continued in next column 42 SIAM Conference on Applied Algebraic Geometry

Wednesday, August 2 Wednesday, August 2 Thursday, August 3 CP3 SP1 Algebra SIAG/AG Early Career Prize Registration 3:00 PM-5:00 PM Lecture: A Brief History of Smale’s 17th Problem 7:30 AM-4:00 PM Room:Skiles Building - 171 Room:Skiles Building - Bottom (0-th) Floor Chair: Jan Draisma, University of Bern, 5:15 PM-6:00 PM Switzerland Room:Clough Undergraduate Learning Commons - 152 3:00-3:25 A Polynomial-time Algorithm Remarks to Compute Generalized Hermite Chair: Jan Draisma, Universitaet Bern, Normal Forms of Matrices over Z[x] Switzerland 8:20 AM-8:30 AM Xiaoshan Gao, Chinese Academy of Sciences, China Chair: Agnes Szanto, North Carolina State Room:Clough Undergraduate Learning University, USA Commons - 152 3:30-3:55 Noetherianity for Cubic Polynomials In the 80s, Steve Smale, soon joined by Rob H. Eggermont, Harm Derksen, and Mike Shub, studied from a theoretical Andrew Snowden, University of Michigan, point of view the complexity of USA numerically solving polynomial systems. IP7 4:00-4:25 Minimal Free Resolution of They produced many new ideas to Gaussian Graphical the Associated Graded Ring of Certain realize Newton’s method algorithmic Models from an Affine Monomial Curves potential but they also left several open Algebraic, Geometric and Pinar Mete, Balikesir University, Turkey questions, one of which is Smale’s 17th Combinatorial Perspective 4:30-4:55 Generalized Weierstrass problem. From the early results to the Semigroups and their Poincaré Series final touch, I will sketch some of the 8:30 AM-9:30 AM ideas that leads to a solution to Smale’s Wanderson Tenório, University of Campinas, Room:Clough Undergraduate Learning 17th problem. Brazil Commons - 152 Pierre Lairez Chair: Ruriko Yoshida, Naval Postgraduate Inria Saclay Ile-de-France, France School, USA Intermission In this talk we will introduce 5:00 PM-5:15 PM probabilistic Gaussian graphical models as an interesting study object for applied algebraic geometers. In particular, we discuss maximum likelihood estimation for Gaussian graphical models, which leads to the problem of maximizing the determinant function over a spectrahedron, and to the positive definite matrix completion problem. Missing edges in a Gaussian graphical model correspond to conditional independence relations. We present a representation of conditional independence relations by a generalized permutohedron. Finally, we discuss extensions of Gaussian graphical models to exponential families leading to the concept of exponential varieties. Caroline Uhler Massachusetts Institute of Technology, USA

Coffee Break 9:30 AM-10:00 AM Room:Skiles Building SIAM Conference on Applied Algebraic Geometry 43

Thursday, August 3 Thursday, August 3 10:30-10:55 Bad Semidefinite Programs: They All Look the Same MS64 MS65 Gabor Pataki, University of North Carolina at Chapel Hill, USA Coding Theory - Part I of IV Semidefinite Optimization 11:00-11:25 Do Sums-of-squares Dream 10:00 AM-11:30 AM and Convex Algebraic of Free Resolutions? Room:Skiles Building - 249 Geometry - Part I of IV Greg Blekherman and Rainer Sinn, Georgia Institute of Technology, USA; Mauricio For Part 2 see MS75 10:00 AM-12:00 PM Coding Theory comes as an answer to Velasco, Universidad de los Andes, Room:Skiles Building - 202 Colombia the problem of reliable communication For Part 2 see MS76 over noisy channels. As a research field, 11:30-11:55 Hermitian Factorizations of In the past decade there has been a surge Coding Theory intersects Mathematics, Univariate Matrix Polynomials of interest in algebraic approaches to Information Theory, and Electrical Rainer Sinn and Greg Blekherman, Georgia optimization problems defined in terms Engineering. The minisymposium session Institute of Technology, USA; Christoph of multivariate polynomials. Fundamental Hanselka, University of Auckland, New we propose focuses on the algebraic mathematical challenges that arise in Zealand; Daniel Plaumann, Technische aspect of the theory of error-correcting this program include understanding the Universität Dortmund, Germany; Cynthia codes, both in the context of Classical structure of nonnegative polynomials, Vinzant, North Carolina State University, Coding Theory and Network Coding, the interplay between efficiency and USA a new emerging research field that complexity of different representations studies network transmissions. Algebra of algebraic sets, and the development of plays a crucial role in Coding Theory, effective algorithms. Convexity provides a as it provides the main tools for the new viewpoint and a powerful framework construction of error-correcting codes and for addressing these questions. This their analysis. naturally brings us to the intersection Organizer: Alberto Ravagnani of algebraic geometry, optimization,and University of Toronto, Canada convex geometry, with an emphasis Organizer: Gretchen L. on algorithms and computation. This Matthews emerging area has become known as Clemson University, USA convex algebraic geometry. We propose to have 4 minisymposium session to address 10:00-10:25 Distributed Coding for the full breadth of problems arising in Evolving Content in Evolving Networks convex algebraic geometry, semidefinite Muriel Medard, N Prakash, and Vitaly Abdrashitov, Massachusetts Institute of programming and polynomial Technology, USA optimization. 10:30-10:55 AG Codes as Products Organizer: Greg Blekherman of Reed-Solomon Codes and Georgia Institute of Technology, USA Applications Organizer: Cynthia Vinzant Gretchen L. Matthews, Clemson University, North Carolina State University, USA USA 11:00-11:25 Locally Decodable Codes Organizer: Daniel Plaumann and Practical Applications Technische Universität Dortmund, Germany Daniel Augot, Inria, France Organizer: Joao Gouveia Universidade de Coimbra, Portugal 10:00-10:25 On Representing the Positive Semidefinite Cone using the Second-order Cone Hamza Fawzi, University of Cambridge, United Kingdom

continued in next column 44 SIAM Conference on Applied Algebraic Geometry

Thursday, August 3 Thursday, August 3 Thursday, August 3 MS66 MS67 MS68 Applications of Numerical Core Algorithms in Algebra Tensors: from Algebra to Algebraic Geometry in Math, and Geometry - Part I of II Applications - Part III of IV Science, and Engineering - 10:00 AM-12:00 PM 10:00 AM-11:30 AM Part II of II Room:Skiles Building - 254 Room:Skiles Building - 270 10:00 AM-12:00 PM For Part 2 see MS78 For Part 2 see MS57 For Part 4 see MS79 Room:Skiles Building - 255 Experimentation with computer algebra systems is an important technique Tensors are a rapidly growing area of For Part 1 see MS55 research in mathematics. Their theoretical Numerical algebraic geometry is driven throughout algebra and geometry. In this minisymposium the speakers present study involves algebraic and geometric by applications. The need to solve tools, and they are closely linked to polynomial systems is strong, especially both improvements to core algorithms that drive this experimentation, as well applications in data science, statistics in fields such as smart grid networks, and more. This minisymposium gathers chemical reaction networks, kinematics as research that has profited from such experiments. The minisymposium aims researchers who use algebraic methods and robotics, quantum and string theory, to study tensors, and connect this insight algebraic statistics, and many others. to be inclusive and represent the diversity of computer algebra systems. to applications. We will hear talks on With continuing advances in computer the spectral theory of tensors, a range of hardware and theory and algorithms Organizer: Thomas Kahle tensor decomposition and representation, in numerical algebraic geometry, the Universität Magdeburg, Germany computational studies of tensors, as well scope of problems we can solve will 10:00-10:25 When is a Polynomial as connections to biological data analysis also evolve. This session features talks Ideal Binomial After Changing and machine learning. discussing the application of theory, Coordinates? algorithms, and software in numerical Lukas Katthän, Goethe Universität Frankfurt, Organizer: Elina Robeva algebraic geometry to problems across Germany Massachusetts Institute of Technology, USA mathematics, science, and engineering. 10:30-10:55 Computing Chow Forms, Organizer: Anna Seigal Organizer: Dani Brake Hurwitz Forms, and Beyond University of California, Berkeley, USA University of Notre Dame, USA Kathlén Kohn, Technische Universität Berlin, 10:00-10:25 Adaptive Sparsity in Germany 10:00-10:25 Exceptional Stewart- Machine Learning and Autonomy Gough Platforms and Segre 11:00-11:25 Computing GIT-fans with Sara Jamshidi, Pennsylvania State University, Embeddings Symmetry USA Samantha Sherman and Jon Hauenstein, Janko Boehm, Technische Universität 10:30-10:55 Tensor Decomposition University of Notre Dame, USA; Charles Kaiserslautern, Germany for Learning Latent Variable Models: Wampler, General Motors Research 11:30-11:55 The Computation of Algorithms and Challenges Laboratories, USA Discriminants in Mass-action Networks Rong Ge, Duke University, USA 10:30-10:55 Computing the Canonical Alexandru Iosif, Universität Magdeburg, 11:00-11:25 On Learning Low Rank Decomposition of Unbalanced Tensors Germany Tensors by Homotopy Method Massimiliano Pontil, University College Tsung-Lin Lee, National Sun Yat-Sen London, United Kingdom University, Taiwan 11:00-11:25 Numerical Algebraic Geometry for Geolocation of RF Emitters Karleigh Cameron, Colorado State University, USA 11:30-11:55 Topological Data Analysis for Real Algebraic Varieties Parker Edwards, University of Florida, USA; Emilie Dufresne, University of Nottingham, United Kingdom; Heather Harrington, University of Oxford, United Kingdom; Jonathan Hauenstein, University of Notre Dame, USA SIAM Conference on Applied Algebraic Geometry 45

Thursday, August 3 Thursday, August 3 Thursday, August 3 MS69 MS70 MS71 Algebraic and Topological Software and Computation Multivariate Splines and Biology - Part I of IV in Algebraic Statistics - Algebraic Geometry - 10:00 AM-12:00 PM Part I of II Part III of III Room:Skiles Building - 005 10:00 AM-12:00 PM 10:00 AM-12:00 PM For Part 2 see MS80 Room:Skiles Building - 006 Room:Skiles Building - 268 Recently there has been an explosion in For Part 2 see MS81 For Part 2 see MS60 the use of algebraic tools for modeling For over two decades, algebraic The focus of the proposed minisymposium biological systems as well as topological methods have expanded the horizons is on problems in approximation theory data analysis methods for information of statistics with both theoretical and that may be studied using techniques retrieval from biological and medical applied contributions. In this session from commutative algebra and algebraic data sets. Work in this area relies on the we’ll consider recent advances in geometry. Research interests of the application of algebraic geometry to fully applied algebraic statistics, focusing on participants relevant to the minisymposium understand the algebraic structures and algorithms and implementations. Specific fall broadly under multivariate spline topological spaces in question and develop applications range from classical discrete theory, interpolation, and geometric robust algorithms for data mining. The multivariate analysis to social networks modeling. For instance, a main problem topics represented in the list of proposed and phylogenetics. of interest is to study the Hilbert function titles are highly representative of cutting- and algebraic structure of the spline edge research in this area. Speakers will Organizer: Elizabeth Gross module; recently there have been several discuss the use of algebra, topology and San Jose State University, USA advances on this front using notions from geometry to study chromosomal and RNA Organizer: David Kahle algebraic geometry. Nevertheless this structures and cell genomics, as well as the Baylor University, USA problem remains elusive in low degree; inference of phylogenetic tree structures 10:00-10:25 Algebraic Statistics in R – the dimension of the space of piecewise from algebraic-geometric data encoding A State of the Union cubics on a planar triangulation (especially and the study of neural codes using ideals, David Kahle, Baylor University, USA relevant for applications) is still unknown their associated varieties, and modules. 10:30-10:55 Using Macaulay2 from in general! Aside from the organizer, our speakers within R: The M2R Package include graduate students, postdoctoral Organizer: Michael DiPasquale Christopher Oneill, University of California, Oklahoma State University, USA researchers, and early-career tenure- Davis, USA; David Kahle, Baylor track faculty at liberal arts institutions. University, USA; Jeff Sommars, University Organizer: Frank Sottile Additionally, this session will include many of Ilinois at Chicago, USA Texas A&M University, USA non-U.S. speakers and speakers from a 11:00-11:25 Semigroups -- 10:00-10:25 Dimension of broad variety of departmental affiliations. A Computational Approach Tchebycheffian Spline Spaces on Organizer: Ruth E. Davidson Ruriko Yoshida, Naval Postgraduate School, T-meshes University of Illinois at Urbana-Champaign, USA; Florian Kohl, Freie Universität Cesare Bracco, University of Florence, Italy; USA Berlin, Germany; Yanxi Li, University Tom Lyche, University of Oslo, Norway; of Kentucky, USA; Johannes Rauh, Max Carla Manni, Universita di Roma “Tor 10:00-10:25 An Overview of Novel Planck Institute for Mathematics in the Vergata”, Italy; Fabio Roman, University of Applications of Algebraic and Sciences, Germany Turin, Italy; Hendrik Speleers, Universita di Topological Biology Roma “Tor Vergata”, Italy Ruth E. Davidson, University of Illinois at 11:30-11:55 SEMID: An R Package Urbana-Champaign, USA for Parameter Identifiability in Linear 10:30-10:55 Interpolating with Structural Equation Models Hyperplane Arrangements via 10:30-10:55 An Algebraic Framework for Luca Weihs, University of Washington, USA Generalized Star Configurations Determining Weighted Rearrangement Varieties Distance Stefan Tohaneanu, University of Idaho, USA Sangeeta Bhatia, University of Western Sydney, 11:00-11:25 Algebraic Geometry and Australia Interpolation Problems 11:00-11:25 Inferring Rooted Species Boris Shekhtman, University of South Florida, Trees from Unrooted Gene Trees USA James H. Degnan and Ayed Alanzi, University 11:30-11:55 Basis and Dimension of of New Mexico, USA Trivariate Geometrically Continuous 11:30-11:55 Dimensional Reduction for Isogeometric Functions on Two-Patch Phylogenetic Tree Models Domains Jeremy Sumner, University of Tasmania, Katharina Birner and Bert Juettler, University of Australia Linz, Austria; Angelos Mantzaflaris, RICAM, Austrian Academy of Sciences, Austria 46 SIAM Conference on Applied Algebraic Geometry

Thursday, August 3 Thursday, August 3 Thursday, August 3 MS72 MS73 MS74 Algebraic Methods for Computational Tropical Applied and Computational Analyzing Biological Geometry - Part I of II Topology - Part III of III Interaction Networks - Part III 10:00 AM-12:00 PM 10:00 AM-12:00 PM of IV Room:Skiles Building - 168 Room:Skiles Building - 170 10:00 AM-12:00 PM For Part 2 see MS84 For Part 2 see MS63 Room:Skiles Building - 271 This session will highlight recent Applied and computational topology advances in tropical geometry, algebra, combines ideas from topology, geometry, For Part 2 see MS61 and combinatorics, focusing on statistics and computer science to address For Part 4 see MS83 computational aspects and applications. This minisymposium focuses on tools problems pertaining to the analysis of The area enjoys close interactions with from algebraic geometry and beyond that data. In the last decade, it has rapidly max-plus algebra, polyhedral geometry, can aid the study of biological interaction developed as a vibrant field of research combinatorics, Groebner theory, and networks. Such systems frequently arise attracting scientists across several numerical algebraic geometry. in systems biology and range from ODEs communities. This minisymposium defined by biochemical reaction systems Organizer: Josephine Yu will provide a forum for discussion to models from ecology. Topics of interest Georgia Institute of Technology, USA and dissemination of recent advances range from conditions for permanence, addressing computational challenges Organizer: Anders Jensen and foundational questions. In addition, persistence, and multiple equilibria to Aarhus University, Denmark questions of parameter identifiability. applications to computational biology, 10:00-10:25 Gonality Sequences of The ODEs under study are often defined dynamical systems and signal analysis Complete Graphs and Complete will be presented. by polynomial or rational functions. Bipartite Graphs Hence algebra and algebraic geometry Marta Panizzut, Technische Universität, Organizer: Jose Perea are increasingly making important Berlin, Germany Michigan State University, USA contributions, and this minisymposium 10:30-10:55 Computing Tropical Organizer: Justin Curry will be a venue for exchanges on the Variaties using Triangular University of Pennsylvania, USA latest developments in this area. Decomposition 10:00-10:25 Local Cohomology and Organizer: Carsten Conradi Yue Ren, Ben-Gurion University, Israel Stratification Hochschule Karlsruhe Technik und Wirtschaft, 11:00-11:25 The Tropical Vidit Nanda, Oxford University, United Germany Nullstellensatz Kingdom Organizer: Gheorghe Craciun Diane Maclagan, University of Warwick, 10:30-10:55 The Topology of Biological United Kingdom University of Wisconsin, Madison, USA Aggregations: Experiments and 11:30-11:55 Tropical Hyperelliptic Simulations Organizer: Anne Shiu Curves in the Plane Lori Ziegelmeier, Macalester College, USA Texas A&M University, USA Ralph Morrison, Williams College, USA 11:00-11:25 A Morse-theoretic 10:00-10:25 Deficiency-based Algorithm to Compute Persistent Approaches to Steady State Homology, with Generators Parametrizations: New and Old Greg Henselman, Princeton University, USA Matthew D. Johnston, San Jose State University, USA 11:30-11:55 Interleavings on Categories with Lax [0, )-Action ∞ 10:30-10:55 Parametrising the Steady Anastasios Stefanou, State University of New State Variety by Linear Elimination York, Albany, USA Meritxell Saez, Elisenda Feliu, and Carsten Wiuf, University of Copenhagen, Denmark 11:00-11:25 Intermediates, Enzymes, Binomiality and Multistationarity Elisenda Feliu and Amirhossein Sadeghi Manesh, University of Copenhagen, Denmark 11:30-11:55 Polynomial Dynamical Systems Derived from Euclidean Embedded Graphs Polly Yu, University of Wisconsin, Madison, USA SIAM Conference on Applied Algebraic Geometry 47

Thursday, August 3 Thursday, August 3 Thursday, August 3 CP4 IP8 MS75 Various Applications Open Problems in Finite Coding Theory - Part II of IV 10:00 AM-11:30 AM Frame Theory 3:00 PM-5:00 PM Room:Skiles Building - 171 1:30 PM-2:30 PM Room:Skiles Building - 249 Chair: Agnes Szanto, North Carolina State Room:Clough Undergraduate Learning For Part 1 see MS64 University, USA Commons - 152 For Part 3 see MS86 Coding Theory comes as an answer to 10:00-10:25 Difference Sets and Chair: Giorgio Ottaviani, University of the problem of reliable communication Grassmannian Packings Firenze, Italy Emily King, Universität Bremen, Germany over noisy channels. As a research field, Finite frame theory is the study of Coding Theory intersects Mathematics, 10:30-10:55 Resonance Set of a Real collections of vectors with certain Information Theory, and Electrical Polynomial and its Application application-driven properties. This talk Engineering. The minisymposium Alexander B. Batkhin, Keldysh Institute of will discuss a few instances of finite Applied Mathematics of RAS, Russia session we propose focuses on the frame theory. Consider the problem algebraic aspect of the theory of error- and Moscow Institute of Physics and of packing points in real or complex Technology, Russia correcting codes, both in the context of projective space so that the minimum Classical Coding Theory and Network 11:00-11:25 String Topological Robotics distance is maximized. Such optimal Coding, a new emerging research field My Ismail I. Mamouni, Cedar Rapids Medical line packings find applications in sparse that studies network transmissions. Education Foundation, Rabat, Morocco decomposition and quantum information Algebra plays a crucial role in Coding theory. Today, there are various Theory, as it provides the main tools bounds on the best packings, notably, for the construction of error-correcting Lunch Break Levenshtein’s bound arising from linear codes and their analysis. programming. Ensembles which achieve 12:00 PM-1:30 PM equality in Levenshtein’s bound are Organizer: Alberto Ravagnani Attendees on their own projective t-designs with small angle University of Toronto, Canada sets, and their existence is the subject of Organizer: Gretchen L. several open problems. Matthews Dustin Mixon Clemson University, USA Air Force Institute of Technology, USA 3:00-3:25 Weight Two Masking in the McEliece Public Key System Joachim Rosenthal, Universität Zürich, Switzerland; Violetta Weger, University of Zurich, Switzerland Coffee Break 3:30-3:55 Well-rounded Lattices 2:30 PM-3:00 PM and Applications to Physical Layer Security Room:Skiles Building Piermarco Milione, Aalto University, Finland 4:00-4:25 Rank-metric Codes of Zero Defect Alberto Ravagnani, University of Toronto, Canada 4:30-4:55 Quantum Codes from AG Codes of Castle Type Fernando Torres, University of Campinas, Brazil 48 SIAM Conference on Applied Algebraic Geometry

Thursday, August 3 3:30-3:55 Tropical Spectrahedra Thursday, August 3 Xavier Allamigeon and Stephane Gaubert, MS76 Inria and CMAP, Ecole Polytechnique, MS77 France; Mateusz Skomra, CMAP, Ecole Semidefinite Optimization Polytechnique, France Theoretical Advances and Convex Algebraic 4:00-4:25 Polynomial Norms in Numerical Algebraic Geometry - Part II of IV Amir Ali Ahmadi, Princeton University, USA; Geometry - Part I of III 3:00 PM-5:00 PM Etienne Klerk, de, Tilburg University, The 3:00 PM-5:00 PM Netherlands; Georgina Hall, Princeton Room:Skiles Building - 202 University, USA Room:Skiles Building - 255 For Part 1 see MS65 4:30-4:55 Semidefinite Approximations For Part 2 see MS88 For Part 3 see MS87 of Reachable Sets for Discrete-time Numerical Algebraic Geometry is the In the past decade there has been a surge Polynomial Systems analysis and development of algorithms of interest in algebraic approaches to Victor Magron, CNRS, France; Didier for computing with polynomial systems optimization problems defined in terms Henrion, LAAS-CNRS, Toulouse, France; of equations. This minisymposium of multivariate polynomials. Fundamental Pierre-Loic Garoche, ONERA, France; focuses on the main underlying mathematical challenges that arise in Xavier Thirioux, École nationale supérieure foundational concepts, that include: the this program include understanding the d’électrotechnique, d’électronique, theory of real and complex varieties, root d’informatique, d’hydraulique et des structure of nonnegative polynomials, bounds for systems, certification criteria, télécommunications, France the interplay between efficiency and dual spaces, and specialized objects such complexity of different representations as witness sets and homotopy systems. of algebraic sets, and the development of This session focuses on advancements effective algorithms. Convexity provides a in the theory of numerical algebraic new viewpoint and a powerful framework geometry, and how it informs the for addressing these questions. This development of algorithms. naturally brings us to the intersection of algebraic geometry, optimization,and Organizer: Robert Krone convex geometry, with an emphasis Queen’s University, Canada on algorithms and computation. This Organizer: Gregorio Malajovich emerging area has become known as Universidade Federal do Rio De Janeiro, convex algebraic geometry. We propose Brazil to have 4 minisymposium sessions to 3:00-3:25 Computing Newton address the full breadth of problems Polytopes via Numerical Algebraic arising in convex algebraic geometry, Geometry semidefinite programming and polynomial Taylor Brysiewicz, Texas A&M University, optimization. USA Organizer: Greg Blekherman 3:30-3:55 On Sparse Homotopy and Georgia Institute of Technology, USA Toric Varieties Gregorio Malajovich, Universidade Federal Organizer: Cynthia Vinzant do Rio De Janeiro, Brazil North Carolina State University, USA 4:00-4:25 On Isolation of Simple Organizer: Daniel Plaumann Multiple Zeros of Polynomial Systems Technische Universität Dortmund, Germany Nan Li, Tianjin University, China Organizer: Joao Gouveia 4:30-4:55 Singular Value Homotopy Universidade de Coimbra, Portugal for Finding Critical Parameters in Differential Equations 3:00-3:25 Polyhedral Approximations to James B. Collins, West Texas A&M Nonnegative Polynomials University, USA; Jon Hauenstein, Alperen Ergur, North Carolina State University of Notre Dame, USA University, USA

continued in next column SIAM Conference on Applied Algebraic Geometry 49

Thursday, August 3 Thursday, August 3 Thursday, August 3 MS78 MS79 MS80 Core Algorithms in Algebra Tensors: from Algebra to Algebraic and Topological and Geometry - Part II of II Applications - Part IV of IV Biology - Part II of IV 3:00 PM-5:00 PM 3:00 PM-4:30 PM 3:00 PM-5:00 PM Room:Skiles Building - 254 Room:Skiles Building - 270 Room:Skiles Building - 005 For Part 1 see MS67 For Part 3 see MS68 For Part 1 see MS69 Experimentation with computer algebra Tensors are a rapidly growing area of For Part 3 see MS91 systems is an important technique research in mathematics. Their theoretical Recently there has been an explosion in throughout algebra and geometry. In study involves algebraic and geometric the use of algebraic tools for modeling this minisymposium the speakers present tools, and they are closely linked to biological systems as well as topological both improvements to core algorithms applications in data science, statistics data analysis methods for information that drive this experimentation, as well and more. This minisymposium gathers retrieval from biological and medical as research that has profited from such researchers who use algebraic methods data sets. Work in this area relies on the experiments. The minisymposium aims to to study tensors, and connect this insight application of algebraic geometry to fully be inclusive and represent the diversity of to applications. We will hear talks on understand the algebraic structures and computer algebra systems. the spectral theory of tensors, a range of topological spaces in question and develop Organizer: Thomas Kahle tensor decomposition and representation, robust algorithms for data mining. The computational studies of tensors, as well topics represented in the list of proposed Universität Magdeburg, Germany as connections to biological data analysis titles are highly representative of cutting- 3:00-3:25 Homological Algebra in and machine learning. edge research in this area. Speakers will Macaulay2 discuss the use of algebra, topology and Gregory G. Smith, Queen’s University, Canada Organizer: Elina Robeva geometry to study chromosomal and Massachusetts Institute of Technology, USA 3:30-3:55 A Combinatorial Smoothness RNA structures and cell genomics, as Criterion for Spherical Varieties Organizer: Anna Seigal well as the inference of phylogenetic tree Johannes Hofscheier, Universität Magdeburg, University of California, Berkeley, USA structures from algebraic-geometric data Germany 3:00-3:25 The Geometry of Rank-one encoding and the study of neural codes 4:00-4:25 Injective Resolutions in Toric Tensor Completion using ideals, their associated varieties, Geometry Thomas Kahle, Universität Magdeburg, and modules. Aside from the organizer, Lars Kastner, Freie Universität Berlin, Germany; Kaie Kubjas, Aalto University, our speakers include graduate students, Germany Finland; Mario Kummer, Universität postdoctoral researchers, and early- Leipzig, Germany; Zvi H. Rosen, University 4:30-4:55 Asymptotic Syzygies via career tenure-track faculty at liberal arts of Pennsylvania, USA Numerical Linear Algebra and High institutions. Additionally, this session Throughput Computing 3:30-3:55 No Occurrence Obstructions will include many non-U.S. speakers Jay Yang, University of Wisconsin, Madison, in Geometric Complexity Theory and speakers from a broad variety of USA Peter Buergisser, Technische Universität departmental affiliations. Berlin, Germany Organizer: Ruth E. Davidson 4:00-4:25 Border Ranks of Monomials University of Illinois at Urbana-Champaign, Luke Oeding, Auburn University, USA USA 3:00-3:25 Genome Rearrangement Distance under Inversions and Deletions: A Semigroup Model Andrew Francis, University of Western Sydney, Australia

continued on next page 50 SIAM Conference on Applied Algebraic Geometry

Thursday, August 3 Thursday, August 3 Thursday, August 3 MS80 MS81 MS82 Algebraic and Topological Software and Computation in Euclidean Distance Degree: Biology - Part II of IV Algebraic Statistics - Theory, Computation and 3:00 PM-5:00 PM Part II of II Applications - Part I of II 3:00 PM-5:00 PM continued 3:00 PM-4:30 PM Room:Skiles Building - 006 Room:Skiles Building - 268 For Part 1 see MS70 For Part 2 see MS93 3:30-3:55 Topological Methods for For over two decades, algebraic Given a model (i.e. a subset of a real Cancer Genomics methods have expanded the horizons vector space) described by polynomial Pablo Camara and Udi Rubin, Columbia University, USA; Arnold Levine, Institute of statistics with both theoretical and equations, the Euclidean distance (ED) for Advanced Studies, USA; Raul Rabadan, applied contributions. In this session problem is the optimization problem Columbia University, USA we’ll consider recent advances in which seeks to find the nearest model applied algebraic statistics, focusing on point to a given data point with respect 4:00-4:25 Topological Features in to the Euclidean norm. The number of Cancer Gene Expression Data algorithms and implementations. Specific Svetlana Lookwood, Washington State applications range from classical discrete complex critical points of the polynomial University, USA; Bala Krishnamoorthy, multivariate analysis to social networks system associated to this problem is Washington State University, Vancouver, and phylogenetics. called the ED degree and is an invariant USA Organizer: Elizabeth Gross of the model. This minisymposium will explore various attributes of the 4:30-4:55 Mathematical Methods to San Jose State University, USA Quantify the Topological Complexity of ED problem, highlighting theoretical Chromosomes Organizer: David Kahle connections, computational approaches, Javier Asuaga, University of California, Davis, Baylor University, USA and applications. Recent developments USA 3:00-3:25 Fast Exact Tests for Stochastic have illustrated the application of classical Block Models using Algebraic Statistics constructions and invariants from the Vishesh Karwa, Harvard University and intersection theory of projective algebraic Carnegie Mellon University, USA varieties to the ED problem. These 3:30-3:55 Parameter Hypergraphs, connections will be discussed, including Fiber Walks and Goodness-of-fit Testing recent results linking the ED degree of for Biological Network Data a variety to its conormal variety, polar Despina Stasi, Illinois Institute of Technology, degrees, and Chern-Mather class. There USA has also been recent progress in effective 4:00-4:25 Phylogenetic Trees, a M2 techniques to study and solve the ED Package problem in both particular cases (i.e. Allen Stewart, Seattle University, USA; Hector secant varieties and toric varieties) and Banos, University of Alaska, Fairbanks, in the general case. Several talks will USA; Nathaniel Bushek, University focus on some of these developments of Alaska, Anchorage, USA; Ruth E. and on related computational methods in Davidson, University of Illinois at Urbana- real algebraic geometry such as methods Champaign, USA; Elizabeth Gross, San to compute the critical points of maps Jose State University, USA; Pamela Harris, specified by polynomials. ED problems Williams College, USA; Robert Krone, Queen’s University, Canada; Colby Long, have natural applications. Several of these Ohio State University, USA; Robert Walker, will be discussed, including applications University of Michigan, USA of the ED degree to computer vision and relations between the ED problem and semi-algebraic geometry. Organizer: Martin Helmer University of California, Berkeley, USA Organizer: Corey Harris Florida State University, USA

continued on next page SIAM Conference on Applied Algebraic Geometry 51

3:00-3:25 Polar Varieties and Euclidean Thursday, August 3 Thursday, August 3 Distance Degree Ragni Piene, University of Oslo, Norway MS83 MS84 3:30-3:55 Nearest Points on Toric Algebraic Methods for Computational Tropical Varieties Analyzing Biological Geometry - Part II of II Martin Helmer, University of California, Berkeley, USA; Bernd Sturmfels, Max Interaction Networks - Part IV 3:00 PM-5:00 PM Planck Institute Leipzig, Germany and of IV Room:Skiles Building - 168 University of California, Berkeley, USA 3:00 PM-5:00 PM For Part 1 see MS73 4:00-4:25 The ED Degree of the Camera Variety Room:Skiles Building - 271 This session will highlight recent advances in tropical geometry, algebra, Daniel Lowengrub, University of California, For Part 3 see MS72 Berkeley, USA This minisymposium focuses on tools and combinatorics, focusing on from algebraic geometry and beyond that computational aspects and applications. 4:30-4:55 Local Euler Obstructions of The area enjoys close interactions with Toric Varieties can aid the study of biological interaction max-plus algebra, polyhedral geometry, Bernt-Ivar U. Nødland, University of Oslo, networks. Such systems frequently arise Norway in systems biology and range from ODEs combinatorics, Groebner theory, and defined by biochemical reaction systems numerical algebraic geometry. to models from ecology. Topics of interest Organizer: Josephine Yu range from conditions for permanence, Georgia Institute of Technology, USA persistence, and multiple equilibria to Organizer: Anders Jensen questions of parameter identifiability. Aarhus University, Denmark The ODEs under study are often defined by polynomial or rational functions. 3:00-3:25 Construction of Lindstrom Valuations of Algebraic Extensions Hence algebra and algebraic geometry Dustin Cartwright, University of Tennessee, are increasingly making important Knoxville, USA contributions, and this minisymposium will be a venue for exchanges on the 3:30-3:55 A Tropical Approach to latest developments in this area. Bilevel Programming Marianne Akian, Inria and CMAP, Ecole Organizer: Carsten Conradi Polytechnique, France; Mustapha Bouhtou, Hochschule Karlsruhe Technik und Orange Labs, France; Jean Bernard Eytard Wirtschaft, Germany and Stephane Gaubert, Inria and CMAP, Ecole Polytechnique, France Organizer: Gheorghe Craciun University of Wisconsin, Madison, USA 4:00-4:25 Abstract Tropical Linear Programming Organizer: Anne Shiu Georg Loho, Technische Universität Berlin, Texas A&M University, USA Germany 3:00-3:25 A Convergent and Efficient 4:30-4:55 Computing Tropical Linear Algorithm for Calculating Equilibrium Spaces for Chemical Networks of Reversible Benjamin Schröter, Technische Universität Binding Reactions Berlin, Germany Gilles Gnacadja, Amgen Inc., USA 3:30-3:55 Multistationarity in Interaction Networks Badal Joshi, California State University, San Marcos, USA 4:00-4:25 Inheritance of Bistability in Mass Action Reaction Networks Casian Pantea, West Virginia University, USA; Murad Banaji, Middlesex University, United Kingdom 4:30-4:55 Algebraic Complexity of Chemical Reaction Networks Through EDdegrees Michael F. Adamer, University of Oxford, United Kingdom; Martin Helmer, University of California, Berkeley, USA 52 SIAM Conference on Applied Algebraic Geometry

Thursday, August 3 Friday, August 4 Friday, August 4 MS85 IP9 Resultants, Subresultants and Carathéodory Style Applications - Part I of III Registration Theorems for Discrete 3:00 PM-5:00 PM 7:30 AM-4:00 PM Optimization and Game Room:Skiles Building - Bottom (0-th) Floor Room:Skiles Building - 170 Theory For Part 2 see MS96 8:30 AM-9:30 AM The minisymposium focuses on recent Room:Clough Undergraduate Learning advances on resultant, discriminant and Closing Remarks Commons - 152 subresultant theory, and their connections 8:20 AM-8:30 AM Chair: Thorsten Theobald, Goethe Universität with (and applications in) interpolation Frankfurt, Germany problems, real root finding, geometric Room:Clough Undergraduate Learning computation, Schur polynomials, Commons - 152 Convex geometry has been an important polynomial optimization, etc. pillar of the theory of optimization algorithms (e.g., think of Ellipsoid Organizer: Teresa Krick method) and my talk will show this Universidad de Buenos Aires, Argentina continues to be the case today by focusing Organizer: Agnes Szanto one influential theorem, Carathéodory’s North Carolina State University, USA theorem from 1905. In its most basic 3:00-3:25 Introductory Talk form it describes the size of a minimal Agnes Szanto, North Carolina State University, linear combination representing a vector USA in a cone and it is among the most fundamental results in Convex Geometry 3:30-3:55 Resultants Modulo P Laurent Buse, Inria Sophia Antipolis, France; and it has seen many variations and Carlos D’Andrea and Martin Sombra, extensions. I will review some variations Universitat de Barcelona, Spain of Carathéodory’s theorem that have interesting applications in combinatorial 4:00-4:25 Offsets and Subresultants optimization and game theory. E.g., given Gema M. Diaz-Toca, Universidad de Murcia, a system Ax=b, x ≥ 0, what is the size Spain; Laureano Gonzalez-Vega and Mario Fioravanti, Universidad de Cantabria, Spain; of the sparsest solution integer? Integral Jorge Caravantes, Universidad Complutense versions of Carathéodory’s theorem de Madrid, Spain; Ioana Necula, improve prior bounds and show some of Universidad de Sevilla, Spain; Juan Gerardo the fascinating structure of sparse integer Alcázar, Universidad de Alcalá, Spain solutions of Diophantine equations. 4:30-4:55 Resultants and Subresultants Another example will be the use of through Evaluation: Formulae and Hilbert bases in augmentation algorithms Applications for optimization. I will mention some Laureano Gonzalez-Vega, Universidad de open problems too. Cantabria, Spain Jesús A. De Loera University of California, Davis, USA

Intermission 5:00 PM-5:15 PM Coffee Break 9:30 AM-10:00 AM SIAG/AG Business Meeting Room:Skiles Building 5:15 PM-6:15 PM Room:Clough Undergraduate Learning Commons - 152 SIAM Conference on Applied Algebraic Geometry 53

Friday, August 4 Friday, August 4 10:00-10:25 Algebraic Certificates of Disconnectedness MS86 MS87 Didier Henrion, LAAS-CNRS, Toulouse, France; Mohab Safey El Din, Université Coding Theory - Part III of IV Semidefinite Optimization Paris 6, France and Convex Algebraic 10:00 AM-12:00 PM 10:30-10:55 Semidefinitely Room:Skiles Building - 249 Geometry - Part III of IV Representable Convex Sets Claus Scheiderer, Universität Konstanz, For Part 2 see MS75 10:00 AM-12:00 PM Germany For Part 4 see MS97 Room:Skiles Building - 202 Coding Theory comes as an answer to 11:00-11:25 Tranfer Function For Part 2 see MS76 the problem of reliable communication Realizations, Sums of Hermitian For Part 4 see MS98 over noisy channels. As a research field, Squares, and Determinantal In the past decade there has been a Representations Coding Theory intersects Mathematics, surge of interest in algebraic approaches Victor Vinnikov, Ben-Gurion University, Israel Information Theory, and Electrical to optimization problems defined in 11:30-11:55 The Relation Between SOS Engineering. The minisymposium session terms of multivariate polynomials. we propose focuses on the algebraic and SONC Fundamental mathematical challenges Timo de Wolff, Texas A&M University, USA aspect of the theory of error-correcting that arise in this program include codes, both in the context of Classical understanding the structure of Coding Theory and Network Coding, nonnegative polynomials, the interplay a new emerging research field that between efficiency and complexity of studies network transmissions. Algebra different representations of algebraic plays a crucial role in Coding Theory, sets, and the development of effective as it provides the main tools for the algorithms. Convexity provides a new construction of error-correcting codes and viewpoint and a powerful framework their analysis. for addressing these questions. This Organizer: Alberto Ravagnani naturally brings us to the intersection University of Toronto, Canada of algebraic geometry, optimization,and Organizer: Gretchen L. convex geometry, with an emphasis on algorithms and computation. This Matthews emerging area has become known Clemson University, USA as convex algebraic geometry. We 10:00-10:25 The Ingleton Ratio, the propose to have 4 minisymposium Inclusion-exclusion Ratio and the session to address the full breadth of Entropy Region problems arising in convex algebraic John A. Mackenzie, University of Strathclyde, geometry, semidefinite programming and United Kingdom; Michael E. O’Sullivan, San Diego State University, USA; Sarah polynomial optimization. Roy, Unaffiliated Organizer: Greg Blekherman 10:30-10:55 Communication Efficient Georgia Institute of Technology, USA and Strongly Secure Secret Sharing Organizer: Cynthia Vinzant Schemes Based on Algebraic North Carolina State University, USA Geometry Codes Umberto Martinez-Penas, Aalborg University, Organizer: Daniel Plaumann Denmark Technische Universität Dortmund, Germany 11:00-11:25 Quasi-cyclic Subcodes of Organizer: Joao Gouveia Cyclic Codes Universidade de Coimbra, Portugal Cem Güneri, Sabanci University, Turkey 11:30-11:55 Improved Constructions of Nested Code Pairs Carlos Galindo, Universitat Jaume I, Spain; Olav Geil, Aalborg University, Denmark; Fernando Hernando, Universidad Jaume I, Spain; Diego Ruano, Aalborg University, Denmark

continued in next column 54 SIAM Conference on Applied Algebraic Geometry

Friday, August 4 Friday, August 4 10:00-10:25 Probabilistic Schubert Calculus MS88 MS89 Peter Bürgisser, Technische Universität Berlin, Germany Theoretical Advances Random Algebraic Geometry 10:30-10:55 Percolation of Random in Numerical Algebraic Nodal Lines Geometry - Part II of III 10:00 AM-12:00 PM Damien Gayet, Institut Fourier, Grenoble, France 10:00 AM-12:00 PM Room:Skiles Building - 254 11:00-11:25 The Number of a Room:Skiles Building - 255 This minisymposium is meant to report Eigenvectors of a Random Tensor on the recent activity in the field of For Part 1 see MS77 Paul Breiding, Technische Universität Berlin, For Part 3 see MS99 random real algebraic geometry: the Germany Numerical Algebraic Geometry is the probabilistic study of classical questions analysis and development of algorithms in algebraic geometry, ranging from 11:30-11:55 Random Fields and the topology to enumerative geometry. A Enumerative Geometry of Lines on Real for computing with polynomial systems of and Complex Hypersurfaces special feature of real algebraic geometry equations. This minisymposium focuses Erik Lundberg, Florida Atlantic University, on the main underlying foundational is the lack of generic statements, as USA concepts, that include: the theory of real opposed to complex algebraic geometry and complex varieties, root bounds for where generic objects exist and obey systems, certification criteria, dual spaces, simple rules. The simplest example is and specialized objects such as witness the problem of counting real zeroes of sets and homotopy systems. This session a real polynomial of degree d, versus focuses on advancements in the theory of its complex zeroes: real zeroes vary numerical algebraic geometry, and how it depending on some semialgebraic informs the development of algorithms. conditions on the coefficients, complex zeroes are exactly d for an open dense Organizer: Robert Krone set of coefficients. This phenomenon Queen’s University, Canada (which ultimately is due to the fact that Organizer: Gregorio Malajovich real discriminants have codimension Universidade Federal do Rio De Janeiro, one) is the prototype of what happens for Brazil many different geometric problems: from 10:00-10:25 Conic Elimination Hilbert’s Sixteenth Problem (the study Technique for Mixed Cells the “number, shape, and position” of the Computation connected components of a real algebraic Tianran Chen, Auburn University hypersurface) to more recent questions Montgomery, USA in real enumerative geometry. A modern 10:30-10:55 Solving Polynomial approach to these problems is to adopt Systems via Homotopy Continuation a probabilistic point of view. How many and Monodromy zeroes of a random polynomial are Tim Duff and Cvetelina Hill, Georgia Institute real? How many components does a of Technology, USA; Anders Jensen, Aarhus random plane real algebraic curve have? University, Denmark; Kisun Lee and Anton How many real solutions are there to Leykin, Georgia Institute of Technology, an enumerative problem over the reals, USA; Jeff Sommars, University of Ilinois at on average? This approach offers a Chicago, USA broad point of view by seeking typical 11:00-11:25 Computing the Homology properties of random arrangements, of Real Projective Sets and it is particularly well adapted to Felipe Cucker, City University of Hong Kong, study problems coming from applied Hong Kong; Teresa Krick, Universidad de mathematics. Buenos Aires, Argentina; Michael Shub, IMAS, CONICET, Argentina and Graduate Organizer: Antonio Lerario School of CUNY International School for Advanced Studies, 11:30-11:55 Geometry and Topology of Trieste, Italy and Florida Atlantic University, the Solution Variety USA Carlos Beltrán, Universidad de Cantabria, Organizer: Peter Bürgisser Spain Technische Universität Berlin, Germany

continued in next column SIAM Conference on Applied Algebraic Geometry 55

Friday, August 4 Friday, August 4 Friday, August 4 MS90 MS91 MS92 Sparse Representation from Algebraic and Topological Syzygies and Mu-bases: Moments - Part I of II Biology - Part III of IV Theory, Computation, and 10:00 AM-12:00 PM 10:00 AM-12:00 PM Applications - Part I of II Room:Skiles Building - 270 Room:Skiles Building - 005 10:00 AM-11:30 AM For Part 2 see MS101 For Part 2 see MS80 Room:Skiles Building - 006 Recovering structures or models For Part 4 see MS102 For Part 2 see MS103 from sampling or measurements Recently there has been an explosion in Syzygies and µ-bases for syzygies play a is an operation, which appears in the use of algebraic tools for modeling fundamental role in algorithmic algebraic many domains and applications. The biological systems as well as topological geometry and geometric modeling. reconstruction of sparse models from data analysis methods for information µ-bases for rational planar curves can sequences of moments is such a problem, retrieval from biological and medical be used to retrieve both the parametric where algebra and geometry are playing data sets. Work in this area relies on the and implicit equations of these curves. an important role. Problems such as application of algebraic geometry to fully Singularities, their location, number, cubature formula, sparse interpolation, understand the algebraic structures and and types, can also be extracted from exponential fitting, polynomial topological spaces in question and develop the µ-bases of rational planar curves. In optimization or tensor decomposition robust algorithms for data mining. The addition there is a well-founded theory can be reformulated in these terms. The topics represented in the list of proposed of µ-bases for rational curves in arbitrary minisymposium will to bring together titles are highly representative of cutting- dimensions, and there are fast algorithms various aspects of the theory of moments edge research in this area. Speakers will for computing a µ-basis for these rational and sparse representations and explore discuss the use of algebra, topology and curves from a rational parametrization their interactions with algebraic geometry geometry to study chromosomal and RNA of the curve. µ-bases for curves are not and its applications. structures and cell genomics, as well as the unique, but their degrees are unique. Organizer: Cordian Riener inference of phylogenetic tree structures Thus the degrees of a µ-basis can be used from algebraic-geometric data encoding Universität Konstanz, Germany to classify rational curves. For rational and the study of neural codes using ideals, surfaces the situation is more complicated. Organizer: Bernard Mourrain their associated varieties, and modules. µ-bases exist for rational surfaces, but Inria Sophia Antipolis, France Aside from the organizer, our speakers unlike rational curves, where µ-bases exist 10:00-10:25 Moment Problems and include graduate students, postdoctoral relative homogeneous parametrizations, Inequalities for Power Sums researchers, and early-career tenure- µ-bases for rational surfaces are defined Bruce Reznick, University of Illinois at track faculty at liberal arts institutions. only relative to affine parametrizations. Urbana-Champaign, USA Additionally, this session will include µ-bases for rational surfaces can also 10:30-10:55 Optimization Approaches many non-U.S. speakers and speakers be used to retrieve both the parametric to Quadrature from a broad variety of departmental and implicit equations of these surfaces, Cordian Riener and Markus Schweighofer, affiliations. but now extraneous factors may appear. Universität Konstanz, Germany Organizer: Ruth E. Davidson These extraneous factors can be generated 11:00-11:25 Core Variety of a Linear University of Illinois at Urbana-Champaign, both by bases points and by anomalies Functional and Truncated Moment USA at infinity. Moreover, µ-bases for rational Problem 10:00-10:25 Statistics of Topological surface can be difficult to compute. In Greg Blekherman, Georgia Institute of RNA Structures this minisymposium we shall present Technology, USA; Lawrence A. Fialkow, Thomas Li and Christian Reidys, Virginia Tech, the current state of the art in the theory, State University of New York, New Paltz, computation and applications of syzygies USA USA and µ-bases for rational curves and 10:30-10:55 Finding Steady-states 11:30-11:55 Hankel and Quasi-Hankel surfaces. Matrix Completion: Performance of the Solution of Fibrin Network Dynamics Nuclear Norm Relaxation with Numerical Algebraic Geometry Organizer: Ron Goldman Konstantin Usevich and Pierre Comon, Gipsa- Francesco Pancaldi, University of Notre Rice University, USA Lab, France Dame, USA 11:00-11:25 A Boolean Network Model of the L-arabinose Operon Lee Andrew Jenkins, University of Georgia, USA

11:30-11:55 Detecting Binomiality of continued on next page Chemical Reaction Networks Thomas Kahle, Universität Magdeburg, Germany 56 SIAM Conference on Applied Algebraic Geometry

Friday, August 4 Friday, August 4 Organizer: Corey Harris Florida State University, USA MS92 MS93 10:00-10:25 Critical Point Computations Syzygies and Mu-bases: Euclidean Distance Degree: on Smooth Varieties: Degree and Theory, Computation and Complexity Bounds Theory, Computation, and Mohab Safey El Din, Université Pierre et Marie Applications - Part I of II Applications - Part II of II Curie, France 10:00 AM-11:30 AM 10:00 AM-12:00 PM 10:30-10:55 Distance Degree in Semialgebraic Geometry continued Room:Skiles Building - 268 Margaret Stawiska-Friedland, Mathematical For Part 1 see MS82 Reviews, USA; Shmuel Friedland, Given a model (i.e. a subset of a real University of Illinois, Chicago, USA 10:00-10:25 Rational Plane Curves, µ vector space) described by polynomial 11:00-11:25 Data with Infinitely Many Projections, and Degree = 6 and µ= 2 equations, the Euclidean distance (ED) Critical Points David Cox, Amherst College, USA problem is the optimization problem Emil Horobet, Sapientia Hungarian University 10:30-10:55 Implicitizing Rational Tensor which seeks to find the nearest model of Transylvania, Romania Product Surfaces using the Resultant of point to a given data point with respect Three Moving Planes to the Euclidean norm. The number of 11:30-11:55 ED Degrees of Orthogonally Invariant Varieties Liyong Shen, Chinese Academy of Sciences, complex critical points of the polynomial Arthur Bik and Jan Draisma, University of China; Ron Goldman, Rice University, USA system associated to this problem is Bern, Switzerland 11:00-11:25 Implicitizing Rational Tensor called the ED degree and is an invariant Product Surfaces by the Resultant of of the model. This minisymposium Three Moving Planes will explore various attributes of the Ron Goldman, Rice University, USA ED problem, highlighting theoretical connections, computational approaches, and applications. Recent developments have illustrated the application of classical constructions and invariants from the intersection theory of projective algebraic varieties to the ED problem. These connections will be discussed, including recent results linking the ED degree of a variety to its conormal variety, polar degrees, and Chern-Mather class. There has also been recent progress in effective techniques to study and solve the ED problem in both particular cases (i.e. secant varieties and toric varieties) and in the general case. Several talks will focus on some of these developments and on related computational methods in real algebraic geometry such as methods to compute the critical points of maps specified by polynomials. ED problems have natural applications. Several of these will be discussed, including applications of the ED degree to computer vision and relations between the ED problem and semi-algebraic geometry. Organizer: Martin Helmer University of California, Berkeley, USA

continued in next column SIAM Conference on Applied Algebraic Geometry 57

Friday, August 4 Friday, August 4 Friday, August 4 MS94 MS95 MS96 Geometry of Materials - Free Resolutions Governed Resultants, Subresultants and Part I of II by Geometric and/or Applications - 10:00 AM-12:00 PM Combinatorial Data - Part II of III Part I of II Room:Skiles Building - 271 10:00 AM-11:30 AM For Part 2 see MS105 10:00 AM-12:00 PM Room:Skiles Building - 170 The proposed minisymposium, Room:Skiles Building - 168 For Part 1 see MS85 whose theme is inspired by Kepler’s For Part 2 see MS106 For Part 3 see MS107 famous dictum (“Ubi materia, ibi In this minisymposium we will focus The minisymposium focuses on recent geometria” = “Where there is matter, on the computational aspects of free advances on resultant, discriminant and there is geometry”) will bring together resolutions of objects arising from subresultant theory, and their connections geometers (algebraic, discrete and geometric and/or combinatorial with (and applications in) interpolation computational) and physicists whose constructions. Topics should include problems, real root finding, geometric work is motivated by or inspired by but are not limited to Rees algebras, computation, Schur polynomials, current problems emerging in materials fan algebras, multigraded resolutions polynomial optimization, etc. science and crystallography. Our goal of ideals of points, and constructions is to facilitate the dissemination of Organizer: Teresa Krick related to ordinary or symbolic Universidad de Buenos Aires, Argentina recent geometric questions, results powers of ideals. We plan to focus on and applications arising in materials recent progress in this area that result Organizer: Agnes Szanto science, and to inspire further in explicit computations either of North Carolina State University, USA theoretical advances and improved resolutions or of remarkable invariants 10:00-10:25 Hilbert’s Nullstellensatz and computational methods. Topics include of resolutions. Exciting new work Combinatorial Optimization Problems cellular microstructures, grain growth has been announced recently on these Susan Margulies, United States Naval simulations, framework materials, topics and we would like to bring the Academy, USA displacive phase transitions, periodic practitioners of the field, as well as 10:30-10:55 A Local Verification minimal surfaces and crystal structure, graduate students, up to speed in this Method for the Solutions of a Zero- as well as geometric design of materials fast developing area. We are requesting dimensional Polynomial Systems with unusual properties (metamaterials). two blocks, each of 4 talks. Michael Sagraloff, Max Planck Institute for Informatics, Germany Organizer: Ileana Streinu Organizer: Carlos D’Andrea 11:00-11:25 On the Computation of Smith College, USA Universitat de Barcelona, Spain Sparse Resultants Organizer: Frank H. Lutz Organizer: Florian Enescu Carlos D’Andrea, Universitat de Barcelona, Technische Universität Berlin, Germany Georgia State University, USA Spain; Gabriela Jeronimo, Universidad de 10:00-10:25 On the Geometry of Steel 10:00-10:25 On the Resolution of Fan Buenos Aires, Argentina; Martin Sombra, Frank H. Lutz, Technische Universität Berlin, Algebras Universitat de Barcelona, Spain Germany Teresa Cortadellas and Carlos D’Andrea, 10:30-10:55 Voronoi Geometry Universitat de Barcelona, Spain; Florian and Applications to Structure Enescu, Georgia State University, USA Classification 10:30-10:55 Shapes of the Simplest Emanuel A. Lazar, University of Minimal Free Resolutions in P1 \times Pennsylvania, USA P1 11:00-11:25 Geometry of Flat Origami Nicolas Botbol and Alicia Dickenstein, Triangulations Universidad de Buenos Aires, Argentina; Bryan G. Chen and Christian Santangelo, Hal Schenck, University of Illinois, USA University of Massachusetts, USA 11:00-11:25 Bounding the Degrees 11:30-11:55 Simplicial Manifolds with of a Minimal µ-Basis for a Rational Small Valence Surface Parametrization Florian Frick, Cornell University, USA; Yairon Cid Ruiz, University of Barcelona, Frank H. Lutz and John Sullivan, Spain Technische Universität Berlin, Germany 11:30-11:55 Syzygies of Tensor Product Surfaces with Basepoints Eliana M. Duarte, University of Illinois at Urbana-Champaign, USA 58 SIAM Conference on Applied Algebraic Geometry

Friday, August 4 Friday, August 4 Friday, August 4 CP5 IP10 MS97 Optimization and Geometry Talk Title To Be Announced Coding Theory - Part IV of IV 10:00 AM-11:30 AM 3:00 PM-4:30 PM Room:Skiles Building - 171 1:30 PM-2:30 PM Room:Skiles Building - 249 For Part 3 see MS86 Chair: Serkan Hosten, San Francisco State Room:Clough Undergraduate Learning Coding Theory comes as an answer to University, USA Commons - 152 10:00-10:25 Tropical Optimization the problem of reliable communication Chair: Bernard Mourrain, Inria Sophia Problems: Recent Results and over noisy channels. As a research field, Applications Antipolis, France Coding Theory intersects Mathematics, Nikolai Krivulin, St Petersburg State Title not available at time of Information Theory, and Electrical University, Russia publication. Engineering. The minisymposium session we propose focuses on the algebraic 10:30-10:55 On the S -Invariant Jean-Charles Faugère n aspect of the theory of error-correcting F-conjecture Inria Paris-Rocquencourt, France David Swinarski and Han-Bom Moon, codes, both in the context of Classical Fordham University, USA Coding Theory and Network Coding, a new emerging research field that 11:00-11:25 Practical Semialgebraic Geometry for Computer-assisted Proofs studies network transmissions. Algebra Matthias Koeppe and Yuan Zhou, University Coffee Break plays a crucial role in Coding Theory, of California, Davis, USA 2:30 PM-3:00 PM as it provides the main tools for the construction of error-correcting codes and Room:Skiles Building their analysis. Lunch Break Organizer: Felice Manganiello Clemson University, USA 12:00 PM-1:30 PM Organizer: Alberto Ravagnani Attendees on their own University of Toronto, Canada Organizer: Gretchen L. Matthews Clemson University, USA 3:00-3:25 Extension Theorems for Codes over Frobenius Bimodules Heide Gluesing-Luerssen and Tefjol Pllaha, University of Kentucky, USA 3:30-3:55 Codes for Distributed Storage from 3-regular Graphs Shuhong Gao, Fiona Knoll, Felice Manganiello, and Gretchen L. Matthews, Clemson University, USA 4:00-4:25 On Semigroup Ideals and Generalized Hamming Weights of AG Codes Maria Bras-Amorós and Kwankyu Lee, Rovira i Virgili University, Spain SIAM Conference on Applied Algebraic Geometry 59

Friday, August 4 3:00-3:25 Slack Ideals of Polytopes Friday, August 4 Joao Gouveia, Universidade de Coimbra, MS98 Portugal; Antonio Macchia, Universita degli MS99 Semidefinite Optimization studi di Bari, Italy; Rekha Thomas and Amy Theoretical Advances Wiebe, University of Washington, USA and Convex Algebraic in Numerical Algebraic 3:30-3:55 Symbolic Computation for Geometry - Part IV of IV Hyperbolic Polynomials Geometry - Part III of III 3:00 PM-5:00 PM Naldi Simone and Daniel Plaumann, 3:00 PM-5:00 PM Technische Universität Dortmund, Germany Room:Skiles Building - 202 Room:Skiles Building - 255 4:00-4:25 Test Sets for Nonnegativity of For Part 3 see MS87 For Part 2 see MS88 Reflection-invariant Polynomials In the past decade there has been a surge Numerical Algebraic Geometry is the Jose Acevedo, Georgia Institute of Technology, of interest in algebraic approaches to USA; Mauricio Velasco, Universidad de los analysis and development of algorithms optimization problems defined in terms Andes, Colombia for computing with polynomial systems of multivariate polynomials. Fundamental of equations. This minisymposium 4:30-4:55 Determinantal mathematical challenges that arise in focuses on the main underlying Representations of Hyperbolic Plane this program include understanding the Curves with Cyclic Invariance foundational concepts, that include: the structure of nonnegative polynomials, Lillian F. Pasley, North Carolina State theory of real and complex varieties, root the interplay between efficiency and University, USA; Konstantinos Lentzos, bounds for systems, certification criteria, complexity of different representations Technische Universität Dortmund, Germany dual spaces, and specialized objects such of algebraic sets, and the development of as witness sets and homotopy systems. effective algorithms. Convexity provides a This session focuses on advancements new viewpoint and a powerful framework in the theory of numerical algebraic for addressing these questions. This geometry, and how it informs the naturally brings us to the intersection development of algorithms. of algebraic geometry, optimization,and Organizer: Robert Krone convex geometry, with an emphasis Queen’s University, Canada on algorithms and computation. This emerging area has become known as Organizer: Gregorio Malajovich convex algebraic geometry. We propose Universidade Federal do Rio De Janeiro, to have $4$ minisymposium session Brazil to address the full breadth of problems 3:00-3:25 Probabilistic Enumerative arising in convex algebraic geometry, Geometry semidefinite programming and polynomial Antonio Lerario, International School for optimization. Advanced Studies, Trieste, Italy and Florida Atlantic University, USA Organizer: Greg Blekherman Georgia Institute of Technology, USA 3:30-3:55 A Numerical Method for Solving Real Bi-parametric Systems Organizer: Joao Gouveia Wenyuan Wu, Chinese Academy of Universidade de Coimbra, Portugal Sciences, China; Changbo Chen and Organizer: Daniel Plaumann Yong Feng, Chongqing Institute of Green and Intelligent Technology, and Chinese Technische Universität Dortmund, Germany Academy of Sciences, China Organizer: Cynthia Vinzant 4:00-4:25 Certification of Approximate North Carolina State University, USA Roots of Polynomial Systems Tulay Ayyildiz Akoglu and Agnes Szanto, North Carolina State University, USA; Jon Hauenstein, University of Notre Dame, USA 4:30-4:55 Numerical Irreducible Decomposition for Multiprojective Varieties Frank Sottile, Texas A&M University, USA

continued in next column 60 SIAM Conference on Applied Algebraic Geometry

Friday, August 4 Friday, August 4 Friday, August 4 MS100 MS101 MS102 Random Commutative Sparse Representation from Algebraic and Topological Algebra Moments - Part II of II Biology - Part IV of IV 3:00 PM-5:00 PM 3:00 PM-5:00 PM 3:00 PM-5:00 PM Room:Skiles Building - 254 Room:Skiles Building - 270 Room:Skiles Building - 005 Randomness and stochasticity have long For Part 1 see MS90 For Part 3 see MS91 been used in the algebra of polynomial Recovering structures or models Recently there has been an explosion in rings. For example, already in the from sampling or measurements the use of algebraic tools for modeling 1930’s, Littlewood and Offord studied is an operation, which appears in biological systems as well as topological the expected number of real roots of many domains and applications. data analysis methods for information a random algebraic equation. Such The reconstruction of sparse models retrieval from biological and medical investigations on random varieties, from sequences of moments is such a data sets. Work in this area relies on the defined by random coefficients, attracted problem, where algebra and geometry application of algebraic geometry to fully a lot of work now considered classical. are playing an important role. Problems understand the algebraic structures and This session brings together researchers such as cubature formula, sparse topological spaces in question and develop interested in further using statistical interpolation, exponential fitting, robust algorithms for data mining. The and probabilistic thinking for studying polynomial optimization or tensor topics represented in the list of proposed properties of polynomial rings as well as decomposition can be reformulated titles are highly representative of cutting- to improve computation analysis. in these terms. The minisymposium edge research in this area. Speakers will will to bring together various aspects discuss the use of algebra, topology and Organizer: Despina Stasi of the theory of moments and sparse geometry to study chromosomal and RNA Illinois Institute of Technology, USA representations and explore their structures and cell genomics, as well as the Organizer: Jesus De Loera interactions with algebraic geometry and inference of phylogenetic tree structures University of California, Davis, USA its applications. from algebraic-geometric data encoding Organizer: Sonja Petrovic Organizer: Cordian Riener and the study of neural codes using ideals, Illinois Institute of Technology, USA Universität Konstanz, Germany their associated varieties, and modules. Aside from the organizer, our speakers 3:00-3:25 Randomization in Organizer: Bernard Mourrain include graduate students, postdoctoral Computational and Commutative Inria Sophia Antipolis, France Algebra researchers, and early-career tenure- Despina Stasi, Illinois Institute of 3:00-3:25 Structured Matrices Arising track faculty at liberal arts institutions. in Multivariate Polynomial Problems Technology, USA Additionally, this session will include George Labahn, University of Waterloo, many non-U.S. speakers and speakers from 3:30-3:55 Random Monomial Ideals Canada; Bernhard Beckermann, Universite a broad variety of departmental affiliations. Lily Silverstein, University of California, de Lille, France; Evelyne Hubert, Inria Davis, USA Méditerranée, France Organizer: Ruth E. Davidson University of Illinois at Urbana-Champaign, 4:00-4:25 Random Numerical 3:30-3:55 Moment Problems for USA Semigroups Symmetric Algebras of Locally Dane Wilburne, Illinois Institute of Convex Spaces 3:00-3:25 Grobner Bases of Neural Technology, USA; Jesus De Loera and Salma Kuhlmann, Universität Konstanz, Ideals Chris O’Neill, University of California, Germany Rebecca Garcia and Luis David Garcia Puente, Davis, USA Sam Houston State University, USA; 4:00-4:25 Decomposition of Ryan Kruse, Central College, USA; Jessica 4:30-4:55 Syzygies of Random Polynomial-exponential Series from Liu, Bard College, USA; Dane Miyata, Stanley-Reisner Ideals Moments Willamette University, USA; Ethan Petersen, Daniel M. Erman, University of Wisconsin, Bernard Mourrain, Inria Sophia Antipolis, Rose-Hulman Institute of Technology, Israel; Madison, USA France Kaitlyn Phillipson, St. Edwards University, 4:30-4:55 Truncated Moment USA; Anne Shiu, Texas A&M University, Problems for Unital Commutative Real USA Algebras Maria Infusino, Universität Konstanz, Germany

continued on next page SIAM Conference on Applied Algebraic Geometry 61

3:30-3:55 Neural Ideals and Stimulus Friday, August 4 3:00-3:25 Computing Singularities of Space Visualization Rational Curves and Surfaces using Nora Youngs, Colby College, USA; Elizabeth MS103 their Mu-bases Gross, San Jose State University, USA Xiaohong Jia, Chinese Academy of Sciences, Syzygies and Mu-bases: 4:00-4:25 Real Multigraded Modules as China Data Structures for Fly Wings Theory, Computation, and 3:30-3:55 Degree-optimal Moving Justin Curry, Ezra Miller, and Ashleigh Applications - Part II of II Frame for Rational Curves Thomas, Duke University, USA 3:00 PM-4:30 PM Irina Kogan, Hoon Hong, and Zachary 4:30-4:55 Persistence of Convex Hough, North Carolina State University, Room:Skiles Building - 006 Codes, Inferring the Rank of Non-linear USA Matrix Factorizations and the Space of For Part 1 see MS92 4:00-4:25 Algorithm for Computing Smells Syzygies and µ-bases for syzygies play a µ-Bases of Univariate Polynomials Vladimir Itskov, Pennsylvania State fundamental role in algorithmic algebraic Zachary Hough, Hoon Hong, and Irina University, USA geometry and geometric modeling. Kogan, North Carolina State University, µ-bases for rational planar curves can USA be used to retrieve both the parametric and implicit equations of these curves. Singularities, their location, number, and types, can also be extracted from the µ-bases of rational planar curves. In addition there is a well-founded theory of µ-bases for rational curves in arbitrary dimensions, and there are fast algorithms for computing a µ-basis for these rational curves from a rational parametrization of the curve. µ-bases for curves are not unique, but their degrees are unique. Thus the degrees of a µ-basis can be used to classify rational curves. For rational surfaces the situation is more complicated. µ-bases exist for rational surfaces, but unlike rational curves, where µ-bases exist relative homogeneous parametrizations, µ-bases for rational surfaces are defined only relative to affine parametrizations. µ-bases for rational surfaces can also be used to retrieve both the parametric and implicit equations of these surfaces, but now extraneous factors may appear. These extraneous factors can be generated both by bases points and by anomalies at infinity. Moreover, µ-bases for rational surface can be difficult to compute. In this minisymposium we shall present the current state of the art in the theory, computation and applications of syzygies and µ-bases for rational curves and surfaces. Organizer: Ron Goldman Rice University, USA

continued in next column 62 SIAM Conference on Applied Algebraic Geometry

Friday, August 4 Friday, August 4 Friday, August 4 MS104 MS105 MS106 Likelihood Geometry Geometry of Materials - Free Resolutions Governed 3:00 PM-5:00 PM Part II of II by Geometric and/or Room:Skiles Building - 268 3:00 PM-5:00 PM Combinatorial Data - Maximum likelihood estimation is a Room:Skiles Building - 271 Part II of II fundamental problem in statistics. By For Part 1 see MS94 3:00 PM-5:00 PM studying the geometry of this problem The proposed minisymposium, whose Room:Skiles Building - 168 one is able to gain new insights. These theme is inspired by Kepler’s famous insights lead to connections to Euler dictum (“Ubi materia, ibi geometria” For Part 1 see MS95 In this minisymposium we will focus characteristics, maximum likelihood = “Where there is matter, there is on the computational aspects of free degrees, and toric varieties. geometry”) will bring together geometers resolutions of objects arising from (algebraic, discrete and computational) Organizer: Jose I. Rodriguez geometric and/or combinatorial and physicists whose work is motivated University of Chicago, USA constructions. Topics should include by or inspired by current problems but are not limited to Rees algebras, Organizer: Serkan Hosten emerging in materials science and fan algebras, multigraded resolutions of San Francisco State University, USA crystallography. Our goal is to facilitate ideals of points, and constructions related 3:00-3:25 Introduction to Maximum the dissemination of recent geometric to ordinary or symbolic powers of ideals. Likelihood Degrees questions, results and applications We plan to focus on recent progress Jose Rodriguez, University of Chicago, USA arising in materials science, and to in this area that result in explicit inspire further theoretical advances 3:30-3:55 Maximum Likelihood computations either of resolutions or Degrees for Discrete Random Models and improved computational methods. of remarkable invariants of resolutions. Courtney Gibbons, Hamilton College, USA Topics include cellular microstructures, Exciting new work has been announced grain growth simulations, framework 4:00-4:25 Maximum Likelihood recently on these topics and we would materials, displacive phase transitions, Estimation for Cubic and Quartic like to bring the practitioners of the Canonical Toric Del Pezzo Surfaces periodic minimal surfaces and crystal field, as well as graduate students, up to Dimitra Kosta, University of Edinburgh, structure, as well as geometric design speed in this fast developing area. We are United Kingdom of materials with unusual properties requesting two blocks, each of 4 talks. 4:30-4:55 Topological Invariants and (metamaterials). the Maximum Likelihood Degree Organizer: Ileana Streinu Organizer: Florian Enescu Georgia State University, USA Martin Helmer, University of California, Smith College, USA Berkeley, USA; Jose I. Rodriguez, Organizer: Frank H. Lutz Organizer: Carlos D’Andrea University of Chicago, USA; Serkan Universitat de Barcelona, Spain Hosten, San Francisco State University, Technische Universität Berlin, Germany 3:00-3:25 Resolutions Associated USA 3:00-3:25 Defects in Three to a Matrix of Linear Forms which Dimensional Smectics and their is Annihilated by a Vector of Combination Rules Indeterminates Thomas Machon, University of Pennsylvania, Andrew Kustin, University of South Carolina, USA USA 3:30-3:55 Twisted Topological Tangles 3:30-3:55 Castelnuovo-Mumford or: The Knot Theory of Knitting Regularity vs. Virtual Cohomological Elisabetta A. Matsumoto, Georgia Institute of Dimension Technology, USA Alexandru Constantinescu, University of 4:00-4:25 Auxetic and Expansive: Genova, Italy Beyond Two Dimensions Ciprian S. Borcea, Rider University, USA; Ileana Streinu, Smith College, USA 4:30-4:55 Periodic Auxetics: Elliptic Curves, Convexity Constraints and Framework Generation Ciprian S. Borcea, Rider University, USA; Ileana Streinu, Smith College, USA

continued on next page SIAM Conference on Applied Algebraic Geometry 63

4:00-4:25 When are the Symbolic Friday, August 4 Powers of an Ideal Equal to its Ordinary Powers? MS107 Alexandra Seceleanu, University of Nebraska, Lincoln, USA; Susan Cooper, Resultants, Subresultants North Dakota State University, USA; and Applications - Giuliana Fattabi, University of Perugia, Part III of III Italy; Elena Guardo, Universita’ di Catania, Italy; Anna Lorenzini, University 3:00 PM-5:00 PM of Perugia, Italy; Juan Migliore, Notre Room:Skiles Building - 170 Dame University, USA; Uwe Nagel, University of Kentucky, USA; Justina For Part 2 see MS96 Szpond, Pedagogical University of The minisymposium focuses on recent Kraków, Russia; Adam Van Tuyl, advances on resultant, discriminant McMaster University, Canada and subresultant theory, and their 4:30-4:55 Properties of Symmetric connections with (and applications Ideals in) interpolation problems, real root Uwe Nagel, University of Kentucky, USA finding, geometric computation, Schur polynomials, polynomial optimization, etc. Organizer: Teresa Krick Universidad de Buenos Aires, Argentina Organizer: Agnes Szanto North Carolina State University, USA 3:00-3:25 Sylvester Sums in Multiple Roots and Subresultants Marcelo A. Valdettaro, Universidad de Buenos Aires, Argentina; Carlos D’Andrea, Universitat de Barcelona, Spain; Teresa Krick, Universidad de Buenos Aires, Argentina; Agnes Szanto, North Carolina State University, USA 3:30-3:55 Sylvester Double Sums and Subresultants in the General Case Aviva Szpirglas, Université de Poitiers, France 4:00-4:25 Chebyshev Multivariate Sparse Interpolation Evelyne Hubert, Inria Méditerranée, France; Michael Singer, North Carolina State University, USA 4:30-4:55 Irredundant Decomposition of Radical Ideals via Triangular Sets Gleb Pogudin, Johannes Kepler Universität, Linz, Austria 64 SIAM Conference on Applied Algebraic Geometry

Notes SIAM Conference on Applied Algebraic Geometry 65

AG17 Abstracts

Abstracts are printed as submitted by the authors. 150 SIAM Conference on Applied Algebraic Geometry

Or­ganizer and Speaker Index SIAM Conference on Applied Algebraic Geometry 151

A Bik, Arthur, MS93, 11:30 Fri Chakrabarty, Deeparnab, MS12, 3:30 Mon Aamari, Eddie, MS37, 3:30 Tue Birner, Katharina, MS71, 11:30 Thu Chandrasekaran, Venkat, MS43, 10:30 Wed Abe, Hiraki, MS3, 11:30 Mon Blekherman, Greg, MS65, 10:00 Thu Chen, Bryan G., MS94, 11:00 Fri Abelard, Simon, MS11, 3:30 Mon Blekherman, Greg, MS76, 3:00 Thu Chen, Hao, MS21, 10:00 Tue Abo, Hirotachi, MS25, 11:00 Tue Blekherman, Greg, MS87, 10:00 Fri Chen, Shaoshi, MS10, 10:00 Mon Acevedo, Jose, MS98, 4:00 Fri Blekherman, Greg, MS90, 11:00 Fri Chen, Shaoshi, MS20, 3:00 Mon Adamer, Michael F., MS83, 4:30 Thu Blekherman, Greg, MS98, 3:00 Fri Chen, Shaoshi, MS30, 10:00 Tue Adams, Henry, MS40, 3:00 Tue Bliss, Nathan, MS33, 3:00 Tue Chen, Tianran, MS33, 3:00 Tue Adams, Henry, MS51, 10:00 Wed Bocci, Cristiano, MS29, 10:00 Tue Chen, Tianran, MS44, 10:00 Wed Adams, Henry, MS62, 3:00 Wed Bocci, Cristiano, MS25, 11:30 Tue Chen, Tianran, MS88, 10:00 Fri Ahmadi, Amir Ali, MS32, 4:00 Tue Bocci, Cristiano, MS39, 3:00 Tue Cheng, Jinsan, MS4, 11:30 Mon Aliev, Iskander, MS2, 11:30 Mon Boehm, Janko, MS67, 11:00 Thu Chiantini, Luca, MS25, 10:00 Tue Alter, Orly, MS35, 4:30 Tue Borcea, Ciprian S., MS105, 4:30 Fri Chiantini, Luca, MS39, 3:00 Tue Amendola Ceron, Carlos, MS17, 3:00 Bossinger, Lara, MS3, 10:30 Mon Mon Botbol, Nicolas, MS95, 10:30 Fri Chiantini, Luca, MS46, 10:00 Wed Asuaga, Javier, MS80, 4:30 Thu Bracco, Cesare, MS71, 10:00 Thu Chifman, Julia, MS58, 3:00 Wed Augot, Daniel, MS64, 11:00 Thu Brake, Dani, MS44, 10:00 Wed Chua, Lynn, MS54, 3:30 Wed Averkov, Gennadiy, MS2, 10:30 Mon Brake, Dani, MS55, 3:00 Wed Chum, Kenneth, MS42, 11:00 Wed Ayyildiz Akoglu, Tulay, MS99, 4:00 Fri Brake, Dani, MS66, 10:00 Thu Cid Ruiz, Yairon, MS95, 11:00 Fri Bras-Amorós, Maria, MS97, 4:00 Fri Cifuentes, Diego, MS18, 4:30 Mon B Brecheteau, Claire, MS27, 10:30 Tue Collins, James B., MS77, 4:30 Thu Bajbar, Tomas, MS32, 4:30 Tue Breiding, Paul, MS89, 11:00 Fri Conradi, Carsten, MS50, 10:00 Wed Ballentine, Sean F., MS53, 4:00 Wed Brunner, James, MS50, 11:00 Wed Conradi, Carsten, MS50, 10:00 Wed Banos Cervantes, Hector D., MS48, 10:30 Conradi, Carsten, MS61, 3:00 Wed Wed Brysiewicz, Taylor, MS77, 3:00 Thu Conradi, Carsten, MS72, 10:00 Thu Barg, Alexander, MS42, 10:00 Wed Buczynski, Jaroslaw, MS25, 10:30 Tue Conradi, Carsten, MS83, 3:00 Thu Barg, Alexander, MS42, 10:00 Wed Buergisser, Peter, MS79, 3:30 Thu Constantinescu, Alexandru, MS106, 3:30 Barg, Alexander, MS53, 3:00 Wed Bürgisser, Peter, MS89, 10:00 Fri Fri Bartoli, Daniele, CP2, 3:30 Tue Bürgisser, Peter, MS89, 10:00 Fri Coons, Jane, MS6, 10:30 Mon Basu, Amitabh, MS2, 10:00 Mon Burr, Michael A., MS14, 3:30 Mon Corey, Dan, MS22, 11:00 Tue Bathala, Srinivasulu, CP2, 4:00 Tue C Cortadellas, Teresa, MS95, 10:00 Fri Batkhin, Alexander B., CP1, 10:30 Tue Camara, Pablo, MS80, 3:30 Thu Coss, Owen, CP1, 10:00 Tue Batkhin, Alexander B., CP4, 10:30 Thu Cameron, Karleigh, MS66, 11:00 Thu Cox, David, MS92, 10:00 Fri Beltrán, Carlos, IP2, 1:30 Mon Caminata, Alessio, MS1, 10:00 Mon Craciun, Gheorghe, IP4, 1:30 Tue Beltrán, Carlos, MS88, 11:30 Fri Caminata, Alessio, MS11, 3:00 Mon Craciun, Gheorghe, MS50, 10:00 Wed Benedetti, Bruno, MS40, 3:00 Tue Caminata, Alessio, MS21, 10:00 Tue Craciun, Gheorghe, MS61, 3:00 Wed Bernardi, Alessandra, MS25, 10:00 Tue Caminata, Alessio, MS21, 11:30 Tue Craciun, Gheorghe, MS72, 10:00 Thu Bernstein, Daniel J., MS11, 3:00 Mon Cappelletti, Daniele, MS61, 4:00 Wed Craciun, Gheorghe, MS83, 3:00 Thu Bernstein, Daniel I., MS38, 4:00 Tue Carlini, Enrico, MS46, 11:30 Wed Crawford, Lorin, MS37, 3:00 Tue Bhatia, Sangeeta, MS69, 10:30 Thu Cartwright, Dustin, MS84, 3:00 Thu Curry, Justin, MS52, 10:00 Wed

Italicized names indicate session organizers 152 SIAM Conference on Applied Algebraic Geometry

Curry, Justin, MS63, 3:00 Wed Dreesen, Philippe, MS5, 11:00 Mon Friedland, Shmuel, MS35, 3:30 Tue Curry, Justin, MS74, 10:00 Thu Drellich, Elizabeth, MS56, 3:00 Wed Frolov, Evgeny, MS39, 4:00 Tue Curto, Carina, MS31, 10:30 Tue Drendel, Jesse W., MS33, 4:00 Tue Dressler, Mareike, MS54, 4:00 Wed G Cuyt, Annie, MS5, 10:00 Mon Gallardo, Patricio, MS16, 4:30 Mon Drton, Mathias, MS48, 11:00 Wed Cuyt, Annie, MS15, 3:00 Mon Gallet, Matteo, MS45, 11:00 Wed Duarte, Eliana M., MS95, 11:30 Fri Gao, Tingran, MS37, 4:00 Tue D Duff, Tim, MS88, 10:30 Fri D’Andrea, Carlos, MS85, 3:30 Thu Gao, Xiaoshan, CP3, 3:00 Wed Dufresne, Emilie, MS34, 3:00 Tue D’Andrea, Carlos, MS95, 10:00 Fri Garcia Puente, Luis David, MS48, 11:30 Dumas, Philippe, MS10, 10:00 Mon Wed D’Andrea, Carlos, MS106, 3:00 Fri Durden, Chris, MS17, 4:00 Mon Garcia Trillos, Nicolas, MS63, 3:00 Wed Davidson, Ruth E., MS69, 10:00 Thu Duursma, Iwan, CP2, 4:30 Tue Davidson, Ruth E., MS69, 10:00 Thu Garoufalidis, Stavros, MS10, 11:00 Mon Gasparovic, Ellen, MS52, 11:00 Wed Davidson, Ruth E., MS80, 3:00 Thu E Gaubert, Stephane, MS76, 3:30 Thu Davidson, Ruth E., MS91, 10:00 Fri Edelsbrunner, Herbert, IP5, 8:30 Wed Gavryushkin, Alex, MS26, 10:30 Tue Davidson, Ruth E., MS102, 3:00 Fri Edwards, Parker, MS66, 11:30 Thu Gayet, Damien, MS89, 10:30 Fri De Loera, Jesus, MS2, 10:00 Mon Eggermont, Rob H., CP3, 3:30 Wed Ge, Rong, MS68, 10:30 Thu De Loera, Jesus, MS12, 3:00 Mon Eisenberg, Marisa, MS7, 11:30 Mon Geil, Olav, MS86, 11:30 Fri De Loera, Jesus, MS100, 3:00 Fri Enescu, Florian, MS95, 10:00 Fri De Loera, Jesús A., IP9, 8:30 Fri Enescu, Florian, MS106, 3:00 Fri Gibbons, Courtney, MS104, 3:30 Fri Gittenberger, Bernhard, MS20, 3:00 Mon de Wolff, Timo, MS32, 3:00 Tue Ergur, Alperen, MS76, 3:00 Thu de Wolff, Timo, MS32, 3:30 Tue Erman, Daniel M., MS100, 4:30 Fri Gluesing-Luerssen, Heide, MS97, 3:00 Fri de Wolff, Timo, MS43, 10:00 Wed Escobar, Laura, MS8, 10:30 Mon Gnacadja, Gilles, MS83, 3:00 Thu de Wolff, Timo, MS54, 3:00 Wed Eytard, Jean Bernard, MS84, 3:30 Thu Goel, Charu, MS24, 11:00 Tue de Wolff, Timo, MS87, 11:30 Fri F Goldman, Ron, MS92, 10:00 Fri Degnan, James H., MS69, 11:00 Thu Farnsworth, Cameron L., MS29, 10:00 Tue Goldman, Ron, MS92, 11:00 Fri Delucchi, Emanuele, MS40, 3:30 Tue Farnsworth, Cameron L., MS29, 10:00 Goldman, Ron, MS103, 3:00 Fri Dey, Santanu, MS12, 3:00 Mon Tue Gonzalez-Vega, Laureano, MS85, 4:30 Diaz-Toca, Gema M., MS85, 4:00 Thu Farnsworth, Cameron L., MS39, 3:00 Tue Thu Dickenstein, Alicia, MS61, 3:30 Wed Fasy, Brittany, MS27, 10:00 Tue Görlach, Paul, MS34, 3:30 Tue Dimitrova, Elena S., MS31, 10:00 Tue Fasy, Brittany, MS37, 3:00 Tue Goudarzi Karim, Ramin, MS5, 10:30 Dimitrova, Elena S., MS41, 3:00 Tue Faugère, Jean-Charles, IP10, 1:30 Fri Mon Ding, Jintai, MS21, 10:30 Tue Fawzi, Hamza, MS65, 10:00 Thu Gouveia, Joao, MS65, 10:00 Thu DiPasquale, Michael, MS49, 10:00 Wed Fischer, Ilse, MS10, 10:30 Mon Gouveia, Joao, MS76, 3:00 Thu DiPasquale, Michael, MS49, 10:00 Wed Forcey, Stefan, MS6, 11:00 Mon Gouveia, Joao, MS87, 10:00 Fri DiPasquale, Michael, MS60, 3:00 Wed Francis, Andrew, MS80, 3:00 Thu Gouveia, Joao, MS98, 3:00 Fri DiPasquale, Michael, MS71, 10:00 Thu Frick, Florian, MS40, 3:00 Tue Greenwood, Torin, MS20, 3:30 Mon Disanto, Filippo, MS16, 4:00 Mon Frick, Florian, MS51, 10:00 Wed Grindstaff, Gill, MS47, 10:00 Wed Dochtermann, Anton, MS51, 11:30 Wed Frick, Florian, MS62, 3:00 Wed Gross, Elizabeth, MS55, 3:00 Wed Domanov, Ignat, MS15, 4:00 Mon Frick, Florian, MS94, 11:30 Fri Gross, Elizabeth, MS70, 10:00 Thu Draisma, Jan, MS46, 10:00 Wed Friedland, Shmuel, MS35, 3:00 Tue Gross, Elizabeth, MS81, 3:00 Thu

Italicized names indicate session organizers SIAM Conference on Applied Algebraic Geometry 153

Güneri, Cem, MS86, 11:00 Fri I King, Emily, MS9, 10:00 Mon Gupte, Akshay, MS12, 4:30 Mon Infusino, Maria, MS101, 4:30 Fri King, Emily, MS19, 3:00 Mon Gustavson, Richard S., CP1, 11:00 Tue Iosif, Alexandru, MS67, 11:30 Thu King, Emily, CP4, 10:00 Thu Ishteva, Mariya, MS5, 10:00 Mon Koeppe, Matthias, MS12, 4:00 Mon H Kogan, Irina, MS103, 3:30 Fri Haas, John, MS19, 4:00 Mon Ishteva, Mariya, MS5, 10:00 Mon Kohn, Kathlén, MS67, 10:30 Thu Hall, Georgina, MS76, 4:00 Thu Ishteva, Mariya, MS15, 3:00 Mon Kosta, Dimitra, MS104, 4:00 Fri Hammen, Nathaniel, MS19, 4:30 Mon Itskov, Vladimir, MS102, 4:30 Fri Krick, Teresa, MS85, 3:00 Thu Han, Lixing, MS44, 11:30 Wed Iverson, Joseph, MS9, 11:00 Mon Krick, Teresa, MS96, 10:00 Fri Hanselka, Christoph, MS43, 10:00 Wed J Krick, Teresa, MS88, 11:00 Fri Hansen, Mads C., MS61, 4:30 Wed Jamshidi, Sara, MS68, 10:00 Thu Krick, Teresa, MS107, 3:00 Fri Hao, Wenrui, MS55, 4:30 Wed Jao, David, MS1, 11:30 Mon Krishnamoorthy, Bala, MS80, 4:00 Thu Harris, Corey, MS82, 3:00 Thu Jarrah, Abdul Salam, MS31, 11:30 Tue Krivulin, Nikolai, CP5, 10:00 Fri Harris, Corey, MS93, 10:00 Fri Jenkins, Lee Andrew, MS91, 11:00 Fri Krone, Robert, MS24, 11:30 Tue Hauenstein, Jonathan, MS14, 3:00 Mon Jensen, Anders, MS73, 10:00 Thu Krone, Robert, MS77, 3:00 Thu Hauer, Michael, MS45, 10:30 Wed Jensen, Anders, MS84, 3:00 Thu Krone, Robert, MS88, 10:00 Fri He, Qijun, MS31, 11:00 Tue Jeronimo, Gabriela, MS96, 11:00 Fri Krone, Robert, MS99, 3:00 Fri Heal, Kathryn H., PP1, 5:00 Mon Jia, Xiaohong, MS103, 3:00 Fri Kruff, Niclas, MS34, 4:00 Tue Hein, Nickolas, MS55, 3:30 Wed Johnston, Ann, MS56, 4:00 Wed Kubjas, Kaie, MS79, 3:00 Thu Helmer, Martin, MS82, 3:00 Thu Johnston, Matthew D., MS72, 10:00 Thu Kuhlmann, Salma, MS101, 3:30 Fri Helmer, Martin, MS82, 3:30 Thu Joshi, Badal, MS83, 3:30 Thu Kukelova, Zuzana, MS18, 3:00 Mon Helmer, Martin, MS93, 10:00 Fri Kumar, Vijay, MS53, 4:30 Wed Helmer, Martin, MS104, 4:30 Fri K Kahle, David, MS70, 10:00 Thu Kummer, Mario, MS43, 11:30 Wed Henrion, Didier, MS87, 10:00 Fri Kahle, David, MS70, 10:00 Thu Kustin, Andrew, MS106, 3:00 Fri Henselman, Greg, MS74, 11:00 Thu Kahle, David, MS81, 3:00 Thu Heo, Giseon, MS27, 11:30 Tue Kahle, Thomas, MS67, 10:00 Thu L Hildebrand, Robert, MS54, 3:00 Wed Labahn, George, MS101, 3:00 Fri Kahle, Thomas, MS78, 3:00 Thu Hofscheier, Johannes, MS78, 3:30 Thu Ladisch, Frieder, MS2, 11:00 Mon Kahle, Thomas, MS91, 11:30 Fri Horobet, Emil, MS93, 11:00 Fri Lairez, Pierre, SP1, 5:15 Wed Kaihnsa, Nidhi, PP1, 5:00 Mon Hosten, Serkan, MS59, 3:30 Wed Landsberg, Joseph M., IP1, 8:30 Mon Kang, Qiwen, MS36, 4:00 Tue Hosten, Serkan, MS104, 3:00 Fri Lange, Tanja, MS1, 10:00 Mon Karwa, Vishesh, MS81, 3:00 Thu Hough, Zachary, MS103, 4:00 Fri Lao, Angelyn R., MS50, 10:30 Wed Kastner, Lars, MS78, 4:00 Thu Hubert, Evelyne, MS24, 10:00 Tue Laubenbacher, Reinhard, MS41, 3:00 Katthän, Lukas, MS67, 10:00 Thu Hubert, Evelyne, MS34, 3:00 Tue Tue Kauers, Manuel, MS10, 10:00 Mon Hubert, Evelyne, MS34, 4:30 Tue Lawhorn, MaLyn, MS16, 3:30 Mon Kauers, Manuel, MS10, 11:30 Mon Hubert, Evelyne, MS107, 4:00 Fri Lazar, Emanuel A., MS94, 10:30 Fri Kauers, Manuel, MS20, 3:00 Mon Hugounenq, Cyril, MS1, 11:00 Mon Lee, Tsung-Lin, MS66, 10:30 Thu Kauers, Manuel, MS30, 10:00 Tue Hulzebos, Dani, MS42, 10:30 Wed Lee, Wen-shin, MS5, 10:00 Mon Kaveh, Kiumars, MS22, 10:00 Tue Hur, Youngmi, MS39, 3:30 Tue Lee, Wen-shin, MS15, 3:00 Mon Kileel, Joe, MS18, 3:30 Mon Lee, Wen-shin, MS15, 3:00 Mon

Italicized names indicate session organizers 154 SIAM Conference on Applied Algebraic Geometry

Lerario, Antonio, MS89, 10:00 Fri Margulies, Susan, MS96, 10:00 Fri Mou, Chenqi, MS45, 11:30 Wed Lerario, Antonio, MS99, 3:00 Fri Markovsky, Ivan, MS5, 10:00 Mon Mourrain, Bernard, MS60, 3:00 Wed Li, Nan, MS77, 4:00 Thu Markovsky, Ivan, MS15, 3:00 Mon Mourrain, Bernard, MS90, 10:00 Fri Li, Thomas, MS91, 10:00 Fri Martinez-Penas, Umberto, MS86, 10:30 Mourrain, Bernard, MS101, 3:00 Fri Li, Ziming, MS30, 10:30 Tue Fri Mourrain, Bernard, MS101, 4:00 Fri Lieblich, Max, MS8, 10:00 Mon Massierer, Maike, MS1, 10:00 Mon Mukherjee, Sayan, MS27, 10:00 Tue Lieblich, Max, MS18, 3:00 Mon Massierer, Maike, MS11, 3:00 Mon Mukherjee, Sayan, MS27, 10:00 Tue Lim, Lek-Heng, MS57, 4:00 Wed Massierer, Maike, MS11, 4:30 Mon Mukherjee, Sayan, MS37, 3:00 Tue Lin, Bo, MS47, 11:00 Wed Massierer, Maike, MS21, 10:00 Tue Murrugarra, David, MS31, 10:00 Tue Little, John B., MS53, 3:00 Wed Mathews, James, MS18, 4:00 Mon Murrugarra, David, MS31, 10:00 Tue Loho, Georg, MS84, 4:00 Thu Matsumoto, Elisabetta A., MS105, 3:30 Murrugarra, David, MS41, 3:00 Tue Fri Long, Colby, MS17, 3:30 Mon Matthews, Gretchen L., MS64, 10:00 Thu Lowengrub, Daniel, MS82, 4:00 Thu N Matthews, Gretchen L., MS64, 10:30 Nagel, Uwe, MS106, 4:30 Fri Lundberg, Erik, MS89, 11:30 Fri Thu Nanda, Vidit, MS74, 10:00 Thu Lutz, Frank H., MS62, 3:00 Wed Matthews, Gretchen L., MS75, 3:00 Thu Nara, Takaaki, MS15, 3:30 Mon Lutz, Frank H., MS94, 10:00 Fri Matthews, Gretchen L., MS86, 10:00 Fri Nash, Evan, PP1, 5:00 Mon Lutz, Frank H., MS94, 10:00 Fri Matthews, Gretchen L., MS97, 3:00 Fri Navasca, Carmeliza, MS29, 10:30 Tue Lutz, Frank H., MS105, 3:00 Fri Medard, Muriel, MS64, 10:00 Thu Neches, Russell Y., MS16, 3:00 Mon M Mehta, Dhagash, MS55, 4:00 Wed Nelson, Brad, MS37, 4:30 Tue Macauley, Matthew, MS31, 10:00 Tue Melczer, Stephen, MS10, 10:00 Mon Nie, Jiawang, MS57, 3:00 Wed Macauley, Matthew, MS41, 3:00 Tue Melczer, Stephen, MS20, 3:00 Mon Nødland, Bernt-Ivar U., MS82, 4:30 Machon, Thomas, MS105, 3:00 Fri Melczer, Stephen, MS14, 4:00 Mon Thu Maclagan, Diane, MS73, 11:00 Thu Melczer, Stephen, MS30, 10:00 Tue O Magron, Victor, MS76, 4:30 Thu Melczer, Stephen, MS30, 11:00 Tue Obatake, Nida K., MS36, 3:30 Tue Malajovich, Gregorio, MS77, 3:00 Thu Meshkat, Nicolette, MS7, 10:00 Mon Oeding, Luke, MS29, 10:00 Tue Malajovich, Gregorio, MS77, 3:30 Thu Meshkat, Nicolette, MS7, 10:00 Mon Oeding, Luke, MS29, 11:30 Tue Malajovich, Gregorio, MS88, 10:00 Fri Meshkat, Nicolette, MS17, 3:00 Mon Oeding, Luke, MS39, 3:00 Tue Malajovich, Gregorio, MS99, 3:00 Fri Meshkat, Nicolette, MS50, 11:30 Wed Oeding, Luke, MS79, 4:00 Thu Malikiosis, Romanos D., MS19, 3:30 Mete, Pinar, CP3, 4:00 Wed Oneill, Christopher, MS70, 10:30 Thu Mon Micheli, Giacomo, CP2, 3:00 Tue Oneto, Alessandro, MS46, 10:30 Wed Malmskog, Beth, MS42, 11:30 Wed Milione, Piermarco, MS75, 3:30 Thu O’Sullivan, Michael E., MS86, 10:00 Mamouni, My Ismail I., CP4, 11:00 Thu Mishna, Marni, MS30, 10:00 Tue Fri Manganiello, Felice, MS97, 3:00 Fri Mito, Leonardo M., PP1, 5:00 Mon Ottaviani, Giorgio, MS25, 10:00 Tue Manganiello, Felice, MS97, 3:30 Fri Mixon, Dustin, IP8, 1:30 Thu Ottaviani, Giorgio, MS46, 10:00 Wed Manon, Chris, MS22, 10:30 Tue Mixon, Dustin, MS9, 10:00 Mon Owen, Megan, MS36, 3:00 Tue Mantzaflaris, Angelos, MS4, 10:00 Mon Mixon, Dustin, MS19, 3:00 Mon Owen, Megan, MS36, 3:00 Tue Mantzaflaris, Angelos, MS4, 10:00 Mon Mohammadi, Fatemeh, MS3, 11:00 Mon Owen, Megan, MS47, 10:00 Wed Mantzaflaris, Angelos, MS14, 3:00 Mon Morrison, Ralph, MS73, 11:30 Thu Owen, Megan, MS58, 3:00 Wed Mantzaflaris, Angelos, MS45, 10:00 Wed Motta, Francis, MS52, 10:00 Wed

Italicized names indicate session organizers SIAM Conference on Applied Algebraic Geometry 155

Ren, Yue, MS73, 10:30 Thu Schost, Eric, MS13, 3:00 Mon P Reznick, Bruce, MS90, 10:00 Fri Pancaldi, Francesco, MS91, 10:30 Fri Schost, Eric, MS23, 10:00 Tue Riener, Cordian, MS24, 10:00 Tue Panizzut, Marta, MS73, 10:00 Thu Schröcker, Hans-Peter, MS28, 10:30 Riener, Cordian, MS23, 11:30 Tue Tue Pantea, Casian, MS83, 4:00 Thu Riener, Cordian, MS34, 3:00 Tue Schröter, Benjamin, MS84, 4:30 Thu Pantone, Jay, MS30, 11:30 Tue Riener, Cordian, MS90, 10:00 Fri Schwartz, Russell, MS56, 3:30 Wed Pasley, Lillian F., MS98, 4:30 Fri Riener, Cordian, MS90, 10:30 Fri Schweinhart, Benjamin, MS27, 11:00 Pataki, Gabor, MS65, 10:30 Thu Tue Riener, Cordian, MS101, 3:00 Fri Pegel, Christoph, MS19, 3:00 Mon Seceleanu, Alexandra, MS106, 4:00 Fri Robeva, Elina, MS35, 3:00 Tue Perea, Jose, MS52, 10:00 Wed Seigal, Anna, PP1, 5:00 Mon Robeva, Elina, MS46, 11:00 Wed Perea, Jose, MS63, 3:00 Wed Seigal, Anna, MS35, 3:00 Tue Robeva, Elina, MS57, 3:00 Wed Perea, Jose, MS74, 10:00 Thu Seigal, Anna, MS47, 11:30 Wed Robeva, Elina, MS68, 10:00 Thu Perrucci, Daniel, MS23, 10:00 Tue Seigal, Anna, MS57, 3:00 Wed Robeva, Elina, MS79, 3:00 Thu Persichetti, Edoardo, MS1, 10:30 Mon Seigal, Anna, MS68, 10:00 Thu Robins, Sinai, MS24, 10:30 Tue Peterson, Chris, MS40, 4:00 Tue Seigal, Anna, MS79, 3:00 Thu Robinson, Michael, MS63, 4:00 Wed Petrovic, Sonja, MS100, 3:00 Fri Sevilla, David, MS45, 10:00 Wed Rodriguez, Jose I., MS33, 3:30 Tue Petzoldt, Albrecht R., MS21, 11:00 Tue Shekhtman, Boris, MS71, 11:00 Thu Rodriguez, Jose, MS104, 3:00 Fri Piene, Ragni, IP3, 8:30 Tue Shen, Chen, MS47, 10:30 Wed Rodriguez, Jose I., MS104, 3:00 Fri Piene, Ragni, MS82, 3:00 Thu Shen, Liyong, MS92, 10:30 Fri Rojas, J. Maurice, MS4, 10:30 Mon Pir, Ata F., MS40, 4:30 Tue Sherman, Samantha, MS66, 10:00 Thu Rosen, Zvi H., MS28, 11:30 Tue Plaumann, Daniel, MS13, 4:30 Mon Shiu, Anne, MS50, 10:00 Wed Rosenthal, Joachim, MS75, 3:00 Thu Plaumann, Daniel, MS65, 10:00 Thu Shiu, Anne, MS61, 3:00 Wed Rusinko, Joseph P., MS6, 10:00 Mon Plaumann, Daniel, MS76, 3:00 Thu Shiu, Anne, MS72, 10:00 Thu Rusinko, Joseph P., MS6, 10:00 Mon Plaumann, Daniel, MS87, 10:00 Fri Shiu, Anne, MS83, 3:00 Thu Rusinko, Joseph P., MS16, 3:00 Mon Plaumann, Daniel, MS98, 3:00 Fri Shiu, Anne, MS102, 3:00 Fri Rusinko, Joseph P., MS26, 10:00 Tue Pogudin, Gleb, MS107, 4:30 Fri Shokrieh, Farbod, MS51, 10:00 Wed Rusinko, Joseph P., MS56, 3:00 Wed Pontil, Massimiliano, MS68, 11:00 Thu Shonkwiler, Clayton, MS26, 10:00 Tue Poznanovi’{c}, Svetlana, MS26, 11:00 S Sidman, Jessica, MS28, 10:00 Tue Tue Sadeghi Manesh, Amirhossein, MS72, Sidman, Jessica, MS38, 3:00 Tue 11:00 Thu Sidman, Jessica, MS38, 3:00 Tue Q Saez, Meritxell, MS72, 10:30 Thu Qi, Yang, MS39, 4:30 Tue Silverstein, Lily, MS100, 3:30 Fri Safey El Din, Mohab, MS13, 3:00 Mon Simon, Steven, MS51, 10:30 Wed R Safey El Din, Mohab, MS23, 10:00 Tue Simone, Naldi, MS98, 3:30 Fri Rahkooy, Hamid, MS4, 11:00 Mon Safey El Din, Mohab, MS93, 10:00 Fri Singer, Michael, MS10, 10:00 Mon Rajchgot, Jenna, MS59, 4:00 Wed Sagraloff, Michael, MS96, 10:30 Fri Singer, Michael, MS20, 3:00 Mon Ravagnani, Alberto, MS64, 10:00 Thu Samper, Jose, MS62, 4:00 Wed Singer, Michael, MS30, 10:00 Tue Ravagnani, Alberto, MS75, 3:00 Thu Sazdanovic, Radmila, MS52, 11:30 Ravagnani, Alberto, MS75, 4:00 Thu Wed Sinn, Rainer, MS65, 11:30 Thu Ravagnani, Alberto, MS86, 10:00 Fri Scheiderer, Claus, MS87, 10:30 Fri Sitharam, Meera, MS28, 10:00 Tue Ravagnani, Alberto, MS97, 3:00 Fri Schoennenbeck, Sebastian, PP1, 5:00 Sitharam, Meera, MS38, 3:00 Tue Raymond, Annie, MS32, 3:00 Tue Mon Sizemore, Ann, MS52, 10:30 Wed Regan, Margaret, MS44, 11:00 Wed Schost, Eric, MS13, 3:00 Mon Smith, Benjamin, MS11, 4:00 Mon

Italicized names indicate session organizers 156 SIAM Conference on Applied Algebraic Geometry

Smith, Gregory G., MS78, 3:00 Thu Swinarski, David, CP5, 10:30 Fri Smith, Heather C., MS26, 11:30 Tue V Szanto, Agnes, MS24, 10:00 Tue Valdettaro, Marcelo A., MS107, 3:00 Solus, Liam, MS48, 10:00 Wed Szanto, Agnes, MS85, 3:00 Thu Fri Solus, Liam, MS48, 10:00 Wed Szanto, Agnes, MS85, 3:00 Thu van Meter, Lucas, MS8, 11:00 Mon Solus, Liam, MS59, 3:00 Wed Szanto, Agnes, MS96, 10:00 Fri Vannieuwenhoven, Nick, MS25, 10:00 Tue Sommars, Jeff, MS44, 10:30 Wed Szanto, Agnes, MS107, 3:00 Fri Vannieuwenhoven, Nick, MS46, 10:00 Wed Sorokina, Tatyana, MS49, 11:00 Wed Szöllosi, Ferenc, MS9, 11:30 Mon Vannieuwenhoven, Nick, MS57, 3:30 Sottile, Frank, MS3, 10:00 Mon Szpirglas, Aviva, MS107, 3:30 Fri Wed Sottile, Frank, MS3, 10:00 Mon Varilly Alvarado, Anthony, MS42, 10:00 Wed Sottile, Frank, MS22, 10:00 Tue T Tang, Xiaoxiao, MS23, 10:30 Tue Varilly Alvarado, Anthony, MS53, 3:00 Sottile, Frank, MS49, 10:00 Wed Tavenas, Sebastien, MS23, 11:00 Tue Wed Sottile, Frank, MS49, 10:30 Wed Telen, Simon, MS14, 4:30 Mon Varilly Alvarado, Anthony, MS53, 3:30 Sottile, Frank, MS60, 3:00 Wed Wed Tenório, Wanderson, CP3, 4:30 Wed Sottile, Frank, MS71, 10:00 Thu Velasco, Mauricio, MS65, 11:00 Thu Theobald, Thorsten, MS32, 3:00 Tue Sottile, Frank, MS99, 4:30 Fri Veliz-Cuba, Alan, MS41, 4:00 Tue Theobald, Thorsten, MS43, 10:00 Wed Spaenlehauer, Pierre-Jean, MS1, 10:00 Mon Ventura, Emanuele, MS58, 3:30 Wed Theobald, Thorsten, MS43, 11:00 Wed Spaenlehauer, Pierre-Jean, MS11, 3:00 Mon Vidal, Rene, MS29, 11:00 Tue Theobald, Thorsten, MS54, 3:00 Wed Spaenlehauer, Pierre-Jean, MS21, 10:00 Tue Villamizar, Nelly, MS49, 11:30 Wed Theran, Louis, MS28, 10:00 Tue St. John, Audrey, MS28, 10:00 Tue Vinnikov, Victor, MS87, 11:00 Fri Theran, Louis, MS38, 3:00 Tue Stanley, Caprice, PP1, 5:00 Mon Vinzant, Cynthia, MS38, 4:30 Tue Theran, Louis, MS38, 3:30 Tue Stasi, Despina, MS81, 3:30 Thu Vinzant, Cynthia, MS65, 10:00 Thu Thomas, Ashleigh, MS102, 4:00 Fri Stasi, Despina, MS100, 3:00 Fri Vinzant, Cynthia, MS76, 3:00 Thu Thomas, Rekha, MS8, 10:00 Mon Stasi, Despina, MS100, 3:00 Fri Vinzant, Cynthia, MS87, 10:00 Fri Thomas, Rekha, MS18, 3:00 Mon Stawiska-Friedland, Margaret, MS93, Vinzant, Cynthia, MS98, 3:00 Fri 10:30 Fri Tohaneanu, Stefan, MS71, 10:30 Thu Viray, Bianca, IP6, 1:30 Wed Stefanou, Anastasios, MS74, 11:30 Thu Torres, Fernando, MS75, 4:30 Thu Stewart, Allen, MS81, 4:00 Thu Trager, Matthew, MS8, 10:00 Mon W Stigler, Brandilyn, MS41, 4:30 Tue Trager, Matthew, MS8, 10:00 Mon Walch, Olivia, MS7, 11:00 Mon Stiller, Peter F., MS60, 3:30 Wed Trager, Matthew, MS18, 3:00 Mon Wang, Ronghua, MS20, 4:30 Mon Straub, Armin, MS20, 4:00 Mon Tralie, Chris, MS63, 4:30 Wed Wei, Guowei, MS63, 3:30 Wed Strawn, Nate, MS9, 10:00 Mon Transtrum, Mark K., MS7, 10:30 Mon Weihs, Luca, MS70, 11:30 Thu Strawn, Nate, MS9, 10:00 Mon Traves, Will, MS28, 11:00 Tue Wiebe, Amy, MS98, 3:00 Fri Strawn, Nate, MS19, 3:00 Mon Tsigaridas, Elias, MS4, 10:00 Mon Wilburne, Dane, MS100, 4:00 Fri Streinu, Ileana, MS94, 10:00 Fri Tsigaridas, Elias, MS14, 3:00 Mon Williams, Robert L., MS56, 4:30 Wed Streinu, Ileana, MS105, 3:00 Fri Tsigaridas, Elias, MS45, 10:00 Wed Wiuf, Carsten, MS61, 3:00 Wed Streinu, Ileana, MS105, 4:00 Fri Tymoczko, Julianna, MS60, 4:00 Wed Woodroofe, Russ, MS62, 3:30 Wed Sturmfels, Bernd, MS8, 11:30 Mon U Wu, Wenyuan, MS99, 3:30 Fri Sullivant, Seth, MS7, 10:00 Mon Uhler, Caroline, IP7, 8:30 Thu X Sullivant, Seth, MS17, 3:00 Mon Uhler, Caroline, MS59, 3:00 Wed Xi, Jing, MS58, 4:30 Wed Sullivant, Seth, MS58, 4:00 Wed Usevich, Konstantin, MS90, 11:30 Fri Xu, Yibo, MS54, 4:30 Wed Sumner, Jeremy, MS69, 11:30 Thu

Italicized names indicate session organizers SIAM Conference on Applied Algebraic Geometry 157

Y Yang, Jay, MS78, 4:30 Thu Yang, Zhihong, MS13, 4:00 Mon Yap, Chee K., MS13, 3:30 Mon Ye, Ke, MS35, 4:00 Tue Yoshida, Ruriko, MS36, 3:00 Tue Yoshida, Ruriko, MS47, 10:00 Wed Yoshida, Ruriko, MS58, 3:00 Wed Yoshida, Ruriko, MS70, 11:00 Thu Youngs, Nora, MS102, 3:30 Fri Yu, Josephine, MS59, 4:30 Wed Yu, Josephine, MS73, 10:00 Thu Yu, Josephine, MS84, 3:00 Thu Yu, Polly, MS72, 11:30 Thu Yu, Wei-Hsuan, MS9, 10:30 Mon Z Zanudo, Jorge, MS41, 3:30 Tue Zeng, Zhonggang, MS33, 4:30 Tue Zhang, Xu, MS36, 4:30 Tue Zheng, Hailun, MS51, 11:00 Wed Zhou, Yuan, CP5, 11:00 Fri Ziegelmeier, Lori, MS74, 10:30 Thu

Italicized names indicate session organizers 158 SIAM Conference on Applied Algebraic Geometry Notes SIAM Conference on Applied Algebraic Geometry 159

AG17 Budget

Conference Budget SIAM Conference on Applied Algebraic Geometry July 31 - August 4, 2017 Georgia Institute of Technology Atlanta, Georgia

Expected Paid Attendance 380

Revenue Registration Income $79,350.00 Total $79,350.00

Expenses Printing $3,367.00 Organizing Committee $3,800.00 Invited Speakers $15,000.00 Food and Beverage $18,000.00 Equipment Rental/Telecommunication $2,750.00 Advertising $7,500.00 Conference Labor (including benefits) $23,905.00 Other (supplies, staff travel, freight, misc.) $2,970.00 Administrative $7,779.00 Accounting/Distribution & Shipping $4,252.00 Information Systems $7,818.00 Customer Service $2,929.00 Marketing $4,521.00 Office Space (Building) $2,988.00 Other SIAM Services $3,114.00 Total $110,693.00

Net Conference Expense -$31,343.00

Support Provided by SIAM $31,343.00 $0.00

Estimated Support for Travel Awards not included above:

Student and Early Career 32 $24,000.00 Georgia Institute of Technology

COURTYARD FIRST FLOOR SECOND FLOOR

★ equals conference locations

✪

✪

✪