THE LEMNISCATE TREE OF A RANDOM POLYNOMIAL

With Kulkarni [11], they notably extend Crofton’s formula to the p-adic setting and derive new estimations on the num- ber of roots of a p-adic polynomial, establishing in

Now, let G be a connected graph consisting of two or more vertices, and let v be some vertex of G. For any simplicial graph G and any simplicial clique K 6 G, the line graph of

We will prove that under a Diophantine condition on the rota- tion number, the special flow has a polynomial decay of correlations between rectangles.. We will see later why

the values of the p consecutive coefficients a,, a^ ..., dp are given with cip-^o^ there exists an upper limit to the moduli of the p roots of smallest absolute value which is

Conclusion : A few itérations of Graeffe's root-squaring method followed by an application of Knuth's inequality will give a very tight bound for the absolute value of the roots of

Given a braid β with rightmost base point and whose closure is a knot K , denote by HH(β) the complex of bigraded Q-vector spaces obtained by taking the Hochschild homology of

K´atai, Distribution of the values of q-additive functions on polynomial sequences, Acta Math. Chowla, Theorems in the additive theory of

Regarding exact evaluation, we prove that the interlace polynomial is # P -hard to evaluate at every point of the plane, except at one line, where it is trivially polynomial