Let N(f) denote the number of zeros of a sparse
multivariate polynomial f(x) over a finite field of
characteristic p. In this lecture, we discuss the
complexity and algorithms for computing the
reduction N(f) modulo a power of p.
In 1986 A. Ancona showed, using the Koebe one-quarter Theorem, that for a simply-connected planar domain the constant in the Hardy inequality with the distance to the boundary is greater than or equal to 1/16. We consider classes of domains for which there is a stronger version of the Koebe Theorem. This implies better estimates for the constant appearing in the Hardy inequality.
We will talk about transversality and intersection of submanifolds. Then we will define intersection forms of 4-manifolds and 6-manifolds and give some examples.
For a class of stationary Markov-dependent sequences
(A_n,B_n)
in R^2, we consider the random linear recursion S_n=A_n+B_n
S_{n-1}, n \in \zz, and show that the distribution tail of its
stationary solution has a power law decay.