Related papers: Euclid's Algorithm in quartic CM-fields
The theory of harmonic vector fields on Riemannian manifolds is generalised to pseudo-Riemannian manifolds. Harmonic conformal gradient fields on pseudo-Euclidean hyperquadrics are classified up to congruence, as are harmonic Killing fields…
We present an algorithm based on continuation techniques that can be applied to solve numerically minimization problems with equality constraints. We focus on problems with a great number of local minima which are hard to obtain by local…
Let $\cl{M}$ be a Hilbert module of holomorphic functions over a natural function algebra $\mathcal{A}(\Omega)$, where $\Omega \subseteq \bb{C}^m$ is a bounded domain. Let $\cl{M}_0\subseteq \cl{M}$ be the submodule of functions vanishing…
We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions…
We construct two-dimensional non-commutative topological quantum field theories (TQFTs), one for each Hecke algebra corresponding to a finite Coxeter system. These TQFTs associate an invariant to each ciliated surface, which is a Laurent…
We find general solutions of some field equations (systems of equations) in pseudo-Euclidian spaces (so-called primitive field equations). These equations are used in the study of the Dirac equation and Yang-Mills equations. These equations…
Several perspectives of the cluster Gutzwiller method are briefly discussed. I show that the cluster mean-field method can be used for large inhomogeneous lattices, for computing local excitations, and for the time evolution of correlated…
Unit group computations are a cryptographic primitive for which one has a fast quantum algorithm, but the required number of qubits is $\tilde O(m^5)$. In this work we propose a modification of the algorithm for which the number of qubits…
We study the equidistribution of integers of the form $n= x_1^2 + \cdots + x_d^2$ under the arithmetic constraints given by $(\mathbb{Z}/p\mathbb{Z})^d$. The first step in addressing this problem is to construct modular forms whose Fourier…
The Hamiltonian eigenvalue problem for bound states of a quantum field theory is formulated in terms of Dirac's light-front coordinates and then approximated by the exponential-operator technique of the standard coupled-cluster method. This…
Algorithms to compute the quantum Fourier transform over a cyclic group are fundamental to many quantum algorithms. This paper describes such an algorithm and gives a proof of its correctness, tightening some claimed performance bounds…
We construct a kernel density estimator on symmetric spaces of non-compact type and establish an upper bound for its convergence rate, analogous to the minimax rate for classical kernel density estimators on Euclidean space. Symmetric…
We study real hyperfields, focusing in particular on those that are finite with cyclic positive cones. All real hyperfields have characteristic zero, although they can still be classified using the C-characteristic, an invariant that…
For any fixed positive integer $n$, we provide a method to compute all imaginary bicyclic biquadratic number fields with class number $n$, along with their class group structures, using the list of all imaginary quadratic number fields…
The lattice formulation provides a way to regularize, define and compute the Path Integral in a Quantum Field Theory. In this paper we review the theoretical foundations and the most basic algorithms required to implement a typical lattice…
We compute the cycle index sum of the symmetric group action on the homology of the configuration spaces of points in a Euclidean space with the condition that no $k$ of them are equal.
We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.
Spherical harmonics of degree 4 are widely used in volumetric frame fields design due to their ability to reproduce octahedral symmetry. In this paper we show how to use harmonics of degree 3 (octupoles) for the same purpose, thereby…
In this paper, we propose an improved numerical algorithm for solving minimax problems based on nonsmooth optimization, quadratic programming and iterative process. We also provide a rigorous proof of convergence for our algorithm under…
The hermitian u-invariants of a central simple algebra with involution are studied. In this context, a new technique is obtained to give bounds for the behavior of these invariants under a quadratic field extension. This is applied to…