Related papers: Splitting quaternion algebras over quadratic numbe…
Schubert polynomials form a basis of all polynomials and appear in the study of cohomology rings of flag manifolds. The vanishing problem for Schubert polynomials asks if a coefficient of a Schubert polynomial is zero. We give a tableau…
Consider a sparse polynomial in several variables given explicitly as a sum of non-zero terms with coefficients in an effective field. In this paper, we present several algorithms for factoring such polynomials and related tasks (such as…
We calculate the zeros of an exponential polynomial of some variables by a classical algorithm and quantum algorithms which are based on the method of van Dam and Shparlinski, they treated the case of two variables, and compare with the…
This note presents new results for the squarefree value sets of quartic polynomials over the integers.
We consider sparse polynomials in $N$ variables over a finite field, and ask whether they vanish on a set $S^N$, where $S$ is a set of nonzero elements of the field. We see that if for a polynomial $f$, there is $\mathbf{c}\in S^N$ with $f…
Let $R$ be a ring with ${\bf 1}$ which is not commutative. Assume that a non-zero commutator in $R$ is not a zero divisor. Assume further that either $R$ is alternative, but not associative, or $R$ is associative and any commutator $v\in R$…
We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into partition functions of abstract combinatorial structures…
We propose a geometric explanation for the observation that generic quadratic polynomials over split quaternions may have up to six different factorizations while generic polynomials over Hamiltonian quaternions only have two. Split…
It is known that the quaternion algebras are central simple algebras and also clifford algebras. In this paper, we introduce a new class of quaternions called Lucas-Leonardo p-quaternions and derive several fundamental properties of these…
A linear quaternionic equation in one quaternionic variable q is of the form $a_1 q b_1+a_2 q b_2+ ... +a_m q b_m = c$, where the $a_i, b_j, c$ are given quaternionic coefficients. If introducing basis elements $\bf i, j, k$ of pure…
The relationship between a polynomial's zeros and factors is well known. If a is a zero of f(x) then (x-a) is a factor of f(x). In this paper, we generalize this idea to polynomials of two variables and with real coefficients. We consider…
We introduce a three-dimensional random point field using the concept of the quaternion determinant. Orthogonal polynomials on the space of pure quaternions are defined, and used to construct a kernel function similar to the Ginibre kernel.…
An efficient, when compared to exhaustive enumeration, algorithm for computing the number of square-free words of length $n$ over the alphabet $\{a, b, c\}$ is presented.
A famous conjecture about group algebras of torsion-free groups states that there is no zero divisor in such group algebras. A recent approach to settle the conjecture is to show the non-existence of zero divisors with respect to the length…
Consider a problem where 4k given vectors need to be partitioned into k clusters of four vectors each. A cluster of four vectors is called a quad, and the cost of a quad is the sum of the component-wise maxima of the four vectors in the…
We propose a method for finding gaps in the spectrum of a differential operator. When applied to the one-dimensional Hamiltonian of the quartic oscillator, a simple algebraic algorithm is proposed that, step by step, separates with a…
In this article we present a parallel modular algorithm to compute all solutions with multiplicities of a given zero-dimensional polynomial system of equations over the rationals. In fact, we compute a triangular decomposition using…
We construct the quaternion algebra [10] "geometrically" by a three dimensional analogue of the classic two dimensional geometric description of the complex field. The algebraic description of the multiplication operation in three…
Quantifier elimination over the reals is a central problem in computational real algebraic geometry, polynomial system solving and symbolic computation. Given a semi-algebraic formula (whose atoms are polynomial constraints) with…
We investigate quantum algorithms for classification, a fundamental problem in machine learning, with provable guarantees. Given $n$ $d$-dimensional data points, the state-of-the-art (and optimal) classical algorithm for training…