From SIAG-AG

Revision as of 21:36, 15 December 2012 (edit) Leykin (Talk | contribs) (→Minisymposia) ← Previous diff		Revision as of 06:54, 19 December 2012 (edit) (undo) Leykin (Talk | contribs) (→Minisymposia) Next diff →
Line 77:		Line 77:
	** [[Numerical and Classical Algebraic Geometry]]. Organizer: Gian Mario Besana (Depaul, Chicago, USA)		** [[Numerical and Classical Algebraic Geometry]]. Organizer: Gian Mario Besana (Depaul, Chicago, USA)
	** [[On Coppersmith's heuristic algorithm for finding roots of multivariate polynomials]]. Organizer: Damien Stehlé (École Normale Supérieure de Lyon, France).		** [[On Coppersmith's heuristic algorithm for finding roots of multivariate polynomials]]. Organizer: Damien Stehlé (École Normale Supérieure de Lyon, France).
-	** [[Polynomial problems in computer vision]]. Organizer: Tomas Pajdla (Czech Technical University, Czech Republic).	+	** [[Polynomial problems in computer vision]]. Organizer: Tomas Pajdla (Czech Technical U, Czech Republic).
		+	** [[Post-Quantum Cryptography]]. Organizer: Dan Bernstein (???) and Tanja Lange (Technische U Eindhoven, Netherlands).
	** [[Real algebraic geometry and optimization]]. Organizers: Grigory Blekherman (Georgia Institute of Technology, Atlanta, USA), Cordian Riener (Univ. Konstanz, Germany), and Thorsten Theobald (Goethe-University Frankfurt, Germany).		** [[Real algebraic geometry and optimization]]. Organizers: Grigory Blekherman (Georgia Institute of Technology, Atlanta, USA), Cordian Riener (Univ. Konstanz, Germany), and Thorsten Theobald (Goethe-University Frankfurt, Germany).
	** [[Singular Learning Theory]]. Organizer: Mathias Drton (U Washington, Seattle, USA).		** [[Singular Learning Theory]]. Organizer: Mathias Drton (U Washington, Seattle, USA).

---

Revision as of 06:54, 19 December 2012

Contents 1 Place and dates 2 Organizers 3 Plenary speakers 4 Minisymposia 4.1 Local information

Place and dates

• Colorado State University, Fort Collins, Colorado, USA, August 1--4, 2013
• SIAM official webpage

Organizers

• Program Chairs:
  • Alicia Dickenstein
  • Anton Leykin

• Program Committee:
  • Henry Cohn
  • Ioannis Emiris
  • Robert Ghrist
  • Gilles Gnacadja
  • Tanja Lange
  • Reinhard Laubenbacher
  • Peter Olver
  • Chris Peterson (one of the local organizers)
  • Bernd Sturmfels
  • Rekha Thomas

• Local organizers:
  • Dan Bates (CSU)
  • Renzo Cavalieri (CSU)
  • Alexander Hulpke (CSU)
  • Chris Peterson (CSU)
  • Rachel Pries (CSU)
  • Amelia Taylor (Colorado College)

Plenary speakers

• Yuliy Baryshnikov
• Greg Blekherman
• Sandra di Rocco
• Olga Holtz
• Rei Inoue
• Damien Stehlé
• Ravi Vakil
• Carsten Wiuf

Minisymposia

• Please, e-mail the program chairs with your ideas and informal proposals.
• Official SIAM call for minisymposia proposal submissions.
• A list of minisymposia suggested so far:
  • Algebraic Aspects of Biochemical Reaction Networks. Organizers: Anne Shiu (University of Chicago, USA) and Gilles Gnacadja (Amgen, USA).
  • Algebraic Aspects of Large-Scale Statistics. Organizers: Venkat Chandrasekaran (Caltech, USA) and Caroline Uhler (IST, Austria).
  • Approximation Theory, Geometric Modeling, and Algebraic Geometry. Organizers: Luis García-Puente (Sam Houston State, USA) Frank Sottile (Texas A&M, USA).
  • Algebraic Geometry of Tensors. Organizer: Lek-Heng Lim (University of Chicago, USA).
  • Algebraic geometry, moment problems and applications. Organizer: Bernard Mourrain (INRIA Sophia Antipolis, France).
  • Algebro-geometric approaches to tensor spaces, tensor decomposition, and identifiability. Organizers: Hirotachi Abo, (U of Idaho, USA) Luke Oeding (UC Berkeley, USA), and Giorgio Ottaviani (U di Firenze, Italy), Chris Peterson (Colorado State U, USA).
  • Algorithms in Numerical Algebraic Geometry. Organizer: Jonathan Hauenstein (NCSU, Raleigh, USA)
  • Algorithms in Real Algebraic Geometry and its Applications. Organizers: Mohab Safey El Din and Elias Tsigaridas (Paris 6/INRIA, France).
  • Applications of Computational and Numerical Algebraic Geometry to Theoretical Physics. Organizers: Yang-Hui He (U of Oxford, UK) and Dhagash Mehta (Syracuse U, USA).
  • Applications of Numerical Algebraic Geometry (2013). Organizer: Wenrui Hao (Notre Dame, South Bend IN, USA)
  • Applications to image processing and shape analysis. Organizers: Irina Kogan (NCSU, Raleigh, USA) and Facundo Memoli (University of Adelaide, Australia).
  • Applications to phase retrieval and low-rank matrix recovery. Organizers: Vladislav Voroninski (University of California, Berkeley, USA), Yang Wang (Michigan State University, USA), and Zhiqiang Xu (Chinese Academy of Sciences, China).
  • Applied and Computational Topology. Organizers: Peter Bubenik (Cleveland State U, USA), Dmitriy Morozov (Lawrence Labs, Berkeley, USA), and Mikael Vejdemo-Johnasson (St. Andrews U, Scotland).
  • Arithmetic Geometry. Organizer: Stefan Erickson (Colorado College) and Rachel Pries (Colorado State University, USA).
  • Coding Theory. Organizers: Iwan Duursma (UIUC, USA), Elisa Gorla (University of Neuchatel, Switzerland), and Joachim Rosenthal (University of Zurich, Switzerland).
  • Combinatorial Algebraic Statistics. Organizers: Alexander Engstrom and Patrik Noren (Aalto University, Finland).
  • Complexity of Polynomial System Solving. Organizers: Guillermo Matera (UNGS, Argentina) and Luis M. Pardo (U of Cantabria, Spain).
  • Computational aspects of moving frames. Organizers: Evelyne Hubert (INRIA Méditerranée, France) and Francis Valiquette (Dalhousie University).
  • Computations and effective bounds in commutative algebra. Organizers: Karl Schwede (Penn State U, USA), Claudiu Raicu (Princeton U), and Uli Walther (Purdue U, USA).
  • Computing Sparse Approximate Models from Values. Organizers: Mark Giesbrecht (U Waterloo, Canada), Erich Kaltofen (NCSU, Raleigh, USA), and Wen-shin Lee (University of Antwerp, Belgium).
  • Exact Certificates in Nonlinear Global Optimization. Organizers: Erich Kaltofen (NCSU, Raleigh, USA), Mohab Safey El Din (Paris 6/INRIA, France), and Lihong Zhi (Chinese Academy of Sciences).
  • Effective methods in D-modules and singularities. Organizers: Karl Schwede (Penn State U, USA), Claudiu Raicu (Princeton U), and Uli Walther (Purdue U, USA).
  • Exact Linear Algebra Algorithms. Organizers: Martin Albrecht (Paris 6, France), Pascal Giorgi (University Montpellier 2, France), and Clement Pernet (Université Joseph Fourier, France).
  • Formulas in Interpolation. Organizers: Carlos D'Andrea (U of Barcelona, Spain), Teresa Krick(U of Buenos Aires, Argentina), and Agnes Szanto (NCSU, USA).
  • Geometry of Statistical Models. Organizers: Andrew Critch and Bernd Sturmfels (UC Berkeley, USA)
  • Hyperbolic Polynomials. Organizers: Tim Netzer (U Leipzig, Germany), Daniel Plaumann (U Konstanz, Germany), and Victor Vinnikov (Ben Gurion U, Israel).
  • Hypergeometric Differential Equations and Statistics. Organizers: Nobuki Takayama (Kobe University, Japan), Takayuki Hibi (Osaka University, Japan), and Kenta Nishiyama (Osaka University, Japan).
  • Identifiability Problems in Biology and Statistics. Organizers: Nicolette Meshkat (UCLA, Los Angeles, USA), Seth Sullivant (NCSU, Raleigh, USA).
  • Number Theory and Algebraic Curves. Organizers: Iwan Duursma (UIUC, USA) and Rachel Pries (Colorado State University, USA).
  • Numerical and Classical Algebraic Geometry. Organizer: Gian Mario Besana (Depaul, Chicago, USA)
  • On Coppersmith's heuristic algorithm for finding roots of multivariate polynomials. Organizer: Damien Stehlé (École Normale Supérieure de Lyon, France).
  • Polynomial problems in computer vision. Organizer: Tomas Pajdla (Czech Technical U, Czech Republic).
  • Post-Quantum Cryptography. Organizer: Dan Bernstein (???) and Tanja Lange (Technische U Eindhoven, Netherlands).
  • Real algebraic geometry and optimization. Organizers: Grigory Blekherman (Georgia Institute of Technology, Atlanta, USA), Cordian Riener (Univ. Konstanz, Germany), and Thorsten Theobald (Goethe-University Frankfurt, Germany).
  • Singular Learning Theory. Organizer: Mathias Drton (U Washington, Seattle, USA).
  • Software for Algebraic Geometry: Macaulay2. Organizer: Greg Smith (Queen's University, Kingston, Canada).
  • Symbolic Combinatorics (2013). Organizers: Manuel Kauers (RISC, Austria) and Michael Singer (NCSU, Raleigh, USA).
  • Tensor Networks. Organizer: Jason Morton (Penn State U, USA).
  • Toric geometry, Lattice points, and Applications. Organizers: Benjamin Nill (Case Western Reserve U, USA) and Ivan Soprunov (Cleveland State U, USA).
  • Tropical Geometry and Combinatorics in Dynamical Systems. Organizers: Rei Inoue (Chiba University, Japan) and Thomas Lam (University of Michigan, USA).

Local information

Lectures and minisymposia will be in the Clark building at Colorado State University, in Fort Collins, CO.

• Travel: Participants will find it most convenient to fly into Denver (DEN), a hub for both United and Frontier, and take a SuperShuttle van to their hotels. Van reservations are strongly recommended and may be made here.

• Hotels: Room blocks are being arranged on campus (in dormitories, with air conditioning, in-house dining, and various other amenities), the Fort Collins Hilton, and the Best Western University Inn. The on-campus housing option is about a five minute walk to the Clark building while the hotels are each 10-15 minutes away. Please DO NOT make reservations yet as there will be a special block with lower rates finalized very soon.

• Food: There are numerous dining options around campus, particularly across Shields on Elizabeth, along College between Prospect and Laurel, and 15-20 minutes north of the conference venue, in

Old Town. The student union, adjacent to the venue, will likely be closed for renovation at the time of the conference. More details will be posted later.

• Before and after the conference: Conference participants may want to consider planning for a few extra days in the region as the Colorado Rockies are a common vacation spot for families. Destinations other than Fort Collins/Loveland include Aspen, Vail, Estes Park, Colorado Springs, and many others. Further details and options will be posted soon.

Please contact Dan Bates (bates [AT] math.colostate.edu) with any questions.