Related papers: Remarks on polynomial count varieties
We consider random orthonormal polynomials $$ P_{n}(x)=\sum_{i=0}^{n}\xi_{i}p_{i}(x), $$ where $\xi_{0}$, . . . , $\xi_{n}$ are independent random variables with zero mean, unit variance and uniformly bounded $(2+\ep_0)$-moments, and…
We prove uniform upper bounds on the number of integral points of bounded height on affine varieties. If $X$ is an irreducible affine variety of degree $d\geq 4$ in $\mathbb{A}^n$ which is not the preimage of a curve under a linear map…
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 each integer $n\geq 1$ we consider the unique polynomials $P, Q\in\mathbb{Q}[x]$ of smallest degree $n$ that are solutions of the equation $P(x)x^{n+1}+Q(x)(x+1)^{n+1}=1$. We derive numerous properties of these polynomials and their…
Let $f:\mathbb{K}^n\rightarrow\mathbb{K}^m$ be a generically finite polynomial map of degree $d$ between affine spaces. In arXiv:1411.5011 we proved that if $\mathbb{K}$ is the field of complex or real numbers, then the set $S_f$ of points…
The chromatic polynomial is characterized as the unique polynomial invariant of graphs, compatible with two interacting bialgebras structures: the first coproduct is given by partitions of vertices into two parts, the second one by a…
Let F be a function field of one variable over an algebraically closed field of characteristic zero, X a geometrically irreducible smooth projective variety over F, and L a line bundle on X. In this note, we will prove that if the…
Given a symmetric variety Y defined over the rationals and a non-zero polynomial with integer coefficients, we use techniques from homogeneous dynamics to establish conditions under which the polynomial can be made r-free for a Zariski…
An $n$-independent set in two dimensions is a set of nodes admitting (not necessarily unique) bivariate interpolation with polynomials of total degree at most $n.$ For an arbitrary $n$-independent node set $\mathcal X$ we are interested…
An algebraic variety $X$ is called a homogeneous space if there exists a transitive regular action of an algebraic group on $X$. We prove inequalities between the dimension of a homogeneous space of a linear algebraic group and its Picard…
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…
An enumerative problem on a variety $V$ is usually solved by reduction to intersection theory in the cohomology of a compactification of $V$. However, if the problem is invariant under a "nice" group action on $V$ (so that $V$ is…
We establish basic facts about the varieties of homogeneous polynomials divisible by powers of linear forms, and explain consequences for geometric complexity theory. This includes quadratic set-theoretic equations, a description of the…
We give a bound for the number of real solutions to systems of n polynomials in n variables, where the monomials appearing in different polynomials are distinct. This bound is smaller than the fewnomial bound if this structure of the…
Sommese has conjectured a classification of smooth projective varieties X containing, as an ample divisor, a P^d-bundle Y over a smooth variety Z. This conjecture is known if d>1, if dim(X)<5, or if Z admits a finite morphism to an Abelian…
We present bounds for the degree and the height of the polynomials arising in some central problems in effective algebraic geometry including the implicitation of rational maps and the effective Nullstellensatz over a variety. Our treatment…
Let $\mathbb{F}_q$ be a finite field with $q$ elements. M. Gerstenhaber and Irving Reiner has given two different methods to show the number of matrices with a given characteristic polynomial. In this talk, we will give another proof for…
A graph $X$ is said to be a pattern polynomial graph if its adjacency algebra is a coherent algebra. In this study we will find a necessary and sufficient condition for a graph to be a pattern polynomial graph. Some of the properties of the…
This paper investigates the number of monic integer polynomials of degree $n$ whose roots are all real and positive. We establish an asymptotic formula for the case of fixed trace by estimating the number of integer sequences satisfying…
Let $X$ be a smooth projective curve of genus $g\geq 2$ over the complex numbers. A holomorphic triple $(E_1,E_2,\phi)$ on $X$ consists of two holomorphic vector bundles $E_{1}$ and $E_{2}$ over $X$ and a holomorphic map $\phi \colon E_{2}…