Related papers: Computing $n^{\rm th}$ roots in $SL_2$ and Fibonac…
The problems of square root from group element existing in $SL_2(F_p)$, $PSL_2(F_p)$ and $GL_2(F_p)$ were solved. The similar goal of root finding was reached in the GM algorithm adjoining an $n$-th root of a generator results in a discrete…
We study the asymptotics of the average number of squares (or quadratic residues) in Z_n and Z_n^*. Similar analyses are performed for cubes, square roots of 0 and 1, and cube roots of 0 and 1.
We present an explicit algorithmic method for computing square roots in quaternion algebras over global fields of characteristic different from 2.
For an odd prime $p$, we say a polynomial $f\in \mathbb F_p[X]$ computes square roots if $f(a)^2=a$ for all nonzero, perfect squares $a\in \mathbb F_p$. When $p\equiv 3 \mod 4$, it is easy to see that $f(X)=X^{\frac{p+1}{4}}$ is the…
Working over the split octonions over an algebraically closed field, we solve all polynomial equations in which all the coefficients but the constant term are scalar. As a consequence, we calculate the n-th roots of an octonion.
The structure of the tensor product representation v_{\lambda_1}(x)\otimes V_{\lambda_2}(y) of U_q(\hat sl_2) is investigated at roots of unity. A polynomial identity is derived as an outcome. Also, new bases of v_{\lambda_1}(x)\otimes…
We investigate some Galois groups of linearized polynomials over fields such as $\mathbb{F}_q(t)$. The space of roots of such a polynomial is a module for its Galois group. We present a realization of the symmetric powers of this module, as…
A method to construct in explicit form the generators of the simple roots of an arbitrary finite-dimensional representation of a quantum or standard semisimple algebra is found. The method is based on general results from the global theory…
We develop algebro-combinatorial tools for computing the Thom polynomials for the Morin singularities $A_i(-)$ ($i\ge 0$). The main tool is the function $F^{(i)}_r$ defined as a combination of Schur functions with certain numerical…
We present here a combinatorial method for computing cup-$i$ products and Steenrod squares of a simplicial set $X$. This method is essentially based on the determination of explicit formulae for the component morphisms of a higher diagonal…
A technique to compute arbitrary products of a class of Fibonacci $2\times2$ square matrices is proved in this work. General explicit solutions for non autonomous Fibonacci difference equations are obtained from these products. In the…
On the math-fun mailing list (7 May 2013), Neil Sloane asked to calculate the number of $n \times n$ matrices with entries in $\{0,1\}$ which are squares of other such matrices. In this paper we analyze the case that the arithmetic is in…
For each odd prime power q, and each integer k, we determine the sum of the k-th powers of all elements x in F_q for which both x and x+1 are squares in F_q^*. We also solve the analogous problem when one or both of x and x+1 is a…
This part is made of three sections. In the first section we study the family of polynomials whose roots are 4cos2 k{\pi}, (n \geqslant 3,1 \leqslant k < \frac{n}{2}). We obtain n2 in this manner a family of orthogonal polynomials. This…
For a root system R, a field K and a "choice of coefficients in K" we define a category of graded spaces with operators and study some of its properties. Then we assume that the coefficients are given by quantum binomials. We use basic…
The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive'…
In this paper, we derive explicit formulas for computing the roots of $ax^{2}+bx+c=0$ with $a$ being not invertible in split quaternion algebra. We also imitate the approach developed by Opfer, Janovska and Falcao etc. to verify our results…
It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…
We show in this paper that the roots $x_1$ and $x_2$ of a scalar quadratic polynomial $ax^2+bx+c=0$ with real or complex coefficients $a$, $b$ $c$ can be computed in a element-wise mixed stable manner, measured in a relative sense. We also…
The $n^{th}$ cyclotomic polynomial $\Phi_n(x)$ is the minimal polynomial of an $n^{th}$ primitive root of unity. Its coefficients are the subject of intensive study and some formulas are known for them. Here we are interested in formulas…