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

This paper is devoted to the study of the proximal point algorithm for solving monotone and nonmonotone nonlinear complementarity problems. The proximal point algorithm is to generate a sequence by solving subproblems that are regularizations of the original problem. After given an appropriate criterion for approximate solutions of subproblems by adopting a merit function, the proximal point algorithm is verified to have global and superlinear convergence properties. For the purpose of solving the subproblems efficiently, we introduce a generalized Newton method and show that only one Newton step is eventually needed to obtain a desired approximate solution that approximately satisfies the appropriate criterion under mild conditions. The motivations of this paper are twofold. One is analyzing the proximal point algorithm based on the generalized Fischer-Burmeister function which includes the Fischer-Burmeister function as special case, another one is trying to see if there are relativistic change on numerical performance when we adjust the parameter in the generalized Fischer-Burmeister.

We investigate a class of supersymmetric quantum mechanical theories (with two supercharges) having tensor-valued degrees of freedom which are dominated by melon diagrams in the large N limit. One motivation was to examine the interplay between supersymmetry and melonic dominance and potential implications for building toy models of holography. We find a definite tension between supersymmetry (with dynamical bosons) and melonic dominance in this class of systems. More specifically, our theories attain a low energy non-supersymmetric conformal fixed point. The origin of supersymmetry breaking lies in the need to regularize bosonic and fermionic degrees of freedom independently. We investigate various aspects of the low energy spectrum and also comment on related examples with different numbers of supercharges. Along the way we also derive some technical results for SL(2, ℝ) wavefunctions for fermionic excitations.

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.