Let $h$ be a complex valued multiplicative function. For any $N\in \mathbb{N}$, we compute the value of the determinant $D_N:={det}_{i|N,j|N}\left(\frac{h\left(\left(i,j\right)\right)}{ij}\right)$ where $\left(i,j\right)$ denotes the greatest common divisor of $i$ and $j$, which appear in increasing order in rows and columns. Precisely we prove that $$D_N=\prod _{p{}^l\parallel N}{\left(\frac{1}{p^{l\left(l+1\right)}}\stackrel{l}{\prod _{i=1}}\left(h\left(p^i\right)-h\left(p^{i-1}\right)\right)\right)}^{\tau \left(N/p^l\right)}.$$ This means that $D_N^{1/\tau \left(N\right)}$ is a multiplicative function of $N$. The algebraic apparatus associated with this result allows us to prove the following two results. The first one is the characterization of real multiplicative functions $f\left(n\right)$, with $0\le f\left(p\right)<1$, as minimal values of certain...

The coefficients of the greatest common divisor of two polynomials $f$ and $g$ (GCD$(f,g)$) can be obtained from the Sylvester subresultant matrix $S_j(f,g)$ transformed to lower triangular form, where $1\le j\le d$ and $d=$ deg(GCD$(f,g)$) needs to be computed. Firstly, it is supposed that the coefficients of polynomials are given exactly. Transformations of $S_j(f,g)$ for an arbitrary allowable $j$ are in details described and an algorithm for the calculation of the GCD$(f,g)$ is formulated. If inexact polynomials are given, then an approximate greatest...

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 develop a recursive method for computing the $r$-removed $P$-orderings and $P$-orderings of order $h,$ the characteristic sequences associated to these and limits associated to these sequences for subsets $S$ of a Dedekind domain $D.$ This method is applied to compute these objects for $S=\mathbb{Z}$ and $S=\mathbb{Z}\setminus p\mathbb{Z}$.

In this paper we study an action $D$ of the absolute Galois group $\Gamma =Gal(\overline{\mathbb{Q}}/\mathbb{Q})$ on bicolored plane trees. In distinction with the similar action provided by the Grothendieck theory of “Dessins d’enfants” the action $D$ is induced by the action of $\Gamma$ on equivalence classes of conservative polynomials which are the simplest examples of postcritically finite rational functions. We establish some basic properties of the action $D$ and compare it with the Grothendieck action.

For n ∈ ℕ, L > 0, and p ≥ 1 let ${\kappa }_p(n,L)$ be the largest possible value of k for which there is a polynomial P ≢ 0 of the form $P\left(x\right)={\sum }_{j=0}^n{a}_j{x}^j$, $|a_0\left|\ge L\right({\sum }_{j=1}^n|a_j{{|}^p)}^{1/p}$, $a_j\in ℂ$, such that ${(x-1)}^k$ divides P(x). For n ∈ ℕ, L > 0, and q ≥ 1 let ${\mu }_q(n,L)$ be the smallest value of k for which there is a polynomial Q of degree k with complex coefficients such that $\left|Q\left(0\right)\right|>1/L({\sum }_{j=1}^n{\left|Q\left(j\right)\right|}^q{)}^{1/q}$. We find the size of ${\kappa }_p(n,L)$ and ${\mu }_q(n,L)$ for all n ∈ ℕ, L > 0, and 1 ≤ p,q ≤ ∞. The result about ${\mu }_{\infty }(n,L)$ is due to Coppersmith and Rivlin, but our proof is completely different and much shorter even in that special...