Abstract
Given a regular chain, we are interested in questions like computing the limit points of its quasi-component, or equivalently, computing the variety of its saturated ideal. We propose techniques relying on linear changes of coordinates and we consider strategies where these changes can be either generic or guided by the input.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alvandi, P., Chen, C., Maza, M.M.: Computing the limit points of the quasi-component of a regular chain in dimension one. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2013. LNCS, vol. 8136, pp. 30–45. Springer, Heidelberg (2013)
Aubry, P., Lazard, D., Maza, M.M.: On the theories of triangular Sets. J. Symb. Comput. 28(1–2), 105–124 (1999)
Boulier, F., Lemaire, F., Moreno Maza, M.: Pardi! In: Proceedings of International Symposium on Symbolic and Algebraic Computation, ISSAC 2001, pp. 38–47 (2001)
Boulier, F., Lemaire, F., Maza, M.M.: Computing differential characteristic sets by change of ordering. J. Symb. Comput. 45(1), 124–149 (2010)
Chen, C., Golubitsky, O., Lemaire, F., Maza, M.M., Pan, W.: Comprehensive triangular decomposition. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2007. LNCS, vol. 4770, pp. 73–101. Springer, Heidelberg (2007)
Chen, C., Maza, M.M.: Algorithms for computing triangular decomposition of polynomial systems. J. Symb. Comput. 47(6), 610–642 (2012)
Dahan, X., Jin, X., Maza, M.M., Schost, É.: Change of order for regular chains in positive dimension. Theor. Comput. Sci. 392(1–3), 37–65 (2008)
Eisenbud, D.: Commutative Algebra with a View toward Algebraic Geometry. Springer, New York (1995)
Greuel, G.M., Pfister, G.: A Singular Introduction to Commutative Algebra. Springer, Berlin (2002)
Hashemi, A.: Effective computation of radical of ideals and its application to invariant theory. In: Hong, H., Yap, C. (eds.) ICMS 2014. LNCS, vol. 8592, pp. 382–389. Springer, Heidelberg (2014)
Krick, T., Logar, A.: An algorithm for the computation of the radical of an ideal in the ring of polynomials. In: Mattson, H.F., Mora, T., Rao, T.R.N. (eds.) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1991. LNCS, vol. 539, pp. 195–205. Springer, Heidelberg (1991)
Lecerf, G.: Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers. J. of Complexity 19(4), 564–596 (2003)
Lemaire, F., Maza, M.M., Pan, W., Xie, Y.: When does 〈T〉 equal sat(T)? J. Symb. Comput. 46(12), 1291–1305 (2011)
Logar, A.: A computational proof of the noether normalization lemma. In: Mora, T. (ed.) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1988. LNCS, vol. 357, pp. 259–273. Springer, Heidelberg (1989)
Rouillier, F.: Solving zero-dimensional systems through the rational univariate representation. Appl. Algebra Eng. Commun. Comput. 9(5), 433–461 (1999)
Seiler, W.M.: A combinatorial approach to involution and δ-regularity II: Structure analysis of polynomial modules with Pommaret bases. Appl. Alg. Eng. Comm. Comp. 20, 261–338 (2009)
Sommese, A.J., Verschelde, J.: Numerical homotopies to compute generic points on positive dimensional algebraic sets. J. Complexity 16(3), 572–602 (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Alvandi, P., Chen, C., Hashemi, A., Maza, M.M. (2015). Regular Chains under Linear Changes of Coordinates and Applications. In: Gerdt, V., Koepf, W., Seiler, W., Vorozhtsov, E. (eds) Computer Algebra in Scientific Computing. CASC 2015. Lecture Notes in Computer Science(), vol 9301. Springer, Cham. https://doi.org/10.1007/978-3-319-24021-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-24021-3_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24020-6
Online ISBN: 978-3-319-24021-3
eBook Packages: Computer ScienceComputer Science (R0)