Related papers: Euclid's Algorithm in quartic CM-fields
These notes are concerned with harmonic and holomorphic functions on Euclidean spaces, using quaternions and Clifford algebras in higher dimensions. The main themes are weak solutions, the mean-value property, and subharmonicity.
In this paper we propose a heuristic technique for distributing points on the surface of a unit n-dimensional Euclidean sphere, generated as the orbit of a finite cyclic subgroup of orthogonal matrices, the so called cyclic group codes.…
We give a canonical form for a complex matrix, whose square is normal, under transformations of unitary similarity as well as a canonical form for a real matrix, whose square is normal, under transformations of orthogonal similarity.
In Continuum Light Cone Quantization (CLCQ) the treatment of scalar fields as operator valued distributions and properties of the accompanying test functions are recalled. Due to the paracompactness property of the Euclidean manifold these…
We develop a theory of sesquilinear forms over finite fields, investigating their representations via polynomials and coefficient matrices, along with classification results for these forms. Through their connection to quadratic forms, we…
This paper introduces two classes of totally real quartic number fields, one of biquadratic extensions and one of cyclic extensions, each of which has a non-principal Euclidean ideal. It generalizes techniques of Graves used to prove that…
This paper addresses the Optimal Transport problem, which is regularized by the square of Euclidean $\ell_2$-norm. It offers theoretical guarantees regarding the iteration complexities of the Sinkhorn--Knopp algorithm, Accelerated Gradient…
In previous work, the authors introduced "soft" methods to prove the effective (i.e. with power savings error) equidistribution of "shears" in cusped hyperbolic surfaces. In this paper, we study the same problem but now allow full use of…
We propose a method for obtaining rigorous and accurate upper and lower bounds on the eigenvalues of ordinary and partial differential operators in bounded regions of Euclidean space. It uses a boundary condition homotopy method starting…
We propose and study a generalized continued fraction algorithm that can be executed in an arbitrary imaginary quadratic field, the novelty being a non-restriction to the five Euclidean cases. Many hallmark properties of classical continued…
We introduce a new Partition of Unity Method for the numerical homogenization of elliptic partial differential equations with arbitrarily rough coefficients. We do not restrict to a particular ansatz space or the existence of a finite…
We approximate an elliptic problem with oscillatory coefficients using a problem of the same type, but with constant coefficients. We deliberately take an engineering perspective, where the information on the oscillatory coefficients in the…
We analyze the behavior of the Euclidean algorithm applied to pairs (g,f) of univariate nonconstant polynomials over a finite field F_q of q elements when the highest-degree polynomial g is fixed. Considering all the elements f of fixed…
This paper considers the equivalence problem for quasi-cyclic codes over finite fields. The results obtained are used to construct isodual quasi-cyclic codes.
The isomorphism problem means to decide if two given finite-dimensional simple algebras over the same centre are isomorphic and, if so, to construct an isomorphism between them. A solution to this problem has applications in computational…
We describe a practical algorithm for computing normal forms for semigroups and monoids with finite presentations satisfying so-called small overlap conditions. Small overlap conditions are natural conditions on the relations in a…
In this work, we characterize the existence of solution for a certain variational inequality by means of a classical minimax theorem. In addition, we propose a numerical algorithm for the solution of an inverse problem associated with a…
Every conformal field theory has the symmetry of taking each field to its adjoint. We consider here the quotient (orbifold) conformal field theory obtained by twisting with respect to this symmetry. A general method for computing such…
We construct an effective algorithmic method to compute the homological monodromy of a complex polynomial which is tame. As an application we show the existence of conjugated polynomials in a number field which are not topologically…
We introduce some general tools to design exact splitting methods to compute numerically semigroups generated by inhomogeneous quadratic differential operators. More precisely, we factorize these semigroups as products of semigroups that…