回复 全回 转寄 删除 上一封 下一封 返回 
 
发件人： no-reply@arxiv.org 存入地址簿 阻止发信人 加入过滤器 
收件人： chen@nankai.edu.cn 
抄送：  
邮件主题： 0711.3386 password (SAVE) 
发件日期： Wed, 21 Nov 2007 09:48:40 -0500 看信件原文   打印信件 
 
来信内容: 选择内码:from:GBKGB2312BIG-5UTF-8  to:GBKBIG-5UTF-8
 
            *** SAVE THIS MESSAGE FOR FUTURE REFERENCE ***
          (and forward to any collaborators for safekeeping)

Your user/password combination for this article is

 User-ID: 0711.3386
 Password: 3btpf

You will need this ID/password pair to do any of the following:

  - to check the article before it is announced
  - to cross-list the article 
  - to add publication information
  - to replace the article with a revised version

Keep this password safe -- all future replacements will require it.

If you submit this article to an overlay journal based on arXiv you may
need to supply the following identifier to allow the collaborating
service to track your submission: arXiv:tracking/b1d0e9213e787d8f

------------------------------------------------------------------------------
\\
arXiv:0711.3386
From: William Y. C. Chen <chen@nankai.edu.cn>
Date: Wed, 21 Nov 2007 14:48:33 GMT   (10kb)

Title: Converging to Gosper's Algorithm
Authors: William Y. C. Chen, Peter Paule and Husam L. Saad
Categories: math.CA math.CO
Comments: 13 pages
MSC-class: 33F10; 05A19
\\
  Given two polynomials, we find a convergence property of the GCD of the
rising factorial and the falling factorial. Based on this property, we present
a unified approach to computing the universal denominators as given by Gosper's
algorithm and Abramov's algorithm for finding rational solutions to linear
difference equations with polynomial coefficients.
\\

 


 
回复 全回 转寄 删除 上一封 下一封 返回 
 






--------------------------------------------------------------------------------
 
Copyright ? 1999 - 2004 eYou.net. All Rights Reserved