skip to main content
10.1145/3476446.3536189acmconferencesArticle/Chapter ViewAbstractPublication PagesissacConference Proceedingsconference-collections
research-article

Bounding the Number of Roots of Multi-Homogeneous Systems

Published: 05 July 2022 Publication History

Abstract

Determining the number of solutions of a multi-homogeneous polynomial system is a fundamental problem in algebraic geometry. The multi-homogeneous Bézout (m-Bézout) number bounds from above the number of non-singular solutions of a multi-homogeneous system, but its computation is a #P>-hard problem.
Recent work related the m-Bézout number of certain multi-homogeneous systems derived from rigidity theory with graph orientations, cf Bartzos et al. (2020). A first generalization applied graph orientations for bounding the root count of a multi-homogeneous system that can be modeled by simple undirected graphs, as shown by three of the authors (Bartzos et al., 2021).
Here, we prove that every multi-homogeneous system can be modeled by hypergraphs and the computation of its m-Bézout bound is related to constrained hypergraph orientations. Thus, we convert the algebraic problem of bounding the number of roots of a polynomial system to a purely combinatorial problem of analyzing the structure of a hypergraph. We also provide a formulation of the orientation problem as a constraint satisfaction problem (CSP), hence leading to an algorithm that computes the multi-homogeneous bound by finding constrained hypergraph orientations.

References

[1]
I. Bárány. Applications of graph and hypergraph theory in geometry. Combinatorial and computational geometry, 52:31--50, 2005.
[2]
E. Bartzos, I.Z. Emiris, and J. Schicho. On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs. J. Applicable Algebra in Engineering, Communication & Computing, 31, 2020. URL: https://doi.org/10.1007/s00200-020-00447--7.
[3]
E. Bartzos, I.Z. Emiris, and C. Tzamos. The m-Bé zout bound and distance geometry. In F. Boulier, M. England, T.M. Sadykov, and E.V. Vorozhtsov, editors, Computer Algebra in Scientific Computing - 23rd Intern. Workshop, CASC 2021, Sochi, Russia, September 13--17, 2021, Proc., volume 12865 of LNCS, pages 6--20. Springer, 2021. URL: https://doi.org/10.1007/978--3-030--85165--1_2.
[4]
E. Bartzos, I.Z. Emiris, and R. Vidunas. New upper bounds for the number of embeddings of minimally rigid graphs. arXiv:2010.10578 [math.CO], 2020.
[5]
C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. On the desirability of acyclic database schemes. J. ACM, 30(3):479--513, jul 1983. URL: https://doi.org/10.1145/2402.322389.
[6]
D.N. Bernstein. The number of roots of a system of equations. Functional Analysis and Its Applications, 9(3):183--185, 1975. URL: doi.org/10.1007/BF01075595.
[7]
Moody T. Chu, T. Y. Li, and Tim Sauer. Homotopy method for general $łambda$-matrix problems. SIAM Journal on Matrix Analysis and Applications, 9(4):528--536, 1988. href http://arxiv.org/abs/https://doi.org/10.1137/0609043 patharXiv:https://doi.org/10.1137/0609043, href https://doi.org/10.1137/0609043 pathdoi:10.1137/0609043 .
[8]
D. Cifuentes and P.A. Parrilo. Exploiting chordal structure in polynomial ideals: A grö bner bases approach. SIAM J. Discret. Math., 30(3):1534--1570, 2016. URL: https://doi.org/10.1137/151002666.
[9]
A. Dickenstein and I.Z. Emiris, editors. Solving polynomial equations, volume 14 of Algorithms and Computation in Mathematics. Springer-Verlag, Berlin, 2005. Foundations, algorithms, and applications.
[10]
Ioannis Zacharias Emiris. Sparse Elimination and Applications in Kinematics. PhD thesis, USA, 1994. UMI Order No. GAX95--29288.
[11]
A. Frank, T. Király, and Z. Király. On the orientation of graphs and hypergraphs. Discrete Applied Mathematics, 131(2):385--400, 2003. URL: https://www.sciencedirect.com/science/article/pii/S0166218X02004626.
[12]
G. Gallo, G. Longo, S. Pallottino, and S. Nguyen. Directed hypergraphs and applications. Discrete Applied Mathematics, 42(2):177--201, 1993. URL: https://www.sciencedirect.com/science/article/pii/0166218X9390045P.
[13]
J. Huang, R. Zhang, and J. X. Yu. Scalable hypergraph learning and processing. In 2015 IEEE International Conference on Data Mining, pages 775--780, 2015. href https://doi.org/10.1109/ICDM.2015.33 pathdoi:10.1109/ICDM.2015.33 .
[14]
A.G. Khovanskii. Newton polyhedra and the genus of complete intersections. Functional Analysis and Its Applications, 12(1):38--46, Jan 1978. URL: https://doi.org/10.1007/BF01077562.
[15]
A.G. Kouchnirenko. Polyèdres de Newton et nombres de Milnor. Inventiones mathematicae, 32:1--32, 1976. URL: http://eudml.org/doc/142365.
[16]
H. Li, B. Xia, H. Zhang, and T. Zheng. Choosing the variable ordering for cylindrical algebraic decomposition via exploiting chordal structure. In Fré dé ric Chyzak and George Labahn, editors, ISSAC '21: International Symposium on Symbolic and Algebraic Computation, Virtual Event, Russia, July 18--23, 2021, pages 281--288. ACM, 2021.
[17]
G. Malajovich and K. Meer. Computing minimal multi-homogeneous bezout numbers is hard. Theory of Computing Systems, 40(4):553--570, 2007. URL: https://doi.org/10.1007/s00224-006--1322-y.
[18]
C. Mou, Y. Bai, and J. Lai. Chordal graphs in triangular decomposition in top-down style. J. Symbolic Comput., 102:108--131, 2021.
[19]
B. Mourrain. The 40 "generic" positions of a parallel robot. In Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, ISSAC '93, page 173--182, New York, NY, USA, 1993. Association for Computing Machinery. href https://doi.org/10.1145/164081.164120 pathdoi:10.1145/164081.164120 .
[20]
R. Patro and C. Kingsford. Predicting protein interactions via parsimonious network history inference. Bioinformatics, 29(13):i237--i246, 06 2013. URL: https://doi.org/10.1093/bioinformatics/btt224.
[21]
F. Rossi, P. van Beek, and T. Walsh, editors. Handbook of Constraint Programming, volume 2 of Foundations of Artificial Intelligence. Elsevier, 2006. URL: https://www.sciencedirect.com/science/bookseries/15746526/2.
[22]
S. J. Russell and P. Norvig. Artificial Intelligence: A Modern Approach (4th Edition). Pearson, 2020. URL: http://aima.cs.berkeley.edu/.
[23]
I.R. Shafarevich. Intersection Numbers, pages 233--283. Springer, Berlin, Heidelberg, 2013.
[24]
A.J. Sommese and C.W II Wampler. The Numerical Solution of Systems of Polynomials Arising in Engineering and Science. World Scientific Publishing, 2005.
[25]
P.-J. Spaenlehauer. Solving multi-homogeneous and determinantal systems: algorithms, complexity, applications. PhD thesis, UPMC, 2015.
[26]
K. Stergiou and N. Samaras. Binary encodings of non-binary constraint satisfaction problems: Algorithms and experimental results. ArXiv, abs/1109.5714, 2005.
[27]
Z. Tian, TH. Hwang, and R. Kuang. A hypergraph-based learning algorithm for classifying gene expression and array CGH data with prior knowledge. Bioinformatics, 25(21):2831--2838, 07 2009. URL: https://doi.org/10.1093/bioinformatics/btp467.
[28]
J.H. van Lint and R.M. Wilson. A Course in Combinatorics. Cambridge University press, 2001.
[29]
H. Zhang, L. Song, Y. Li, and GY. Li. Hypergraph theory: Applications in 5g heterogeneous ultra-dense networks. IEEE Communications Magazine, 55(12):70--76, 2017. href https://doi.org/10.1109/MCOM.2017.1700400 pathdoi:10.1109/MCOM.2017.1700400 .
[30]
D. Zhou, J. Huang, and B. Schölkopf. Learning with hypergraphs: Clustering, classification, and embedding. In Proceedings of the 19th International Conference on Neural Information Processing Systems, NIPS'06, page 1601--1608, Cambridge, MA, USA, 2006. MIT Press.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ISSAC '22: Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation
July 2022
547 pages
ISBN:9781450386883
DOI:10.1145/3476446
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: 05 July 2022

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. constraint satisfaction problems
  2. distance graphs
  3. enumeration
  4. hypergraph orientations
  5. polynomial system

Qualifiers

  • Research-article

Funding Sources

  • Competitiveness, Entrepreneurship & Innovation

Conference

ISSAC '22
Sponsor:

Acceptance Rates

Overall Acceptance Rate 395 of 838 submissions, 47%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 66
    Total Downloads
  • Downloads (Last 12 months)8
  • Downloads (Last 6 weeks)0
Reflects downloads up to 14 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media