Bounds for the degrees in the membership test for a polynomial ideal
Bounds on degrees of projective schemes.
Calculs d'invariants primitifs de groupes finis
Calculs d'invariants primitifs de groupes finis
We introduce in this article a new method to calculate all absolute and relatif primitive invariants of finite groups. This method is inspired from K. Girstmair which calculate an absolute primitive invariant of minimal degree. Are presented two algorithms, the first one enable us to calculate all primitive invariants of minimal degree, and the second one calculate all absolute or relative primitive invariants with distincts coefficients. This work take place in Galois Theory and Invariant Theory. ...
Classical geometry and computers.
Classification of finite rings: theory and algorithm
An interesting topic in the ring theory is the classification of finite rings. Although rings of certain orders have already been classified, a full description of all rings of a given order remains unknown. The purpose of this paper is to classify all finite rings (up to isomorphism) of a given order. In doing so, we introduce a new concept of quasi basis for certain type of modules, which is a useful computational tool for dealing with finite rings. Then, using this concept, we give structure...
Classification results in quasigroup and loop theory via a combination of automated reasoning tools
We present some novel classification results in quasigroup and loop theory. For quasigroups up to size 5 and loops up to size 7, we describe a unique property which determines the isomorphism (and in the case of loops, the isotopism) class for any example. These invariant properties were generated using a variety of automated techniques --- including machine learning and computer algebra --- which we present here. Moreover, each result has been automatically verified, again using a variety of techniques...
Complexity bound of absolute factoring of parametric polynomials.
Computation in Coxeter groups. I: Multiplication.
Computation of centralizers in Braid groups and Garside groups.
We give a new method to compute the centralizer of an element in Artin braid groups and, more generally, in Garside groups. This method, together with the solution of the conjugacy problem given by the authors in [9], are two main steps for solving conjugacy systems, thus breaking recently discovered cryptosystems based in braid groups [2]. We also present the result of our computations, where we notice that our algorithm yields surprisingly small generating sets for the centralizers.
Computation of Period Matrices of Real Algebraic Curves*
Computational aspects of group extensions and their applications in topology.
Computations in finite-dimensional Lie algebras.
Computer-Assisted Proofs and Symbolic Computations
We discuss some main points of computer-assisted proofs based on reliable numerical computations. Such so-called self-validating numerical methods in combination with exact symbolic manipulations result in very powerful mathematical software tools. These tools allow proving mathematical statements (existence of a fixed point, of a solution of an ODE, of a zero of a continuous function, of a global minimum within a given range, etc.) using a digital computer. To validate the assertions of the underlying theorems...
Computing Gröbner fans of toric ideals.
Computing Kazhdan-Lusztig polynomials for arbitrary Coxeter groups.
Computing nilpotent quotients in finitely presented Lie rings.
Computing parametric rational generating functions with a primal Barvinok algorithm.
Computing the integral closure of an affine semigroup.
Computing the period of an Ehrhart quasi-polynomial.