Cited By
View all- Gao XVan der Hoeven JYuan CZhang G(2009)Characteristic set method for differential-difference polynomial systemsJournal of Symbolic Computation10.1016/j.jsc.2008.02.01044:9(1137-1163)Online publication date: 1-Sep-2009
Resolvent systems of difference polynomial ideals
Pages 101 - 108
Abstract
In this paper, a new theory of resolvent systems is developed for prime difference ideals and difference ideals defined by coherent and proper irreducible ascending chains. Algorithms to compute such resolvent systems are also given. As a consequence, we prove that any irreducible difference variety is birationally equivalent to an irreducible difference variety of codimension one. As a preparation to the resolvent theory, we also prove that the saturation ideal of a coherent and proper ascending chain is unmixed in the sense that all its prime components have the same dimension and order.
References
[1]
T. Cluzeau and E. Hubert, Resolvent Representation for Regular Differential Ideals, AAECC, 29, 395--425, 2003.]]
[2]
R.M. Cohn, Difference Algebra, Interscience Pbulishers, 1965.]]
[3]
R.M. Cohn, Manifolds of Difference Polynomials, Trans. of AMS, 64, 133--172, 1948.]]
[4]
S.C. Chou, Mechanical Geometry Theorem Proving, D.Reidel Publishing Company, 1988.]]
[5]
X.S. Gao and S.C. Chou, On the Parameterization of Algebraic Curves, AAECC, 3, 27--38, 1992.]]
[6]
X.S. Gao and S.C. Chou, On the Dimension for Arbitrary Ascending Chains, Chinese Bull. of Scis., vol. 38, 396--399, 1993.]]
[7]
X.S. Gao and S.C. Chou, On the Theory of Resolvents and its Applications, Sys. Sci. and Math. Sci., 12, 17--30, 1999.]]
[8]
X.S. Gao and Y. Luo, A Characteristic Set Method for Difference Polynomial Systems, Inter Conf on Poly Sys. Sol., Nov. 24--26, Paris, 2004. Submitted to JSC.]]
[9]
P. Gianni and T. Mora, Algebraic Solution of Systems of Polynomial Equations Using Gröbnert bases, 247--257, LNCS, vol. 356, Springer-Verlag, 1987.]]
[10]
D. Grigoriev, Complexity of Quantifier Elimination in the Theory of Ordinary Differential Equations, LNCS, vol. 378, 11--25, 1989.]]
[11]
R. Loos, Computing in Algebraic Extensions, in Computer Algebra (Ed. by B. Buchberger, et al), 173--187, Springer-Verlag, New York, 1982.]]
[12]
H. Kobayashi, S. Moritsugu and R.W. Hogan, Solving Systems of Algebraic Equations, Proc. of ISSAC-88, pp.139--149, LNCS No. 358, Springer-Verlag, 1988.]]
[13]
E. Kolchin, Differential Algebra and Algebraic Groups, Academic Press, New York, 1973.]]
[14]
E.L. Mansfield and A. Szanto, Elimination Theory for Differential Difference Polynomials, Proc. ISSAC 2002, 191--198, ACM Press.]]
[15]
J.F. Ritt, Differential Algebra, Amer. Math. Soc. Colloquium, 1950.]]
[16]
J.F. Ritt and J.L. Doob, Systems of Algebraic Difference Equations, American Journal of Mathematics, 55, 505--514, 1933.]]
[17]
B.M. Trager, Algebraic Factoring and Rational Integration, Proc. of ACM Sym. on Symbolic and Algebraic Computation, 1976.]]
[18]
D. Wang and D. Lin, A Method for Multivariate Polynomial Factorization over Successive Algebraic Extension Fields, Mathematics and Mathematics Mechanization, 138--172, 2001.]]
[19]
J. van der Hoeven, Differential and Mixed Differential-difference Equations from the Effetive Viewpoint, Preprints, 1996.]]
[20]
W.T. Wu, Basic Principle of Mechanical Theorem Proving in Geometries, Science Press, Beijing, 1984; Springer, Wien, 1994.]]
[21]
K. Yokoyama, M. Noro and T. Takeshima, Computing Primitive Elements of Extension Fields, Journal of Symbolic Computation, 8, 553--580, 1989.]]
Index Terms
- Resolvent systems of difference polynomial ideals
Recommendations
A characteristic set method for ordinary difference polynomial systems
We prove several basic properties for difference ascending chains, including a necessary and sufficient condition for an ascending chain to be the characteristic set of its saturation ideal and a necessary and sufficient condition for an ascending chain ...
Decomposition of ordinary difference polynomials
In this paper, we present an algorithm to decompose ordinary non-linear difference polynomials with rational functions as coefficients. The algorithm provides an effective reduction of the decomposition of difference polynomials to the decomposition of ...
Cubature Formulae and Polynomial Ideals
The structure of cubature formulae of degree 2n 1 is studied from a polynomial ideal point of view. The main result states that if I is a polynomial ideal generated by a proper set of (2n 1)-orthogonal polynomials and if the cardinality of the variety V(...
Comments
Information & Contributors
Information
Published In
Copyright © 2006 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 09 July 2006
Check for updates
Author Tags
Qualifiers
- Article
Conference
Acceptance Rates
Overall Acceptance Rate 395 of 838 submissions, 47%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 107Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 21 Oct 2024
Other Metrics
Citations
Cited By
View all- Gao XVan der Hoeven JYuan CZhang G(2009)Characteristic set method for differential-difference polynomial systemsJournal of Symbolic Computation10.1016/j.jsc.2008.02.01044:9(1137-1163)Online publication date: 1-Sep-2009
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in