Related papers: Euclid's Algorithm in quartic CM-fields
In this paper, we use Proximal Cubic regularized Newton Methods (PCNM) to optimize the sum of a smooth convex function and a non-smooth convex function, where we use inexact gradient and Hessian, and an inexact subsolver for the cubic…
We use geometric ideas coming from certain classic algebraic constructions to associate, to every classical field theory, a symmetric monoidal double functor from the double category of cobordisms with corners to a certain symmetric…
We give an asymptotic formula for class numbers of orders in cubic number fields.
Consider a quartic number field $K$ generated by a root of an irreducible quadrinomial of the form $ F(x)= x^4+ax^3+bx+c \in \Z[x]$. Let $i(K)$ denote the index of $K$. Engstrom \cite{Engstrom} established that $i(K)=2^u \cdot 3^v$ with $u…
Backward parabolic equations, such as the backward heat equation, are classical examples of ill-posed problems where solutions may not exist or depend continuously on the data. In this work, we study a least squares finite element method to…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
In this thesis, we develop algorithms similar to the Gaussian elimination algorithm in symplectic and split orthogonal similitude groups. As an application to this algorithm, we compute the spinor norm for split orthogonal groups. Also, we…
We prove that the smoothed counting function of the set of quartic fields, satisfying any finite set of local conditions, can be written as a linear combination of $X,X^{5/6}\log X,X^{5/6}$, upto an error term of $O(X^{13/16+o(1)})$. For…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
Euclidean conformal integrals for an arbitrary number of points in any dimension are evaluated. Conformal transformations in the Euclidean space can be formulated as the Moebius group in terms of Clifford algebras. This is used to interpret…
In this article we propose a consistent scheme of doing computations directly in four dimensions using conventional quantum field theory methods. This work is continuation of a stochastic quantization program reported earlier.
A unitary coupled-cluster (UCC) form for the wavefunction in the variational quantum eigensolver has been suggested as a systematic way to go beyond the mean-field approximation and include electron correlation in solving quantum chemistry…
We use the method of Shintani, as developed by Taniguchi and Thorne, to prove the joint cuspidal equidistribution of the shape of quartic fields paired with the shape of its cubic resolvent, when the fields are ordered by discriminant. Our…
I present a method of performing geometric quantization using cohomology groups extended via coefficient groups of different types. This is possible according to the Universal Coefficient Theorem (UTC). I also show that by using this method…
For a finite group $G$, we introduce a generalization of norm relations in the group algebra $\mathbb Q[G]$. We give necessary and sufficient criteria for the existence of such relations and apply them to obtain relations between the…
We use the spectral theory of Hilbert-Maass forms for real quadratic fields to obtain the asymptotics of some sums involving the number of representations as a sum of two squares in the ring of integers.
Elegant 'microlocal' methods have long since been extensively developed for the analysis of conventional Schroedinger eigenvalue problems. For technical reasons though these methods have not heretofore been applicable to quantum field…
In this paper we address the numerical approximation of linear fourth-order elliptic problems on polygonal meshes. In particular, we present a novel nonconforming virtual element discretization of arbitrary order of accuracy for biharmonic…
Quadratically optimized polynomials are described which are useful in multi-bosonic algorithms for Monte Carlo simulations of quantum field theories with fermions. Algorithms for the computation of the coefficients and roots of these…
We prove that, over a perfect field, Bredon motivic cohomology can be computed by Suslin-Friedlander complexes of equivariant equidimensional cycles. Partly based on this result we completely identify Bredon motivic cohomology of a…