Related papers: An Algorithm for Computing Four-Ramond Vertices at…
We present the fermionic universal one--loop effective action obtained by integrating out heavy vector--like fermions at one loop using functional techniques. Even though previous approaches are able to handle integrating out heavy fermions…
Computational analysis with the finite element method requires geometrically accurate meshes. It is well known that high-order meshes can accurately capture curved surfaces with fewer degrees of freedom in comparison to low-order meshes.…
In this paper, we present an algorithm to generate the collider events of the GeV-scale oscillating sterile neutrinos with the ready-made event generation tools in the case that the crossing-widths among the nearly-degenerate fermionic…
The problem of map enumeration concerns counting connected spatial graphs, with a specified number $j$ of vertices, that can be embedded in a compact surface of genus $g$ in such a way that its complement yields a cellular decomposition of…
We compute the $n_h$ terms to the massive three loop vector-, axialvector-, scalar- and pseudoscalar form factors in a direct analytic calculation using the method of large moments. This method has the advantage, that the master integrals…
We consider quantum spin chains with a hidden free fermionic structure, distinct from the Jordan-Wigner transformation and its generalizations. We express selected local operators with the hidden fermions. This way we can exactly solve the…
In this paper we present approaches that address two issues that can occur when the level-set method is used to simulate two-fluid flows in engineering practice. The first issue concerns regularizing the Heaviside function on arbitrary…
Operator nucleon vertices are constructed in composite superconformal string model. Splitting of baryon Regge trajectories with the same quantum numbers but with opposite parity is provided by inclusion of simple additional components to…
In scientific computing and machine learning applications, matrices and more general multidimensional arrays (tensors) can often be approximated with the help of low-rank decompositions. Since matrices and tensors of fixed rank form smooth…
A deflated and restarted Lanczos algorithm to solve hermitian linear systems, and at the same time compute eigenvalues and eigenvectors for application to multiple right-hand sides, is described. For the first right-hand side, eigenvectors…
I present an approach to derive the full fermion-boson vertex function in four-dimensional Abelian gauge theory in terms of a set of normal (longitudinal) and transverse Ward-Takahashi relations for the fermion-boson and axial-vector…
We investigate the combination of a two-level sampling algorithm with distillation techniques to compute disconnected fermionic correlation functions. The method relies on a factorization of the quark propagator into domain-local…
I explore computer simulations of the dynamics of small multi-fermion lattice systems. The method is more general, but I concentrate on Hubbard type models where the fermions hop between a small number of connected sites. I use the natural…
In this paper, we focus on developing randomized algorithms for the computation of low multilinear rank approximations of tensors based on the random projection and the singular value decomposition. Following the theory of the singular…
The ability to efficiently simulate random quantum circuits using a classical computer is increasingly important for developing Noisy Intermediate-Scale Quantum devices. Here we present a tensor network states based algorithm specifically…
Bilevel optimization has gained prominence in various applications. In this study, we introduce a framework for solving bilevel optimization problems, where the variables in both the lower and upper levels are constrained on Riemannian…
We present a method for symbolic calculation of Feynman amplitudes for processes involving both massless and massive fermions. With this approach fermion strings in a specific amplitude can be easily evaluated and expressed as basic Lorentz…
We consider the problem of efficiently computing a discrete Morse complex on simplicial complexes of arbitrary dimension and very large size. Based on a common graph-based formalism, we analyze existing data structures for simplicial…
We present a new method for online prediction and learning of tensors ($N$-way arrays, $N >2$) from sequential measurements. We focus on the specific case of 3-D tensors and exploit a recently developed framework of structured tensor…
Certain fermionic quantum field theories are equivalent to probabilistic cellular automata, with fermionic occupation numbers associated to bits. We construct an automaton that represents a discrete model of spinor gravity in four…