相关论文: Automatic generation of vertices for the Schroedin…

The branching algorithm is a fundamental technique for designing fast exponential-time algorithms to solve combinatorial optimization problems exactly. It divides the entire solution space into independent search branches using…

The Schr\"odingerisation method combined with the autonomozation technique in \cite{cjL23} converts general non-autonomous linear differential equations with non-unitary dynamics into systems of autonomous Schr\"odinger-type equations, via…

We present a scheme for the analytic computation of renormalization functions on the lattice, using a symbolic manipulation computer language. Our first nontrivial application is a new three-loop result for the topological susceptibility.

Findings by M. L. Lyra, S. Mayboroda and M. Filoche relate invertibility and positivity of a class of discrete Schr\"odinger matrices with the existence of the "Landscape Function", which provides an upper bound on all eigenvectors…

In this paper we construct the M\"obius domain wall fermions (MDWF) in the Schr\"odinger functional (SF) scheme for the SU(3) gauge theory by adding a boundary operator at the temporal boundary of the SF scheme setup and investigate the…

We determine O($a$) boundary improvement coefficients up to 1-loop level for the Schr\"odinger Functional coupling with improved gauge actions including plaquette and rectangle loops. These coefficients are required to implement 1-loop…

Conjecturing formulas and other symbolic relations occurs frequently in number theory and combinatorics. If we could automate conjecturing, we could benefit not only from speeding up, but also from finding conjectures previously out of our…

Azam and Richmond arXiv:2107.09149 obtained a recursion for the generating function of \(P_\lambda(y)\), itself a generating function enumerating by length partitions in the lower ideal \([0,\lambda]\) in the Young lattice. We show that…

This paper addresses the problem of computing the eigenvalues lying in the gaps of the essential spectrum of a periodic Schrodinger operator perturbed by a fast decreasing potential. We use a recently developed technique, the so called…

Similarly to the interaction lagrangian, the possible boundary conditions in quantum field theories on space-time manifolds with boundaries are strongly constrained by the symmetry and scaling properties of the theory. Based on this general…

We perform a renormalization group transformation to construct a lattice theory of chiral fermions. The field variables of the continuum theory are averaged over hypercubes to define lattice fields. Integrating out the continuum variables…

We introduce a new method to treat Majorana fermions and interactions with fermion-number violation on the GRACE system which has been developed for the automatic computation of the matrix elements for the processes of the standard model.…

We study discrete Schr\"odinger operators on the graphs corresponding to the triangular lattice, the hexagonal lattice, and the square lattice with next-nearest neighbor interactions. For each of these lattice geometries, we analyze the…

We propose and test an algorithm to simulate a lattice system of interacting fermions in two spatial dimensions. The approach is an extension of the entanglement renormalization technique [Phys. Rev. Lett. 99, 220405 (2007)] and the related…

Massless fermion field interacting with abelian dynamical gauge field on 2-dimensional random-block lattices are investigated using Hybrid Monte Carlo simulations. Preliminary results of the Wilson loop and the chiral correlation function…

A numerical method is developed for calculating the real time Green's functions of very large sparse Hamiltonian matrices, which exploits the numerical solution of the inhomogeneous time-dependent Schroedinger equation. The method has a…

The Gram-Schmidt algorithm produces a pairwise orthogonal set from a linearly independent set of vectors in an inner product vector space V. We give a linear algorithm that constructs vectors with the same span and which have pairwise the…

As a feasibility study for a scaling test we investigate the behavior of algorithms for dynamical fermions in the N_f=2 Schroedinger functional at an intermediate volume of 1 fm^4. Simulations were performed using HMC with two…

We propose a relax-and-round approach combined with a greedy search strategy for performing complex lattice basis reduction. Taking an optimization perspective, we introduce a relaxed version of the problem that, while still nonconvex, has…

We define cylindric generalisations of skew Macdonald functions when one of their parameters is set to zero. We define these functions as weighted sums over cylindric skew tableaux: fixing two integers n>2 and k>0 we shift an ordinary skew…