580 California St., Suite 400
San Francisco, CA, 94104
Key research themes
1. How do discrete mass points in orthogonality measures affect the monotonicity of polynomial zeros?
This research investigates the influence of discrete masses added to a nonatomic positive Borel measure on the monotonic behavior of zeros of orthogonal polynomials. It addresses an open problem posed by Mourad Ismail regarding the monotonicity of zeros when a mass point varies and whether all zeros move coherently with the mass point, focusing on measures with discrete perturbations rather than absolutely continuous parts.
Key finding: The paper proves that for polynomials orthogonal with respect to a measure composed of a nonatomic positive Borel measure plus a single discrete mass (Dirac delta) at a varying point a with positive mass M, all zeros of the... Read more
2. What are effective numerical methods for counting zeros of real polynomials inside specified domains, such as the open unit disk?
This theme focuses on devising computationally efficient techniques to determine the number of complex zeros of real polynomials within particular regions, notably the open unit disk. Methods aim to surpass traditional approaches by using polynomial expansions and Sturm-sequence constructions, improving computational efficiency and accuracy for applied problems involving control and stability analysis.
Key finding: Introduces a novel numerical method utilizing the Boubaker Polynomial Expansion Scheme (BPES) to generate Sturm-like sequences that effectively count the number of complex zeros of real polynomials inside the unit disk... Read more
3. How can special polynomial sequences (e.g., R-Bonacci and Lucas-Lehmer) characterize zero distributions and facilitate explicit root formulas?
This research direction explores special recursively defined polynomial families that generalize classical sequences like Fibonacci and Lucas-Lehmer, aiming to characterize their zeros' geometric distribution and develop explicit formulas for roots of these polynomials and their derivatives. It links these special polynomials to well-studied entities like Chebyshev and Hermite polynomials, thereby enriching the theory with new algebraic and analytic insights.
Key finding: The study generalizes zero characterizations of R-Bonacci polynomials for arbitrary r ≥ 2, confirming that zeros lie on equally spaced r-star sets relating to the angle 2π/r. By identifying symmetric polynomials comprised of... Read more
Key finding: The paper introduces Lucas-Lehmer polynomials generated via the same recursive formula as the classical Lucas-Lehmer integer sequence and reveals their close relationship to Chebyshev polynomials of the first and second kind.... Read more
Key finding: Using the umbral calculus framework based on Bell and Hermite polynomials, the study establishes new sufficient conditions ensuring the reality of polynomial zeros. It extends classical results by Wang and Yeh to classes of... Read more
4. What bounds and inequalities govern the imaginary and real parts of zeros of orthogonal polynomials and their expansions?
This area addresses analytical inequalities providing upper bounds on imaginary and real parts of zeros of polynomials expressed as expansions in orthogonal polynomial bases. It unifies and generalizes classical bounds such as those of Cauchy, Fujiwara, and Giroux by using majorization and convex analysis, offering refined estimates that relate polynomial coefficients and moments to zero localization in the complex plane.
Key finding: The author establishes a unified majorization-based framework that generalizes known inequalities bounding the imaginary parts of zeros of polynomials expressed as orthogonal expansions. By specifying convex functions and... Read more
Key finding: This work introduces higher-order Cauchy and Fujiwara bounds for the modulus of products of multiple zeros of a polynomial via compound matrices. By analyzing the spectral norm of compounds of a companion matrix, it... Read more
5. What are advanced computational and practical frameworks for representing and manipulating real algebraic numbers and polynomials in symbolic computation?
Research here concentrates on software libraries and algorithmic implementations that support exact symbolic manipulation of real algebraic objects, including polynomials and real algebraic numbers. It addresses the challenges of integrating such tools into computational frameworks like SMT solvers, focusing on open-source, efficient C++ libraries underpinning real algebraic computations, decision procedures, and root isolation algorithms.
Key finding: Presents the GiNaCRA library, a free open-source C++ toolkit extending the GiNaC computer algebra system with data types and algorithms to represent and compute with real algebraic numbers. Key features include exact... Read more