Related papers: Extending the PSLQ Algorithm to Algebraic Integer …
We present an algorithm to find invariant poynomial transformations of integer sequences, using the classical invariant theory approach.
A formalism is given to count integer and rational solutions to polynomial equations with rational coefficients. These polynomials $P(x)$ are parameterized by three integers, labeling an elliptic curve. The counting of the rational…
Through the following, we establish the conditions which allow us to express recursive sequences of real numbers, enumerated through the recurrence relation a_{n+1} = Aa_n + Ba_{n-1}, by means of algebraic equations in two variables of…
Linear algebra algorithms often require some sort of iteration or recursion as is illustrated by standard algorithms for Gaussian elimination, matrix inversion, and transitive closure. A key characteristic shared by these algorithms is that…
In this note we augment the poly-Bernoulli family with two new combinatorial objects. We derive formulas for the relatives of the poly-Bernoulli numbers using the appropriate variations of combinatorial interpretations. Our goal is to show…
We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on…
Algebraic geometrical concepts are playing an increasing role in quantum applications such as coding, cryptography, tomography and computing. We point out here the prominent role played by Galois fields viewed as cyclotomic extensions of…
We develop a curved Koszul duality theory for algebras presented by quadratic-linear-constant relations over unital versions of binary quadratic operads. As an application, we study Poisson $n$-algebras given by polynomial functions on a…
We extend the algorithms of Robinson, Smyth, and McKee--Smyth to enumerate all real-rooted integer polynomials of a fixed degree, where the first few (at least three) leading coefficients are specified. Additionally, we introduce new linear…
We investigate the characters of some finite-dimensional representations of the quantum affine algebras $U_q(\hat{g})$ using the action of the copy of $U_q(g)$ embedded in it. First, we present an efficient algorithm for computing the…
We derive the algebraic relations of alternating and non-alternating finite harmonic sums up to the sums of depth~6. All relations for the sums up to weight~6 are given in explicit form. These relations depend on the structure of the index…
The Sequential Linear Quadratic (SLQ) algorithm is a continuous-time variant of the well-known Differential Dynamic Programming (DDP) technique with a Gauss-Newton Hessian approximation. This family of methods has gained popularity in the…
A method for obtaining complex analytic realizations for a class of deformed algebras based on their respective deformation mappings and their ordinary coherent states is introduced. Explicit results of such realizations are provided for…
We present a new algorithm for reconstructing an exact algebraic number from its approximate value using an improved parameterized integer relation construction method. Our result is consistent with the existence of error controlling on…
The present work includes some of the author's original researches on integer solutions of Diophantine liner equations and systems. The notion of "general integer solution" of a Diophantine linear equation with two unknowns is extended to…
The objective of this paper is, in the main, twofold: Firstly, to develop an algebraic setting for dealing with Bell polynomials and related extensions. Secondly, based on the author's previous work on multivariate Stirling polynomials…
Given a set of integers, one can easily construct the set of their pairwise distances. We consider the inverse problem: given a set of pairwise distances, find the integer set which realizes the pairwise distance set. This problem arises in…
We consider GLq(N)-covariant quantum algebras with generators satisfying quadratic polynomial relations. We show that, up to some inessential arbitrariness, there are only two kinds of such quantum algebras, namely, the algebras with…
We propose a quantum algorithm to solve systems of nonlinear algebraic equations. In the ideal case the complexity of the algorithm is linear in the number of variables $n$, which means our algorithm's complexity is less than $O(n^{3})$ of…
We obtain a presentation of Schur algebras (and q-Schur algebras) by generators and relations which is compatible with the usual presentation of the enveloping algebra (quantized enveloping algebra) corresponding to the Lie algebra gl(n) of…