An integral domain $D$ is called a emph{locally GCD domain} if $D_{M}$ is aGCD domain for every maximal ideal $M$ of $D$. We study somering-theoretic properties of locally GCD domains. E.g., we show that $%D$ is a locally GCD domain if and only if $aDcap bD$ is locally principalfor all $0neq a,bin D$, and flat overrings of a locally GCD domain arelocally GCD. We also show that the t-class group...

In recent work we called a ring R a GGCD ring if the semigroup of finitely generated faithful multiplication ideals of R is closed under intersection. In this paper we introduce the concept of generalized GCD modules. An R-moduleM is a GGCD module if M is multiplication and the set of finitely generated faithful multiplication submodules of M is closed under intersection. We show that a ring R ...

Greatest common divisors and least common multiples of quotients of elements of integral domains have been investigated by Lüneburg and further by Jäger. In this paper we extend these results to invertible fractional ideals. We also lift our earlier study of the greatest common divisor and least common multiple of finitely generated faithful multiplication ideals to finitely generated projectiv...

All rings are assumed to be commutative with identity. A generalized GCD ring (G-GCD ring) is a ring (zero-divisors admitted) in which the intersection of every two finitely generated (f.g.) faithful multiplication ideals is a f.g. faithful multiplication ideal. Various properties of G-GCD rings are considered. We generalize some of Jäger’s and Lüneburg’s results to f.g. faithful multiplication...

It is well known that an integral domain D is a UFD if and only if every nonzero prime ideal of D contains a nonzero principal prime. This is the so-called Kaplansky’s theorem. In this paper, we give this type of characterizations of a graded PvMD (resp., G-GCD domain, GCD domain, Bézout domain, valuation domain, Krull domain, π-domain).

In this letter, generalized gamma distribution (GCD) is introduced as a new statistical model of spectral distribution to be applied to the likelihood ratio test performed in voice activity detection (VAD). A gradient-based on-line algorithm is proposed to estimate the parameters of GCD according to the maximum likelihood criterion. Experimental results show that the VAD algorithm implemented b...

• Greatest common divisor (GCD) algorithms. We begin with Euclid’s algorithm, and the extended Euclidean algorithm [2, 12]. We will then discuss variations and improvements such as Lehmer’s algorithm [14], the binary algorithms [12], generalized binary algorithms [20], and FFT-based methods. We will also discuss how to adapt GCD algorithms to compute modular inverses and to compute the Jacobi a...

Anti-circulant tensors have applications in exponential data fitting. They are special Hankel tensors. In this paper, we extend the definition of anti-circulant tensors to generalized anticirculant tensors by introducing a circulant index r such that the entries of the generating vector of a Hankel tensor are circulant with module r. In the special case when r=n, where n is the dimension of the...

We study a variant of the univariate approximate GCD problem, where the coefficients of one polynomial f(x)are known exactly, whereas the coefficients of the second polynomial g(x)may be perturbed. Our approach relies on the properties of the matrix which describes the operator of multiplication by gin the quotient ring C[x]/(f). In particular, the structure of the null space of the multiplicat...