Related papers: Extending the PSLQ Algorithm to Algebraic Integer …
Multiple elliptic polylogarithms can be written as (multiple) integrals of products of basic hypergeometric functions. The latter are computable, to arbitrary precision, using a q-difference equation and q-contiguous relations.
Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares…
A perturbative approach to quantum field theory involves the computation of loop integrals, as soon as one goes beyond the leading term in the perturbative expansion. First I review standard techniques for the computation of loop integrals.…
In this paper, we give explicit evaluation for some infinite series involving generalized (alternating) harmonic numbers. In addition, some formulas for generalized (alternating) harmonic numbers will also be derived.
We use computational linear algebra and commutative algebra to study spaces of relations satisfied by quadrilinear operations. The relations are analogues of associativity in the sense that they are quadratic (every term involves two…
In this article we present a method to implement orthogonal polynomials and many other special functions in Computer Algebra systems enabling the user to work with those functions appropriately, and in particular to verify different types…
We present here some results of applying the Cayley-Dickson process to certain alternative algebras (notably built upon Galois fields and congruence rings), in a manner which might yield new building blocks for cryptographic systems. We…
We study quantum algorithms working on classical probability distributions. We formulate four different models for accessing a classical probability distribution on a quantum computer, which are derived from previous work on the topic, and…
We investigate how well complex algebraic numbers can be approximated by algebraic numbers of degree at most n. We also investigate how well complex algebraic numbers can be approximated by algebraic integers of degree at most n+1. It…
We show the 3 by 3 magic square of squares problem equivalent to solving quartic polynomials with certain factorization constraints over an abelian extension of the rationals. We analyze a particular case in which said extension is assumed…
Let $\xi$ be an irrational algebraic real number and $(p_k / q_k)_{k \ge 1}$ denote the sequence of its convergents. Let $(u_n)_{n \geq 1}$ be a non-degenerate linear recurrence sequence of integers, which is not a polynomial sequence. We…
In this thesis quadratic and cubic algebras, which are extensions of SU(1,1) and SU(2) are studied in detail, with particular attention being given to their construction, their finite and infinite dimensional irreducible representations and…
By considering probability distributions over the set of assignments the expected truth values assignment to propositional variables are extended through linear operators, and the expected truth values of the clauses at any given…
Let k be an imaginary quadratic number field (with class number 1). We describe a new, essentially linear-time algorithm, to list all isomorphism classes of cubic extensions L/k up to a bound X on the norm of the relative discriminant…
The conjugation action of the complex orthogonal group on the polynomial functions on $n \times n$ matrices gives rise to a graded algebra of invariant polynomials. A spanning set of this algebra is in bijective correspondence to a set of…
We characterize all algebraic numbers $\alpha$ of degree $d\in\{4,5,6,7\}$ for which there exist four distinct algebraic conjugates $\alpha_1$, $\alpha_2$, $\alpha_3$, $\alpha_4$ of $\alpha$ satisfying the relation…
An infinite dimensional algebra, which is useful for deriving exact solutions of the generalized pairing problem, is introduced. A formalism for diagonalizing the corresponding Hamiltonian is also proposed. The theory is illustrated with…
In this paper, we give an algorithm that finds an epsilon-approximate solution to a mixed integer quadratic programming (MIQP) problem. The algorithm runs in polynomial time if the rank of the quadratic function and the number of integer…
General algebraic properties of the algebras of vector fields over quantum linear groups $GL_q(N)$ and $SL_q(N)$ are studied. These quantum algebras appears to be quite similar to the classical matrix algebra. In particular, quantum…
We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…