Efficient Computation of Squarefree Separator Polynomials

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10931)


Given a finite set of distinct points, a separator family is a set of polynomials, each one corresponding to a point of the given set, such that each of them takes value one at the corresponding point, whereas it vanishes at any other point of the set. Separator polynomials are fundamental building blocks for polynomial interpolation and they can be employed in several practical applications. Ceria and Mora recently developed a new algorithm for squarefree separator polynomials. The algorithm employs as a tool the point trie structure, first defined by Felszeghy-Ráth-Rónyai in their Lex game algorithm, which gives a compact representation of the relations among the points’ coordinates. In this paper, we propose a fast implementation in C of the aforementioned algorithm, based on an efficient storing and visiting of the point trie. We complete the implementation with tests on some sets of points, giving different configurations of the corresponding tries.


Separator polynomials Point trie 


  1. 1.
    Ceria, M., Mora, T.: Combinatorics of ideals of points: a cerlienco-mureddu-like approach for an iterative lex game. Preprint (2018)Google Scholar
  2. 2.
    Felszeghy, B., Ráth, B., Rónyai, L.: The lex game and some applications. J. Symbolic Comput. 41(6), 663–681 (2006)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Laubenbacher, R., Stigler, B.: A computational algebra approach to the reverse engineering of gene regulatory networks. J. Theor. Biol. 229(4), 523–537 (2004)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Lundqvist, S.: Vector space bases associated to vanishing ideals of points. J. Pure Appl. Algebra 214(4), 309–321 (2010)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Marinari, M.G., Moeller, H.M., Mora, T.: Gröbner bases of ideals defined by functionals with an application to ideals of projective points. Appl. Algebra Eng. Commun. Comput. 4(2), 103–145 (1993)CrossRefGoogle Scholar
  6. 6.
    Möller, H.M., Buchberger, B.: The construction of multivariate polynomials with preassigned zeros. In: Calmet, J. (ed.) EUROCAM 1982. LNCS, vol. 144, pp. 24–31. Springer, Heidelberg (1982). Scholar
  7. 7.
    Mora, T.: Solving Polynomial Equation Systems, 4 Vols. Cambridge University Press, Cambridge, I (2003), II (2005), III (2015), IV (2016)Google Scholar
  8. 8.
    Ritchie, D.M., Kernighan, B.W., Lesk, M.E.: The C Programming Language. Prentice Hall, Englewood Cliffs (1988)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversità degli Studi di MilanoMilanItaly
  2. 2.Department of MathematicsUniversity of GenoaGenoaItaly

Personalised recommendations