Related papers: Representing the GCD as linear combination in non-…

We study the non-linear extension of integer programming with greatest common divisor constraints of the form $\gcd(f,g) \sim d$, where $f$ and $g$ are linear polynomials, $d$ is a positive integer, and $\sim$ is a relation among $\leq, =,…

The author in [7] was proved the generalized remainder and quotient theorems of polynomial in one indeterminate where the divisor is complete factorization to linear factors. In this paper we give the formula for the generalized remainder…

Let $R$ be a commutative ring with identity. An element $r \in R$ is said to be absolutely irreducible in $R$ if for all natural numbers $n>1$, $r^n$ has essentially only one factorization namely $r^n = r \cdots r$. If $r \in R$ is…

For a commutative ring R with many units, we describe the kernel of H_3(inc): H_3(GL_2(R), Z) --> H_3(GL_3(R), Z). Moreover we show that the elements of this kernel are of order at most two. As an application we study the indecomposable…

It is known that the greatest common divisor of two Fibonacci numbers is again a Fibonacci number. It is called the strong divisibility property. However, this property does not hold for every second order sequence. In this paper we study…

We study linear difference equations with variable coefficients in a ring using a new nonlinear method. In a ring with identity, if the homogeneous part of the linear equation has a solution in the unit group of the ring (i.e., a unitary…

A divisibility sequence is a sequence of integers $\{d_n\}$ such that $d_m$ divides $d_n$ if $m$ divides $n$. Results of Bugeaud, Corvaja, Zannier, among others, have shown that the gcd of two divisibility sequences corresponding to…

Let $G$ be a group. The subsets $A_1,\ldots,A_k$ of $G$ form a complete factorization of group $G$ if if they are pairwise disjoint and each element $g\in G$ is uniquely represented as $g=a_1\ldots a_k$, with $a_i\in A_i$. We prove the…

In this paper I consider all possible properties from commutative algebra for polynomial composites and monoid domains. The aim is full characterization of these structures. I start with the examination of group, ring, modules properties,…

In this paper, new and significant advances on the understanding the structure of p.p. rings and their generalizations have been made. Especially among them, it is proved that a commutative ring $R$ is a generalized p.p. ring if and only if…

The discrete Fourier transform of the greatest common divisor is a multiplicative function, if taken with respect to the same order of the primitive root of unity, which is a well known fact. As such, the transform can be expressed in the…

For a prime $p$ and an arbitrary finite group $G$, we show that if $p^{2}$ does not divide the size of each conjugacy class of \emph{$p$-regular} element (element of order not divisible by $p$) in $G$, then the largest power of $p$ dividing…

We reprove twice, in a simpler but as elementary way, a result by Hor\'ak and Skula (1985) who determined, among all sequences of integers defined by $$u_1=1,\quad u_2=R,\quad u_{n+2}=Pu_{n+1}-Qu_n$$ for some integers $P,Q,R$, those which…

Let $\mathcal{V}$ be an integral normal complex projective variety of dimension $n\geq 3$ and denote by $\mathcal{L}$ an ample line bundle on $\mathcal{V}$. By imposing that the linear system $|\mathcal{L}|$ contains an element…

Let $p$ be a fixed prime, and let $v(a)$ stand for the exponent of $p$ in the prime factorization of the integer $a$. Let $f$ and $g$ be two monic polynomials with integer coefficients and nonzero resultant $r$. Write $S$ for the maximum of…

We have shown how to express a tensor permutation matrix $p^{\otimes n}$ as a linear combination of the tensor products of the $p\times p$-Gell-Mann matrices. We have given the expression of a tensor permutation matrix $2\otimes 2 \otimes…

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

We classify all linear division sequences in the integers, a problem going back to at least the 1930s. As a corollary we also classify those linear recurrence sequences in the integers for which $(x_m,x_n)=\pm x_{(m,n)}$. We also show that…

For any polynomial $P \in \mathbb{C}[X_1,X_2,...,X_n]$, we describe a $\mathbb{C}$-vector space $F(P)$ of solutions of a linear system of equations coming from some algebraic partial differential equations such that the dimension of $F(P)$…

Ailon and Rudnick have shown that if $a,b \in C[T]$ are multiplicatively independent polynomials, then $\deg(\gcd(a^n-1,b^n-1))$ is bounded for all $n\ge1$. We show that if instead $a,b \in F[T]$ for a finite field $F$ of characteristic…