LCM矩阵的可逆性与不定方程ayz+bzx+cxy=xyz+1的解

设S＝{x1,x2,…xn}是不同正整数的集合。已经知道当n≤7时在最大公因数封闭集S上的LCM矩阵是可逆的；也知道当n≥9时有无限多个包含整数1的最大公因数封闭集它们的LCM矩阵是奇异的；这篇文章的主要结果是证明当n=8且包含整数1时，除了20个最大公因数封闭集外，其余所有最大公因数封闭集上的LCM矩阵都是可逆的，而这归结为解一个不定方程。     

分次环与局部化

设Ｇ是有限群，Ｒ是有单位元的Ｇ－型分次环，Ｓ是包含在Ｒ的所有齐次元素组成的集合内的乘法封闭子集，Ｓ＝ｘ∈Ｇａｅ（ｇｘ，ｘ）ａ∈Ｓ，Ｄｅｇ（ａ）＝ｇ∈Ｇ｛｝，Ｓ＝＝ｘ∈Ｇａｅ（ｇｘ，ｘｈ）ａ∈Ｓ，Ｄｅｇ（ａ）＝ｇ∈Ｇ，ｈ∈Ｇ｛｝，ＭＧ（Ｒ）表示以Ｇ的元作为行列标的｜Ｇ｜阶矩阵环．本文证明了Ｒ关于Ｓ满足左Ｏｒｅ条件当且仅当Ｒ＃Ｇ关于Ｓ满足左Ｏｒｅ条件当且仅当ＭＧ（Ｒ）关于Ｓ＝满足左Ｏｒｅ条件，而且，Ｓ－１（Ｒ＃Ｇ）≌（Ｓ－１Ｒ）＃Ｇ和Ｓ＝，－１（ＭＧ（Ｒ））≌ＭＧ（Ｓ－１Ｒ）．     

一个最值不等式的两点新见

一个最值不等式的两点新见孙超（浙江嘉善一中３１４１００）１问题的由来与提出现行高中《代数》（下册）Ｐ９页例３介绍了一个最值不等式，原题如下：已知ｘ，ｙ∈Ｒ＋，ｘ＋ｙ＝Ｓ，ｘｙ＝Ｐ，求证：（１）如果Ｐ是定值，那么当且仅当ｘ＝ｙ时，Ｓ的值最小；（２）如果...     

（G）Fuzzy积分定义的Fuzzy测度

本文利用（２）中的一类Ｆｕｚｚｙ积分定义了一类Ｆｕｚｚｙ测度，并讨论了其性质和收敛性，且当Ｓ（ｘ，ｙ）＝ｘ＾ｙ时即得到文（４）的所有结果。     

不等式x~3 y~3 z~3≥3xyz的几何证法

我们先证ｘ２＋ｙ２≥２ｘｙ（ｘ、ｙ∈Ｒ＋,当ｘ＝ｙ时,等号成立）证明　如图１,设正方形ＡＢＣＤ的边长为ｘ,正方形ＢＥＦＪ的边长为ｙ,在ＡＢ上取ＡＨ＝ｙ,则ＨＢ＝ｘ－ｙ,故ＨＥ＝ＨＢ＋ＢＥ＝ｘ－ｙ＋ｙ＝ｘ,∴　Ｓ矩ＡＨＰＤ＝Ｓ矩ＨＥＦＫ＝ｘｙ．由图１显然有　Ｓ正ＡＢＣＤ＋Ｓ正ＢＥＦＪ≥Ｓ矩ＡＨＰＤ＋Ｓ矩ＨＥＦＫ,即　　　ｘ２＋ｙ２≥２ｘｙ（当且仅当ｘ＝ｙ时,等号成立）再证　ｘ３＋ｙ３＋ｚ３≥３ｘｙｚ（ｘ、ｙ、ｚ∈Ｒ＋,当且仅当ｘ＝ｙ＝ｚ时,等号成立）证明　如图２,设三个正方体ＶＡＢ、ＶＣＤ、ＶＥＦ…     

本原分式 Artin 的 Exchange 环上矩阵环

文章证明了：如果Ｒ或要为本原Ａｒｔｉｎ的Ｅｘｃｈａｎｇｅ环,则Ｍｎ（Ｒ）≌（Ｓ）当且仅当Ｒ≌Ｓ。     

布尔矩阵广义逆A－ω，A－d，A－ω

设Ａ是布尔矩阵，而矩阵Ｇ满足ＡＧＡ＝Ａ．（１）如果对所有Ａｘ＝ｙ的向量ｘ，ｙ．有ω（Ｇｙ）≤ω（ｘ）（＊）称Ｇ是Ａ的一个极小权ｇ－逆，表示为Ａ－ω．（２）如果对所有向量ｘ，ｙ，有ｄ（ＡＧｙ，ｙ）≤ｄ（Ａｘ，ｙ）（＊＊）称Ｇ是Ａ的最小距离ｇ－逆，表示为Ａ－ｄ．（３）如果（＊）和（＊＊）都成立，就称Ｇ是极小权最小距离ｇ－逆，表示为Ａ－ωｄ．本文研究这三类广义逆矩阵的最大逆的存在性及表示式．主要结果如下：假定对于矩阵Ａ．Ａ－ω，Ａ－ｄ，Ａ－ωｄ分别存在，那么．（１）存在最大Ａ－ω，当且仅当Ａ中设有两个相同的非零列，且最大Ａ－ω为Ａω＝［ＩＣＡＴ］Ｃ．（２）最大Ａ－ｄ存在，且为Ａｄ＝［ＡＴＡＣＡＴ＋ＡＴ（ＪＡＴ）Ｃ］Ｃ．（３）存在最大Ａ－ωｄ，当且仅当Ａ的所有非零列向量线性独立，且最大Ａ－ωｄ为Ａωｄ＝［ＡＴＡｃＡＴ＋ＡＴ（ＪＡＴ）ｃ＋（ＡＴＪ）ｃＡＴ］Ｃ．其中Ｊ为全１矩阵     

｛0,1,3｝问题摄动形式所对应的测度

给定实数λ,α以及Ｒ上（以λ,α为参数）的压缩自相似映射Ｓ１（ｘ）＝λｘ, Ｓ２（ｘ）＝ λｘ＋ａ, Ｓ３（ｘ）＝ λｘ＋３,记满足测度方程ｖ＝（１／３）∑ｉ＝１ｖｏＳｉ－１的唯一概率测度为ｕλ,α本文得到：（１）当固定 λ∈Ａ Ｅ（１／３, ２／５）时,则在 Ｌｅｂｅｓｇｕｅ测度意义下,对于 ａ．ｅ．的 ａ∈（０,１）,测度 ｕλ,α绝对连续,且存在平方可积密度．（２）若λ－１是 Ｐ．Ｖ．数,且 α是λ的有理系数多项式,则测度ｕλ,α是奇异测度．     

最佳L2局部逼近存在唯一的充分必要条件

本文给出了最佳Ｌ２局部逼近的存在唯一性定理，设ｆ∈Ｌ２（０，δ），Ｓｎ＝ｓｐａｎ（ｕ０，ｕ１，．．．Ｕｎ－１）Ｃ＾ｎ－１（０，δ），且ｄｅｔＷｎ（ｕ０，ｕ１，．．．ｕｎ－１；０）≠０，那么，当ｘ→０时，网（Ｐｘ（ｆ，Ｓｎ）收敛于Ｓｎ中某元素Ｐ０（ｆ，Ｓｎ）的充要条件为：ｆ＝Ｐｎ－１＋ｈ，其中Ｐｎ－１（ｔ）＝ｎ－１∑ｉ＝１ａｉｔｉ（ｈ，１）ｘ＝０（Ｘ＾ｎ），ｘ→０，且Ｐ０（ｆ，Ｓｎ）＝ＵＷ＾－１ｎＡ     

关于Szasz—Kantorovich算子的强逆不等式

本文对Ｓｚａｓｚ－Ｋａｎｔｏｒｏｖｉｃｈ算子Ｓｎ＾＊（ｆ，ｘ）证明了，当１〈ｐ≤∝时存在某一正整数ｍ，使得ｗψ＾２（ｆ；１／√ｎ）ｐ≤Ｍ（‖Ｓｎ＾＊（ｆ，ｘ）－ｆ‖ｐ＋‖Ｓｍｍ＾＊（ｆ，ｘ）－ｆ‖ｐ），ψ（ｘ）＾２＝ｘ，Ｍ〉０，ｗψ＾（ｆ，ｔ）ｐ为Ｄｉｔｚａｉｎ和Ｔｏｔｉｋ光滑模〔２〕。     

GCD和GCUD矩阵行列式的一个不等式（英）

Let S = {x₁, x₂,..., x_n} be a set of distinct positive integers. The n x n matrix (S) whose i, j-entry is the greatest common divisor (x_i, x_j) of x_i and x_j is called the GCD matrix on S. A divisor d of x is said to be a unitary divisor of x if (d, x/d) = 1. The greatest common unitary divisor (GCUD) matrix (S^**) is defined analogously. We show that if S is both GCD-closed and GCUD-closed, then det(S^**) ≥ det(S), where the equality holds if and Only if (S^**) = (S).     

有限个互素因子链上幂GCD矩阵与幂LCM矩阵的行列式的整除性

设S={x1,x2,...,xn}是由n个不同的正整数组成的集合,并设a为正整数.如果一个n阶矩阵的第i行j列元素是S中元素xi和xj的最大公因子的a次幂(xi,xj)a,则称该矩阵为定义在S上的a次幂最大公因子(GCD)矩阵,用(Sa)表示;类似定义a次幂LCM矩阵[Sa].如果存在{1,2,...,n}上的一个置换σ使得xσ(1)|xσ(2)|···|xσ(n),则称S为一个因子链.如果存在正整数k,使得S=S1∪S2∪···∪Sk,其中每一个Si(1ik)均为一个因子链,并且对所有的1i=jk,Si中的每个元素与Sj中的每个元素互素,则称S由有限个互素因子链构成.本文中,设S由有限个互素的因子链构成,并且1∈S.我们首先给出幂GCD矩阵与幂LCM矩阵的行列式的公式,然后证明:如果a|b,则det(Sa)|det(Sb),det[Sa]|det[Sb],det(Sa)|det[Sb].最后我们指出:如果构成S的有限个因子链不互素,则此结论一般不成立.     

Generators and relations of abelian semigroups and semigroup rings

The object of this paper is the study of the relations of finitely generated abelian semigroups. We give a new proof of the fact that each such semigroup S is finitely presented. Moreover, we show that the number of relations defining S is greater than or equal to the least number of generators of S minus the rank of the associated group of S. If equality holds, we say S is a complete intersection. The main part of this study is devoted to semigroups of natural numbers generated by 3 elements. These semigroups are complete intersections if and only if they are symmetric in the sense of R. Apéry [1]. This result applies to algebraic geometry: An affine space-curve C with the parametric equations x=t^a, y=t^b, z=t^c, a, b, c natural numbers with greatest common divisor 1, is a global idealtheoretic complete intersection, if and only if the semigroup S generated by a, b, c is symmetric.This paper forms part of the author's thesis, submitted at Lousiana State University.The writing of this paper was partially supported by NSF grant GP-6388 in which the author participated as a junior assistant at Purdue University.     

有理g-轮换阵之性质及g-轮换阵求逆的计算复杂性

本文利用本原多项式在有理数域上的不可约性及n次本原根的性质。证明了若(g,n)=1,则n阶有理g-轮换阵为可对角化矩阵。进一步利用快速富里叶变换(FFT)给出了g-轮换阵之求逆算法。算法的主要运算为FFT的计算,因此时间复杂性为O(n log n)。其中(g,n)表示整数,g,n,的最大公约数。     

Blind image deconvolution using a banded matrix method

In this paper we study the blind image deconvolution problem in the presence of noise and measurement errors. We use a stable banded matrix based approach in order to robustly compute the greatest common divisor of two univariate polynomials and we introduce the notion of approximate greatest common divisor to encapsulate the above approach, for blind image restoration. Our method is analyzed concerning its stability and complexity resulting to useful conclusions. It is proved that our approach has better complexity than the other known greatest common divisor based blind image deconvolution techniques. Examples illustrating our procedures are given.     

The colorings of homeomorphisms on connected graphs

In this paper, we decide the exact value of the color number of a fixed point free homeomorphism on a connected locally finite graph. We prove that for every fixed-point free homeomorphism from a connected locally finite graph into itself, the greatest common divisor of all period for its map is equal to one or three if and only if its color number is 4.     

Greatest common divisor of generalized polynomials and polynomial matrices

The comrade matrix was introduced recently as the analogue of the companion matrix when a polynomial is expressed in terms of a basis set of orthogonal polynomials. It is now shown how previous results on determining the greatest common divisor of two or more polynomials can be extended to the case of generalized polynomials using the comrade form. Furthermore, a block comrade matrix is defined, and this is used to extend to the generalized case another previous result on the regular greatest common divisor of two polynomial matrices.     

On computation of the greatest common divisor of several polynomials over a finite field

We propose a probabilistic algorithm to reduce computing the greatest common divisor of m polynomials over a finite field (which requires computing m−1 pairwise greatest common divisors) to computing the greatest common divisor of two polynomials over the same field.     

单位上三角矩阵群的注记

记Tr_1(n,Z)是整数环Z上对角线元素全是1的全体上三角矩阵组成的群,k_(ij)(1≤i相似文献   

Applications of the generalized Sylvester matrix

Recently a Sylvester matrix for several polynomials has been defined, establishing the relative primeness and the greatest common divisor of polynomials. Using this matrix, we perform qualitative analysis of several polynomials regarding the inners, the bigradients, Trudi's theorem, and the connection of inners and the Schur complement. Also it is shown how the regular greatest common divisor of m+1 (m>1) polynomial matrices can be determined.