Minisymposium Submission Dates:

Contributed Talks Submission Dates:

A minisymposium consists of four 25-minute presentations, with an additional five minutes for discussion after each presentation. Please submit a title, a description (not to exceed 100 words), and a list of speakers, and, if possible, titles of their presentations. The deadline for minisymposium proposal submission is January 9st, 2014.
The conference registration fee will be waived for Minisymposia organizers and speakers.
The pre-registration is until July 10, 2015.
(In US Dollars)

Pre-registration (on or before July/ 10/ 2015) | On-site registration (after July/ 10/ 2015) | |
---|---|---|

SIAG Member | 150 | 200 |

SIAM Member | 160 | 210 |

Mini Speaker / Organizer | 0 | 50 |

Non-Member | 200 | 250 |

One Day | 100 | 120 |

Student | 50 | 60 |

Symbolic Combinatorics. I and II.
**Organizers: **
Shaoshi Chen (Chinese Academy of Sciences), Manuel Kauers (Research Institute for Symbolic Computation, Austria), Michael Singer (North Carolina State University).
**Speakers:**
Cyril Banderier (Universite de Paris XIII), Shaoshi Chen (Chinese Academy of Sciences), Shishuo Fu (Penn State), Tomack Gilmore (Universität Wien), Qinghu Hou (Nankai University), Arthur Libo Yang (Nankai University), Eric Rowland (University of Liège), Rika Yatchak (NC State)
**Short Description**
In recent years algorithms and software have been developed that allow researchers to discover and verify combinatorial identities as well as understand analytic and algebraic properties of generating functions. The interaction of combinatorics and symbolic computation has had a beneficial impact on both fields. This minisymposium will feature 8 speakers describing recent research combining these areas.
Verified Solutions of Algebraic Systems.
**Organizer: **
Lihong Zhi, (Academia Sinica).
**Speakers:**
Angelos Mantzaflaris (RICAM Austrian Academy of Sciences), Chee Yap (New York University), Anton Leykin (Georgia Tech), Nan Li (Tianjin Center for Applied Mathematics)
**Short Description**
There are important classes of computational problems in various areas of engineering science (robotics, biology, etc.) and information technology (cryptology, coding theory, etc.) and even mathematical proof, which require exact and/or verified solutions. The verified computation based e.g., on symbolic/numeric techniques can provide us certified solutions, thus the reliability of computational results can be guaranteed. This mini-symposium gives a view of latest progress in developing effective methods for computing verified solutions of algebraic systems.
Nonnegative Rank.
**Organizers: **
Bernd Sturmfels (UC Berkeley), Hyenkyun Woo (KIAS Seoul).
**Speakers: **
Hyenkyun Woo (KIAS Seoul), Kaie Kubjas (Aalto University), Wotao Yin (UCLA), Serkan Hosten (San Francisco State University)
**Short Description**
Real Algebraic Geometry and Optimization I and II.
**Organizers: **
Cordian Riener (Aalto University), Thorsten Theobald (Goethe University), Timo de Wolff (Texas A&M).
**Speakers: **
Raman Sanyal (TU Berlin), Mohab Safey El Din (Universite Pierre et Marie Curie), Yoshiyuki Sekiguchi (Tokyo University of Marine Science and Technology), Martina Juhnke-Kubitzke (University of Osnabrück), Daniel Plaumann (University of Konstanz), Bernard Mourrain (INRIA Sophia Antipolis), Anne Shiu (Texas A&M University), Bruce Reznick (University of Illinois at Urbana-Champaign)
**Short Description**
The minisymposium presents recent developments in the interplay of real algebraic geometry and optimization. Topics include positive polynomials, sums of squares, semidefinite programming, polynomial optimization, linear and semidefinite relaxations, symmetries, and spectrahedra.
Markov bases and their Applications in Statistics I and II.
**Organizers: **
David Kahle (Baylor University), Ruriko Yoshida (University of Kentucky).
**Speakers: **
Uwe Nagel (University of Kentucky), Akimichi Takemura (University of Tokyo), Despina Stasi (Illinois Institute of Technology), Satoshi Aoki (Kagoshima University), Mitsunori Ogawa (University of Tokyo), Abraham Martin del Campo (ISM Austria), David Kahle (Baylor University), Tobias Windisch (Technische Universität München)
**Short Description**
Using results from the algebraic theory of toric ideals, a landmark finding of Diaconis-Sturmfels revealed an algorithm for sampling from discrete exponential families conditional on their sufficient statistics. The algorithm hinged on the construction of a type of lattice basis now known as a Markov basis for use as a transition kernel in a Markov chain Monte Carlo algorithm. While the theory is very general, despite numerous advances there remain many practical challenges motivated by real-world applications. This minisymposium serves to stimulate and sustain a vibrant, vertically integrated research community in the algebraic theory of toric ideals and its applications to discrete multivariate analysis through the use of Markov bases.
Combinatorial Phylogenetics I and II.
**Organizers: **
Jing Xi (North Carolina State University), Ruriko Yoshida (University of Kentucky).
**Speakers: **
Ruriko Yoshida (University of Kentucky), Piotr Zwiernik (UC Berkeley), Seth Sullivant (North Carolina State University), Jeremy Sumner (University of Tasmania), Megan Owen (Lehman College, CUNY), Andrew Francis (University of Western Sydney), Terrel Hodge (Western Michigan University), Grady Weyenberg (University of Kentucky), Ruth Davidson (University of Illinois, Urbana-Champaign)
**Short Description**
The primary objective of this minisymposium is to bring together new and established researchers in mathematics, biology, and statistics in order to discuss the crossover between algebraic statistics, molecular evolution, and phylogenetics.
Holonomic Functions and Holonomic Gradient Method.
**Organizer: **
Akimichi Takemura (University of Tokyo).
**Speakers: **
Christoph Koutschan (RICAM, Austria), Raimundas Vidunas (Univesity of Tokyo), Tomonari Sei (Keio University), Yoshiaki Goto (Kobe University)
**Short Description**
In this minisymposium we will cover theory and emerging applications of holonomic functions and honolomic gradient method to statistics and other areas of applied mathematics.
Computational Approaches to GIT and Moduli Theory I and II.
**Organizers: **
David Hyeon (POSTECH), David Swinarski (Fordham University).
**Speakers: **
Dawei Chen (Boston College), Anand Deopurkar (Columbia University), Patricio Gallardo (University of Georgia), Maksym Fedorchuk (Boston College), David Swinarski (Fordham University), Hyunbin Loh (POSTECH), Dao Phuong Bac (GAIA-POSTECH)
**Short Description**
In this mini symposium, we focus on the computational issues arising from the construction of moduli spaces, especially the Gröbner basis techniques applied to Hilbert points and syzygy points.
Maximum Likelihood Degrees and Critical Points I, II and III.
**Organizers: **
Jose Rodriguez (Notre Dame), Xiaoxian Tang (NIMS).
**Speakers: **
Elizabeth Gross (San Jose State University), Serkan Hosten (San Francisco State University), June Huh (Princeton), Hwangrae Lee (Pohang University of Science and Technology), Fatemeh Mohammadi (Universität Osnabrück), Mohab Safey El Din (Universite Pierre et Marie Curie (Paris 6)), Pierre-Jean Spaenlehauer (Inria Nancy Grand-Est), Caroline Uhler (Institute of Science and Technology Austria), Piotr Zwiernik (University of California Berkeley), Jose Israel Rodriguez (Notre Dame), Xiaoxian Tang (NIMS), Paolo Lella (University of Turin)
**Short Description**
Maximum likelihood estimation (MLE) is a fundamental problem in statistics. The maximum likelihood degree (ML-degree) of a statistical model gives an algebraic measure of the MLE's complexity. The ML-degree can be phrased as the number of critical points of the likelihood function for general data on the model. In this mini-symposium, we will have presentations on ML-degrees, Euclidean distance degrees, and methods to compute critical points.
Semidefinite Optimization: Geometry, Algebra and Applications I and II.
**Organizers: **
Hamza Fawzi (MIT), James Saunderson (MIT), Rekha Thomas (University of Washington).
**Speakers: **
Greg Blekherman (Georgia Tech), Joao Gouveia (Universidade de Coimbra), Kai Kellner (Goethe University), Pablo Parrilo (MIT), Elina Robeva (UC Berkeley), Rainer Sinn (Georgia Tech), Anthony Man-Cho So (The Chinese University of Hong Kong), Annie Raymond (University of Washington)
**Short Description**
This session will aim to highlight recent developments in semidefinite optimization with a focus on topics such as positive semidefinite lifts of convex sets, positive semidefinite rank, structure and complexity of spectrahedra, algebraic structures and applications.
Spectral Theory of Tensors and Tensor Rank I and II.
**Organizers: **
Hirotachi Abo (Univ of Idaho), Giorgio Ottaviani (Univ of Florence).
**Speakers: **
Nick Vannieuwenhoven (Katholieke Universiteit Leuven), Ye Ke(University of Chicago), JM Landsberg (Texas A&M University), Lek-Heng Lim (University of Chicago), Mitsuhiro Miyazaki (Kyoto University of Education), Luke Oeding (Auburn University), Elina Robeva (University of California, Berkeley), Youngho Woo (NIMS)
**Short Description**
This mini-symposium is concerned with the interplay between algebraic geometry and multi-linear algebra. The particular focus of the mini-symposium will be on algebraic and geometric approaches to problems in (1) spectral theory of tensors and (2) tensor rank.
Tropical Geometry. I,II and III.
**Organizers: **
Angelica Cueto (Columbia), Anders Jensen (Aarhus), Josephine Yu (Georgia Tech).
**Speakers: **
Pascal Benchimol (Ecole Polytechnique), Timo de Wolff (Texas A&M), Dustin Cartwright (U Tennesse Knoxville), Jan Draisma (Eindhoven), Yoav Len (Saarbrucken), Simon Hampe (Warwick), Marie MacCaig (Birmingham), Diane Maclagan (Warwick), Ralph Morrison (UC Berkeley), Yue Ren (TU Kaiserslautern), Yaroslav Shitov (Moscow), Emmanuel Tsukerman (UC Berkeley)
**Short Description**
Tropical geometry is a piecewise-linear analogue of algebraic geometry. Advances in tropical geometry enable us to use tools from discrete geometry and combinatorics for computations in algebraic geometry and commutative algebra. This minisymposium will feature recent progress in tropical curves, tropical algebra, combinatorics, and algorithms, with applications.
Parametrizations of Rational Curves in Projective Space.
**Organizer: **
David Cox (Amherst).
**Speakers: **
Ron Goldman (Rice University), Xiaohong Jia (Chinese Academy of Sciences), David A. Cox (Amherst College)
**Short Description**
This mini-symposium will focus on the commutative algebra, algebraic geometry and geometric modeling of parametrized rational curves in projective space. A range of topics will be covered, including mu-bases, singularities, stratifications, rational normal scrolls and ancestor ideals.
Group actions in algebraic geometry and commutative algebra.
**Organizers: **
Claudiu Raicu (Notre Dame), Abraham Martin del Campo (IST Austria).
**Speakers: **
Kangjin Han (DGIST, Korea), Luke Oeding (Auburn University), David Swinarski (Fordham University), Jose Rodriguez (University of Notre Dame)
**Short Description**
Many applied and theoretical problems exhibit symmetry in the form of a group action (of a finite group, a torus, an infinite symmetric group, etc.). It is then a challenge to understand this symmetry as well as the structural implications it presents. Two major reasons for studying objects with symmetry (besides their intrinsic significance) are: (a) they provide good testing grounds for general phenomena (e.g. toric varieties, homogeneous spaces); (b) they allow one to deduce general results that hold in the absence of symmetry (e.g. monomial ideals, singular curves). The goal of this minisymposium is to bring together researchers in algebraic geometry and commutative algebra and discuss recent developments where symmetry plays an important role.
Aspects of Grassmann Manifolds with a view towards applications.
**Organizer: **
Chris Peterson (Colorado State Univ).
**Speakers: **
Joachim Rosenthal (University of Zurich), Hirotachi Abo (University of Idaho), Clayton Shonkwiler (Colorado State University), Lek-Heng Lim (University of Chicago)
**Short Description**
Aspects of Grassmann Manifolds with a view towards applications
Coding Theory I, II, III, IV and V.
**Organizers: **
Felice Manganiello (Clemson Univ), Alberto Ravagnani (Univ Neuchatel).
**Speakers: **
Network Coding
Amaro Barreal (University of Aalto, Finland), Anton Betten (Colorado State University, USA), Eimear Byrne (UC Dublin, Ireland), Heide Gluesing-Luerssen (University of Kentucky, USA), Elisa Gorla (University of Neuchâtel, Switzerland), Relinde Jurrius (University of Neuchâtel, Switzerland), Joachim Rosenthal (University of Zurich, Switzerland), Thomas Westerbäck (University of Aalto, Finland)
Algebraic Coding Theory
Chaoping Xing (Nanyang Technological University), Lingfei Jin (Sudan University), Jon-Lark Kim (Sogang University), Patric Solé (Telecom ParisTech, France), Shuhong Gao (Clemson University, USA), Yoonjin Lee (Ewha Womans University, Korea), Daniele Bartoli (Ghent University, Belgium), Edgar Martinez-Moro (University of Valladolid, Spain), Leo Storme (Ghent University, Belgium)
**Short Description**
Coding Theory is a branch of Information Theory that comes as an answer to the problem of reliable communication over noisy networks. The Coding Theory sessions focus on the algebraic aspect of it and divide in two main parts:
1) Network Coding, concerning message transmission from multiple sources to multiple sinks. This part focuses on algebraic constructions and bounds for subspace codes for communication over multicast networks.
2) Algebraic Coding Theory, dealing with communication over noisy unicast networks. This part of the session broadly focuses on the mathematical aspects of Coding Theory.
Combinatorial methods in Algebraic Geometry I and II.
**Organizer: **
Sandra Di Rocco (KTH).
**Speakers: **
Alicia Dickenstein (University of Buenos Aires), Atsushi Ito (University of Kyoto), Diane Maclagan (University of Warwick), Benjamin Nill (University of of Stockholm), Luke Oeding (Auburn University), Elisa Postinghel (Leuven), Bernd Sturmfels (UC Berkeley), Greg Smith (Queens)
**Short Description**
Combinatorial methods have shown to be fundamental in recent advance of Algebraic Geometry, especially in developing algebra-geometrical methods towards applications. The theory of discriminants, tropical geometry and tensor decomposition are just some examples, well highlighted in this conference.
The minisymposium will cover a broad range of applications of algebraic-geometrical theories where combinatorial techniques play a fundamental role.
Software and Applications in Numerical Algebraic Geometry I, II and III.
**Organizers: **
Daniel Brake (Notre Dame), Elizabeth Gross (San Jose State Univ).
**Speakers: **
Daniel Bates (Colorado State), Daniel Brake (Notre Dame), Tianran Chen (Michigan State), Brent Davis (Colorado State), Heather Harrington (Oxford), Nickolas Hein (Nebraska-Kearney), María Isabel Herrero (Simons Inst. for the Theory of Computing), Alan Liddell (Notre Dame), Gregorio Malajovich (Universidade Federal do Rio de Janeiro), Abraham Martin del Campo (IST Austria), Frank Sottile (Texas A&M), Josephine Yu (Georgia Tech)
**Short Description**
Many software packages exist in numerical algebraic geometry, implementing everything from fundamental algorithms to routines for specific applications. Examples include raw path trackers and homotopy engines, solvers for parametrized systems, certification routines, and specialized packages for real algebraic sets.
While current software has applications to a variety of fields, including robotics, statistics, evolutionary biology, physics, and other area of mathematics such as Schubert calculus and tropical geometry, the development of reliable and fast software to solve polynomial systems is paramount to the broad adoption of algebro-geometric techniques across the sciences and engineering.
In this minisymposium, we discuss software in the field of numerical algebraic geometry and its many applications.
Tensor decomposition: ideals meet applications I and II.
**Organizers: **
Jan Draisma (Eindhoven), Kangjin Han (DGIST), Luke Oeding (Auburn Univ).
**Speakers: **
Ke Ye (University of Chicago), Jarosław Buczyński (Institute of Mathematics of Polish Academy of Sciences), Ignat Domanov (KU Leuven), Insong Choe (KIAS, Korea), Andrzej Cichocki (RIKEN, Japan), Kristian Ranestad (University of Oslo), Hirotachi Abo (University of Idaho), Elisa Postinghel (KU Leuven)
**Short Description**
This minisymposium will be a meeting of pure and applied researchers working on tensors, tensor decompositions, and their associated algebra and geometry.
Tensor decomposition is a tool occurring in many areas of science. Equations (or ideals) play a vital role in understanding tensors and their decompositions.
The goal of this mini-symposium is to maximize a synergy of ideas related to tensor decomposition by bringing together researchers from these two different groups.
1. Ke Ye
2. Jarosław Buczyński
3. Ignat Domanov
4. Insong Choe
Session 2:
5. Andrzej Cichocki
6. Kristian Ranestad
7. Hirotachi Abo
8. Elisa Postinghel
Core Algorithms in Algebraic Geometry I and II.
**Organizers: **
Anton Leykin (Georgia Tech), Michael Stillman (Cornell).
**Speakers: **
Hans Schoenemann (TU Kaiserslautern), Shuhong Gao (Clemson University), Janko Boehm (TU Kaiserslautern), Masayuki Noro (), Santiago Laplagne (U de Buenos Aires), Wolfram Decker (TU Kaiserslautern), Anders Jensen (Aarhus University)
**Short Description**
This minisymposium will focus on algorithms that lie in the foundation of computer algebra systems used in applied algebraic geometry: algorithms for Groebner bases, free resolutions, polynomial factorization, primary decomposition, polynomial homotopy continuation, and many others.
Algebraic structures arising in systems biology I, II and III.
**Organizers: **
Alicia Dickenstein (Buenos Aires), Anne Shiu (TAMU).
**Speakers: **
Carsten Conradi (Max Planck Institute, Magdeburg), Carina Curto (Penn State), Elisenda Feliu (University of Copenhagen), Heather Harrington (Oxford University), Badal Joshi (Cal State, San Marcos), Nikki Meshkat (North Carolina State University), Casian Pantea (West Virginia University), Mercedes Perez Millan (University of Buenos Aires), Zvi Rosen (UC Berkeley), Xiaoxian Tang (NIMS, South Korea), Carsten Wiuf (University of Copenhagen), Nora Youngs (University of Nebraska), Bernd Sturmfels (UC Berkeley)
**Short Description**
This minisymposium focuses on algebraic structures that arise in systems biology, which range from ODEs arising from biochemical reaction systems to representations of neural codes. Algebra and algebraic geometry are increasingly making important contributions, and this minisymposium will be a venue for exchanges on the latest developments in this area.
Applications of Polynomial System Solving in Cryptology I and II.
**Organizers: **
Maike Massierer (LORIA, France), Pierre-Jean Spaenlehauer (Inria, France).
**Speakers: **
Elisa Gorla (University of Neuchâtel, Switzerland), Tim Hodges (University of Cincinnati, USA), Sebastian Kochinke (University of Leipzig, Germany), Kim Laine (University of California, Berkeley, USA), Koh-ichi Nagao (Kanto Gakuin University, Japan), Pablo Parrilo (Massachusetts Institute of Technology, USA), Igor Semaev (University of Bergen, Norway), Bo-Yin Yang (Academia Sinica, Taiwan), Frank Quedenfeld (TU Braunschweig)
**Short Description**
The security of many cryptosystems is strongly related to the hardness of solving polynomial systems over finite fields. These systems often have specific algebraic properties, which may be leveraged by specialized methods. The goal of this minisymposium is to bring together experts in cryptology and in computational algebraic geometry to discuss the interaction of recent developments in polynomial system solving and related problems arising in cryptology.
Applications of Computational Algebraic Geometry to Theoretical Physics I and II.
**Organizers: **
Yang—Hui He (Oxford, London), Rak-Kyeong Seong (KIAS), Michael Stillman (Cornell).
**Speakers: **
Seung-Joo Lee (Virginia Tech), Rak-Kyeong Seong (Korea Institute for Advanced Study), Jon Hauenstein (Notre Dame), Burt Ovrut (UPenn), Yang-Hui He (City University, London, Nankai University, China and Merton College, Oxford University), Michael Stillman (Cornell University), Cyril Matti (City University, London)
**Short Description**
The last few years have witnessed a rapid development in the fruitful cross-fertilization between computational algebraic geometry and various important problems in theoretical physics, especially in field theory and string theory.
These have ranged from identification of vacuum structure of quantum field theories and moduli spaces of instantons as algebraic varieties to the catalogue of Calabi- Yau manifolds embedded in toric varieties, from efficient calculation of cohomologies for stable vector bundles used in string compactifications to the enumeration of operators in field theories using Hilbert series, from quiver gauge theories to bipartite graphs on Riemann surfaces, etc.
This session intends to bring together experts from a diverse background, physicists and mathematicians alike, and attempts to generate new ideas and collaborations.
Polynomial Optimization and Moments I, II and III.
**Organizers: **
Feng Guo (Dalian University of Technology), Daniel Plaumann (University of Konstanz), Rainer Sinn (Georgia Tech).
**Speakers: **
Igor Klep (The University of Auckland), Dennis Amelunxen (City University of Hong-Kong), Sabine Burgdorf (Centrum Wiskunde & Informatica), Sunyoung Kim (Ewha W. University), Wang Lin (Wenzhou University, Zhejiang), Bruce Reznick (University of Illinois), Mohab Safey el Din (Université Pierre et Marie Curie), Claus Scheiderer (University of Konstanz), Chu Wang (Academy of Mathematics and Systems Science), Zhengfang Yang (East China Normal University), Lihong Zhi (Academy of Mathematics and Systems Science), Cordian Riener (Aalto University)
**Short Description**
The theory of positive polynomials in algebraic geometry is combined with methods from analysis, combinatorics, and convexity to study global optimization problems for polynomials.
Using semidefinite programming techniques, the moment problem of functional analysis leads to efficient algorithms. The minisymposium brings together experts from these different disciplines.
Algebraic Structure in Graphical Models I, II and III.
**Organizers: **
Venkat Chandrasekaran (Cal Tech), Sung-Ho Kim (KAIST), Caroline Uhler (IST, Austria).
**Speakers: **
Piotr Zwiernik (Universita di Genova), Shaowei Lin (Institute for Infocomm Research, Singapore), Venkat Chandrasekaran (Caltech), Yaokun Wu (Shanghai Jiao Tong University), Po-Ling Loh (University of Pennsylvania), Gautam Dasarathy (Carnegie Mellon University), Seth Sullivant (North Carolina State University), Sung-Ho Kim (Korea Advanced Institute of Science and Technology), James Saunderson (Massachusetts Institute of Technology), Robin Evans (Oxford University), Caroline Uhler (Institute of Science and Technology Austria), Jinfang Wang (Chiba University, Japan)
**Short Description**
Algebraic and geometric properties such as sparsity, low rank, and convexity have played a prominent role in the development of new methodology for inference in graphical models. These ideas have also broadened the range of problem domains to which graphical modeling techniques have been fruitfully applied (e.g., phylogeny, gene expression analysis). This session will highlight exciting recent developments spanning the spectrum from theoretical advances to new applications.
Geometry of Matrix Multiplication.
**Organizer: **
Joseph Landsberg (Texas A&M).
**Speakers: **
Luca Chiantini (University of Siena), Christian Ikenmeyer (Texas A&M), Peter Buergisser (TU Berlin), JM Landsberg (Texas A&M University)
**Short Description**
Recently there have been advances in using geometry to prove both upper and lower bounds for the complexity of matrix multiplication. This workshop will discuss recent work in the area.
Geometric Complexity Theory.
**Organizer: **
Peter Bürgisser (TU Berlin).
**Speakers: **
Christian Ikenmeyer (Texas A&M University), Joseph Landsberg (Texas A&M University), Michael Walter (Stanford University)
**Short Description**
Geometric Complexity Theory seeks to address fundamental complexity lower bound questions such as P versus NP by means of algebraic geometry and representation theory.
There has recently been a burst of activity in these areas that has revealed connections between the original program and other questions in complexity theory, as well as several longstanding open questions in representation theory and algebraic geometry.
Orbit closure problems are of particular importance here. The analysis of the symmetries via representions leads to a bunch of challenging mathematical questions.
Algorithms and Complexity in Polynomial System Solving I and II.
**Organizers: **
Mohab Safey El Din (Universite Pierre et Marie Curie), Éric Schost (University of Western Ontario), Elias Tsigaridas (INRIA, France).
**Speakers: **
Frank Sottile (Texas A&M University), Carlos DAndrea (Universitat de Barcelona), Pierre-Jean Spaenlehauer (Inria), Vissarion Fisikopoulos (Université libre de Bruxelles (ULB)), Chee Yap (Courant Institute of Mathematical Sciences, New York University), Michael Burr (Clemson University), James H. Davenport (University of Bath), Martin Helmer (University of Western Ontario)
**Short Description**
The purpose of the mini-symposium is to bring together researchers interested in polynomial system solving to present cutting-edge results in the area and to identify future challenges.
Recent developments on geometric and algebraic methods in Economics.
**Organizers: **
Simona Settepanella (Hokkaido University), Yuji Aruka, (Chuo University), Eva Maria Feichtner (Bremen University).
**Speakers: **
Yoshinori Shiozawa (Osaka City University), Marco Grazzi (University of Bologna), Mariann Ollar (University of Pennsylvania), Masashi Morioka (Ritsumeikan University).
**Short Description**
Economics, among all social sciences, has made wide use of mathematics in order to develop rigorous models. In recent years, geometric tools such as hyperplane arrangements, tropical geometry, polytopes and others, have been used to model new and old problems in economics, such as collective choices, demand, production theory etc... This minisymposium is intended to give examples of these new algebraic and geometric models and discuss the opportunities they can offer new and deeper insight in economic theory and more generally in social sciences.
Algebraic Vision I and II.
**Organizers: **
Hon Leung Lee (University of Washington), Rekha Thomas (University of Washington).
**Speakers: **
David Dynerman (U Wisconsin), Joe Kileel (UC Berkeley), Hon Leung Lee (U Washington), Manolis Tsakiris (Johns Hopkins University), Anton Leykin (Georgia Tech), Luke Oeding (Auburn University), Irina Kogan (NC State), Roland Angst (Stanford)
**Short Description**
Algebraic vision is the emerging research area that aims to study problems in 3D vision and more generally, computer vision, using tools from algebraic geometry and polynomial optimization.
This session will showcase several projects that fit under this umbrella, including open questions and current challenges.
Coding Theory and Cryptography I and II.
**Organizer: **
Jon-Lark Kim (Sogang University).
**Speakers: **
Jung Hee Cheon (Seoul National University, S. Korea), Jon-Lark Kim (Sogang University, S. Korea), Daniel Smith (University of Louisville), Kirill Morozov (Kyushu University, Japan), Tanja Lange (Technische Universiteit Eindhoven, Netherlands), Daniel Bernstein (University of Illinois at Chicago, USA) and (Technische Universiteit Eindhoven, Netherlands), Jooyoung Lee (Sejong University)
**Short Description**
Coding Theory is the study of reliable communication and Cryptography is the study of secret communication. It is important to note that some of the coding theoretical techniques can be used to study cryptography in secret sharing schemes, bent functions, McEliece cryptosystems, etc. Recently, Carlet, Kim, Sole, et al. introduced a new class of linear codes, called Complementary Information Set codes, in order to study side channel attacks. Moreover, Public key cryptosysems based on codes such as McEliece cryptosystems are still considered secure under quantum algorithm. Therefore, the aim of this minisymposium is to invite active researchers in each area and discuss current research with the connection of Coding Theory, Cryptography, Algebra, Number Theory, and Algebraic Geometry.
Class Groups of Global Fields.
**Organizers: **
Yoonjin Lee (Ewha Womans University, South Korea), Renate Scheidler (University of Calgary, Canada).
**Speakers: **
Hwanyup Jung (Chungbuk National University), Jungyun Lee (Ewha Womans University), Yoonjin Lee (Ewha Womans University), Yuichiro Taguchi (Kyushu University)
**Short Description**
One of the most important invariants of a global field (i.e. a number field or a function field over a finite field) is its associated class group. For a number field, it measures the extent to which the maximal order fails at unique prime factorization. Moreover, class groups of genus 1 and 2 function fields serve as a useful setting for public key cryptography. Although recent years have seen significant advances in the area of class group computation, this remains a difficult problem in general. This mini-symposium is devoted to the key role that class groups play in algebraic and algorithmic number theory.
Pairings in Cryptography I and II.
**Organizers: **
Hyang-Sook Lee (Ewha Womans University, South Korea), Renate Scheidler (University of Calgary, Canada).
**Speakers: **
Sorina Ionica (University of Bordeaux), Peter Schwabe (Radboud University Nijmegen), Soo Kyung Eom (Ewha Womans university), Koray Karabina (Florida Atlantic University), Mehdi Tibouchi (NTT Tokyo), Para Lee (Ewha Womans University)
**Short Description**
Pairings on elliptic and hyperelliptic curves have many applications in cryptography, including identity based cryptography, cryptographic key agreement, digital signatures, and others. While recent advances in discrete logarithm computations over fields of small characteristic have had a significant impact on this area, pairings over fields of large characteristic continue to be of widespread interest.
On the Geometry and Topology of (Co)Amebas and Beyond.
**Organizers: **
Young Rock Kim (Hankuk University of Foreign Studies), Mounir Nisse (Korea Institute for Advanced Study).
**Speakers: **
June Huh (Princeton University), Diane Maclagan (University of Warwick), Faird Madani (Universität Regensburg), Frank Sottile (Texas A&M)
**Short Description**