Related papers: F-pure thresholds of binomial hypersurfaces

Let K be F_q((T)), or more generally any field of characteristic p equipped with a valuation having a finite residue field of q elements. Then a polynomial f(x) in K[x] having k+1 nonzero coefficients has at most q^k distinct zeros in K. We…

The purpose of this paper is to point out a relation between the canonical sheaf and the intersection complex of a singular algebraic variety. We focus on the hypersurface case. Let $M$ be a complex manifold, $X\subset M$ a singular…

For any affine hypersurface defined by a complete symmetric polynomial in $k\geq 3$ variables of degree $m$ over the finite field $\mathbb{F}_{q}$ of $q$ elements, a special case of our theorem says that this hypersurface has at least…

We give a criterion when a polynomial $x^n-g$ is irreducible over a pseudofinite field. As an application we give an explicit description of algebraic closure of some pseudofinite fields of zero characteristic.

We give an algorithm to compute the periods of smooth projective hypersurfaces of any dimension. This is an improvement over existing algorithms which could only compute the periods of plane curves. Our algorithm reduces the evaluation of…

In a recent paper, Dimca and Nemethi pose the problem of finding a homogeneous polynomial f such that the homology of the complement of the hypersurface defined by f is torsion-free, but the homology of the Milnor fiber of f has torsion. We…

Let $F$ be a homogeneous polynomial in $S = \mathbb{C}[x_0,...,x_n]$. Our goal is to understand a particular polynomial decomposition of $F$; geometrically, we wish to determine when the hypersurface defined by $F$ in $\mathbb{P}^n$…

It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…

We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching polynomial of complete bipartite graphs with bounded weights…

Consider a polynomial F such that each variable appears in exactly one monomial. The hypersurface defined by the polynomial F is called a hypersurface with separable variables. A variety is called rigid if there are no nontrivial actions of…

Let $A/K$ be an absolutely simple abelian surface defined over a number field $K$. We give unconditional upper bounds for the number of prime ideals $\mathfrak{p}$ of $K$ with norm up to $x$ such that $A$ has supersingular reduction at…

In this paper we obtain an explicit formula for the number of hypersurfaces in a compact complex manifold X (passing through the right number of points), that has a simple node, a cusp or a tacnode. The hypersurfaces belong to a linear…

In this paper, we derive an explicit formula for constructing the confidence interval of binomial parameter with guaranteed coverage probability. The formula overcomes the limitation of normal approximation which is asymptotic in nature and…

We establish effective bounds on the number of periodic points of degree-$d$ polynomials $\phi$ defined over $p$-adic fields and number fields, under a mild reduction hypothesis that is satisfied by all unicritical polynomials $X^d + c$…

We calculate the fibre integrals of the hypersurface in a torus in the form of their Mellin transforms. Especially, our method works efficiently for an affine hypersurface defined by a so called simpliciable polynomial. The relations…

The objective of this article is to give an effective algebraic characterization of normal crossing hypersurfaces in complex manifolds. It is shown that a hypersurface has normal crossings if and only if it is a free divisor, has a radical…

We fix a counting function of multiplicities of algebraic points in a projective hypersurface over a number field, and take the sum over all algebraic points of bounded height and fixed degree. An upper bound for the sum with respect to…

In this paper we obtained the formula for the number of irreducible polynomials with degree $n$ over finite fields of characteristic two with given trace and subtrace. This formula is a generalization of the result of Cattell et al.(2003)…

For a function field $K$ and fixed polynomial $F\in K[x]$ and varying $f\in F$ (under certain restrictions) we give a lower bound for the degree of the greatest prime divisor of $F(f)$ in terms of the height of $f$, establishing a strong…

We obtain various irreducibility criteria for pairs of polynomials $(f(X),g(X))$ with integer coefficients whose resultant $Res(f,g)$ is a prime number, or is divisible by a sufficiently large prime number, and also for some of their linear…