Bounding the Number of Roots of Multi-Homogeneous Systems
Abstract
References
Index Terms
- Bounding the Number of Roots of Multi-Homogeneous Systems
Recommendations
Fractional chromatic number and circular chromatic number for distance graphs with large clique size
An Erratum has been published for this article in Journal of Graph Theory 48: 329–330, 2005.
Let M be a set of positive integers. The distance graph generated by M, denoted by G(Z, M), has the set Z of all integers as the vertex set, and edges ij ...
Distance graphs with maximum chromatic number
The distance graph G(D) has the set of integers as vertices and two vertices are adjacent in G(D) if their difference is contained in the set D@__ __Z. A conjecture of Zhu states that if the chromatic number of G(D) achieves its maximum value |D|+1 then ...
Bezout number calculations for multi-homogeneous polynomial systems
The Bezout number of a system of multi-homogeneous polynomial equations is the largest number of nonsingular solutions such a system can have, and it is also the number of solution paths used to compute all geometrically isolated solutions of the system ...
Comments
Information & Contributors
Information
Published In
![cover image ACM Conferences](/cms/asset/e86f6a5b-b0c3-4878-b93d-eba0d92b08b2/3476446.cover.jpg)
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Competitiveness, Entrepreneurship & Innovation
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 66Total Downloads
- Downloads (Last 12 months)8
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in