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.

Let$E$ç$S$^{1}be a set with Minkowski dimension$d(E)1$. We consider the Hardy-Littlewood maximal function, the Hilbert transform and the maximal Hilbert transform along the directions of$E$. The main result of this paper shows that these operators are bounded on$L$_{$rad$}^{$p$}(R^{2}) for$p>1+d(E)$and unbounded when$p<1+d(E)$. We also give some end-point results.

In this paper, we propose a conjectural multiplicity formula for general spherical varieties. For all the cases where a multiplicity formula has been proved, including Whittaker model, Gan-Gross-Prasad model, Ginzburg-Rallis model, Galois model and Shalika model, we show that the multiplicity formula in our conjecture matches the multiplicity formula that has been proved. We also give a proof of this multiplicity formula in two new cases.

The convergence to steady state solutions of the Euler equations for weighted compact nonlinear schemes (WCNS) [Deng X. and Zhang H. (2000), J. Comput. Phys. 165, 22-44 and Zhang S., Jiang S and Shu C.-W. (2008), J. Comput. Phys. 227, 7294-7321] is studied through numerical tests. Like most other shock capturing schemes, WCNS also suffers from the problem that the residue can not settle down to machine zero for the computation of the steady state solution which contains shock waves but hangs at the truncation error level. In this paper, the techniques studied in [Zhang S. and Shu. C.-W. (2007), J. Sci. Comput. 31, 273-305 and Zhang S., Jiang S and Shu. C.-W. (2011), J. Sci. Comput. 47, 216-238], to improve the convergence to steady state solutions for WENO schemes, are generalized to the WCNS. Detailed numerical studies in one and two dimensional cases are performed. Numerical tests demonstrate the effectiveness of these techniques when applied to WCNS. The residue of various order WCNS can settle down to machine zero for typical cases while the small post-shock oscillations can be removed.

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.$$