Related papers: Intersection multiplicities of Noetherian function…

We consider an algebraic variety and its foliation, both defined over a number field. We prove upper bounds for the geometric complexity of the intersection between a leaf of the foliation and a subvariety of complementary dimension (also…

We obtain upper bounds for the multiplicity of an isolated solution of a system of equations $f_1=...= f_M =0$ in $M$ variables, where the set of polynomials $(f_1,..., f_M)$ is a tuple of general position in a subvariety of a given…

Let $\Omega\subset{\mathbb R}^n$ be a relatively compact domain. A finite collection of real-valued functions on $\Omega$ is called a \emph{Noetherian chain} if the partial derivatives of each function are expressible as polynomials in the…

The \emph{Noetherian class} is a wide class of functions defined in terms of polynomial partial differential equations. It includes functions appearing naturally in various branches of mathematics (exponential, elliptic, modular, etc.). A…

The problem of estimating the multiplicity of the zero of a polynomial when restricted to the trajectory of a non-singular polynomial vector field, at one or several points, has been considered by authors in several different fields. The…

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

We show that the number of bifurcation points at infinity of a polynomial function f : C2 -> C is at most the number of branches at infinity of a generic fiber of f and that this upper bound can be diminished by one in certain cases.

Let $R$ be a polynomial ring over a field of characteristic zero and let $I \subset R$ be a graded ideal of height $N$ which is minimally generated by $N+1$ homogeneous polynomials. If $I=(f_1,...,f_{N+1})$ where $f_i$ has degree $d_i$ and…

We estimate the frequency of polynomial iterations which falls in a given multiplicative subgroup of a finite field of $p$ elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first $N$…

We consider a problem of bounding the maximal possible multiplicity of a zero at of some expansions $\sum a_i F_i(x)$, at a certain point $c,$ depending on the chosen family $\{F_i \}$. The most important example is a polynomial with $c=1.$…

Let $F(x, y) \in \mathbb{C}[x,y]$ be a polynomial of degree $d$ and let $G(x,y) \in \mathbb{C}[x,y]$ be a polynomial with $t$ monomials. We want to estimate the maximal multiplicity of a solution of the system $F(x,y) = G(x,y) = 0$. Our…

We bound the location of roots of polynomials that have nonnegative coefficients with respect to a fixed but arbitrary basis of the vector space of polynomials of degree at most $d$. For this, we interpret the basis polynomials as vector…

We prove an intersection formula for two plane branches in terms of their semigroups and key polynomials. Then we provide a strong version of Bayer's theorem on the set of intersection numbers of two branches and apply it to the logarithmic…

We give a necessary and sufficient condition for the maximum multiplicity of a root of the matching polynomial of a tree to be equal to the minimum number of vertex disjoint paths needed to cover it.

We provide upper bounds for the sum of the multiplicities of the non-constant irreducible factors that appear in the canonical decomposition of a polynomial $f(X)\in\mathbb{Z}[X]$, in case all the roots of $f$ lie inside an Apollonius…

Let f be a polynomial over the complex numbers with an isolated singularity at 0. We show that the multiplicity and the log canonical threshold of f at 0 are invariants of the link of f viewed as a contact submanifold of the sphere. This is…

Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate…

Under mild conditions on $n,p$, we give a lower bound on the number of $n$-variable balanced symmetric polynomials over finite fields $GF(p)$, where $p$ is a prime number. The existence of nonlinear balanced symmetric polynomials is an…

The matching polynomial of a graph encodes rich combinatorial information through its roots. We determine the maximum multiplicity of a non-zero matching polynomial root and characterize all graphs attaining the bound. We also generalize…

We define nondegenerate tropical complete intersections imitating the corresponding definition in complex algebraic geometry. As in the complex situation, all nonzero intersection multiplicity numbers between tropical hypersurfaces defining…