Program

Update (14/11/17): The PDF of the technical program of MACIS can be found here

Time	Wednesday, November 15 2017
08:30-17:30	Registration open
09:00-10:00	Invited talk: Bruno Buchberger Johannes Kepler University, Austria Session Chair: Temur Kutsia
09:00-10:00	Teaching Math to Lady M Abstract : I stopped teaching logic and math to humans. Instead I started to teach logic / math to Lady M, a machine. She (or he or it) has absolutely no insight and I enjoy that she does not expect that what I am telling her has any meaning (semantics). For certain input expressions she produces certain output. Very reliably, for the same input the same output. By certain input, her inner state changes and she her input / output behavior changes. Recently, after many layers of communication, I managed to make her behave the way I behaved when, as a PhD student, I invented the Gröbner bases algorithm. I.e. I taught her to invent mathematical algorithms and proofs. Of course, she does not know. I am not sure how far I managed to carry this approach consistently through. In the talk, I will display certain stages of this program for discussion.
10:00-10:30	Coffee break
10:30-12:00	Session 1.1 (Track 1): Foundation of Algorithms in Mathematics, Engineering & Scientific Computation Lecture Hall A Session Chair: Matthew England
	Homotopies for connected components of algebraic sets with application to computing critical sets Daniel J. Bates, Dani Brake, Jonathan Hauenstein, Andrew Sommese and Charles W. Wampler Dimension Quasi-polynomials of Inversice Difference Field Extensions with Weighted Translations Alexander Levin On Real Roots Counting for Non-radical Parametric Ideal Ryoya Fukasaku and Yosuke Sato On the bit-size of non-radical triangular set Xavier Dahan
12:00-14:00	Lunch

14:00-16:30	Session 1.2 (Track 1): Foundation of Algorithms in Mathematics, Engineering & Scientific Computation Lecture Hall A Session Chair: Zafeirakis Zafeirakopoulos	Session 3.1 (Track 3): Data Modeling and Analysis Lecture Hall B Session Chair: Alex Karagrigoriou
	Certifying Newton-invariant subspaces Jonathan Hauenstein Efficient certification of numeric solutions to eigenproblems Joris van der Hoeven and Bernard Mourrain Implementing fast carryless multiplication Joris van der Hoeven, Robin Larrieu and Gregoire Lecerf Rapidly convergent integrals and function evaluation Heba Al Kafri, David J. Jeffrey and Robert M. Corless Stirling Numbers, Lambert W and the Gamma Function David J. Jeffrey and Nick Murdoch	A Simple Streaming Bit-parallel Algorithm for Swap Pattern Matching Václav Bla_ej, Tomá_ Valla and Ondrej Suchy Epidemic Intelligence Statistical Modelling for Biosurveillance Christina Parpoula, Alex Karagrigoriou and Angeliki Lambrou Mining Acute Stroke Patients’ Data using Supervised Machine Learning Ritu Kundu and Toktam Mahmoodi Parallel and Robust Empirical Risk Minimization via the Median Trick Patrick Traxler and Alexander Kogler
16:00-16:30	Coffee break
16:30-17:45	Session 4.1 (Track 4): Mathematical Aspects of Information Security and Cryptography Lecture Hall A Session Chair: Temur Kutsia
	Subtleties in Security Definitions for Predicate Encryption with Public Index Johannes Blömer and Gennadij Liske A leakage resilient shuffling Filip Zagorski, Michal Kulis and Pawel Lorek Code-based Key Encapsulation from McEliece’s Cryptosystem Edoardo Persichetti
18:00-23:00	Mayor´s Reception Meeting point: 18:00 in front of the Conference Venue

Time	Thursday, November 16
08:30-17:30	Registration open
09:00-10:00	Invited talk: Dongming Wang Beihang University and Guangxi University for Nationalities, China & CNRS, France. Session Chair: Johannes Blömer
09:00-10:00	Characteristic Decomposition of Polynomial Sets Abstract: Let G be a reduced lexicographic Groebner basis. A polynomial g in G is said to be minimal if g has the lowest order among all those polynomials in G which have the same leading variable as g. The minimal polynomials in G form a triangular set, called the W-characteristic set of G or of the ideal generated by G. G is said to be normal if for every minimal polynomial g in G, the initial of g does not involve the leading variable of any other polynomial in G. We show that there are inherent conncections between Ritt characteristic sets and lexicographic Groebner bases, normal Groebner bases and their W-characteristic sets possess a number of interesting properties, and any polynomial set can be decomposed into finitely many normal Groebner bases with associated zero relations. The decomposition algorithm is based on the structural properties we have established and the computation of lexicographic Groebner bases. We discuss briefly the implementation of our decomposition algorithm with some experiments. Part of the word presented in this talk was done jointly with Rina Dong and Chenqi Mou.
10:00-10:30	Coffee break
10:30-12:00	Session 1.3 (Track 1): Foundation of Algorithms in Mathematics, Engineering & Scientific Computation Lecture Hall A Session Chair: Xavier Dahan
	Balancing expression dags for more efficient lazy adaptive evaluation Martin Wilhelm On Interval Methods with Zero Rewriting and Exact Geometric Computation Stefan Schirra and Martin Wilhelm Improving Enclosure of Interval Scalar Projection Operation Tomasz Dobrowolski
12:00-14:00	Lunch

14:00-16:00	Session 1.4 (Track 1): Foundation of Algorithms in Mathematics, Engineering & Scientific Computation Lecture Hall A Session Chair: Ilias Kotsireas	Session 2.1 (Track 2): Combinatorics and Codes in Computer Science Lecture Hall B Session Chair: Stefan Schirra
	Fast Chinese remaindering in practice Joris van der Hoeven Jordan Canonical Form with Parameters From Frobenius Form with Parameters Steven Thornton, Marc Moreno Maza and Robert Corless Decomposition of Low Rank Multi-Symmetric Tensor Jouhayna Harmouch, Bernard Mourrain and Houssam Khalil Sparse Rational Function Interpolation with Finitely Many Values for the Coefficients Qiao-Long Huang and Xiao-Shan Gao	Right-justified characterization for generating regular pattern avoiding permutations Thi Thu Huong Tran, Phan Thuan Do and Vincent Vajnovszki New small 4-designs with nonabelian automorphism groups Vedran Krcadinac and Mario Osvin Pavcevic On Classifying Steiner triple systems by their 3-rank Dieter Jungnickel, Spyros Magliveras, Vladimir Tonchev and Alfred Wassermann Experimental Study of the Ehrhart Interpolation Polytope Vissarion Fisikopoulos and Zafeirakis Zafeirakopoulos On Testing Isomorphism of Graphs of Bounded Eigenvalue Multiplicity Takunari Miyazaki
16:00-16:30	Coffee break
16:30-17:30	Session 4.2 (Track 4): Mathematical Aspects of Information Security and Cryptography Lecture Hall A Session Chair: Johannes Blömer
	Ordinary Pairing-Friendly Genus 2 Hyperelliptic Curves with Absolutely Simple Jacobians Georgios Fotiadis and Elisavet Konstantinou Statistical testing of PRNG: generalized gambler’s ruin problem Pawel Lorek, Marcin Slowik and Filip Zagorski
17:45-19:30	Audio Guided Tour – Museum of Fine Arts Vienna Meeting point: 17:45 in front of the Conference Venue

Time	Friday, November 17
08:30-17:30	Registration open
09:00-10:00	Invited Tutorial Talk: Ilias Kotsireas Wilfrid Laurier University, Canada Session Chair: Dimitris Simos
09:00-10:00	All kinds a new Maple Packages, remind me of You Abstract: Maple 2017 encompasses a significant amount of new functionalities in more than 150 different packages. We will present an overview of new functionalities in Maple 2017, with an emphasis on the Group Theory and Physics packages. We will illustrate these functionalities with fully worked out examples.
10:00-10:30	Coffee break
10:30-12:00	Session 1.5 (Track 1): Foundation of Algorithms in Mathematics, Engineering & Scientific Computation Lecture Hall A Session Chair: Alexei Lisitsa
	Knowledge-Based Interoperability for Mathematical Software Systems Michael Kohlhase, Dennis Müller, Markus Pfeiffer, Florian Rabe, Nicolas M. Thiéry, Victor Vasilyev and Tom Wiesing Virtual Theories – A Uniform Interface to Mathematical Knowledge Bases Tom Wiesing, Michael Kohlhase and Florian Rabe Isabelle Formalization of Set Theoretic Structures and Set Comprehensions Cezary Kaliszyk and Karol Pąk
12:00-14:00	Lunch
14:00-15:15	Session 1.6 (Track 1): Foundation of Algorithms in Mathematics, Engineering & Scientific Computation Lecture Hall A Session Chair: Temur Kutsia
	The Potential and Challenges of CAD with Equational Constraints for SC-Square James H. Davenport and Matthew England Automated reasoning for knot semigroups and pi-orbifold groups of knots Alexei Lisitsa and Alexei Vernitski Integrating Algebraic and SAT Solvers Jan Horacek, Jan Burchard, Bernd Becker and Martin Kreuzer
15:15-15:30	Closing remarks

By continuing to use the site, you agree to the use of cookies. more information