A symbolic Lie p-ring presentation defines a family of nilpotent Lie rings with pn elements for infinitely many primes p and a fixed positive integer n. Symbolic Lie p-ring presentations are used in the classification of isomorphism types of nilpotent Lie rings of order pn for all primes p and n≤7. We describe an algorithm to compute the Schur multipliers of all nilpotent Lie rings in the family defined

Feynman integral computations in theoretical high energy particle physics frequently involve square roots in the kinematic variables. Physicists often want to solve Feynman integrals in terms of multiple polylogarithms. One way to obtain a solution in terms of these functions is to rationalize all occurring square roots by a suitable variable change. In this paper, we give a rigorous definition of

We present a generic and executable formalization of signature-based algorithms (such as Faugère's F5) for computing Gröbner bases, as well as their mathematical background, in the Isabelle/HOL proof assistant. Said algorithms are currently the best known algorithms for computing Gröbner bases in terms of computational efficiency. The formal development attempts to be as generic as possible, generalizing

We introduce a “workable” notion of degree for non-homogeneous polynomial ideals and formulate and prove ideal theoretic Bézout inequalities for the sum of two ideals in terms of this notion of degree and the degree of generators.

We investigate the tree gonality of a genus-g metric graph, defined as the minimum degree of a tropical morphism from any tropical modification of the metric graph to a metric tree. We give a combinatorial constructive proof that this number is at most ⌈g/2⌉+1, a fact whose proofs so far required an algebro-geometric detour via special divisors on curves. For even genus, the tropical morphism which

It is well known that Riquier introduced the notion of multiplicative variables applied to order ideals to represent initial conditions of partial differential equations as series. On the other hands, Janet introduced the concept of involutive division. Following Riquier and Janet, we focus on the following problem. Suppose one needs to compute a monomial ideal generated in some degree D and its escalier

Modelling the substitution of nucleotides along a phylogenetic tree is usually done by a hidden Markov process. This allows to define a distribution of characters at the leaves of the trees and one might be able to obtain polynomial relationships among the probabilities of different characters. The study of these polynomials and the geometry of the algebraic varieties defined by them can be used to

We study Gröbner degenerations of Schubert varieties inside flag varieties. We consider toric degenerations of flag varieties induced by matching fields and semi-standard Young tableaux. We describe an analogue of matching field ideals for Schubert varieties inside the flag variety and give a complete characterization of toric ideals among them. We use a combinatorial approach to standard monomial

Both spectral sequences and persistent homology are tools in algebraic topology defined from filtrations of objects (e.g. topological spaces or simplicial complexes) indexed over the set Z of integer numbers. A recent work has shown the details of the relation between both concepts. Moreover, generalizations of both concepts have been proposed which originate from a different choice of the set of indices

Let K be a field of characteristic zero and let K‾ be an algebraic closure of K. Consider a sequence of polynomials G=(g1,…,gs) in K[X1,…,Xn] with s

Polynomial factoring has famous practical algorithms over fields– finite, rational and p-adic. However, modulo prime powers, factoring gets harder because there is non-unique factorization and a combinatorial blowup ensues. For example, x2+pmodp2 is irreducible, but x2+pxmodp2 has exponentially many factors in the input size (which here is logarithmic in p)! We present the first randomized poly(deg⁡f

We describe new fast algorithms for evaluation and interpolation on the “novel” polynomial basis over finite fields of characteristic two introduced by Lin et al. (2014). Fast algorithms are also described for converting between their basis and the monomial basis, as well as for converting to and from the Newton basis associated with the evaluation points of the evaluation and interpolation algorithms

An independence model for discrete random variables is a Segre-Veronese variety in a probability simplex. Any metric on the set of joint states of the random variables induces a Wasserstein metric on the probability simplex. The unit ball of this polyhedral norm is dual to the Lipschitz polytope. Given any data distribution, we seek to minimize its Wasserstein distance to a fixed independence model

We classify embedded blowups of the real affine plane up to oriented isomorphy. We show that two blowups in the same isomorphism class are isotopic, using a matrix deformation argument similar to an idea given in Shastri (2002). This answers two questions which were motivated by the interactive visualizations of such blowups (see Schenzel and Stussak, 2013, Stussak, 2007, 2013).

It is known since the 1970s that no more than 23 multiplications are required for computing the product of two 3×3-matrices. For non-commutative coefficient rings, it is not known whether it can also be done with fewer multiplications. However, there are several mutually inequivalent ways of doing the job with 23 multiplications. In this article, we extend this list considerably by providing more than

We classify the two-way quasi-independence models (independence models with structural zeros) that have rational maximum likelihood estimators, or MLEs. We give a necessary and sufficient condition on the bipartite graph associated to the model for the MLE to be rational. In this case, we give an explicit formula for the MLE in terms of combinatorial features of this graph. We also use the Horn uniformization

Given symmetric matrices A0,A1,…,An of size m with rational entries, the set of real vectors x=(x1,…,xn) such that the matrix A0+x1A1+⋯+xnAn has non-negative eigenvalues is called a spectrahedron. Minimization of linear functions over spectrahedra is called semidefinite programming. Such problems appear frequently in control theory and real algebra, especially in the context of nonnegativity certificates

The objective of this paper is twofold. First we do a survey on what we call the Yoshida method for studying the analytic first integrals of the quasi-homogeneous polynomial differential systems. After, we apply the Yoshida method for studying the analytic first integrals of all the quasi-homogeneous polynomial differential systems in R3 of degree 2.

Algorithms for integration of the algebraic functions implemented in modern computer algebra systems (CAS) are not always able to solve the classical problems of integration in the class of algebraic or elementary functions. The most general approach to describing the integral of an algebraic function is to find a standard representation for Abelian integrals, which, on the one hand, would not be too

In this paper, we study unirational differential curves and the corresponding differential rational parametrizations. We first investigate basic properties of proper differential rational parametrizations for unirational differential curves. Then we show that the implicitization problem of proper linear differential rational parametric equations can be solved by means of differential resultants. Furthermore

This paper introduces an algorithmic approach to the analysis of bifurcation of limit cycles from the centers of nonlinear continuous differential systems via the averaging method. We develop three algorithms to implement the averaging method. The first algorithm allows one to transform the considered differential systems to the normal form of averaging. Here, we restricted the unperturbed term of

We consider the problem of finding a condition for a univariate polynomial having a given multiplicity structure when the number of distinct roots is given. It is well known that such conditions can be written as conjunctions of several polynomial equations and one inequation in the coefficients, by using repeated parametric gcd's. In this paper, we give a novel condition which is not based on repeated

Zeilberger's method of creative telescoping is crucial for the computer-generated proofs of combinatorial and special-function identities. Telescopers are linear differential or (q-)recurrence operators computed by algorithms for creative telescoping. Two fundamental problems related to creative telescoping are whether telescopers exist, and how to construct them efficiently when they do. In this paper

We describe a new arithmetic system for the Magma computer algebra system for working with p-adic numbers exactly, in the sense that numbers are represented lazily to infinite p-adic precision. This is the first highly featured such implementation. This has the benefits of increasing user-friendliness and speeding up some computations, as well as forcibly producing provable results. We give theoretical

It is undecidable in general whether a given finitely presented group is word hyperbolic. We use the concept of pregroups, introduced by Stallings (1971), to define a new class of van Kampen diagrams, which represent groups as quotients of virtually free groups. We then present a polynomial-time procedure that analyses these diagrams, and either returns an explicit linear Dehn function for the presentation

Square-free decomposition is one of fundamental computations for polynomials. However, any conventional algorithm may not work for polynomials with a priori errors on their coefficients. There are mainly two approaches to overcome this empirical situation: approximate polynomial GCD (greatest common divisor) and the nearest singular polynomial. In this paper, we show that these known approaches are

We provide algorithms to reconstruct rational ruled surfaces in three-dimensional projective space from the “apparent contour” of a single projection to the projective plane. We deal with the case of tangent developables and of general projections to P3 of rational normal scrolls. In the first case, we use the fact that every such surface is the projection of the tangent developable of a rational normal

Multiplicative relations between the roots of a polynomial in Q[x] have drawn much attention in the field of arithmetic and algebra, while the problem of computing these relations is interesting to researchers in many other fields. In this paper, a sufficient condition is given for a polynomial f∈Q[x] to have only trivial multiplicative relations between its roots, which is a generalization of those

Let p be an odd natural number ≥3. Inspired by results from Euclid's Elements, we express the irrationaly=d+Rp, whose degree is 2p, as a polynomial function of irrationals of degrees ≤p. In certain cases y is expressed by simple radicals. This reduction of the degree exhibits remarkably regular patterns of the polynomials involved. The proof is based on hypergeometric summation, in particular, on Zeilberger's

We introduce the notion of confinement of decompositions for forms or vector of forms. The confinement, when it holds, lowers the number of parameters that one needs to consider, in order to find all the possible decompositions of a given set of data. With the technique of confinement, we obtain here two results. First, we give a new, shorter proof of a result by London (1890) that 3 general plane

We present a new formula for the Cauchy index of a rational function on an interval using subresultant polynomials. There is no condition on the endpoints of the interval and the formula also involves in some cases less subresultant polynomials.

For a given projective variety X, the high rank loci are the closures of the sets of points whose X-rank is higher than the generic one. We show examples of strict inclusion arising from two consecutive high rank loci. Our first example comes from looking at the Veronese surface of plane quartics. Although Piene had already shown an example in which X is a curve, we construct infinitely many curves

Consider an action of a connected solvable group G on an affine variety X. This paper presents an algorithm that constructs a semi-invariant f∈K[X]=:R and computes the invariant ring (Rf)G together with a presentation. The morphism Xf→Spec((Rf)G) obtained from the algorithm is a universal geometric quotient. In fact, it is even better than that: a so-called excellent quotient. If R is a polynomial

Every real algebraic variety determines a Voronoi decomposition of its ambient Euclidean space. Each Voronoi cell is a convex semialgebraic set in the normal space of the variety at a point. We compute the algebraic boundaries of these Voronoi cells.

In 1884 the German mathematician Karl Rohn published a substantial paper Rohn (1884) on the properties of quartic surfaces with triple points, proving (among many other things) that the maximum number of lines contained in a quartic monoid surface is 31. In this paper we study in details this class of surfaces. We prove that there exists an open subset A⊆PK1 (K is a characteristic zero field) that

We study the autocovariance functions of moving average random fields over the integer lattice Zd from an algebraic perspective. These autocovariances are parametrized polynomially by the moving average coefficients, hence tracing out algebraic varieties. We derive dimension and degree of these varieties and we use their algebraic properties to obtain statistical consequences such as identifiability

We solve a special type of linear systems with coefficients in multivariate polynomial rings. These systems arise in the computation of b-functions with respect to weights of certain hypergeometric ideals in the Weyl algebra.

Maximal mediated sets (MMS), introduced by Reznick, are distinguished subsets of lattice points in integral polytopes with even vertices. MMS of Newton polytopes of AGI-forms and nonnegative circuit polynomials determine whether these polynomials are sums of squares. In this article, we take initial steps in classifying MMS both theoretically and practically. Theoretically, we show that MMS of simplices

We give upper bounds for the solving degree and the last fall degree of the polynomial system associated to the HFE (Hidden Field Equations) cryptosystem. Our bounds improve the known bounds for this type of systems. We also present new results on the connection between the solving degree and the last fall degree and prove that, in some cases, the solving degree is independent of coordinate changes

Starting with the ground-breaking work of Cook II, Harbourne, Migliore and Nagel, there has been a lot of interest in unexpected hypersurfaces. In the last couple of months a considerable number of new examples and new phenomena has been observed and reported on. All examples studied so far had just one fat point. In this note we introduce a new series of examples, which establishes for the first time

Given a polynomial ring P over a field K, an element g∈P, and a K-subalgebra S of P, we deal with the problem of saturating S with respect to g, i.e. computing Satg(S)=S[g,g−1]∩P. In the general case we describe a procedure/algorithm to compute a set of generators for Satg(S) which terminates if and only if it is finitely generated. Then we consider the more interesting case when S is graded. In particular

We present a new algorithm for computing integral bases in algebraic function fields of one variable, or equivalently for constructing the normalization of a plane curve. Our basic strategy makes use of the concepts of localization and completion, together with the Chinese remainder theorem, to reduce the problem to the task of finding integral bases for the branches of each singularity of the curve

We consider numerical certification of approximate solutions to a system of polynomial equations with more equations than unknowns by first certifying solutions to a square subsystem. We give several approaches that certifiably select which are solutions to the original overdetermined system. These approaches each use different additional information for this certification, such as liaison, Newton-Okounkov

In algebraic geometry, the Frobenius map F⁎ on cohomology groups play an important role in the classification of algebraic varieties over a field of positive characteristic. In particular, representation matrices for F⁎ give rise to many important invariants such as p-rank and a-number. Several methods for computing representation matrices for F⁎ have been proposed for specific curves. In this paper

The goal of this paper is to measure the non-convexity of compact and smooth connected components of real algebraic plane curves. We study these curves first in a general setting and then in an asymptotic one. In particular, we consider sufficiently small levels of a real bivariate polynomial in a small enough neighbourhood of a strict local minimum at the origin of the real affine plane. We introduce

We prove that, for a tropical rational map if for any point the convex hull of Jacobian matrices at smooth points in a neighborhood of the point does not contain singular matrices then the map is an isomorphism. We also show that a tropical polynomial map on the plane is an isomorphism if all the Jacobians have the same sign (positive or negative). In addition, for a tropical rational map we prove

A constructive method for decomposing finite dimensional representations of semisimple real Lie algebras is developed. The method is illustrated by an example. We also discuss an implementation of the algorithm in the language of the computer algebra system GAP4.

Given an autonomous first order algebraic ordinary differential equation F(y,y′)=0, we prove that every formal Puiseux series solution of F(y,y′)=0, expanded around any finite point or at infinity, is convergent. The proof is constructive and we provide an algorithm to describe all such Puiseux series solutions. Moreover, we show that for any point in the complex plane there exists a solution of the

The W-characteristic set of a polynomial ideal is the minimal triangular set contained in the reduced lexicographical Gröbner basis of the ideal. A pair (G,C) of polynomial sets is a strong regular characteristic pair if G is a reduced lexicographical Gröbner basis, C is the W-characteristic set of the ideal 〈G〉, the saturated ideal sat(C) of C is equal to 〈G〉, and C is regular. In this paper, we show

A k-ellipse is a plane curve consisting of all points whose distances from k fixed foci sum to a constant. We determine the singularities and genus of its Zariski closure in the complex projective plane. The paper resolves an open problem stated by Nie, Parrilo and Sturmfels in 2008.

We exploit structure in polynomial system solving by considering polynomials that are linear in subsets of the variables. We focus on algorithms and their Boolean complexity for computing isolating hyperboxes for all the isolated complex roots of well-constrained, unmixed systems of multilinear polynomials based on resultant methods. We enumerate all expressions of the multihomogeneous (or multigraded)

Symmetric tensor decomposition is an important problem with applications in several areas, for example signal processing, statistics, data analysis and computational neuroscience. It is equivalent to Waring's problem for homogeneous polynomials, that is to write a homogeneous polynomial in n variables of degree D as a sum of D-th powers of linear forms, using the minimal number of summands. This minimal

We design and analyze new protocols to verify the correctness of various computations on matrices over the ring F[x] of univariate polynomials over a field F. For the sake of efficiency, and because many of the properties we verify are specific to matrices over a principal ideal domain, we cannot simply rely on previously-developed linear algebra protocols for matrices over a field. Our protocols are

The functional (de)composition of polynomials is a topic in pure and computer algebra with many applications. The structure of decompositions of (suitably normalized) polynomials f=g∘h in F[x] over a field F is well understood in many cases, but less well when the degree of f is divisible by the positive characteristic p of F. This work investigates the decompositions of r-additive polynomials, where

Approximate polynomial GCD (greatest common divisor) of polynomials with a priori errors on their coefficients, is one of interesting problems in Symbolic-Numeric Computations. In fact, there are many known algorithms: QRGCD, UVGCD, STLN based methods, Fastgcd and so on. The fundamental question of this paper is “which is the best?” from the practical point of view, and subsequently “is there any better

We consider the problem of obtaining expressions for integrals that are continuous over the entire domain of integration where the true mathematical integral is continuous, which has been called the problem of obtaining integrals on domains of maximum extent (Jeffrey, 1993). We develop a method for correcting discontinuous integrals using an extension of the concept of unwinding numbers for complex

We present a novel randomized algorithm to factor polynomials over a finite field Fq of odd characteristic using rank 2 Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo the polynomial f∈Fq[x] to be factored) with respect to a random Drinfeld module ϕ with complex multiplication. Factors of f supported on prime ideals with supersingular

We present a parallel GCD algorithm for sparse multivariate polynomials with integer coefficients. The algorithm combines a Kronecker substitution with a Ben-Or/Tiwari sparse interpolation modulo a smooth prime to determine the support of the GCD. We have implemented our algorithm in C for primes of various size and have parallelized it using Cilk C. We compare our implementation with Maple and Magma's

We consider the problem of analyzing chemical reaction networks that may allow multiple positive steady states. We use tools from “classical” computer algebra (Gröbner bases over a parametrized domain, computation of a discriminant variety, graphical and mathematical analysis of solution sets, cylindrical decomposition) to help determine regions of stoichiometric compatibility classes that have multiple

One of the fundamental tasks of Symbolic Computation is the factorization of polynomials into irreducible factors. The aim of the paper is to produce new families of irreducible polynomials, generalizing previous results in the area. One example of our general result is that for a near-separated polynomial, i.e., polynomials of the form F(x,y)=f1(x)f2(y)−f2(x)f1(y), then F(x,y)+r is always irreducible