No abstract uploaded!

No abstract uploaded!

We define a hierarchy of Hamiltonian PDEs associated to an arbitrary tau-function in the semi-simple orbit of the Givental group action on genus expansions of Frobenius manifolds. We prove that the equations, the Hamiltonians, and the bracket are weightedhomogeneous polynomials in the derivatives of the dependent variables with respect to the space variable. In the particular case of a conformal (homogeneous) Frobenius structure, our hierarchy coincides with the Dubrovin–Zhang hierarchy that is canonically associated to the underlying Frobenius structure. Therefore, our approach allows to prove the polynomiality of the equations, Hamiltonians, and one of the Poisson brackets of these hierarchies, as conjectured by Dubrovin and Zhang.

No abstract uploaded!

In 1975, P. Erd\H os proposed the problem of determining the maximum number $f(n)$ of edges in a graph on $n$ vertices in which any two cycles are of different lengths. Let $f^{\ast}(n)$ be the maximum number of edges in a simple graph on $n$ vertices in which any two cycles are of different lengths. Let $M_n$ be the set of simple graphs on $n$ vertices in which any two cycles are of different lengths and with the edges of $f^{\ast}(n)$. Let $mc(n)$ be the maximum cycle length for all $G \in M_n$. In this paper, it is proved that for $n$ sufficiently large, $mc(n)\leq \frac{15}{16}n.$ \par We make the following conjecture: \par \bigskip \noindent{\bf Conjecture.} $$\lim_{n \rightarrow \infty} {mc(n)\over n}= 0.$$