Related papers: Parameterizing roots of polynomial congruences

In this paper, we study ideals spanned by polynomials or overconvergent series in a Tate algebra. With state-of-the-art algorithms for computing Tate Gr{\"o}bner bases, even if the input is polynomials, the size of the output grows with the…

The arithmetic properties of the ordinary partition function $p(n)$ have been the topic of intensive study for the past century. Ramanujan proved that there are linear congruences of the form $p(\ell n+\beta)\equiv 0\pmod\ell$ for the…

Classically, Groebner bases are computed by first prescribing a set monomial order. Moss Sweedler suggested an alternative and developed a framework to perform such computations by using valuation rings in place of monomial orders. We build…

Developed by Buchberger for commutative polynomial rings, Groebner Bases are frequently applied to solve algorithmic problems, such as the congruence problem for ideals. Until now, these ideas have been transmitted to different in part…

This paper describes and analyzes a method for computing border bases of a zero-dimensional ideal $I$. The criterion used in the computation involves specific commutation polynomials and leads to an algorithm and an implementation extending…

Our aim is to explain instances in which the value of the logarithmic Mahler measure of a polynomial can be written in an unexpectedly neat manner. To this end we examine polynomials defining rational curves, which allows their zero-locus…

We discuss the problem of determining reduction number of a polynomial ideal I in n variables. We present two algorithms based on parametric computations. The first one determines the absolute reduction number of I and requires computation…

We consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. Normal form algorithms provide an algebraic approach to solve this problem.…

We construct parametric families of (monic) reducible polynomials having two roots very close to each other.

It has been well known since Gauss that the principality of an ideal in a real quadratic field $K$ is equivalent to the solvability of a certain generalized Pell equations. In this paper, we combine this classical result with Srinivasan's…

In this contribution, we consider a zero-dimensional polynomial system in $n$ variables defined over a field $\mathbb{K}$. In the context of computing a Rational Univariate Representation (RUR) of its solutions, we address the problem of…

We consider certain families of integers $n$ determined by some congruence condition, such that the global root number of the elliptic curve $E_{-432n^2}: Y^2=X^3-432n^2$ is $1$ for every $n$, however a given $n$ may or may not be a sum of…

We discuss several conjectures about the real-rootedness of polynomials whose coefficients are determinants of coefficients of a real-rooted polynomial. We also consider some questions about matrices generalizing totally positive matrices,…

We give a description of the minimal primes of the ideal generated by the 2 x 2 adjacent minors of a generic matrix. We also compute the complete prime decomposition of the ideal of adjacent m x m minors of an m x n generic matrix when the…

We give algorithms to compute isomorphism classes of ordinary abelian varieties defined over a finite field $\mathbb{F}_q$ whose characteristic polynomial (of Frobenius) is square-free and of abelian varieties defined over the prime field…

Using symmetric algebras we simplify (and slightly strengthen) the Bruns-Eisenbud-Evans "generalized principal ideal theorem" on the height of order ideals of non-minimal generators in a module. We also obtain a simple proof and an…

We consider polynomial approximation over the interval $[-1,1]$ by regularized weighted discrete least squares methods with $\ell_2-$ or $\ell_1-$regularization, respectively. As the set of nodes we use Gauss quadrature points (which are…

It turns out that a parametrization of degenerate density matrices requires a parametrization of $\mathfrak{F}=U(n)/({U(k_1)\times U(k_2)\times \cdots \times U(k_m)})\quad n=k_1 +\cdots + k_m $ where $U(k)$ denotes the set of all unitary…

We explore parameterizations by radicals of low genera algebraic curves. We prove that for $q$ a prime power that is large enough and prime to $6$, a fixed positive proportion of all genus 2 curves over the field with $q$ elements can be…

This work provides a method(an algorithm) for solving the solvable unary algebraic equation $f(x)=0$ ($f(x)\in\mathbb{Q}[x]$) of arbitrary degree and obtaining the exact radical roots. This method requires that we know the Galois group as…