Related papers: Euclid's Algorithm in quartic CM-fields
We review some aspects of harmonic analysis for the Euclidean conformal group, including conformally-invariant pairings, the Plancherel measure, and the shadow transform. We introduce two efficient methods for computing these quantities:…
We compute the dimensions of the Hochschild cohomology of symmetric groups over prime fields in low degrees. This involves us in studying some partition identities and generating functions of the dimensions in any fixed degree of the…
We obtain the ratio of semiclassical partition functions for the extension under mixed flux of the minimal surfaces subtending a circumference and a line in Euclidean $AdS_{3}\times S^{3}\times T^{4}$. We reduce the problem to the…
This work provides explicit characterizations and formulae for the minimal polynomials of a wide variety of structured $4\times 4$ matrices. These include symmetric, Hamiltonian and orthogonal matrices. Applications such as the complete…
We propose an algorithm to find a lower bound for the number of cyclic codes over any finite field with any given exponent. Besides, we give a formula to find the exponent of BCH codes.
A unitary (Euclidean) representation of a quiver is given by assigning to each vertex a unitary (Euclidean) vector space and to each arrow a linear mapping of the corresponding vector spaces. We recall an algorithm for reducing the matrices…
We present a brief introduction to QCD, the QCD phase diagram, and non-equilibrium phenomena in QCD. We emphasize aspects of the theory that can be addressed using computational methods, in particular euclidean path integral Monte Carlo,…
We prove a quantitative result on norm convergence of cubic ergodic averages with respect to $d\geq 1$ commuting measure-preserving transformations. We use harmonic analysis techniques, a key tool being estimates for singular Brascamp-Lieb…
Methodology is provided towards the solution of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the d-dimensional Euclidean…
Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input…
Given n points in Euclidean space E^d, we propose an algebraic algorithm to compute the best fitting (d-1)-cylinder. This algorithm computes the unknown direction of the axis of the cylinder. The location of the axis and the radius of the…
This note presents a short, transparent proof of the theorem that every Euclidean quadratic form over a normed integral domain is an Aubry-Davenport-Cassels form. The theorem, as formulated in the note, allows besides quadratic terms also…
We present an alternative account of the problem of classifying and finding normal forms for arbitrary bilinear forms. Beginning from basic results developed by Riehm, our solution to this problem hinges on the classification of…
In this paper we considerably extend the class of known $\alpha$-minimizing hypercones using sub-calibration methods. Indeed, the improvement of previous results follows from a careful analysis of special cubic and quartic polynomials.
We propose a randomized polynomial time algorithm for computing nontrivial zeros of quadratic forms in 4 or more variables over $\mathbb{F}_q(t)$, where $\mathbb{F}_q$ is a finite field of odd characteristic. The algorithm is based on a…
We give an algorithm to solve the quantum hidden subgroup problem for maximal cyclic non-normal subgroups of the affine group of a finite field (if the field has order $q$ then the group has order $q(q-1)$) with probability $1-\varepsilon$…
The predictions of the geometric collective model (GCM) for different sets of Hamiltonian parameter values are related by analytic scaling relations. For the quartic truncated form of the GCM -- which describes harmonic oscillator, rotor,…
In a previous paper (J. Comp. Phys. 230 (2011), 3668--3694), the authors proposed a new practical method for computing expected values of functionals of solutions for certain classes of elliptic partial differential equations with random…
Finding integer solutions to norm form equations is a classical Diophantine problem. Using the units of the associated coefficient ring, we can produce sequences of solutions to these equations. It is known that these solutions can be…
In this note, we construct explicit examples of $F_Q$-minimal quadratic forms of dimension $5$ and $7$, where $F_Q$ is the function field of a conic over a field $F$ of characteristic $2$. The construction uses the fact that any set of $n$…