Related papers: Parameterizing roots of polynomial congruences
We establish limit laws for the distribution in small intervals of the roots of the quadratic congruence $\mu^2 \equiv D \bmod m$, with $D > 0$ square-free and $D\not\equiv 1 \bmod 4$. This is achieved by translating the problem to…
The subject matter of this work is quadratic and cubic polynomial functions with integer coefficients;and all of whose roots are integers. The material of this work is directed primarily at educators,students,and teachers of…
A quadrature rule of a measure $\mu$ on the real line represents a convex combination of finitely many evaluations at points, called nodes, that agrees with integration against $\mu$ for all polynomials up to some fixed degree. In this…
Motivated by a desire to understand the distribution of roots of cubic congruences, we re-derive a parametrization of roots $\nu \pmod m$ of $X^3 \equiv 2 \pmod m$ found by Hooley. Although this parametrization does not lead us here to…
A necessary and sufficient condition is provided for the solvability of a binomial congruence with a composite modulus, circumventing its prime factorization. This is a generalization of Euler's Criterion through that of Euler's Theorem,…
We consider the generalised root identities introduced in [1] for simple functions, and also for \Gamma(z+1) and \zeta(s). In this paper, unlike [1], we focus on the case of noninteger \mu. For the simplest function f(z)=z, and hence for…
We present a new method to calculate analytically the roots of the general complex polynomial of degree three. Thismethod is based on the approach of appropriated changes of variable involving an arbitrary parameter. The advantageof this…
Certain generalization of Euler numbers was defined in 1935 by Lehmer using cubic roots of unity, as a natural generalization of Bernoulli and Euler numbers. In this paper, Lehmer's generalized Euler numbers are studied to give certain…
We prove a doubly exponential bound for the Castelnuovo-Mumford regularity of prime ideals defining varieties with polynomial parametrisation.
In this paper, we present a generic parametrization of generically zero-dimensional parametric polynomial systems. More specifically, we study the specialization properties of the Rational Univariate Representation and derive bounds on the…
The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive'…
Certain generalization of Euler numbers was defined in 1935 by Lehmer using cubic roots of unity, as a natural generalization of Bernoulli and Euler numbers. In this paper, we define a new polynomial related to the higher-order generalized…
With a main tool is signed graphs, we give a full description of the characteristic quasi-polynomials of ideals of classical root systems ($ABCD$) with respect to the integer and root lattices. As a result, we obtain a full description of…
Let $K$ be a complete non-archimedean field with a discrete valuation, $f\in K[X]$ a polynomial with non-vanishing discriminant, $A$ the valuation ring of $K$, and $\M$ the maximal ideal of $A$. The first main result of this paper is a…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
We extend the geometric interpretation of the roots of the quadratic congruence $\mu^2 \equiv D \pmod m$ as the tops of certain geodesics in the hyperbolic plane to the case when $D$ is square-free and $D\equiv 1\pmod 4$. This allows us to…
In this paper, we study functions of the roots of a univariate polynomial in which the roots have a given multiplicity structure $\mu$. Traditionally, root functions are studied via the theory of symmetric polynomials; we extend this theory…
The roots of any polynomial of degree m with complex integer coefficients can be computed by manipulation of sequences made from distinct symbols and counting the different symbols in the sequences. This method requires only primitive…
This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…
The main purpose of this paper is solve polynomial equations that are satisfied by (generalized) polynomials. More exactly, we deal with the following problem: let $\mathbb{F}$ be a field with $\mathrm{char}(\mathbb{F})=0$ and $P\in…