The computation of the greatest common divisor (GCD) has many applications in several disciplines including computer graphics, image deblurring problem or computing multiple roots of inexact polynomials. In this paper, Sylvester and Bézout matrices are considered for this purpose. The computation is divided into three stages. A rank revealing method is shortly mentioned in the first one and then the algorithms for calculation of an approximation of GCD are formulated. In the final stage the coefficients...

We prove that the global geometric theta-lifting functor for the dual pair $(H,G)$ is compatible with the Whittaker functors, where $(H,G)$ is one of the pairs $({\mathrm{S}𝕆}_{2n},{𝕊p}_{2n})$, $({𝕊p}_{2n},{\mathrm{S}𝕆}_{2n+2})$ or $({𝔾\mathrm{L}}_n,{𝔾\mathrm{L}}_{n+1})$. That is, the composition of the theta-lifting functor from $H$ to $G$ with the Whittaker functor for $G$ is isomorphic to the Whittaker functor for $H$.

We investigate complete arcs of degree greater than two, in projective planes over finite fields, arising from the set of rational points of a generalization of the Hermitian curve. The degree of the arcs is closely related to the number of rational points of a class of Artin-Schreier curves, which is calculated by using exponential sums via Coulter's approach. We also single out some examples of maximal curves.

The triples $(x,y,z)=(1,z^z-1,z)$, $(x,y,z)=(z^z-1,1,z)$, where $z\in \mathbb{N}$, satisfy the equation $x^y+y^x=z^z$. In this paper it is shown that the same equation has no integer solution with $min\{x,y,z\}>1$, thus a conjecture put forward by Z. Zhang, J. Luo, P. Z. Yuan (2013) is confirmed.

In this paper, we use Baker’s method, based on linear forms of logarithms, to solve a family of Thue equations associated with a family of number fields of degree 3. We obtain all solutions to the Thue equation$$\begin{array}{cc}\hfill {\Phi }_n(x,y)& =x^3+(n^8+2n^6-3n^5+3n^4-4n^3+5n^2-3n+3)x^{2}y\hfill \\ & -(n^3-2)n^{2}x{y}^2-y^3=\pm 1,\hfill \end{array}$$for $n\ge 0$.