Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
This research area focuses on deriving sharp lower bounds for norms of monic extremal polynomials and Widom factors with respect to probability measures supported on subsets of the real line. It sheds light on inequalities involving orthogonal polynomials that are crucial in the study of polynomial approximations and direct implications for zero lower bound (ZLB) theoretical bounds where extremal polynomial behavior plays a role. Understanding these bounds improves the accuracy of inequalities governing polynomials with zeros in specific regions, directly impacting analysis in the ZLB context.
2019
2025
2023, Applicable Analysis and Discrete Mathematics
This area investigates refined classical inequalities such as Jensen's, Minkowski’s, and Hardy’s inequalities via superquadraticity and convexity properties of functions, alongside Łojasiewicz-type and Redheffer-type bounds for special and definable functions. The refined inequalities, gradient inequalities, and monotonicity properties provide powerful analytical tools to handle nonlinearities and error bounds that are essential in tackling zero lower bound problems in nonlinear functional analysis, optimization, and control settings where sharp error estimates under minimal assumptions are vital.
2021, Bulletin of the Australian Mathematical Society
2023, Mathematics
2024, Journal of Inequalities and Applications
This theme covers foundational limitations and lower bounds in computational complexity theory and cryptographic protocols exhibiting zero knowledge properties, especially under asynchronous or adversarial multi-session environments. Zero lower bounds in these discrete computational contexts represent minimal resource or round thresholds below which secure or efficient interactive proofs and circuit computations become impossible. Such rigorous lower bounds delineate fundamental limits analogous to analytical ZLB phenomena in continuous mathematics, ensuring algorithmic robustness in cryptographic and complexity applications.
2024, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
2022
2025, Journal of Macroeconomics
2025, SSRN Electronic Journal
2025, RePEc: Research Papers in Economics
2025, Social Science Research Network
2025, SSRN Electronic Journal
2025, Social Science Research Network
2025, Social Science Research Network
2025
2025, SSRN Electronic Journal
2025, SSRN Electronic Journal
2025, SSRN Electronic Journal
2025, Cambridge University Press eBooks
2025, Empirica
2025, Federal Reserve Bank of Richmond Economic …
2025
2025, RePEc: Research Papers in Economics
2025, Review of Economics
2025, arXiv (Cornell University)
2025
2025
2025, arXiv (Cornell University)
2025, Political Economy - Development: Fiscal & Monetary Policy eJournal
2025
2025, Finance and Economics Discussion Series
2025
2025, Accounting and Finance Research
2025, SSRN Electronic Journal
2025, SSRN Electronic Journal
2025
2025, Economics Letters
2025, Research Papers in Economics
2025, Review of Economics and Statistics
2025
2025, RePEc: Research Papers in Economics
2025, RePEc: Research Papers in Economics
2025, Social Science Research Network
2025, IMF Working Papers
2025, SSRN Electronic Journal
2025, Journal of Economic Dynamics and Control
2025, Social Science Research Network
2025, Social Science Research Network
2025
2025, SSRN Electronic Journal
2025
2025, Review of Economic Dynamics
2025
2025