相关论文: Automatic generation of vertices for the Schroedin…
An affine variety induces the structure of an algebraic matroid on the set of coordinates of the ambient space. The matroid has two natural decorations: a circuit polynomial attached to each circuit, and the degree of the projection map to…
Following Sklyanin's proposal in the periodic case, we derive the generating function of the Gaudin Hamiltonians with boundary terms. Our derivation is based on the quasi-classical expansion of the linear combination of the transfer matrix…
We introduce a new computer algebra system optimized for use in lattice perturbation theory as well as continuum perturbation theory and a new framework to perform automated perturbative calculations on top of said computer algebra system.…
We introduce the weighted graph Laplacian and the notion of Schr\"odinger operator on a locally finite weighted graph . Concerning essential self-adjointness, we extend Wojciechowski's and Dodziuk's results for graphs with vertex constant…
We discuss the functional Schroedinger picture for fermions in external fields for both stationary and time-dependent problems. We give formal results for the ground state and the solution of the time-dependent Schroedinger equation for QED…
We discuss an algorithm for the approximate solution of Schrodinger's equation for lattice gauge theory, using lattice SU(3) as an example. A basis is generated by repeatedly applying an effective Hamiltonian to a ``starting state.'' The…
We derive the spherical field formalism for fermions. We find that the spherical field method is free from certain difficulties which complicate lattice calculations, such as fermion doubling, missing axial anomalies, and computational…
We perform the sewing of two (dual) Ramond reggeon vertices and derive an algorithm by means of which the so obtained four-Ramond reggeon vertex may be explicitly computed at arbitrary oscillator (mass) level. A closed form of the…
Modular arithmetic is widely used in crytography and symbolic computation. This paper presents a vectorized Montgomery algorithm for modular multiplication, the key to fast modular arithmetic, that fully utilizes the SIMD instructions. We…
We describe a general algorithm for generating various families of ribbon tableaux and computing their spin polynomials. This algorithm is derived from a new matricial coding. An advantage of this new notation lies in the fact that it…
We present an algorithmic study for the simulation of two massless flavors of O(a) improved Wilson quarks with Schroedinger functional boundary conditions. The algorithm used is Hybrid Monte Carlo with two pseudo-fermion fields as proposed…
In this paper, we study averaging operators from an algebraic and combinatorial point of view. We first construct free averaging algebras in terms of a class of bracketed words called averaging words. We next apply this construction to…
We present a method to automatically derive the Feynman rules for mesonic chiral perturbation theory with a lattice regulator. The Feynman rules can be output both in a human-readable format and in a form suitable for an automated numerical…
The contributions of the improved fermion action of Sheikholeslami and Wohlert to the two loop coefficient of the expansion of the Schroedinger functional coupling in terms of the lattice coupling are calculated for the gauge group SU(3).…
The dual form of the massless Schwinger model on the lattice overcomes the complex action problems from two sources: a topological term, as well as non-zero chemical potential, making these physically interesting cases accessible to Monte…
A discretisation scheme for differential geometry is applied to the problem of constructing lattice actions, the naive and staggered action are thus derived. It is found that after specifying an ansatz for the space of fields, the…
Motivated by a rigidity-theoretic perspective on the Localization Problem in 2D, we develop an algorithm for computing circuit polynomials in the algebraic rigidity matroid associated to the Cayley-Menger ideal for $n$ points in 2D. We…
In this article, we introduce an algorithm for automatic generation and categorization of triangle geometry theorems.
We discuss a method for regularizing chiral gauge theories. The idea is to formulate the gauge fields on the lattice, while the fermion determinant is regularized and computed in the continuum. A simple effective action emerges which lends…
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…