Related papers: Legendre Polynomials Roots and the $F$-Pure Thresh…

In this article, we investigate F-pure thresholds of polynomials that are homogeneous under some N-grading, and have an isolated singularity at the origin. We characterize these invariants in terms of the base p expansion of the…

We find a formula, in terms of n, d and p, for the value of the F-pure threshold for the generic homogeneous polynomial of degree d in n variables over an algebraically closed field of characteristic p. We also show that, in every…

In this article we study F-pure thresholds (and, more generally, F-thresholds) of homogeneous polynomials in two variables over a field of characteristic p>0. Passing to a field extension, we factor such a polynomial into a product of…

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

In this note, we use estimates given in the recent preprint [Her11b]to deduce a formula for the F-pure threshold of a binomial hypersurface over a field of prime characteristic. These formulas are given in terms of the associated splitting…

Inspired by the work of Bhatt and Singh (see: arXiv:1307.1171) we compute the $F$-pure threshold of quasi-homogeneous polynomials. We first consider the case of a curve given by a quasi-homogeneous polynomial $f$ in three variables $x,y,z$…

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

In this article, we consider the conjectured relationship between F-purity and log canonicity for polynomials over the complex numbers. We associate to a collection M of n monomials a rational polytope P contained in [0,1]^n. Using P and…

Theorem 1 is a formula expressing the mean number of real roots of a random multihomogeneous system of polynomial equations as a multiple of the mean absolute value of the determinant of a random matrix. Theorem 2 derives closed form…

The $F$-pure threshold is the characteristic $p$ counter part of the log canonical threshold in characteristic zero. It is a numerical invariant associated to the singularities of a variety, hence computing its value is important. We give a…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

For an odd prime $p$, we say $f(X) \in {\mathbb F}_p[X]$ computes square roots in $\mathbb F_p$ if, for all nonzero perfect squares $a \in \mathbb F_p$, we have $f(a)^2 = a$. When $p \equiv 3 \mod 4$, it is well known that $f(X) =…

Expressions for the derivatives of the Legendre polynomials of the first kind with respect to the order of these polynomials are given. An explicit form for the fourth derivative is presented.

Let $\{Q_{n}(x)\}$ be a system of integral Legendre polynomials of degree exactly n,and let $\{P_{n}(x)\}$ be polar polynomials primitives of integral Legendre polynomials. We derive some identities and relations and extremal problems and…

We compute the $F$-pure threshold of the natural cone over flag varieties in characteristic $p>0$. Our calculations are mainly focused on flag varieties that are arithmetically Gorenstein, but we offer some results in the non-Gorenstein…

We provide a formula for $F$-thresholds of a Thom-Sebastiani type polynomial over a perfect field of prime characteristic. This result extends the formula for the $F$-pure threshold of a diagonal hypersurface. We also compute the first test…

We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…

We construct a class of multiple Legendre polynomials and prove that they satisfy an Ap\'ery-like recurrence. We give new upper bounds of the approximation measures of logarithms of rational numbers by algebraic numbers of bounded degree.…

We give a separation bound for the complex roots of a trinomial $f \in \mathbb{Z}[X]$. The logarithm of the inverse of our separation bound is polynomial in the size of the sparse encoding of $f$; in particular, it is polynomial in $\log…

In this paper, we give sharp upper and lower bounds for the number of degenerate monic (and arbitrary, not necessarily monic) polynomials with integer coefficients of fixed degree $n \ge 2$ and height bounded by $H \ge 2$. The polynomial is…