Massimo Caboara
ABSTRACT
In this paper we present a full solution to an open problem in Design of Experiments, a branch of Statistics, which can equally be seen as a problem in Algebraic Geometry. Given a complete set O of estimable terms, we are able to find all the fractions F of a full factorial design, such that O is a basis of P/I(F) as a K-vector space. This fact can be rephrased as a result in the theory of zem-dimensional schemes.
- 1.W. Auzinger, H.J. Stetter, An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations, In: Conference in Numerical Analysis, ISNM vol. 86, 11-30, Birkauser Verlag.]]Google Scholar
- 2.A. Capani, G. Niesi, L. Robbiano, CoCoA, a system for doing Computations in Commutative Algebra, (1995). Available via anonymous ftp from cocoa, dima. unige, it.]]Google Scholar
- 3.M. Caboara, L. Robbiano, Families of ideal in Statistics, Proceedings of the ISSAC-97 Conference (Maui, Hawaii, July 1997) Kfichlin ed., (1997), 404-409.]] Google ScholarDigital Library
- 4.M. Kreuzer, L. Robbiano, Computations in Commutative Algebra 1, Springer (2000).]]Google Scholar
- 5.B. Mourrain, A New Criterion for Normal Form Algorithms, Proc. of the 13th International Symposium, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, LNCS 1719, (1999), 430-443.]] Google ScholarDigital Library
- 6.G. Pistone, E. R.iccomagno, H.P. Wynn, Algebraic Statistics: Computational Commutative Algebra in Statistics, Monographs on Statistics and Applied Probability 89 Chapman&Hall/CRC (2000).]]Google Scholar
- 7.G. Pistone G., H.P. Wynn, Generalised confounding and GrSbner bases, Biometrika 83-3, (1996), 653-666.]]Google ScholarCross Ref
- 8.A. Reeves, B. Sturmfels, A Note on Polynomial Reduction, J. Symbolic Comput. 16 (1993), 273-277.]] Google ScholarDigital Library
- 9.L. Robbiano, GrSbner bases and Statistics, In B.Buchberger, F.Winkler, editors, Gr6bner Bases and Applications (Proe. of the Conf. 33 years of GrSbner bases), volume 251 of London Mathematical Society Lecture Note Series, Cambridge University Press (1998), 179-204.]]Google Scholar
- 10.L. Robbiano, Zero Dimensional Ideals or The inestimable value of Estimable Terms, Proceedings of the Academy Colloquium "Constructive Algebra and Systems Theory", Amsterdam 1 - 3 November 2000]]Google Scholar
- 11.L. Robbiano, M.P. Rogantin Full Factorial Designs and Distracted Fractions, In B.Buchberger, F.Winkler, editors, GrSbner Bases and Applications (Proc. of the Conf. 33 years of GrSbner bases), volume 251 of London Mathematical Society Lecture Note Series, Cambridge University Press (1998), 473-482.]]Google Scholar
Index Terms
- Families of estimable terms
Recommendations
A Polyhedral Characterization of Border Bases
Border bases arise as a canonical generalization of Gröbner bases, using order ideals instead of term orderings. We provide a polyhedral characterization of all order ideals (and hence all border bases) that are supported by a zero-dimensional ideal: order ...
Complexity of Gröbner basis detection and border basis detection
Grobner basis detection (GBD) is defined as follows: given a set of polynomials, decide whether there exists-and if ''yes'' find-a term order such that the set of polynomials is a Grobner basis. This problem was proposed by Gritzmann and Sturmfels (1993)...
Border basis detection is NP-complete
ISSAC '11: Proceedings of the 36th international symposium on Symbolic and algebraic computationBorder basis detection (BBD) is described as follows: given a set of generators of an ideal, decide whether that set of generators is a border basis of the ideal with respect to some order ideal. The motivation for this problem comes from a similar ...
Comments