38th International Symposium on Symbolic and Algebraic Computation (ISSAC 2013)

Boston, Massachusetts, June 26--29, 2013

Contents


Contributions, sorted by conference schedule

Wednesday
Shillman Hall (SH) 220
9:30 – 11:40
Tutorial: Dan Steffy – Exact linear and integer programmingfurther material
1:30 – 3:40
Tutorial: Mark van Hoeij – The complexity of factoring univariate polynomials over the rationals
3:40 – 4:00
Break
4:00 – 6:10
Tutorial: Pablo Parrilo – Convex algebraic geometry and semidefinite optimizationfurther material
7:00 – 9:00
Opening Reception

 

Thursday
Room 1 (West Village F 20) Room 2 (Shillman Hall (SH) 220)
8:40
Opening remarks
9:00 – 10:00
Invited Talk: Henry Cohn – Solving equations with size constraints for the solutions
10:00 – 10:30
Break
Bivariate systems Software and Applications
10:30 – 10:55
Romain Lebreton, Esmaeil Mehrabi and Éric Schost. On the complexity of solving bivariate systems: the case of non-singular solutions Joris van der Hoeven and Gregoire Lecerf. Interfacing Mathemagix with C++
10:55 – 11:20
Yacine Bouzidi, Sylvain Lazard, Marc Pouget and Fabrice Rouillier. Separating linear forms for bivariate systems Mark Boady, Pavel Grinfeld and Jeremy Johnson. A Term Rewriting System for the Calculus of Moving Surfaces
11:20 – 11:45
Yacine Bouzidi, Sylvain Lazard, Marc Pouget and Fabrice Rouillier. Rational Univariate Representations of bivariate systems and applications Laureano Lambán, Francisco-Jesus Martin-Mateos, Julio Rubio and Jose-Luis Ruiz-Reina. Certified symbolic manipulation: bivariate simplicial polynomials
11:45 – 1:30
Lunch
1:30 – 2:20
Invited Software Talk: Stephen Wolfram – Computer Algebra: A 32-Year Update  
  Software Presentations I

Poster Session I (main foyer West Village F20)

2:30 – 2:45 Break

Posters 1–9

Coffee and snacks available from 3:30

2:45 – 3:10
Christoph Koutschan. Holonomic Functions in Mathematica
3:10 – 3:35 Erik Postma. The new GroupTheory package in Maple 17
3:35 – 4:00
Break
Fourier Tranforms Computational Group Theory and Number theory
4:00 – 4:25
Yasuhito Kawano and Hiroshi Sekigawa. Quantum Fourier Transform over Symmetric Groups Eric Bach and Jonathan Sorenson. Approximately Counting Semismooth Integers
4:25 – 4:50
Andrew Arnold. A new Truncated Fourier Transform algorithm Alexander Hulpke. Calculation of the Subgroups of a Trivial-Fitting Group
4:50 – 5:15
Joris van der Hoeven, Romain Lebreton and Éric Schost. Structured FFT and TFT: symmetric and lattice polynomials Anton Betten. Rainbow Cliques and the Classification of Small BLT-Sets
5:30 – 6:45
ISSAC Business Meeting
6:45 – 7:30
SIGSAM Business Meeting

 

Friday
Room 1 (West Village F 20) Room 2 (Shillman Hall (SH) 220)
9:00 – 10:00
Invited Talk: Hendrik Lenstra – Lattices with symmetry
10:00 – 10:30
Break
Algebraic Algorithms Difference equations
10:30 – 10:55
Jingwei Chen, Damien Stehle and Gilles Villard. A New View on HJLS and PSLQ: Sums and Projections of Lattices Mariya Bessonov, Alexey Ovchinnikov and Maxwell Shapiro. Integrability conditions for parameterized linear difference equations
10:55 – 11:20
Luca De Feo, Éric Schost and Javad Doliskani. Fast algorithms for l-adic towers over finite fields Alexander Levin. Multivariate Difference-Differential Dimension Polynomials and New Invariants of Difference-Differential Field Extensions
11:20 – 11:45
Valérie Berthé, Jean Creusefond, Loick Lhote and Brigitte Vallée. Multiple GCD's. Probabilistic analysis of the plain algorithm Veronika Pillwein. Termination Conditions for Positivity Proving Procedures
11:45 – 1:30
Lunch
Linear algebra Telescoping and Desingularization
1:30 – 1:55
Jean-Guillaume Dumas, Clément Pernet and Ziad Sultan. Simultaneous computation of the row and column rank profiles Alin Bostan, Pierre Lairez and Bruno Salvy. Creative telescoping for rational functions using the Griffiths–Dwork method
1:55 – 2:20
Colton Pauderis and Arne Storjohann. Computing the invariant structure of integer matrices: fast algorithms into practice Alin Bostan, Shaoshi Chen, Frédéric Chyzak, Ziming Li and Guoce Xin. Hermite Reduction and Creative Telescoping for Hyperexponential Functions
2:20 – 2:45
Wei Zhou and George Labahn. Computing Column Bases of Polynomial Matrices Shaoshi Chen, Maximilian Jaroschek, Manuel Kauers and Michael Singer. Desingularization Explains Order-Degree Curves for Ore Operators
  Software Presentations II Poster Session II
2:45 – 3:00 Break

Posters 10–18

Coffee and snacks available from 3:30

3:00 – 3:25

Anton Betten. Classifying Discrete Objects with Orbiter
3:25 – 3:50 Fredrik Johansson. Arb: a C library for ball arithmetic
3:50 – 4:15
Tien-Yien Li, Zhonggang Zeng.NAClab: A Matlab Toolbox for Numerical Algebraic Computation
4:15 – 4:30 Break
Solutions of Equations Integration
4:30 – 4:55
Zhengfeng Yang, Lihong Zhi and Yijun Zhu. Verified Error Bounds for Real Solutions of Positive-dimensional Polynomial Systems Clemens G. Raab. Integration of unspecified functions and families of iterated integrals
4:55 – 5:20
Qingdong Guo, Mohab Safey El Din and Lihong Zhi. Computing rational solutions of linear matrix inequalities Francois Boulier, François Lemaire, Georg Regensburger and Markus Rosenkranz. On the Integration of Differential Fractions
5:20 – 5:45
Victor Y. Pan and Elias Tsigaridas. On the Boolean complexity of real root refinement Alin Bostan, Frédéric Chyzak and Élie de Panafieu. Complexity Estimates for Two Uncoupling Algorithms
7:00
Banquet


Saturday Room 1 (West Village F 20) Room 2 (Shillman Hall (SH) 220)
9:00 – 10:00 Invited Talk: Mohab Safey El Din – Critical Point Methods and Effective Real Algebraic Geometry: New Results and Trends
10:00 – 10:30 Break
Resultants and Algebra Gröbner Bases
10:30 – 10:55 Alicia Dickenstein, Ioannis Emiris and Vissarion Fisikopoulos. Combinatorics of 4-dimensional Resultant Polytopes Senshan Pan, Yupu Hu and Baocang Wang. The Termination of the F5 Algorithm Revisited
10:55 – 11:20 Romain Basson, Reynald Lercier, Christophe Ritzenthaler and Jeroen Sijsling. An explicit expression of the Luroth invariant Bjarke Hammersholt Roune and Christian Eder. Signature Rewriting in Gröbner Basis Computation
11:20 – 11:45 Wei Li, Chun-Ming Yuan and Xiao-Shan Gao. Sparse Difference Resultant Jean-Charles Faugère, Mohab Safey El Din and Thibaut Verron. On the Complexity of Computing Gröbner bases for quasi-homogeneous systems
11:45 – 1:30 Lunch
Sparse polynomials Gröbner Bases II
1:30 – 1:55 Arkadev Chattopadhyay, Bruno Grenet, Pascal Koiran, Natacha Portier and Yann Strozecki. Factoring bivariate lacunary polynomials without heights Viktor Levandovskyy, Benjamin Schnitzler and Grischa Studzinski. Enhanced computations of Gröbner bases in free algebras as a new application of the letterplace paradigm
1:55 – 2:20 Erich Kaltofen and Zhengfeng Yang. Sparse multivariate function recovery from values with noise and outlier errors Jules Svartz and Jean-Charles Faugère. Gröbner bases of ideals invariant under a commutative group: the non-modular case
2:25 – 2:50 Jingguo Bi, Qi Cheng and J. Maurice Rojas. Sub-Linear Root Detection, and New Hardness Results, for Sparse Polynomials Over Finite Fields
3:00 – 3:30 Maplesoft Demo: Jürgen Gerhard. What's new in Maple 17?
3:30 – 4:00 Break
Cylindrical Algebraic Decomposition Differential Equations
4:00 – 4:25 Russell Bradford, James Davenport, Matthew England, Scott McCallum and David Wilson. Cylindrical Algebraic Decompositions for Boolean Combinations Vijay Kunwar and Mark van Hoeij. Second Order Differential Equations with Hypergeometric Solutions of Degree Three
4:25 – 4:50 Christopher Brown. Constructing a Single Open Cell in a Cylindrical Algebraic Decomposition Fredrik Johansson, Manuel Kauers and Marc Mezzarobba. Finding Hyperexponential Solutions of Linear ODEs by Numerical Evaluation
4:50 – 5:15 Kurt Mehlhorn, Michael Sagraloff and Pengming Wang. From Approximate Factorization to Root Isolation Greg Reid and Wenyuan Wu. Numerical determination of witness points on real solution components of polynomial and differential polynomial systems
5:20 Closing
5:40 Walking tour through Boston

top


Poster Presentations

  1. Andrew Arnold, Mark Giesbrecht, Daniel Roche
    Recursive sparse interpolation
  2. James Belk, Nabil Hossain, Francesco Matucci, Robert W. McGrail
    Implementation of a Solution to the Conjugacy Problem in Thompson's Group F
  3. Jingwei Chen, Yong Feng, Wenyuan Wu
    Incremental PSLQ with Application to Algebraic Number Reconstruction
  4. Van Chien Bui, Gérard H. E. Duchamp, Vincel Hoang Ngoc Minh
    Schützenberger's factorization on q-stuffle Hopf algebra
  5. Pascal Giorgi, Romain Lebreton
    Relaxing Order Basis Computation
  6. Gavin Harrison, Jeremy Johnson, B. David Saunders
    Probabilistic Analysis of Wiedemann’s Algorithm for Minimal Polynomial Computation
  7. Jiaxiong Hu, Michael Monagan
    A Parallel Algorithm to Compute the Greatest Common Divisor of Sparse Multivariate Polynomials
  8. Jeremy Johnson, Lingchuan Meng
    Towards Parallel General-Size Library Generation for Polynomial Multiplication
  9. Muhammad Taimoor Khan, Wolfgang Schreiner
    A Verification Framework for MiniMaple Programs
  10. Takaaki Masui, Kosaku Nagasaka
    Revisiting QRGCD and Comparison with ExQRGCD
  11. Johannes Middeke
    Annihilating monomials with the integro-differential Weyl algebra
  12. Éric Schost, Pierre-Jean Spaenlehauer
    Newton-like Iteration for Determinantal Systems and Structured Low-Rank Approximation
  13. Sidi Mohamed Sedjelmaci
    Fast Parallel GCD algorithm of many integers.
  14. Akira Terui
    Calculating Approximate GCD of Multiple Univariate Polynomials using Approximate Syzygies
  15. Bastien Vialla
    Block Wiedemann algorithm on multicore architectures
  16. James Wan
    Hypergeometric generating functions and series for 1/π
  17. Thomas Wolf
    A Linear Sparse Systems Solver (LSSS) applied to the Classification of Integrable non-abelian Laurent ODEs
  18. Xiangui Zhao
    Gelfand-Kirillov dimensions of differential difference modules via Groebner bases

top


Software Demonstrations

Industry sponsor software presentations

Jürgen Gerhard, Director of Research, Maplesoft

What's new in Maple 17?

Abstract: We will present some of the new features in Maple 17, including performance enhancements, new GUI features, new library packages, and new Math Apps. Some of the highlights are improved memory management, a new polynomial data structure, a new group theory package, and videos in worksheets.

top


All contributions, sorted by author

top