Hoon Hong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Hoon Hong has a total of 60 co-authors. Here are the top co-authors by number of shared publications:
- Jing Yang
School of Mathematical Sciences, Guangxi Minzu University, Nanning, China
6 shared publications - Alexey Ovchinnikov
Department of Mathematics North Carolina State University Raleigh NC USA
5 shared publications - Chee Yap
New York University
4 shared publications - Juan Rafael Sendra
University of Alcalá
4 shared publications - Jonathan D. Hauenstein
University of Notre Dame
3 shared publications - Ala'A Al-Kateeb
Department of Mathematics Yarmouk University Irbid Jordan yu.edu.jo
2 shared publications
Latest Publications
- Open Access
- 26 May 2026
- Published by Elsevier in SSRN Electronic Journal
Conditions for eigenvalue configurations of two real symmetric matrices (symmetric polynomial approach)
Given two real symmetric matrices, their eigenvalue configuration is therelative arrangement of their eigenvalues on the real line.In this paper, we consider the following problem: given two parametric real symmetric matrices and an eigenvalue configuration, find asimple condition on the parameters such that their eigenvalues havethe given configuration. In this paper, we give an algorithm which expresses the eigenvalue configuration problem as a real root counting problem of certain symmetric polynomials, whose roots can be counted using the Fundamental Theorem of Symmetric Polynomials and Descartes' rule of signs.
- 26 May 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessConditions for eigenvalue configurations of two real symmetric matrices (symmetric polynomial approach)
Given two real symmetric matrices, their eigenvalue configuration is therelative arrangement of their eigenvalues on the real line.In this paper, we consider the following problem: given two parametric real symmetric matrices and an eigenvalue configuration, find asimple condition on the parameters such that their eigenvalues havethe given configuration. In this paper, we give an algorithm which expresses the eigenvalue configuration problem as a real root counting problem of certain symmetric polynomials, whose roots can be counted using the Fundamental Theorem of Symmetric Polynomials and Descartes' rule of signs.
- Open Access
Stratifying Discriminant Hypersurface
This paper investigates the stratification of the discriminant hypersurface associated with a univariate polynomial via the number of its distinct complex roots. We introduce two novel approaches different from the one based on subdiscriminants. The first approach stratifies the discriminant hypersurface by recursively removing all the lowest-order points, while the second one stratifies the discriminant hypersurface by recursively removing all the smooth points. Both approaches rely solely on the discriminant itself instead of using high-order subdiscriminants. These results offer new insights into the intrinsic geometry of the discriminant and its connection to root multiplicity.
Open AccessStratifying Discriminant Hypersurface
This paper investigates the stratification of the discriminant hypersurface associated with a univariate polynomial via the number of its distinct complex roots. We introduce two novel approaches different from the one based on subdiscriminants. The first approach stratifies the discriminant hypersurface by recursively removing all the lowest-order points, while the second one stratifies the discriminant hypersurface by recursively removing all the smooth points. Both approaches rely solely on the discriminant itself instead of using high-order subdiscriminants. These results offer new insights into the intrinsic geometry of the discriminant and its connection to root multiplicity.
- Open Access
- 1 August 2025
- Published by University of Western Ontario, Western Libraries in Maple Transactions
- Vol. 5 (3)
Geometry of Continuous Adjoint Newton's Method for Bivariate Quadratics
Newton's method is a classical iterative approach for computing solutions to nonlinear equations. To overcome some of its drawbacks, one often considers a continuous adjoint form of Newton's method. This paper investigates the geometric structure of the trajectories produced by the continuous adjoint Newton's method for bivariate quadratics, a system of two quadratic polynomials in two variables, via eigenanalysis at its equilibrium points. The main ideas are illustrated using plots generated by a Maple program.
- 1 August 2025
- Published by University of Western Ontario, Western Libraries in Maple Transactions
- Vol. 5 (3)
Open AccessGeometry of Continuous Adjoint Newton's Method for Bivariate Quadratics
Newton's method is a classical iterative approach for computing solutions to nonlinear equations. To overcome some of its drawbacks, one often considers a continuous adjoint form of Newton's method. This paper investigates the geometric structure of the trajectories produced by the continuous adjoint Newton's method for bivariate quadratics, a system of two quadratic polynomials in two variables, via eigenanalysis at its equilibrium points. The main ideas are illustrated using plots generated by a Maple program.
- 28 July 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 509
Robust parameter estimation for rational ordinary differential equations
- 28 July 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 509
Robust parameter estimation for rational ordinary differential equations
- 27 March 2025
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 93 (6) , 953-976
Improving angular speed uniformity of rational parameterization using piecewise radical reparameterization
- 27 March 2025
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 93 (6) , 953-976
Improving angular speed uniformity of rational parameterization using piecewise radical reparameterization
- 6 October 2024
- Published by Springer Nature
- p. 187-207
Structure of Cyclotomic Polynomials and Several Applications
- 6 October 2024
- Published by Springer Nature
- p. 187-207
Structure of Cyclotomic Polynomials and Several Applications
- Open Access
- 5 October 2024
- Published by Springer Nature in Numerical Algorithms
- p. 1-22
Smooth connectivity in real algebraic varieties
A standard question in real algebraic geometry is to compute the number of connected components of a real algebraic variety in affine space. This manuscript provides algorithms for computing the number of connected components, the Euler characteristic, and deciding the connectivity between two points for a smooth manifold arising as the complement of a real hypersurface of a real algebraic variety. When considering the complement of the set of singular points of a real algebraic variety, this yields an approach for determining smooth connectivity in a real algebraic variety. The method is based upon gradient ascent/descent paths on the real algebraic variety inspired by a method proposed by Hong, Rohal, Safey El Din, and Schost for complements of real hypersurfaces. Several examples are included to demonstrate the approach.
- 5 October 2024
- Published by Springer Nature in Numerical Algorithms
- p. 1-22
Open AccessSmooth connectivity in real algebraic varieties
A standard question in real algebraic geometry is to compute the number of connected components of a real algebraic variety in affine space. This manuscript provides algorithms for computing the number of connected components, the Euler characteristic, and deciding the connectivity between two points for a smooth manifold arising as the complement of a real hypersurface of a real algebraic variety. When considering the complement of the set of singular points of a real algebraic variety, this yields an approach for determining smooth connectivity in a real algebraic variety. The method is based upon gradient ascent/descent paths on the real algebraic variety inspired by a method proposed by Hong, Rohal, Safey El Din, and Schost for complements of real hypersurfaces. Several examples are included to demonstrate the approach.
- 8 March 2024
- Published by Springer Nature in Science China Mathematics
- Vol. 67 (8) , 1911-1932
Parametric “non-nested” discriminants for multiplicities of univariate polynomials
- 8 March 2024
- Published by Springer Nature in Science China Mathematics
- Vol. 67 (8) , 1911-1932
Parametric “non-nested” discriminants for multiplicities of univariate polynomials
- Open Access
- 22 January 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 398, 165-178
Improving Angular Speed Uniformity by Piecewise Radical Reparameterization
For a rational parameterization of a curve, it is desirable that its angular speed is as uniform as possible. Hence, given a rational parameterization, one wants to find re-parameterization with better uniformity. One natural way is to use piecewise rational reparameterization. However, it turns out that the piecewise rational reparameterization does not help when the angular speed of the given rational parameterization is zero at some points on the curve. In this paper, we show how to overcome the challenge by using piecewise radical reparameterization.
- 22 January 2024
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 398, 165-178
Open AccessImproving Angular Speed Uniformity by Piecewise Radical Reparameterization
For a rational parameterization of a curve, it is desirable that its angular speed is as uniform as possible. Hence, given a rational parameterization, one wants to find re-parameterization with better uniformity. One natural way is to use piecewise rational reparameterization. However, it turns out that the piecewise rational reparameterization does not help when the angular speed of the given rational parameterization is zero at some points on the curve. In this paper, we show how to overcome the challenge by using piecewise radical reparameterization.
- Open Access
Optimality of Curtiss Bound on Poincare Multiplier for Positive Univariate Polynomials
Let $f$ be a monic univariate polynomial with non-zero constant term. We say that $f$ is positive if $f(x)$ is positive over all $x\geq0$. If all the coefficients of $f$ are non-negative, then $f$ is trivially positive. In 1883, Poincaré proved that$f$ is positive if and only if there exists a monic polynomial $g$ such that all the coefficients of $gf$ are non-negative. Such polynomial $g$ is called a Poincaré multiplier for the positive polynomial $f$. Of course one hopes to find a multiplier with smallest degree. This naturally raised a challenge: find an upper bound on the smallest degree of multipliers. In 1918, Curtiss provided such a bound. Curtiss also showed that the bound is optimal (smallest) when degree of $f$ is 1 or 2. It is easy to show that the bound is not optimal when degree of $f$ is higher. The Curtiss bound is a simple expression that depends only on the angle (argument) of non-real roots of $f$. In this paper, we show that the Curtiss bound is optimal among all the bounds that depends only on the angles.Open AccessOptimality of Curtiss Bound on Poincare Multiplier for Positive Univariate Polynomials
Let $f$ be a monic univariate polynomial with non-zero constant term. We say that $f$ is positive if $f(x)$ is positive over all $x\geq0$. If all the coefficients of $f$ are non-negative, then $f$ is trivially positive. In 1883, Poincaré proved that$f$ is positive if and only if there exists a monic polynomial $g$ such that all the coefficients of $gf$ are non-negative. Such polynomial $g$ is called a Poincaré multiplier for the positive polynomial $f$. Of course one hopes to find a multiplier with smallest degree. This naturally raised a challenge: find an upper bound on the smallest degree of multipliers. In 1918, Curtiss provided such a bound. Curtiss also showed that the bound is optimal (smallest) when degree of $f$ is 1 or 2. It is easy to show that the bound is not optimal when degree of $f$ is higher. The Curtiss bound is a simple expression that depends only on the angle (argument) of non-real roots of $f$. In this paper, we show that the Curtiss bound is optimal among all the bounds that depends only on the angles.