Related papers: Efficient computation of matrix elements of generi…
Using techniques from hopping expansion we identically map the lattice Schwinger model with Wilson fermions to a model of oriented loops on the lattice. This is done by first computing the explicit form of the fermion determinant in the…
Outliers contaminating data sets are a challenge to statistical estimators. Even a small fraction of outlying observations can heavily influence most classical statistical methods. In this paper we propose generalized spherical principal…
Using the overlap formulation, we calculate the fermionic determinant on the lattice for chiral fermions with twisted boundary conditions in two dimensions. When the lattice spacing tends to zero we recover the results of the usual…
Using the Sklyanin-Kharchev-Lebedev method of Separation of Variables adapted to the cyclic Baxter--Bazhanov--Stroganov or $\tau^{(2)}$-model, we derive factorized formulae for general finite-size Ising model spin matrix elements, proving a…
We study a matrix element of the field operator in the Lieb-Liniger model using the Bethe ansatz technique coupled with a functional approach to compute Slavnov determinants. We obtain the matrix element exactly in the thermodynamic limit…
The matrix element method utilizes ab initio calculations of probability densities as powerful discriminants for processes of interest in experimental particle physics. The method has already been used successfully at previous and current…
We propose a new iterative algorithm for generating a subset of eigenvalues and eigenvectors of large matrices which generalizes the method of optimal relaxations. We also give convergence criteria for the iterative process, investigate its…
We introduce a systematically improvable family of variational wave functions for the simulation of strongly correlated fermionic systems. This family consists of Slater determinants in an augmented Hilbert space involving "hidden"…
In this article, we discuss the efficient implementation of powerful domain decomposition smoothers for multigrid methods for high order discontinuous Galerkin (DG) finite element methods. In particular, we study the inversion of matrices…
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects we call m-schemes. We extend the known conditional deterministic subexponential time polynomial factoring…
We expand the most general lattice Dirac operator D in a basis of simple operators. The Ginsparg-Wilson equation turns into a system of coupled quadratic equations for the expansion coefficients. Our expansion of D allows for a natural…
Explicit expressions are given for the actions and radial matrix elements of basic radial observables on multi-dimensional spaces in a continuous sequence of orthonormal bases for unitary SU(1,1) irreps. Explicit expressions are also given…
We discuss how the peculiar properties of maximally twisted Wilson fermions can be exploited to set up a consistent LQCD computational scheme in which the CP-conserving matrix elements of the $\Delta S =1,2$ effective weak Hamiltonian can…
In the last few years it has been proposed a one-dimensional factorization of the fermion determinant in lattice QCD with Wilson-type fermions that leads to a block-local action of the auxiliary bosonic fields. Here we propose a…
We prove that any finite collection of quadratic forms (overlaps) of general deterministic matrices and eigenvectors of an $N\times N$ Wigner matrix has joint Gaussian fluctuations. This can be viewed as the random matrix analogue of the…
In a series of recent scientific contributions the role of bosonic and fermionic ladder operators in a macroscopic realm has been investigated. Creation, annihilation and number operators have been used in very different contexts, all…
The article considers arrowhead and diagonal-plus-rank-one matrices in F^(nxn) where F in R,C or H. H is a non-commutative field of quaternions. We give unified formulas for fast matrix-vector multiplications, determinants, and inverses for…
Explicit forms are given of matrix elements of generalized coherent operators based on Lie algebras su(1,1) and su(2). We also give a kind of factorization formula of the associated Laguerre polynomials.
Given a square, nonsingular matrix of univariate polynomials $\mathbf{F} \in \mathbb{K}[x]^{n \times n}$ over a field $\mathbb{K}$, we give a fast, deterministic algorithm for finding the Hermite normal form of $\mathbf{F}$ with complexity…
We consider the problem of estimating log-determinants of large, sparse, positive definite matrices. A key focus of our algorithm is to reduce computational cost, and it is based on sparse approximate inverses. The algorithm can be…