17,527 research outputs found

    Solving Dirac equations on a 3D lattice with inverse Hamiltonian and spectral methods

    Get PDF
    A new method to solve the Dirac equation on a 3D lattice is proposed, in which the variational collapse problem is avoided by the inverse Hamiltonian method and the fermion doubling problem is avoided by performing spatial derivatives in momentum space with the help of the discrete Fourier transform, i.e., the spectral method. This method is demonstrated in solving the Dirac equation for a given spherical potential in 3D lattice space. In comparison with the results obtained by the shooting method, the differences in single particle energy are smaller than 10−410^{-4}~MeV, and the densities are almost identical, which demonstrates the high accuracy of the present method. The results obtained by applying this method without any modification to solve the Dirac equations for an axial deformed, non-axial deformed, and octupole deformed potential are provided and discussed.Comment: 18 pages, 6 figure

    Algorithms for Mumford curves

    Get PDF

    Knowledge-Driven Distractor Generation for Cloze-style Multiple Choice Questions

    Full text link
    In this paper, we propose a novel configurable framework to automatically generate distractive choices for open-domain cloze-style multiple-choice questions, which incorporates a general-purpose knowledge base to effectively create a small distractor candidate set, and a feature-rich learning-to-rank model to select distractors that are both plausible and reliable. Experimental results on datasets across four domains show that our framework yields distractors that are more plausible and reliable than previous methods. This dataset can also be used as a benchmark for distractor generation in the future.Comment: To appear at AAAI 202

    The qq-log-convexity of Domb's polynomials

    Full text link
    In this paper, we prove the qq-log-convexity of Domb's polynomials, which was conjectured by Sun in the study of Ramanujan-Sato type series for powers of π\pi. As a result, we obtain the log-convexity of Domb's numbers. Our proof is based on the qq-log-convexity of Narayana polynomials of type BB and a criterion for determining qq-log-convexity of self-reciprocal polynomials.Comment: arXiv admin note: substantial text overlap with arXiv:1308.273

    On the qq-log-convexity conjecture of Sun

    Full text link
    In his study of Ramanujan-Sato type series for 1/π1/\pi, Sun introduced a sequence of polynomials Sn(q)S_n(q) as given by Sn(q)=∑k=0n(nk)(2kk)(2(n−k)n−k)qk,S_n(q)=\sum\limits_{k=0}^n{n\choose k}{2k\choose k}{2(n-k)\choose n-k}q^k, and he conjectured that the polynomials Sn(q)S_n(q) are qq-log-convex. By imitating a result of Liu and Wang on generating new qq-log-convex sequences of polynomials from old ones, we obtain a sufficient condition for determining the qq-log-convexity of self-reciprocal polynomials. Based on this criterion, we then give an affirmative answer to Sun's conjecture

    Strongly Enhanced Second- and Third-harmonic Generation in Graphene Metasurfaces

    Get PDF
    • …
    corecore