A famous theorem of Szemer＇edi asserts that any subset of integers with posi- tive upper density contains arbitrarily arithmetic progressions. Let Fq be a finite field with q elements and Fq（（X^-1）） be the power ...A famous theorem of Szemer＇edi asserts that any subset of integers with posi- tive upper density contains arbitrarily arithmetic progressions. Let Fq be a finite field with q elements and Fq（（X^-1）） be the power field of formal series with coefficients lying in Fq. In this paper, we concern with the analogous Szemeredi problem for continued fractions of Laurent series： we will show that the set of points x ∈ Fq（（X-1）） of whose sequence of degrees of partial quotients is strictly increasing and contain arbitrarily long arithmetic progressions is of Hausdorff dimension 1/2.展开更多
Computing upper bounds of the positive real roots of some polynomials is a key step of those real root isolation algorithms based on continued fraction expansion and Vincent's theorem.The authors give a new algori...Computing upper bounds of the positive real roots of some polynomials is a key step of those real root isolation algorithms based on continued fraction expansion and Vincent's theorem.The authors give a new algorithm for computing an upper bound of positive roots in this paper.The complexity of the algorithm is O(n log(uH-l))additions and multiplications where u is the optimal upper bound satisfying Theorem 3.1 of this paper and n is the degree of the polynomial.The method together w辻h some tricks have been implemented as a software package logcf using C language.Experiments on many benchmarks show that logcf is competitive with Root Intervals of Mathematica and the function realroot of Maple averagely and it is much faster than existing open source real root solvers in many test cases.展开更多
目的图像修复在图像处理中起着举足轻重的地位,针对目前大部分图像修补算法在修复划痕时存在纹理修复不够突出的缺陷,提出了两种基于连分式插值的修补算法,可以较好保持图像纹理的特性。方法该算法基于连分式插值理论,采用图像破损点周...目的图像修复在图像处理中起着举足轻重的地位,针对目前大部分图像修补算法在修复划痕时存在纹理修复不够突出的缺陷,提出了两种基于连分式插值的修补算法,可以较好保持图像纹理的特性。方法该算法基于连分式插值理论,采用图像破损点周围像素信息来插值出破损点的像素值。根据插值函数和插值窗口的不同,提出了两种插值方法,即Thiele型修补算法与Newton-Thiele型修补算法,解决不同纹理类型图像的划痕修补问题,并对插值过程中出现的奇异点问题和平移问题提出了行之有效的解决办法。结果对大量的划痕图像进行实验测试,并通过主观评价和客观评价进行评估。客观评价包括峰值信噪比(PSNR)和运行时间的比较。相对于目前流行的一些修补方法来说,本文算法有更好的视觉效果,更高的峰值信噪比和更短的运行时间,峰值信噪比为44.79 d B,运行时间为0.53 s。结论 Thiele型修补算法更加擅长处理纹理垂直于划痕的图像,而Newton-Thiele型修补算法适用于复杂纹理的图像。展开更多
We consider an M/M/2 queueing system with two-heterogeneous servers and multiple vacations. Customers arrive according to a Poisson process. However, customers become impatient when the system is on vacation. We obtai...We consider an M/M/2 queueing system with two-heterogeneous servers and multiple vacations. Customers arrive according to a Poisson process. However, customers become impatient when the system is on vacation. We obtain explicit expressions for the time dependent probabilities,mean and variance of the system size at time t by employing probability generating functions, continued fractions and properties of the modified Bessel functions. Finally, two special cases are provided.展开更多
We consider the block matrices and 3-dimensional graph manifolds associated with a special type of tree graphs. We demonstrate that the linking matrices of these graph manifolds coincide with the reduced matrices obta...We consider the block matrices and 3-dimensional graph manifolds associated with a special type of tree graphs. We demonstrate that the linking matrices of these graph manifolds coincide with the reduced matrices obtained from the Laplacian block matrices by means of Gauss partial diagonalization procedure described explicitly by W. Neumann. The linking matrix is an important topological invariant of a graph manifold which is possible to interpret as a matrix of coupling constants of gauge interaction in Kaluza-Klein approach, where 3-dimensional graph manifold plays the role of internal space in topological 7-dimensional BF theory. The Gauss-Neumann method gives us a simple algorithm to calculate the linking matrices of graph manifolds and thus the coupling constants matrices.展开更多
For a univariate function given by its Taylor series expansion, a continued fraction expansion can be obtained with the Viscovatov＇s algorithm, as the limiting value of a Thiele interpolating continued fraction or by...For a univariate function given by its Taylor series expansion, a continued fraction expansion can be obtained with the Viscovatov＇s algorithm, as the limiting value of a Thiele interpolating continued fraction or by means of the determinantal formulas for inverse and reciprocal differences with coincident data points. In this paper, both Viscovatov-like algorithms and Taylor-like expansions are incorporated to yield bivariate blending continued expansions which are computed as the limiting value of bivariate blending rational interpolants, which are constructed based on symmetric blending differences. Numerical examples are given to show the effectiveness of our methods.展开更多
基金supported by National Natural Science Foundation of China (Grant No.10971072)Guangdong Provincial Natural Science Foundation (Grant No.8151027501000114)
文摘Let a≥1 be an integer.In this paper,we will prove the equation in the title has at most three positive integer solutions.
文摘A famous theorem of Szemer＇edi asserts that any subset of integers with posi- tive upper density contains arbitrarily arithmetic progressions. Let Fq be a finite field with q elements and Fq（（X^-1）） be the power field of formal series with coefficients lying in Fq. In this paper, we concern with the analogous Szemeredi problem for continued fractions of Laurent series： we will show that the set of points x ∈ Fq（（X-1）） of whose sequence of degrees of partial quotients is strictly increasing and contain arbitrarily long arithmetic progressions is of Hausdorff dimension 1/2.
基金supported by the National Science Foundation of China under Grant Nos.61802318,61732001and 61532019
文摘Computing upper bounds of the positive real roots of some polynomials is a key step of those real root isolation algorithms based on continued fraction expansion and Vincent's theorem.The authors give a new algorithm for computing an upper bound of positive roots in this paper.The complexity of the algorithm is O(n log(uH-l))additions and multiplications where u is the optimal upper bound satisfying Theorem 3.1 of this paper and n is the degree of the polynomial.The method together w辻h some tricks have been implemented as a software package logcf using C language.Experiments on many benchmarks show that logcf is competitive with Root Intervals of Mathematica and the function realroot of Maple averagely and it is much faster than existing open source real root solvers in many test cases.
文摘目的图像修复在图像处理中起着举足轻重的地位,针对目前大部分图像修补算法在修复划痕时存在纹理修复不够突出的缺陷,提出了两种基于连分式插值的修补算法,可以较好保持图像纹理的特性。方法该算法基于连分式插值理论,采用图像破损点周围像素信息来插值出破损点的像素值。根据插值函数和插值窗口的不同,提出了两种插值方法,即Thiele型修补算法与Newton-Thiele型修补算法,解决不同纹理类型图像的划痕修补问题,并对插值过程中出现的奇异点问题和平移问题提出了行之有效的解决办法。结果对大量的划痕图像进行实验测试,并通过主观评价和客观评价进行评估。客观评价包括峰值信噪比(PSNR)和运行时间的比较。相对于目前流行的一些修补方法来说,本文算法有更好的视觉效果,更高的峰值信噪比和更短的运行时间,峰值信噪比为44.79 d B,运行时间为0.53 s。结论 Thiele型修补算法更加擅长处理纹理垂直于划痕的图像,而Newton-Thiele型修补算法适用于复杂纹理的图像。
基金Supported by the National Natural Science Foundation of China(11671204)
文摘We consider an M/M/2 queueing system with two-heterogeneous servers and multiple vacations. Customers arrive according to a Poisson process. However, customers become impatient when the system is on vacation. We obtain explicit expressions for the time dependent probabilities,mean and variance of the system size at time t by employing probability generating functions, continued fractions and properties of the modified Bessel functions. Finally, two special cases are provided.
文摘We consider the block matrices and 3-dimensional graph manifolds associated with a special type of tree graphs. We demonstrate that the linking matrices of these graph manifolds coincide with the reduced matrices obtained from the Laplacian block matrices by means of Gauss partial diagonalization procedure described explicitly by W. Neumann. The linking matrix is an important topological invariant of a graph manifold which is possible to interpret as a matrix of coupling constants of gauge interaction in Kaluza-Klein approach, where 3-dimensional graph manifold plays the role of internal space in topological 7-dimensional BF theory. The Gauss-Neumann method gives us a simple algorithm to calculate the linking matrices of graph manifolds and thus the coupling constants matrices.
基金The NNSF(10171026 and 60473114)of Chinathe Research Funds(2005TD03) for Young Innovation Group,Education Department of Anhui Province.
文摘For a univariate function given by its Taylor series expansion, a continued fraction expansion can be obtained with the Viscovatov＇s algorithm, as the limiting value of a Thiele interpolating continued fraction or by means of the determinantal formulas for inverse and reciprocal differences with coincident data points. In this paper, both Viscovatov-like algorithms and Taylor-like expansions are incorporated to yield bivariate blending continued expansions which are computed as the limiting value of bivariate blending rational interpolants, which are constructed based on symmetric blending differences. Numerical examples are given to show the effectiveness of our methods.
