Related papers: An Algorithm for Computing Four-Ramond Vertices at…
In this article we present an efficient algorithm to compute rotation intervals of circle maps of degree one. It is based on the computation of the rotation number of a monotone circle map of degree one with a constant section. The main…
Three algorithms of Gram-Schmidt type are given that produce an orthogonal decomposition of finite $d$-dimensional symmetric, alternating, or Hermitian forms over division rings. The first uses $d^3/3+O(d^2)$ ring operations with very…
Let $X_1,X_2,...$ be an infinite sequence of i.i.d. random vectors distributed exponentially with parameter $\lam .$ For each $y$ and $n\geq 1,$ form a graph $G_n(y)$ with vertex set $V_n = \{X_1,...,X_n\},$ two vertices are connected if…
We consider a framework for the construction of iterative schemes for operator equations that combine low-rank approximation in tensor formats and adaptive approximation in a basis. Under fairly general assumptions, we obtain a rigorous…
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…
Motivated by the goal of understanding quantum systems away from maximal chaos, in this note we derive a simple closed form expression for the fermion four point function of the large $q$ SYK model valid at arbitrary temperatures and to…
We introduce a numerical algorithm to stochastically sample the dual fermion perturbation series around the dynamical mean field theory, generating all topologies of two-particle interaction vertices. We show results in the weak and strong…
I present a numerical algorithm for direct evaluation of multiple Grassmann integrals. The approach is exact and suffers no Fermion sign problems. Memory requirements grow exponentially with the interaction range and the transverse size of…
In the simplified setting of the Schwinger model we present a systematic study on the simulation of dynamical fermions by global accept/reject steps that take into account the fermion determinant. A family of exact algorithms is developed,…
We give some methods for computing equations for certain Shimura curves, natural maps between them, and special points on them. We then illustrate these methods by working out several examples in varying degrees of detail. For instance, we…
We propose that the height-angle ray vector in matrix optics should be complex, based on a geometric algebra analysis. We also propose that the ray's 2x2 matrix operators should be right-acting, so that the matrix product succession would…
We compute the quark-gluon vertex in quenched lattice QCD, in the Landau gauge using an off-shell mean-field O(a)-improved fermion action. The complete vertex is computed in two specific kinematical limits, while the Dirac-vector part is…
We compute the modifications to the attractor mechanism due to fermionic corrections. In N=2, D=4 supergravity, at the fourth order, we find a new contribution to the horizon values of the scalar fields of the vector multiplets.
Our recent method to calculate renormalized functional determinants, the partial wave cutoff method, is extended for the evaluation of 4-D fermion one-loop effective action with arbitrary mass in certain types of radially symmetric,…
We present a quantum Monte Carlo method which allows calculations on many-fermion systems at finite temperatures without any sign decay. This enables simulations of the grand-canonical ensemble at large system sizes and low temperatures.…
We present an extension of the string-inspired technique suitable to the calculation of amplitudes and effective Lagrangians involving both vector and axial vector gauge fields. The technique is easily adaptable to problems involving…
We present a multi-level algorithm for the solution of five dimensional chiral fermion formulations, including domain wall and Mobius Fermions. The algorithm operates on the red-black preconditioned Hermitian operator, and directly…
We propose a novel rank aggregation method based on converting permutations into their corresponding Lehmer codes or other subdiagonal images. Lehmer codes, also known as inversion vectors, are vector representations of permutations in…
This report describes the computation of gradients by algorithmic differentiation for statistically optimum beamforming operations. Especially the derivation of complex-valued functions is a key component of this approach. Therefore the…
Infinite words, also known as streams, hold significant interest in computer science and mathematics, raising the natural question of how their complexity should be measured. We introduce cellular automaton reducibility as a measure of…