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 develop a multiscale tailored finite point method (MsTFPM) for second order elliptic equations with rough or highly oscillatory coefficients. The finite point method has been tailored to some particular properties of the problem, so that it can capture the multiscale solutions using coarse meshes without resolving the fine scale structure of the solution. Several numerical examples in one-and two-dimensions are provided to show the accuracy and convergence of the proposed method. In addition, some analysis results based on the maximum principle for the one-dimensional problem are proved.

We show that the Masur–Veech volumes and area Siegel–Veech constants can be obtained using intersection theory on strata of Abelian differ- entials with prescribed orders of zeros. As applications, we evaluate their large genus limits and compute the saddle connection Siegel–Veech constants for all strata. We also show that the same results hold for the spin and hyperelliptic components of the strata.

We establish a new relationship (the MLK correspondence) between twisted FJRW theory and local Gromov-Witten theory in all genera. As a consequence, we show that the Landau-Ginzburg/Calabi-Yau correspondence is implied by the crepant transformation conjecture for Fermat type in genus zero. We use this to then prove the Landau-Ginzburg/Calabi-Yau correspondence for Fermat type, generalizing the results of A. Chiodo and Y. Ruan.

We investigate variational principles for the approximation of quantum dynamics that apply for approximation manifolds that do not have complex linear tangent spaces. The first one, dating back to McLachlan (1964) minimizes the residuum of the time-dependent Schrödinger equation, while the second one, originating from the lecture notes of Kramer--Saraceno (1981), imposes the stationarity of an action functional. We characterize both principles in terms of metric and a symplectic orthogonality conditions, consider their conservation properties, and derive an elementary a-posteriori error estimate. As an application, we revisit the time-dependent Hartree approximation and frozen Gaussian wave packets.

A Tamed Transformation Method (TTM) cryptosystem was proposed by T.T.Moh in 1999. We describe how the first implementation scheme of the TTM system can be defeated. The computational complexity of our attack is 2^{33} computations on the finite field with 2^8 elements.

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 (Density theorem) and that the image is the space of good forms (trace Paley-Wiener theorem).

This paper introduces a new efficient algorithm, called MXL_3, for computing Gröbner bases of zero-dimensional ideals. The MXL_3 is based on XL algorithm, mutant strategy, and a new sufficient condition for a set of polynomials to be a Gröbner basis. We present experimental results comparing the behavior of MXL_3 to F_4 on HFE and random generated instances of the MQ problem. In both cases the first implementation of the MXL_3 algorithm succeeds faster and uses less memory than Magma’s implementation of F_4.

Error variance estimation plays an important role in statistical inference for high-dimensional regression models. This article concerns with error variance estimation in high-dimensional sparse additive model. We study the asymptotic behavior of the traditional mean squared errors, the naive estimate of error variance, and show that it may significantly underestimate the error variance due to spurious correlations that are even higher in nonparametric models than linear models. We further propose an accurate estimate for error variance in ultrahigh-dimensional sparse additive model by effectively integrating sure independence screening and refitted cross-validation techniques. The root <i>n</i> consistency and the asymptotic normality of the resulting estimate are established. We conduct Monte Carlo simulation study to examine the finite sample performance of the newly proposed estimate. A real data example is used to

No abstract uploaded!

We consider the effect of small scale random fluctuations of the constitutive coefficients on boundary measurements of solutions to radiative transfer equations. As the correlation length of the random oscillations tends to zero, the transport solution is well approximated by a deterministic, averaged, solution. In this paper, we analyze the random fluctuations to the averaged solution, which may be interpreted as a central limit correction to homogenization. With the inverse transport problem in mind, we characterize the random structure of the singular components of the transport measurement operator. In regimes of moderate scattering, such components provide stable reconstructions of the constitutive parameters in the transport equation. We show that the random fluctuations strongly depend on the decorrelation properties of the random medium.

We argue that a large class of N=2 Chern-Simons-matter theories in three dimensions have a continuous family of exact IR fixed points described by suitable quartic superpotentials, based on holomorphy. The entire family exists in the perturbative regime. A nontrivial check is performed by computing the 4-loop beta function of the quartic couplings, in the ’t Hooft limit, with a large number of flavors. We find that the 4-loop beta function can only deform the family of 2-loop fixed points, and does not change the dimension of this family. We further present an explicit computation of a perturbative correction to the Zamolodchikov metric on this space of three-dimensional superconformal field theories.

This paper discusses two encryption schemes to fix the Square scheme. Square+ uses the Plus modification of appending randomly chosen polynomials. Double-Layer Square uses a construction similar to some signature schemes, splitting the variables into two layers, one of which depends on the other.

A complex symplectic structure on a Lie algebra h is an integrable complex structure J with a closed non-degenerate (2, 0)-form. It is determined by J and the real part of the (2, 0)-form. Suppose that h is a semi-direct product g V, and both g and V are Lagrangian with respect to and totally real with respect to J. This note shows that g V is its own weak mirror image in the sense that the associated differential Gerstenhaber algebras controlling the extended deformations of and J are isomorphic. The geometry of (, J) on the semi-direct product g V is also shown to be equivalent to that of a torsion-free flat symplectic connection on the Lie algebra g. By further exploring a relation between (J, ) with hypersymplectic Lie algebras, we find an inductive process to build families of complex symplectic algebras of dimension 8 n from the data of the 4 n-dimensional ones.

Recently, sparse coding has been widely used in many applications ranging from image recovery to pattern recognition. The low mutual coherence of a dictionary is an important property that ensures the optimality of the sparse code generated from this dictionary. Indeed, most existing dictionary learning methods for sparse coding either implicitly or explicitly tried to learn an incoherent dictionary, which requires solving a very challenging non-convex optimization problem. In this paper, we proposed a hybrid alternating proximal algorithm for incoherent dictionary learning, and established its global convergence property. Such a convergent incoherent dictionary learning method is not only of theoretical interest, but also might benefit many sparse coding based applications.

In 2004, the inventors of TTM cryptosystems proposed a new scheme that could resist the existing attacks, in particular, the Goubin-Courtois attack [GC00] and the Ding-Schmidt attack [DS03]. In this paper, we show the new version is still insecure, and we find that the polynomial components of the cipher (F_i) satisfy nontrivial equations of the special form ∑_{i=0}^{n−1} a_i x_i + ∑_{0≤j≤k≤m−1} b_{jk} F_j F_k + ∑_{j=0}^{m−1} c_j F_j + d = 0, which could be found with 2^{38} computations. From these equations and consequently the linear equations we derive from these equations for any given ciphertext, we can eliminate some of the variables x_i by restricting the functions to an affine subspace, such that, on this subspace, we can trivialize the "lock" polynomials, which are the key structure to ensure its security in this new instance of TTM. Then with method similar to Ding-Schmidt [DS03], we can find the corresponding plaintext for any given ciphertext. The total computational complexity of the attack is less than 2^{39} operations over a finite field of size 2^8. Our results are further confirmed by computer experiments.

In this paper, we prove a closed formula for the degree of regularity of the family of HFE- (HFE Minus) multivariate public key cryptosystems over a finite field of size q. The degree of regularity of the polynomial system derived from an HFE- system is less than or equal to \begin{eqnarray*} \frac{(q-1)(\lfloor \log_q(D-1)\rfloor +a)}2 +2 & & \text{if is even and is odd,} \\ \frac{(q-1)(\lfloor \log_q(D-1)\rfloor+a+1)}2 +2 & & \text{otherwise.} \end{eqnarray*} Here q is the base field size, D the degree of the HFE polynomial, r=\lfloor \log_q(D-1)\rfloor +1 and a is the number of removed equations (Minus number). This allows us to present an estimate of the complexity of breaking the HFE Challenge 2: \begin{itemize} \item the complexity to break the HFE Challenge 2 directly using algebraic solvers is about 2^{96}. \end{itemize}

In this paper, we solve a problem of Kobayashi posed in (Complex Finsler vector bundles, American Mathematical Society, Providence, 1996) by introducing a Donaldson type functional on the space F + ( E ) of strongly pseudo-convex complex Finsler metrics on <i>E</i>a holomorphic vector bundle over a closed Khler manifold <i>M</i>. This Donaldson type functional is a generalization in the complex Finsler geometry setting of the original Donaldson functional and has FinslerEinstein metrics on <i>E</i> as its only critical points, at which this functional attains the absolute minimum.

We give a characterization of the action of the mapping class group on Thurston's space of measured laminations.

The problem is concerned about how large (e.g. the Hausdorff dimension) is Whitney's critical set contained in a given fractal. For this, we prove that the Moran arc, an arc containing a Moran set, is a Whitney's critical set. The excellent open set condition is defined, when the condition holds, the associated self-similar set contains a Whitney's critical subset of full dimension. As its application, the Sierpinski gasket and Koch curve have Whitney's critical subset of full dimension. Finally, we provide a self-similar tree which never contains any Whitney's critical set.

In the CT-track of the 2006 RSA conference, a new multivariate public key cryptosystem, which is called the Medium Field Equation (MFE) multivariate public key cryptosystem, is proposed by Wang, Yang, Hu and Lai. We use the second order linearization equation attack method by Patarin to break MFE. Given a ciphertext, we can derive the plaintext within 2^{23} F_{2^16}-multiplications, after performing once for any given public key a computation of complexity less than 2^{52}. We also propose a high order linearization equation (HOLE) attack on multivariate public key cryptosystems, which is a further generalization of the (first and second order) linearization equation (LE). This method can be used to attack extensions of the current MFE.

Sflash had recently been broken by Dubois, Stern, Shamir, etc., using a differential attack on the public key. The C^{*-} signature schemes are hence no longer practical. In this paper, we will study the new attack from the point view of symmetry, then (1) present a simple concept (projection) to modify several multivariate schemes to resist the new attacks; (2) demonstrate with practical examples that this simple method could work well; and (3) show that the same discussion of attack-and-defence applies to other big-field multivariates. The speed of encryption schemes is not affected, and we can still have a big-field multivariate signatures resisting the new differential attacks with speeds comparable to Sflash.

Let E be a real Banach space with a uniformly Gteaux differentiable norm and which possesses uniform normal structure, K a nonempty bounded closed convex subset of E,{T i} i= 1 N a finite family of asymptotically nonexpansive self-mappings on K with common sequence {k n} n= 1[1,),{t n},{s n} be two sequences in (0, 1) such that s n+ t n= 1 (n 1) and f be a contraction on K. Under suitable conditions on the sequences {s n},{t n}, we show the existence of a sequence {x n} satisfying the relation x n=(1 1 k n) x n+ s n k n f (x n)+ t n k n T r n n x n where n= l n N+ r n for some unique integers l n 0 and 1 r n N. Further we prove that {x n} converges strongly to a common fixed point of {T i} i= 1 N, which solves some variational inequality, provided x n T i x n 0 as n for i= 1, 2,, N. As an application, we prove that the iterative process defined by z 0 K, z n+ 1=(1 1 k n) z n+ s n k n f (z n)+ t n k n

We present a framework for solving the large-scale \ell_1-regularized convex minimization problem:<div class="gsh_dspfr">\ell_1

We consider a volume maximization program to construct hyperbolic structures on triangulated 3-manifolds, for which previous progress has lead to consider angle assignments which do not correspond to a hyperbolic metric on each simplex. We show that critical points of the generalized volume are associated to geometric structures modeled on the extended hyperbolic space-the natural extension of hyperbolic space by the de Sitter space-except for the degenerate case where all simplices are Euclidean in a generalized sense.