41 research outputs found
First-Order Tests for Toricity
Motivated by problems arising with the symbolic analysis of steady state ideals in Chemical Reaction Network Theory, we consider the problem of testing whether the points in a complex or real variety with non-zero coordinates form a coset of a multiplicative group. That property corresponds to Shifted Toricity, a recent generalization of toricity of the corresponding polynomial ideal. The key idea is to take a geometric view on varieties rather than an algebraic view on ideals. Recently, corresponding coset tests have been proposed for complex and for real varieties. The former combine numerous techniques from commutative algorithmic algebra with Gr\"obner bases as the central algorithmic tool. The latter are based on interpreted first-order logic in real closed fields with real quantifier elimination techniques on the algorithmic side. Here we take a new logic approach to both theories, complex and real, and beyond. Besides alternative algorithms, our approach provides a unified view on theories of fields and helps to understand the relevance and interconnection of the rich existing literature in the area, which has been focusing on complex numbers, while from a scientific point of view the (positive) real numbers are clearly the relevant domain in chemical reaction network theory. We apply prototypical implementations of our new approach to a set of 129 models from the BioModels repository
Associator dependent algebras and Koszul duality
We resolve a ten year old open question of Loday of describing Koszul operads
that act on the algebra of octonions. In fact, we obtain the answer by solving
a more general classification problem: we find all Koszul operads among those
encoding associator dependent algebras.Comment: 20 pages, submitted versio
Algorithms in Intersection Theory in the Plane
This thesis presents an algorithm to find the local structure of intersections of plane curves. More precisely, we address the question of describing the scheme of the quotient ring of a bivariate zero-dimensional ideal , \textit{i.e.} finding the points (maximal ideals of ) and describing the regular functions on those points. A natural way to address this problem is via Gr\"obner bases as they reduce the problem of finding the points to a problem of factorisation, and the sheaf of rings of regular functions can be studied with those bases through the division algorithm and localisation.
Let be an ideal generated by , a subset of with and a field. We present an algorithm that features a quadratic convergence to find a Gr\"obner basis of or its primary component at the origin.
We introduce an -adic Newton iteration to lift the lexicographic Gr\"obner basis of any finite intersection of zero-dimensional primary components of if is a \textit{good} maximal ideal. It relies on a structural result about the syzygies in such a basis due to Conca \textit{\&} Valla (2008), from which arises an explicit map between ideals in a stratum (or Gr\"obner cell) and points in the associated moduli space. We also qualify what makes a maximal ideal suitable for our filtration.
When the field is \textit{large enough}, endowed with an Archimedean or ultrametric valuation, and admits a fraction reconstruction algorithm, we use this result to give a complete -adic algorithm to recover , the Gr\"obner basis of . We observe that previous results of Lazard that use Hermite normal forms to compute Gr\"obner bases for ideals with two generators can be generalised to a set of generators. We use this result to obtain a bound on the height of the coefficients of and to control the probability of choosing a \textit{good} maximal ideal to build the -adic expansion of .
Inspired by Pardue (1994), we also give a constructive proof to
characterise a Zariski open set of (with action on ) that changes coordinates in such a way as to ensure the initial term ideal of a zero-dimensional becomes Borel-fixed when is sufficiently large. This sharpens our analysis
to obtain, when or , a complexity less than cubic in terms of the dimension of and softly linear in the height of the coefficients of .
We adapt the resulting method and present the analysis to find the -primary component of . We also discuss the transition towards other primary components via linear mappings, called \emph{untangling} and \emph{tangling}, introduced by van der Hoeven and Lecerf (2017). The two maps form one isomorphism to find points with an isomorphic local structure and, at the origin, bind them. We give a slightly faster tangling algorithm and discuss new applications of these techniques. We show how to extend these ideas to bivariate settings and give a bound on the arithmetic complexity for certain algebras