Related papers: Splitting quaternion algebras over quadratic numbe…
We describe a simple approach to factorize non-commutative (nc) polynomials, that is, elements in free associative algebras (over a commutative field), into atoms (irreducible elements) based on (a special form of) their minimal linear…
Zeros of many ensembles of polynomials with random coefficients are asymptotically equidistributed near the unit circumference. We give quantitative estimates for such equidistribution in terms of the expected discrepancy and expected…
We solve unconditionally the class number one problem for the $2$-parameter family of real quadratic fields $\mathbb{Q}(\sqrt{d})$ with square-free discriminant $d=(an)^2+4a$ for positive odd integers $a$ and $n$.
A quantum mechanical search procedure to determine the real zeros of a polynomial is introduced. It is based on the construction of a spin observable whose eigenvalues coincide with the zeros of the polynomial. Subsequent quantum mechanical…
We study real quadratic fields $\mathbb{Q}(\sqrt{D})$ such that, for a given rational integer $m$, all $m$-multiples of totally positive integers are sums of squares. We prove quite sharp necessary and sufficient conditions for this to…
We present a new method for constructing $D$-dimensional minimally superintegrable systems based on block coordinate separation of variables. We give two new families of superintegrable systems with $N$ ($N\leq D$) singular terms of the…
We consider so-called squaring the square-puzzles where a given square (or rectangle) should be dissected into smaller squares. For a specific instance of such problems we demonstrate that a mathematically rigorous solution can be quite…
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.
A method of determining two factors of an odd integer without need of multiplication or division operation in iterative portion of computation is presented. It is feasible for an implementing algorithm to use only integer addition and…
A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…
Finding the solutions to a system of multivariate polynomial equations is a fundamental problem in mathematics and computer science. It involves evaluating the polynomials at many points, often chosen from a grid. In most current methods,…
We introduce the notion of maximal orders over quaternion algebras with orthogonal involution and give a classification over local fields, and a partial classification over algebraic number fields.
We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t…
Quantum algorithms are usually described as monolithic circuits, becoming large at modest input size. Near-term quantum architectures can only manage a small number of qubits. We develop an automated method to distribute quantum circuits…
This work formalizes efficient Fast Fourier-based multiplication algorithms for polynomials in quotient rings such as $\mathbb{Z}_{m}[x]/\left<x^{n}-a\right>$, with $n$ a power of 2 and $m$ a non necessarily prime integer. We also present a…
We present a zero decomposition theorem and an algorithm based on Wu's method, which computes a zero decomposition with multiplicity for a given zero-dimensional polynomial system. If the system satisfies some condition, the zero…
An algebraic method for evaluating bare nucleon matrix elements of quark operators is proposed. Thereby, bare nucleon matrix elements are traced back to vacuum matrix elements. The method is similar to the soft pion theorem. Matrix elements…
We obtain partition regularity results for homogeneous quadratic equations whose parametrized solutions admit nice factorizations into linear forms over rings of integers of imaginary quadratic fields. To do so, we develop number-theoretic…
Streamline-based quad meshing algorithms use smooth cross fields to partition surfaces into quadrilateral regions by tracing cross field separatrices. In practice, re-entrant corners and misalignment of singularities lead to small regions…
We show that $n$-bit integers can be factorized by independently running a quantum circuit with $\tilde{O}(n^{3/2})$ gates for $\sqrt{n}+4$ times, and then using polynomial-time classical post-processing. The correctness of the algorithm…