Session on Gröbner Bases and their Applications
Organized by Elizabeth Arnold (Virginia, USA), Ilias Kotsireas (Waterloo, Canada) Markus Rosenkranz (Linz, Austria)
in the frame of the conference
ACA 2008, RISC-Linz, Castle of Hagenberg, Austria, July 27-30, 2008.
Honorary Session Chairman: Bruno Buchberger
The theory of Gröbner Bases is a cornerstone of Computer Algebra which has also found (often unexpected) applications to a wide spectrum of areas in Science and Engineering. All major computer algebra systems offer Gröbner Bases functionalities, and powerful stand-alone implementations are also available.
This session is intended to discuss recent theoretical and practical developments in the theory of Gröbner bases as well as applications of Gröbner bases to other fields. Research contributions as well as expository papers are solicited. For more information and/or to present a paper at the session, please contact the session organizers by e-mail.
This session is a continuation of a series of sessions on the theory of Gröbner bases and its applications organized at previous ACA conferences and other workshops.
Session Topics inlcude (but are not limited to):
- elimination theory
- computational commutative algebra
- multivariate polynomial ideal theory
- solving systems of algebraic equations
- Algorithms for computing GB's
- GB for improving oil drilling platforms
- GB for guessing "missing links" in palaeontology
- GB in cryptography (code breaking)
- GB in software engineering (automated inductive assertion generation)
- GB for sudoku
- GB in origami
- GB in combinatorial design theory
- GB in computer aided design
- GB in solid modeling
- GB in mathematics
- GB in logic
- GB in education
- GB in geometrical theorem proving
- GB in integer programming
- GB in sciences and engineering
List of Talks (preliminary):
John AbbottTitle: Stable Border Bases
Abstract: Empirical data are represented as approximate points; the aim is to determine a border basis (a generalization of Grobner basis) valid up to the given uncertainty in the data.
Anna BigattiTitle: The Self-saturating Buchberger Algorithm
Abstract: The difficulties in computing Groebner bases for non-homogeneous inputs are addressed by a combination of homogenization and dynamic saturation.
Eng-Wee ChionhTitle: Some "Numerology" for the Moving Surfaces Implicitization Technique with Gröbner Blending Functions Abstract
Xavier DahanTitle: Lexicographic Gröbner basis as generalized Lagrange interpolation polynomials and its applications
Abstract: We give a simple framework for regarding the polynomials of a zero-dimensional radical lexicographic Gröbner basis as a generalization of Lagrange interpolation polynomials. This extends a previous work (Dahan - Schost, ISSAC 2004) which dealt only with very specific lexicographic Gröbner bases, the Lazard triangular sets. We show how to derive some bounds on the size of the coefficients (for a first approach, those do not concern *reduced* Gröbner bases yet. At the time of the talk, this drawback may certainly change...) Such bounds provide a numerical criterion for choosing a lucky prime p (term borrowed from Arnold's "Modular algorithms for computing Gröbner bases bases", JSC 2003). in the background of modular methods. Some variations may be given also: parametrization of all the Gröbner bases of a given finite family of points with a caracterization of the reduced one, introduction to a transformation (used in Dahan Schost, ISSAC 2004) for general radical zero dimensional lexicographic Grôbner, in order to reduce the size of the coefficients.
Gema M. Diaz-TocaTitle: Dynamic Galois Theory and Gröbner Basis Abstract
Gerdt V.P., Zinin M.V.Title: On efficiency of involutive criteria in computing Boolean Groebner bases
Tetsuo IdaTitle: Analysis of Automated Proof of Origami Morley's Theorem Abstract
Kyriakos KalorkotiTitle: Model Checking in the Modal mu-Calculus by Substitutions and Generic Solutions
Abstract: We give an algebraic method for model checking in the modal mu-calculus over finite state labelled transition systems. This can be used to provide solutions that are in a sense generic, i.e., in a formula the quantifiers can be left as unknowns. The resulting solution can then be used with the method of Gröbner bases to determine for which choice of quantifiers in a formula (and all sub-formulae) have a chosen truth value. The ability to provide generic solutions can be seen as a useful tool for providing examples either for pedagogical reasons of for case studies.
Roberto La Scala and Viktor LevandovskyyTitle: Letterplace ideals and non-commutative Groebner bases
Abstract: In this paper we propose a 1-to-1 correspondence between graded two-sided ideals of the free associative algebra and some class of ideals of the algebra of polynomials whose variables are double-indexed commuting ones. We call these ideals the ``letterplace analogues'' of graded two-sided ideals. We study the behaviour of the generating sets of the ideals under this correspondence and in particular that of the Groebner bases. In this way, we obtain a new method to compute non-commutative homogeneous Groebner bases via polynomials in commuting variables. Since the letterplace ideals are stable under the action of a monoid of endomorphisms of the polynomial algebra, the proposed algorithm results an example of a Buchberger procedure ``reduced by symmetry''. Owing to portability of our algorithm in any computer algebra system able to compute commutative Groebner bases, we present an experimental implementation of our method in Singular. By means of a representative set of examples, we show finally that our implementation is competitive with professional computer algebra systems that provide non-commutative Groebner bases.
Daniel LichtblauTitle: Exact Computation using Approximate Groebner Bases
Abstract: We discuss computation of approximate Groebner bases at high but finite precision. We show how this can be used to deduce exact results.
Edgar Martínez MoroTitle: Groebner presentations of a monoid algebras and applications Abstract
Ernst W. MayrTitle: TBA
Antonio MontesTitle: Canonical reduced comprehensive Groebner System
Abstract: I will present the basic features of the "Minimal Canonical Comprehensive Groebner System" (MCCGS), and the algorithm to obtain it. It works under the hypothesis of a conjecture to produce the most compact canonical reduced possible CGS. It can be used for ideals in the affine space. Using Wibmer's Theorem for homogeneous polynomials I will show that the conjecture can be avoided for non-homogeneous polynomials as well. This also allows to obtain a better natural canonical partition of the parameter space whose existence is theoretically proved and that is described by locally closed sets.
Oleksandr MotsakTitle: Supercommutative algebras
Abstract: We consider supercommutative algebras which generalize both commutative polynomial algebra as well as exterior (Grassmann) algebra. In contrast to the usual treatment as a factor algebras we introduce the usual computer algebra notions directly for supercommutative algebras and emphase differences occurring due to the presence of zero divisors. Although being essentially the same as the general non-commutative Buchberger algorithmus for factor algebras our Groebner basis (GB) algorithmus efficiently uses an intrinsic characterization of a GB in a supercommutative algebra. Moreover, it turns out that the product criterion holds true for Z_2-homogeneous polynomials. Thus we get an efficient GB algorithm in a supercommutative algebra and in particular in an exterior (Grassmann) algebra whose applications include: automatic geometrical theorem proving, analysis of properties of exterior differential systems, computation of sheaf cohomologies.
Jean-François PommaretTitle: Macaulay inverse systems revisited with application to control identifiability Abstract
Tomas RecioTitle: A protocol for automatic discovery of geometry theorems through Minimal Canonical Comprehensive Gröbner Basis
Abstract: The main proposal in this talk is the merging of two techniques that have been recently developed (cf. Montes-Recio, Springer Lect. Notes Artificial Intelligence, 4869, pp. 113-139, 2007). On the one hand, we consider a new approach for computing some specializable Gröbner basis, the so called Minimal Canonical Comprehensive Gröbner Systems (MCCGS) that is -roughly speaking- a computational procedure yielding ``good" bases for ideals of polynomials over a field, depending on several parameters, that specialize ``well", for instance, regarding the number of solutions for the given ideal, for different values of the parameters. The second ingredient is related to automatic theorem discovery in elementary geometry. Automatic discovery aims to obtain complementary (equality and inequality type) hypotheses for a (generally false) geometric statement to become true. The talk presents and discusses a protocol for automatic discovery and shows how to use MCCGS in this context. Joint work with Antonio Montes.
Lorenzo RobbianoTitle: Border Basis and Groebner Basis Schemes, Lorenzo Robbiano
Abstract: These schemes parameterize families of border/Groebner bases; they give a solid mathematical foundation to situations dealing with approximate data.
Markus Rosenkranz, Georg RegensburgerTitle: Groebner Bases for Boundary Value Problems
Yosuke SatoTitle: Boolean Gröbner Bases and Sudoku
Peter SchenzelTitle: Towards a classification of projective varieties by their degree
- NEW YORK, May 13, 2008
Bruno Buchberger is the recipient of the 2007 ACM Paris Kanellakis Theory and Practice Award
- The Groebner-Bases-Bibliography project at RISC. A collection of all journal and proceedings articles, books, survey articles, technical reports, tutorials, lecture notes, slides of talks etc. on Groebner bases theory and related topics (theory, algorithms, systems, applications).
- The Special Semester on Groebner Bases.
- The Groebner Bases Implementations. Functionality Check and Comparison database.
- The 33 Years of Groebner Bases conference.
Papers presented at the session will be considered for publication at a special issue of a journal.