Related papers: A greatest common divisor and a least common multi…
We bound the greatest common divisor of two coprime multivariable polynomials evaluated at algebraic numbers, generalizing work of Levin, and going towards conjectured inequalities of Silverman and Vojta. As an application, we prove results…
In this note we prove the following fact: if finite many elements $p_1,p_2,...,p_n$ of a unique factorization domain are given such that the greatest common divisor of each pair $(p_i,p_j)$ can be expressed as a linear combination of $p_i$…
We establish consequences of the moving form of Schmidt's Subspace Theorem. Indeed, we obtain inequalities that bound the logarithmic greatest common divisor of moving multivariable polynomials evaluated at moving $S$-unit arguments. In…
While studying a characteristic number of manifolds we noticed that the calculation was simply computing a multiple of a multinomial coefficient. We were, at the time, interested in computing the greatest common divisor of these…
New solution method for the systems of linear equations in commutative integral domains is proposed. Its complexity is the same that the complexity of the matrix multiplication.
Effective matrix methods for solving standard linear algebra problems in a commutative domains are discussed. Two of them are new. There are a methods for computing adjoined matrices and solving system of linear equations in a commutative…
Over an algebraically closed field, we describe the affine varieties of solutions to the linear equations $a(xb)=c$ and $a(bx)=c$ over the split-octonions. We also determine the dimensions of the solution sets of arbitrary linear monomial…
This paper describes infinite sets of polynomial equations in infinitely many variables with the property that the existence of a solution or even an approximate solution for every finite subset of the equations implies the existence of a…
Bilinear systems of equations are defined, motivated and analyzed for solvability. Elementary structure is mentioned and it is shown that all solutions may be obtained as rank one completions of a linear matrix polynomial derived from…
This paper is devoted to the study of statistical properties of the greatest common divisor and the least common multiple of random samples of positive integers.
Let $f$ be an arithmetical function. The matrix $[f[i,j]]_{n\times n}$ given by the value of $f$ in least common multiple of $[i,j]$, $f\big([i,j]\big)$ as its $i,\; j$ entry is called the least common multiple (LCM) matrix. We consider the…
In this article we study a class of generalised linear systems of difference equations with given non-consistent initial conditions and infinite many solutions. We take into consideration the case that the coefficients are square constant…
For a linear differential equation with a mild condition on its singularities, we discuss generalized continued fractions converging to expressions in its solutions and their derivatives. In the case of an order two linear differential…
We show that if the probabilistic logarithmic-space solver or the deterministic nearly logarithmic-space solver for undirected Laplacian matrices can be extended to solve slightly larger subclasses of linear systems, then they can be use to…
We study self-adjoint matrix polynomial equations in a single variable and prove existence of self-adjoint solutions under some assumptions on the leading form. Our main result is that any self-adjoint matrix polynomial equation of odd…
The Deligne-Simpson problem is formulated like this: give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\subset SL(n,{\bf C})$ or $c_j\subset sl(n,{\bf C})$ so that there exist irreducible $(p+1)$-tuples of…
We give an explicit description of the basic solutions of max-linear systems with two inequalities.
We show that if two monic polynomials with integer coefficients have square-free resultant, then all positive divisors of the resultant arise as the greatest common divisor of the values of the two polynomials at a suitable integer.
This note considers linear recurrences (also called linear difference equations) in unknowns indexed by the integers. We characterize a unique \emph{reduced} linear recurrence with the same solutions as a given linear recurrence, and…
A left-unilateral matrix equation is an algebraic equation of the form $$ a_0+a_1 x+a_2 x^2+... +a_n x^n=0 $$ where the coefficients $a_r$ and the unknown $x$ are square matrices of the same order and all coefficients are on the left…