A Goldbach theorem for polynomials of low degree over odd finite fields
A new modulo computation algorithm
A note on multiplicatively e-perfect numbers.
A number-theoretic conjecture and its implication for set theory.
A quadratic field which is euclidean but not norm-euclidean.
A survey of divisibility tests with a historical perspective.
About division by 1.
An analysis of GCD and LCM matrices via the -factorization.
An awful problem about integers in base four
An improvement of Euclid's algorithm
The paper introduces the calculation of a greatest common divisor of two univariate polynomials. Euclid’s algorithm can be easily simulated by the reduction of the Sylvester matrix to an upper triangular form. This is performed by using - transformation and -factorization methods. Both procedures are described and numerically compared. Computations are performed in the floating point environment.
An upper bound for the norm of a gcd-related matrix.
Approximate polynomial GCD
The computation of polynomial greatest common divisor (GCD) ranks among basic algebraic problems with many applications, for example, in image processing and control theory. The problem of the GCD computing of two exact polynomials is well defined and can be solved symbolically, for example, by the oldest and commonly used Euclid’s algorithm. However, this is an ill-posed problem, particularly when some unknown noise is applied to the polynomial coefficients. Hence, new methods for the GCD computation...
Arithmetic progressions in a unique factorization domain
Arithmetic properties of numbers with restricted digits
Calculation of the greatest common divisor of perturbed polynomials
The coefficients of the greatest common divisor of two polynomials and (GCD) can be obtained from the Sylvester subresultant matrix transformed to lower triangular form, where and deg(GCD) needs to be computed. Firstly, it is supposed that the coefficients of polynomials are given exactly. Transformations of for an arbitrary allowable are in details described and an algorithm for the calculation of the GCD is formulated. If inexact polynomials are given, then an approximate greatest...
Caratteri di divisibilità per numeri impari
Comparison of algorithms for calculation of the greatest common divisor of several polynomials
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...
Concerning a conjecture of R. L. Graham
Convergence of series of dilated functions and spectral norms of GCD matrices
We establish a connection between the L² norm of sums of dilated functions whose jth Fourier coefficients are for some α ∈ (1/2,1), and the spectral norms of certain greatest common divisor (GCD) matrices. Utilizing recent bounds for these spectral norms, we obtain sharp conditions for the convergence in L² and for the almost everywhere convergence of series of dilated functions.
Divisibility sequences and powers of algebraic integers.