Related papers: Note on the Ideal Exponentiation in Imaginary Quad…
We present a simple yet powerful and applicable quadrature based scheme for constructing optimal iterative methods. According to the, still unproved, Kung-Traub conjecture an optimal iterative method based on $n+1$ evaluations could achieve…
This paper presents in detail the originally developed Quadratic Point Estimate Method (QPEM), aimed at efficiently and accurately computing the first four output moments of probabilistic distributions, using 2n^2+1 sample (or sigma)…
We present new results and an algorithm for standard basis computations of a 0-dimensional ideal I in a power series ring or in the localization of a polynomial ring in finitely many variables over a field K. The algorithm provides a…
Gibbs sampling from continuous real-valued functions is a challenging problem of interest in machine learning. Here we leverage quantum Fourier transforms to build a quantum algorithm for this task when the function is periodic. We use the…
We introduce the Hidden Polynomial Function Graph Problem as a natural generalization of an abelian Hidden Subgroup Problem (HSP) where the subgroups and their cosets correspond to graphs of linear functions over the finite field F_p. For…
Computing the probability of a formula given the probabilities or weights associated with other formulas is a natural extension of logical inference to the probabilistic setting. Surprisingly, this problem has received little attention in…
We introduce a quantum algorithm that produces approximate solutions for combinatorial optimization problems. The algorithm depends on a positive integer p and the quality of the approximation improves as p is increased. The quantum circuit…
Quadratic Unconstrained Binary Optimization (QUBO) is a broad class of optimization problems with many practical applications. To solve its hard instances in an exact way, known classical algorithms require exponential time and several…
The quadratic unconstrained binary optimization (QUBO) problem arises in diverse optimization applications ranging from Ising spin problems to classical problems in graph theory and binary discrete optimization. The use of preprocessing to…
Quantum phase estimation is one of the key algorithms in the field of quantum computing, but up until now, only approximate expressions have been derived for the probability of error. We revisit these derivations, and find that by ensuring…
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…
A combinatorial formula to generate U(N) character expansions is presented. It is shown that the resulting character expansion formulas greatly simplify a number of problems where integrals over the group manifolds need to be calculated.…
Let I be the ideal corresponding to a set of general points $p_1,...,p_n \in P^2$. There recently has been progress in showing that a naive lower bound for the Hilbert functions of symbolic powers $I^{(m)}$ is in fact attained when n>9.…
For a given odd integer $n>1$, we provide some families of imaginary quadratic number fields of the form $\mathbb{Q}(\sqrt{x^2-t^n})$ whose ideal class group has a subgroup isomorphic to $\mathbb{Z}/n\mathbb{Z}$.
Deciding whether an ideal of a number field is principal and finding a generator is a fundamental problem with many applications in computational number theory. For indefinite quaternion algebras, the decision problem reduces to that in the…
This paper presents some algorithmic techniques to compute explicitly the noetherian operators associated to a class of ideals and modules over a polynomial ring. The procedures we include in this work can be easily encoded in computer…
Let $I_1\subset I_2\subset\dots$ be an increasing sequence of ideals of the ring $\Bbb Z[X]$, $X=(x_1,\dots,x_n)$ and let $I$ be their union. We propose an algorithm to compute the Gr\"obner base of $I$ under the assumption that the…
We study the asymptotic estimation of prime ideals that satisfy certain congruence and argument conditions in imaginary quadratic fields. We also discuss the phenomenon of Chebyshev's bias in the distribution of prime ideals among different…
As a cornerstone of automated reasoning, equational reasoning finds equivalences between symbolic expressions and fuels advances across scientific disciplines. Yet, its potential remains limited by the exponential growth of equivalent…
A method is presented for forming polynomial interpolants on squares and cubes, which are more efficient in the so-called Euclidean degree than other commonly used methods with the same number of collocation points. These methods have…