Related papers: The F-pure threshold of quasi-homogeneous polynomi…
The paper deals with a complex polynomial $H$ in two variables having - a generic highest homogeneous part (without multiple zero lines), - nonconstant lower terms. In particular, under these conditions the polynomial $H$ has at least two…
We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\{1, ..., N\}\to\{1, ..., M\}$, its polynomial degree is the same for all…
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…
Call a curve $C \subset \mathbb{P}^2$ defined over $\mathbb{F}_q$ transverse-free if every line over $\mathbb{F}_q$ intersects $C$ at some closed point with multiplicity at least 2. In 2004, Poonen used a notion of density to treat Bertini…
We compute the diagonal F-thresholds of determinantal hypersurfaces arising from a generic matrix and from a generic symmetric matrix, as well as of the Pfaffian hypersurface arising from a generic skew-symmetric matrix of even size. The…
A holomorphic curve in moduli spaces is the image of a non-constant holomorphic map from a hyperbolic surface $B$ of type $(g,n)$ to the moduli space $\mathcal{M}_h$ of closed Riemann surfaces of genus $h$. We show that, when all peripheral…
We prove an unexpected general relation between the Jacobian syzygies of a projective hypersurface $V\subset \mathbb{P}^n$ with only isolated singularities and the nature of its singularities. This allows to establish a new method for the…
Let $\mathbb{F}_q[t]$ be the polynomial ring over the finite field $\mathbb{F}_q$ of $q$ elements. A polynomial in $\mathbb{F}_q[t]$ is called $m$-smooth (or $m$-friable) if all its irreducible factors are of degree at most $m$. In this…
We obtain a polynomial type upper bound for the size of the integral solutions of Thue equations $F(X,Y) = b$ defined over a totally real number field $K$, assuming that $F(X,1)$ has a root $\alpha$ such that $K(\alpha)$ is a CM-field.…
We study integer coefficient polynomials of fixed degree and maximum height $H$, that are irreducible by Dumas's criterion. We call such polynomials Dumas polynomials. We derive upper bounds on the number of Dumas polynomials, as $H$…
We show how to obtain linear combinations of polynomials in an orthogonal sequence $\{P_n\}_{n\geq 0}$, such as $Q_{n,k}(x)=\sum\limits_{i=0}^k a_{n,i}P_{n-i}(x)$, $a_{n,0}a_{n,k}\neq0$, that characterize quasi-orthogonal polynomials of…
A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree…
For a metric continuum $X$, we consider the $n^{\tiny\textrm{th}}$-symmetric product $F_{n}(X)$ defined as the hyperspace of all nonempty subsets of $X$ with at most $n$ points. The homogeneity degree $hd(X)$ of a continuum $X$ is the…
Let $f(\bf z,\bar{\bf z})$ be a strongly mixed homogeneous polynomial of 3 variables $\bf z=(z_1,z_2,z_3)$ of polar degree $q$ with an isolated singularity at the origin. It defines a smooth Riemann surface $C$ in the complex projective…
In this paper we find the tight closure of powers of parameter ideals of certain diagonal hypersurface rings. In many cases the associated graded ring with respect to tight closure filtration turns out to be Cohen-Macaulay. This helps us…
We introduce a new notion, called quasi-holomorphic maps. These are real smooth maps equipped with a structure that imitates the singularities and singularity stratifications of holomorphic maps on the source and target manifolds, although…
Given a polynomial P in several variables over an algebraically closed field, we show that except in some special cases that we fully describe, if one coefficient is allowed to vary, then the polynomial is irreducible for all but at most…
The approximate degree of a Boolean function f is the least degree of a real polynomial that approximates f pointwise to error at most 1/3. Approximate degree is known to be a lower bound on quantum query complexity. We resolve or nearly…
We determine the crossing number of polynomial size curve systems on standard surfaces, in terms of the genus, up to high precision.
We consider polynomials on the intersection of the closed positive orthant with the height-$1$ level hypersurface of certain polynomials with positive coefficients. We show that any polynomial strictly positive on such a semi-algebraic set…