Conference Agenda
Overview and details of the sessions of this conference. Please select a date or location to show only sessions at that day or location. Please select a single session for detailed view (with abstracts and downloads if available).
|
|
|
Session Overview |
| Date: Friday, 12/Jul/2019 | |||
| 8:25am - 8:30am |
Announcements Location: vonRoll, Fabrikstr. 6, 001 |
||
| 8:30am - 9:30am |
IP07: Kristin Lauter: Supersingular Isogeny Graphs in Cryptography Location: vonRoll, Fabrikstr. 6, 001 Supersingular Isogeny Graphs in Cryptography Microsoft Research, United States of America |
IP07-streamed from 001: Kristin Lauter: Supersingular Isogeny Graphs in Cryptography Location: vonRoll, Fabrikstr. 6, 004 |
|
| 9:30am - 10:00am |
Coffee break Location: Unitobler, F wing, floors 0 and -1 |
||
| 10:00am - 12:00pm |
MS137, part 2: Symbolic Combinatorics Location: Unitobler, F005 Symbolic Combinatorics (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Mahlerian analogues of Riccati equations and proofs of hypertranscendence Walk in the quarter plain and differential Galois theory Systems of equations for sets of permutations and limit shapes The location of variables in lambda-terms with bounded De Bruijn levels |
MS146, part 2: Random geometry and topology Location: Unitobler, F006 Random geometry and topology (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Grassmann Integral Geometry Topology of Gaussian Random Fields Spectrum of the Laplace Operator for Random Geometric Graphs Sampling from the uniform distribution on a variety |
MS181, part 2: Integral and algebraic geometric methods in the study of Gaussian random fields Location: Unitobler, F007 Integral and algebraic geometric methods in the study of Gaussian random fields (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) On some Karhunen-Loève expansions related to two-point homogeneous spaces Geometry-driven finite-rank approximations of Gaussian random fields Algebraic methods in sparse grids for interpolation |
| MS126, part 2: Euclidean distance geometry and its applications Location: Unitobler, F011 Euclidean distance geometry and its applications (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Rigidity theory and algebraic matroids Periodic framework enhancements Barvinok's Naive Algorithm in Distance Geometry Mathematics of 3D genome reconstruction in diploid organisms |
MS173, part 2: Numerical methods in algebraic geometry Location: Unitobler, F012 Numerical methods in algebraic geometry (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Numerical Root Finding via Cox Rings Numerical computation of monodromy action over R Adaptive step size control for homotopy continuation methods Numerical homotopies from Khovanskii bases |
MS141, part 1: Chip-firing and tropical curves Location: Unitobler, F013 Chip-firing and tropical curves (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Introduction to chip firing Computing divisorial gonality is hard Recognizing hyperelliptic graphs Graphs of gonality three |
|
| MS179, part 1: Algebraic methods for polynomial system solving Location: Unitobler, F021 Algebraic methods for polynomial system solving solving (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Exploiting fast linear algebra in the computation of multivariate relations Certification via squaring-up Efficient and complete certification of roots in solving polynomial systems Reconstruction of an Algebraic Surface from a 2D Projection |
MS130, part 3: Polynomial optimization and its applications Location: Unitobler, F022 Polynomial optimization and its applications (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Limitations on the expressive power of convex cones without long chains of faces On the exactness of Lasserre relaxations and pure states over real closed fields High-dimensional estimation via sum-of-squares proofs Exact Optimization via Sums of Nonnegative Circuits and Sums of AM/GM ExponentialsLog-concave polynomials, entropy, and approximate counting |
MS124, part 3: The algebra and geometry of tensors 1: general tensors Location: Unitobler, F023 The algebra and geometry of tensors 1: general tensors (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Apolarity for border rank Symmetric tensor decompositions on varieties Tensors under the congruence action Rank additivity for small three-way tensors |
|
| MS174, part 2: Algebraic aspects of biochemical reaction networks Location: Unitobler, F-105 Algebraic aspects of biochemical reaction networks (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Expected number of positive real solutions to systems of polynomial equations arising from reaction networks Absolute concentration robustness: an algebraic perspective On the Stability of the Steady States in the n-site Futile Cycle The DSR graph and dynamical properties of reaction networks |
MS164, part 2: Algebra, geometry, and combinatorics of subspace packings Location: Unitobler, F-106 Algebra, geometry, and combinatorics of subspace packings (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Equiangular tight frames from group divisible designs Using Biangular Gabor Frames to Construct Equiangular Tight Frames Doubly transitive lines: Symmetry implies optimality Equiangular lines in $\mathbb R^{17}$ and the characteristic polynomial of a Seidel matrix |
MS125: Efficient algorithms for geometric invariant theory Location: Unitobler, F-107 Efficient algorithms for geometric invariant theory (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Algorithms for the separation of orbits of matrices Analytic algorithms for the null cone problem Non-commutative rank of linear matrices, related structures and applications Analytic algorithms for the moment polytope |
|
| MS169, part 1: Applications of Algebraic geometry to quantum information Location: Unitobler, F-111 Applications of Algebraic geometry to quantum information (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Tensor rank, border rank, multiplicativity and entanglement Hyperdeterminants form $E_8$ Tensor network representations from the geometry of entangled states Tensor scaling, quantum marginals, and moment polytopes |
MS128, part 1: Symbolic-numeric methods for non-linear equations: Algorithms and applications Location: Unitobler, F-112 Symbolic-numeric methods for non-linear equations: Algorithms and applications (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Multilinear systems, determinantal resultants and the multiparameter eigenvalue problem Algorithmic aspects of the rational interpolation problem Computing Gröbner basis for sparse polynomial systems Real solving polynomial systems with interval method |
MS180, part 2: Network coding and subspace designs Location: Unitobler, F-113 Network coding and subspace designs (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Sum-Rank Codes and Linearized Reed-Solomon Codes On some automorphisms of polynomial rings and their applications in rank metric codes Invariants of rank-metric codes via Galois group action |
|
| MS198: Positive and negative association Location: Unitobler, F-121 Positive and negative association (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Negative dependence and sampling Log-concave polynomials: Polynomials that a drunkard can (almost) evaluate Total positivity in structured binary distributions Geometric problems in non-parametric statistics |
MS185, part 2: Algebraic Geometry Codes Location: Unitobler, F-122 Algebraic Geometry Codes (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Algebraic Geometric Codes on Hirzebruch surfaces Codes and gap sequences of Hermitian curves On the weight distribution of dual AG codes from the GK curve Subcovers and codes on a class of trace-defining curves |
MS145, part 3: Isogenies in Cryptography Location: Unitobler, F-123 Isogenies in Cryptography (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Superspecial genus 2 curves in cryptography Quantum algorithms for finding isogenies between supersingular elliptic curves. Horizontal isogeny graphs Isogeny Graphs of Ordinary Abelian Surfaces and Endomorphism Rings |
|
| 1:30pm - 2:30pm |
IP08: Jeremy Gunawardena: Some mathematical aspects of gene regulation Location: vonRoll, Fabrikstr. 6, 001 Some mathematical aspects of gene regulation Harvard Medical School, United States of America |
IP08-streamed from 001: Jeremy Gunawardena: Some mathematical aspects of gene regulation Location: vonRoll, Fabrikstr. 6, 004 |
|
| 2:30pm - 3:00pm |
Coffee break Location: Unitobler, F wing, floors 0 and -1 |
||
| 3:00pm - 5:00pm |
MS131, part 1: Computations in algebraic geometry Location: Unitobler, F005 Computations in algebraic geometry (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Regularity of S_n-invariant monomial ideals A homological approach to numerical Godeaux surfaces Asymptotic syzygies for products of projective space Where can toric syzygies live? |
MS189, part 2: Geometry and topology in applications. Location: Unitobler, F006 Geometry and topology in applications. (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Persistent Betti numbers of random Cech complexes Topological Analyses of Time Series On the Robustness of the Homological Scaffold Stable and discriminative topological invariants |
MS200, part 4: From algebraic geometry to geometric topology: Crossroads on applications Location: Unitobler, F007 From algebraic geometry to geometric topology: crossroads on applications (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Reconnection in Biology and Physics On the real geometric hypothesis of Banach The Cucker-Smale flocking model on manifolds: Geometric & topological effects, and flocking realizability Topological modeling of local reconnection |
| MS186, part 1: Algebraic vision Location: Unitobler, F011 Algebraic vision (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) "Real" Algebraic Vision A geometric construction of the essential variety Classification of Point-Line Minimal Problems in Complete Multi-View Visibility |
MS160, part 4: Numerical methods for structured polynomial system solving Location: Unitobler, F012 Numerical methods for structured polynomial system solving (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Numerical Schubert Calculus via the Littlewood-Richardson Homotopy Algorithm Computing Verified Real Solutions of Polynomials Systems via Low-rank Moment Matrix Completion Computing the Canonical Polyadic Decomposition of Tensors with Damped Gauss-Newton Method A most outrageous action |
MS167, part 3: Computational tropical geometry Location: Unitobler, F013 Computational tropical geometry (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Tropicalized quartics and curves of genus 3 Tropical Jucys Covers and refined quasimodularity Tropical lines on tropical surfaces Polyhedral tropical geometry of higher rank |
|
| MS158, part 2: Structured sums of squares Location: Unitobler, F021 Structured sums of squares (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Simple Graph Density Inequalities with no Sum of Squares Proofs Symmetry and Nonnegativity Symmetry and the Sum of Squares Hierarchy |
MS129, part 1: Sparsity in polynomial systems and applications Location: Unitobler, F022 Sparsity in polynomial systems and applications (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Optimal Descartes' rule of signs for polynomial systems supported on circuits Polyhedral Approximations to the Cone of Nonnegative Polynomials Nonegativity and Discriminants Exploiting Sparsity for Semi-Algebraic Set Volume Computation |
MS127, part 1: The algebra and geometry of tensors 2: structured tensors Location: Unitobler, F023 The algebra and geometry of tensors 2: structured tensors (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Projective geometry and tensor identifiability A bound for the Waring rank of the determinant via syzygies On the identifiability of ternary forms Real Waring Rank Geometry of Quaternary Forms |
|
| Room free Location: Unitobler, F-105 |
MS154, part 4: New developments in matroid theory Location: Unitobler, F-106 New developments in matroid theory (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Gain matroids and their applications Matroid threshold hypergraphs Whitney Numbers for Cones |
MS136, part 2: Syzygies and applications to geometry Location: Unitobler, F-107 Syzygies and applications to geometry (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Implicitization of Tensor Product Surfaces via Virtual Projective Resolutions (Part I) Implicitization of Tensor Product Surfaces via Virtual Projective Resolutions (Part II) The Hilbert quasipolynomial of a polynomial ring and generating functions related the Frobenius complexity for various classes of singularities Generalized Stanley-Reisner rings |
|
| MS193: Algebraic geometry, data science and fundamental physics Location: Unitobler, F-111 Algebraic geometry, data science and fundamental physics (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) The Calabi-Yau landscape & machine learning Machine Learning for String Vacua Knot Theory and Machine Learning Machine-learning a virus assembly fitness landscape |
MS137, part 3: Symbolic Combinatorics Location: Unitobler, F-112 Symbolic Combinatorics (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Polynomial Reduction and Super Congruences Diagonals, determinants, and rigidity Central Limit Theorems from the Location of Roots of Probability Generating Functions Periodic Pólya urns and an application to Young tableaux |
MS155, part 2: Massively parallel computations in algebraic geometry Location: Unitobler, F-113 Massively parallel computations in algebraic geometry (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Tools for perturbative calculations from algebraic geometry A massively parallel fan traversal with applications to geometric invariant theory Parallel algorithms for computing tropical varieties with symmetry Space sextics and their tritangents |
|
| MS139, part 2: Combinatorics and algorithms in decision and reason Location: Unitobler, F-121 Combinatorics and algorithms in decision and reason (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) On the Graphs of Graphical Models Causal Inference with Unknown Intervention Targets On attempts to characterize facets of the chordal graph polytope |
MS134, part 6: Coding theory and cryptography Location: Unitobler, F-122 Coding theory and cryptography (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) New results on graph-based codes Large constant dimension subspace codes consisting of k-dimensional subspaces, pairwise intersecting in at least (k-2)-dimensional subspaces Algebraic properties of codes with symmetries Quantum codes coming from J-affine variety codes |
MS162, part 1: Applications of finite fields theory Location: Unitobler, F-123 Applications of finite fields theory (25 minutes for each presentation, including questions, followed by a 5-minute break; in case of x<4 talks, the first x slots are used unless indicated otherwise) Introductory Talk Using Mersenne and Fermat numbers in Cryptosystems Cryptographic attacks against filter generator using monomial mapping Permutation and complete rational functions via Chebotarev theorem for function fields |
|
| 5:15pm - 7:00pm |
SI(AG)^2 business meeting Location: vonRoll, Fabrikstr. 6, 001 |
||
