We briefly survey our recent results about the Mumford goodness of several canonical metrics on the moduli spaces of Riemann surfaces, including the Weil-Petersson metric, the Ricci metric, the Perturbed Ricci metric and the Kahler-Einstein metric. We prove the dual Nakano negativity of the Weil-Petersson metric. As applications of these results we deduce certain important results about the <i>L</i> ²-cohomology groups of the logarithmic tangent bundle over the compactified moduli spaces.

As a discrete-time quantum walk model on the one-dimensional integer lattice Z, the quantum walk recently constructed byWang and Ye [CaishiWang and Xiaojuan Ye, Quantum walk in terms of quantum Bernoulli noises, Quantum Information Processing 15 (2016), 1897–1908] exhibits quite different features. In this paper, we extend this walk to a higher dimensional case. More precisely, for a general positive integer d ≥ 2, by using quantum Bernoulli noises we introduce a model of discrete-time quantum walk on the d-dimensional integer lattice Z^d, which we call the d-dimensional QBN walk. The d-dimensional QBN walk shares the same coin space with the quantum walk constructed by Wang and Ye, although it is a higher dimensional extension of the latter. Moreover we prove that, for a range of choices of its initial state, the d-dimensional QBN walk has a limit probability distribution of d-dimensional standard Gauss type, which is in sharp contrast with the case of the usual higher dimensional quantum walks. Some other results are also obtained.

We prove that a random map drawn from any class \mathfrak{C} of polynomial maps from (F_q)^n to (F_q)^{n+r} that is (i) totally random in the affine terms, and (ii) has a negligible chance of being not strongly one-way, provides a secure PRNG (hence a secure stream cipher) for any q. Plausible choices for are semi-sparse (i.e., the affine terms are truly random) systems and other systems that are easy to evaluate from a small (compared to a generic map) number of parameters. To our knowledge, there are no other positive results for provable security of specialized polynomial systems, in particular sparse ones (which are natural candidates to investigate for speed). We can build a family of provably secure stream ciphers a rough implementation of which at the same security level can be more than twice faster than an optimized QUAD (and any other provably secure stream ciphers proposed so far), and uses much less storage. This may also help build faster provably secure hashes. We also examine the effects of recent results on specialization on security, e.g., Aumasson-Meier (ICISC 2007), which precludes Merkle-Damgaard compression using polynomials systems {uniformly very sparse in every degree} from being universally collision-free. We conclude that our ideas are consistent with and complements these new results. We think that we can build secure primitives based on specialized (versus generic) polynomial maps which are more efficient.

We determine a basis of the (twisted) cocenter of graded affine Hecke algebras with arbitrary parameters. In this setting, we prove that the kernel of the (twisted) trace map is the commutator subspace (the Density theorem) and that the image is the space of good forms (the trace PaleyWiener theorem).

We consider a family \{\mathcal {H}^arepsilon\} _ {arepsilon&gt; 0} of \{\mathcal {H}^arepsilon\} _ {arepsilon&gt; 0} -periodic Schrdinger operators with \{\mathcal {H}^arepsilon\} _ {arepsilon&gt; 0} -interactions supported on a lattice of closed compact surfaces; within a minimal period cell one has \{\mathcal {H}^arepsilon\} _ {arepsilon&gt; 0} surfaces. We show that in the limit when \{\mathcal {H}^arepsilon\} _ {arepsilon&gt; 0} and the interactions strengths are appropriately scaled, \{\mathcal {H}^arepsilon\} _ {arepsilon&gt; 0} has at most \{\mathcal {H}^arepsilon\} _ {arepsilon&gt; 0} gaps within finite intervals, and moreover, the limiting behavior of the first \{\mathcal {H}^arepsilon\} _ {arepsilon&gt; 0} gaps can be completely controlled through a suitable choice of those surfaces and of the interactions strengths.