We compute the partition function on the hemisphere of a class of two-dimensional (2,2) supersymmetric field theories including gauged linear sigma models. The result provides a general exact formula for the central charge of the D-brane placed at the boundary. It takes the form of Mellin-Barnes integral and the question of its convergence leads to the grade restriction rule concerning branes near the phase boundaries. We find expressions in various phases including the large volume formula in which a characteristic class called the Gamma class shows up. The two sphere partition function factorizes into two hemispheres glued by inverse to the annulus. The result can also be written in a form familiar in mirror symmetry, and suggests a way to find explicit mirror correspondence between branes.

We combine supersymmetric localization and the conformal bootstrap to study five-dimensional superconformal field theories. To begin, we classify the admissible counter-terms and derive a general relation between the five-sphere partition function and the conformal and flavor central charges. Along the way, we discover a new superconformal anomaly in five dimensions. We then propose a precise triple factorization formula for the five-sphere partition function, that incorporates instantons and is consistent with flavor symmetry enhancement. We numerically evaluate the central charges for the rank-one Seiberg and Morrison-Seiberg theories, and find strong evidence for their saturation of bootstrap bounds, thereby determining the spectra of long multiplets in these theories. Lastly, our results provide new evidence for the F-theorem and possibly a C-theorem in five-dimensional superconformal theories.

Based on three general guiding principles, i.e., no double occupancy constraint, accurate description of antiferromagnetism at half-filling, and the precise sign structure of the t-J model, a new ground state wave function has been constructed recently [Weng, New J. Phys. 13, 103039 (2011)]. In this paper, we specifically study such kind of variational ground state for the one-hole-doped anisotropic two-leg t-J ladder using variational Monte Carlo (VMC) method. The results are then systematically compared with those recently obtained by density matrix renormalization group (DMRG) simulation. An excellent agreement is found between the VMC and DMRG results, including a "quantum critical point" at the anisotropy parameter α = α_c ≈ 0.7 (with the parameters t/J=3), and the emergence of charge modulation and momentum (Fermi point) reconstruction at α > α_c due to the quantum interference of the sign structure. In particular, the wave function indicates that a Landau's quasiparticle description remains valid at α < α_c but fails at α > α_c due to the breakdown of the one-to-one correspondence of momentum and translational symmetry of the hole. The explicit form of the wave function provides a direct understanding on how the many-body strong correlation effect takes place non-perturbatively in a doped Mott insulator, which sheds interesting light on the two-dimensional case where the same type of wave function was proposed to describe the cuprate superconductor.

We conjecture that the level k U(N) Chern-Simons theory coupled to free anticommuting scalar matter in the fundamental is dual to non-minmal higher-spin Vasiliev gravity in dS4 with parity-violating phase \theta0 = \pi N/2k and Neumann boundary conditions for the scalar. Related conjectures are made for fundamental commuting spinor matter and critical theories. This generalizes a recent conjecture relating the minimal Type A Vasiliev theory in dS4 to the Sp(N) model with fundamental real anti-commuting scalars.

We present the Zhuang-Zi algorithm, a new method for solving multivariate polynomial equations over a finite field. We describe the algorithm and present examples, some of which cannot be solved with the fastest known algorithms.

In 2006, the inventors of TRMC public key cryptosystem proposed a new variant of TRMC, TRMC-4, which can resist the existing attack, in particular, the Joux et al attack. In this paper, we show that the new version is vulnerable to attack via the linearization equations (LE) method. For any given valid ciphertext and its corresponding TRMC-4 public key, we can derive the corresponding plaintext within 2^{24} F_{2^8}-operations, after performing once for the public key a computation of complexity less than 2^{34}. Our results are confirmed by computer experiments.

Recent developments in multivariate polynomial solving algorithms have made algebraic cryptanalysis a plausible threat to many cryptosystems. However, theoretical complexity estimates have shown this kind of attack unfeasible for most realistic applications. In this paper we present a strategy for computing Gröbner basis that challenges those complexity estimates. It uses a flexible partial enlargement technique together with reduced row echelon forms to generate lower degree elements–mutants. This new strategy surpasses old boundaries and obligates us to think of new paradigms for estimating complexity of Gröbner basis computation. The new proposed algorithm computed a Gröbner basis of a degree 2 random system with 32 variables and 32 equations using 30 GB which was never done before by any known Gröbner bases solver.

No abstract uploaded!

We provide a non conformal generalization of the Compère-Song-Strominger (CSS) boundary conditions for AdS3 gravity that breaks the \hat{u}(1) Kac-Moody-Virasoro symmetry to two u(1)s. The holographic dual specified by the new boundary conditions can be understood as an irrelevant deformation of a warped conformal field theory (WCFT). Upon consistent reduction to two dimensions, AdS3 gravity results in a deformed Jackiw-Teitelboim dilaton gravity model coupled to a Maxwell field. We show that near extremality the boundary conditions inherited from generalized CSS boundary conditions in three dimensions give rise to an effective action exhibiting the same symmetry breaking pattern as the complex Sachdev-Ye-Kitaev models. Besides the Schwarzian term reflecting the breaking of conformal symmetry, the effective action contains an additional term that captures the breaking of the \hat{u}(1) Kac-Moody symmetry.

In this paper, we show the claims in the original Kipnis-Shamir attack on the HFE cryptosystems and the improved attack by Courtois that the complexity of the attacks is polynomial in terms of the number of variables are invalid. We present computer experiments and a theoretical argument using basic algebraic geometry to explain why it is so. Furthermore we show that even with the help of the powerful new Gröbner basis algorithm like F_4, the Kipnis-Shamir attack still should be exponential but not polynomial. This again is supported by our theoretical argument.

In this paper we present a new variant of the Zhuang-Zi algorithm, which solves multivariate polynomial equations over a finite field by converting it into a single variable problem over a large extension field. The improvement is based on the newly developed concept of mutant in solving multivariate equations.

In this paper, we present an experimental analysis of HFE Challenge 2 (144 bit) type systems. We generate scaled versions of the full challenge fixing and guessing some unknowns. We use the MXL_3 algorithm, an efficient algorithm for computing Gröbner basis, to solve these scaled versions. We review the MXL_3 strategy and introduce our experimental results.

We revisit the spectrum of linear axisymmetric gravitational perturbations of the (near-)extreme Kerr black hole. Our aim is to characterise those perturbations that are responsible for the deviations away from extremality, and to contrast them with the linearized perturbations treated in the Newman-Penrose formalism. For the near horizon region of the (near-)extreme Kerr solution, i.e. the (near-)NHEK background, we provide a complete characterisation of axisymmetric modes. This involves an infinite tower of propagating modes together with the much subtler low-lying mode sectors that contain the deformations driving the black hole away from extremality. Our analysis includes their effects on the line element, their contributions to Iyer-Wald charges around the NHEK geometry, and how to reconstitute them as gravitational perturbations on Kerr. We present in detail how regularity conditions along the angular variables modify the dynamical properties of the low-lying sector, and in particular their role in the new developments of nearly-AdS_2 holography.

In this paper, a class of FETI-DP preconditioners is developed for a fast solution of the linear system arising from staggered discontinuous Galerkin discretization of the two-dimensional Stokes equations. The discretization has been recently developed and has the distinctive advantages that it is optimally convergent and has a good local conservation property. In order to efficiently solve the linear system, two kinds of FETI-DP preconditioners, namely, lumped and Dirichlet preconditioners, are considered and analyzed. Scalable bounds C (H/h) and C (1+ log (H/h)) 2 are proved for the lumped and Dirichlet preconditioners, respectively, with the constant C depending on the infsup constant of the discrete spaces but independent of any mesh parameters. Here H/h stands for the number of elements across each subdomain. Numerical results are presented to confirm the theoretical estimates.

We study a ground-state ansatz for the single-hole doped t-J model in two dimensions via a variational Monte Carlo (VMC) method. Such a single-hole wave function possesses finite angular momenta generated by hidden spin currents, which give rise to a novel ground state degeneracy in agreement with recent exact diagonalization (ED) and density matrix renormalization group (DMGR) results. We further show that the wave function can be decomposed into a quasiparticle component and an incoherent momentum distribution in excellent agreement with the DMRG results up to an 8×8 lattice. Such a two-component structure indicates the breakdown of Landau's one-to-one correspondence principle, and in particular, the quasiparticle spectral weight vanishes by a power law in the large sample-size limit. By contrast, turning off the phase string induced by the hole hopping in the so-called σ⋅t-J model, a conventional Bloch-wave wave function with a finite quasiparticle spectral weight can be recovered, also in agreement with the ED and DMRG results. The present study shows that a singular effect already takes place in the single-hole-doped Mott insulator, by which the bare hole is turned into a non-Landau quasiparticle with translational symmetry breaking. Generalizations to pairing and finite doping are briefly discussed.

MutantXL is an algorithm for solving systems of polynomial equations that was proposed at SCC 2008. This paper proposes two substantial improvements to this algorithm over GF(2) that result in significantly reduced memory usage. We present experimental results comparing MXL2 to the XL algorithm, the MutantXL algorithm and Magma’s implementation of F_4. For this comparison we have chosen small, randomly generated instances of the MQ problem and quadratic systems derived from HFE instances. In both cases, the largest matrices produced by MXL2 are substantially smaller than the ones produced by MutantXL and XL. Moreover, for a significant number of cases we even see a reduction of the size of the largest matrix when we compare MXL2 against Magma’s F_4 implementation.

In this paper, we first prove an explicit formula which bounds the degree of regularity of the family of HFEv (“HFE with vinegar”) and HFEv- (“HFE with vinegar and minus”) multivariate public key cryptosystems over a finite field of size q. The degree of regularity of the polynomial system derived from an HFEv- system is less than or equal to \frac{(q−1)(r+v+a−1)}{2}+2 if q is even and r+a is odd, \frac{(q−1)(r+v+a−1)}{2}+2 otherwise, where the parameters v, D, q, and a are parameters of the cryptosystem denoting respectively the number of vinegar variables, the degree of the HFE polynomial, the base field size, and the number of removed equations, and r is the “rank” paramter which in the general case is determined by D and q as r=⌊log_q (D−1)⌋+1. In particular, setting a = 0 gives us the case of HFEv where the degree of regularity is bound by \frac{(q−1)(r+v−1)}{2}+2 if q is even and r is odd, \frac{(q−1)(r+v)}{2}+2 otherwise. This formula provides the first solid theoretical estimate of the complexity of algebraic cryptanalysis of the HFEv- signature scheme, and as a corollary bounds on the complexity of a direct attack against the QUARTZ digital signature scheme. Based on some experimental evidence, we evaluate the complexity of solving QUARTZ directly using F_4/F_5 or similar Gröbner methods to be around 2^{92}.

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}

A human does not have to see all elephants to recognize an animal as an elephant. On contrast, current state-of-the-art deep learning approaches heavily depend on the variety of training samples and the capacity of the network. In practice, the size of network is always limited and it is impossible to access all the data samples. Under this circumstance, deep learning models are extremely fragile to human-imperceivable adversarial examples, which impose threats to all safety critical systems. Inspired by the association and attention mechanisms of the human brain, we propose reverse adversarial examples method that can greatly improve models' robustness on unseen data. Experiments show that our reverse adversarial method can improve accuracy on average 19.02% on ResNet18, MobileNet, and VGG16 on unseen data transformation. Besides, the proposed method is also applicable to compressed models and shows potential to compensate the robustness drop brought by model quantization - an absolute 30.78% accuracy improvement.

In this work, we develop conformal bootstrap for Galilean conformal field theory (GCFT). In a GCFT, the Hilbert space could be decomposed into quasiprimary states and its global descendants. Different from the usual conformal field theory, the quasi-primary states in a GCFT constitute multiplets, which are block-diagonized under the Galilean boost operator. More importantly the multiplets include the states of negative norms, indicating the theory is not unitary. We compute global blocks of the multiplets, and discuss the expansion of four-point functions in terms of the global blocks of the multiplets. Furthermore we do the harmonic analysis for the Galilean conformal symmetry and obtain an inversion formula. As the first step to apply the Galilean conformal bootstrap, we construct generalized Galilean free theory (GGFT) explicitly. We read the data of GGFT by using Taylor series expansion of four-point function and the inversion formula independently, and find exact agreement. We discuss some novel features in the Galilean conformal bootstrap, due to the non-semisimpleness of the Galilean conformal algebra and the non-unitarity of the GCFTs.

In this paper, we consider the numerical approximation of the three-dimensional poroelastic wave equations in the spherical coordinate system. One difficulty in the design of an efficient numerical scheme is that the problem is singular in the center and the polar axes of the computational domain. Nevertheless, we develop a hybrid finite difference/control volume method for solving this problem. Our method is explicit and is second order accurate in both space and time. Numerical results are shown to confirm the convergence rate of our method and the effectiveness to simulate wave propagation in poroelastic media in the spherical coordinate system.

In this paper, we proposed an idea to construct a general multivariate public key cryptographic (MPKC) scheme based on a user’s identity. In our construction, each user is distributed a unique identity by the key distribution center (KDC) and we use this key to generate user’s private keys. Thereafter, we use these private keys to produce the corresponding public key. This method can make key generating process easier so that the public key will reduce from dozens of Kilobyte to several bits. We then use our general scheme to construct practical identity-based signature schemes named ID-UOV and ID-Rainbow based on two well-known and promising MPKC signature schemes, respectively. Finally, we present the security analysis and give experiments for all of our proposed schemes and the baseline schemes. Comparison shows that our schemes are both efficient and practical.

A product formula is proved which involves the unitary group generated by a semibounded self-adjoint operator and an orthogonal projection P. It gives a partial answer to the question about existence of the limit which describes quantum Zeno dynamics in the subspace Ran P.

No abstract uploaded!

Let G=(V,E) be a locally finite connected weighted graph, and Δ be the usual graph Laplacian. In this article, we study blow-up problems for the nonlinear parabolic equation u_t = Δu + f(u) on G. The blow-up phenomenons for u_t = Δu + f(u) are discussed in terms of two cases: (i) an initial condition is given; (ii) a Dirichlet boundary condition is given. We prove that if f satisfies appropriate conditions, then the corresponding solutions will blow up in a finite time.