Document Open Access Logo

On the Constructive Dimension Spectrum of Polynomials

Authors Prajval Koul , Satyadev Nandakumar

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICALP.2026.183.pdf
  • Filesize: 0.75 MB
  • 13 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation
Keywords
  • Kolmogorov Complexity
  • Dimension
  • Polynomials

Metrics

Abstract

Recently, Stull [Stull, 2025], [Stull, 2022] resolved a long-standing open problem posed by Lutz, on whether the set of effective Hausdorff dimensions of points on a straight line in ℝ² - the effective dimension spectrum of the line - contains a unit interval. This question is related to problems in classical fractal geometry like the Kakeya conjecture and Furstenberg sets. Stull posed an open question on the dimension spectra of polynomial curves. 
For the first result, with new techniques which adapt the theory of classical real root-finding of polynomials to the current setting, we show that the dimension spectra of every polynomial curve contains at least two points. This answers an open question posed by Stull [Stull, 2025], [Stull, 2022]. We use the main result to construct a class of polynomials which have width strictly greater than 1, answering a second problem stated in [Stull, 2025], [Stull, 2022]. 
Stull [Stull, 2025] resolved the dimension spectrum conjecture for planar lines, showing that it contains a unit interval. For the second result, we resolve the conjecture for a subfamily of polynomials whose coefficients form a "low" dimension point in ℝ^{d+1}.

Cite As Get BibTex

Prajval Koul and Satyadev Nandakumar. On the Constructive Dimension Spectrum of Polynomials. In 53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 374, pp. 183:1-183:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.ICALP.2026.183

Author Details

Prajval Koul
  • Department of Computer Science and Engineering, Indian Institute of Technology Kanpur, India
Satyadev Nandakumar
  • Department of Computer Science and Engineering, Indian Institute of Technology Kanpur, India

References

  1. Adam Case and Jack H. Lutz. Mutual dimension. ACM Trans. Comput. Theory, 7(3):12:1-12:26, 2015. URL: https://doi.org/10.1145/2786566.
  2. Augustin-Louis Cauchy. Exercices de mathématique. Œuvres 2, 9:122, 1829. Google Scholar
  3. Rodney Downey and Denis Hirschfeldt. Algorithmic Randomness and Complexity, 2008. In preparation. Google Scholar
  4. Ming Li and Paul M. B. Vitányi. An Introduction to Kolmogorov Complexity and Its Applications, 4th Edition. Texts in Computer Science. Springer, 2019. URL: https://doi.org/10.1007/978-3-030-11298-1.
  5. J. H. Lutz. Gales and the constructive dimension of individual sequences. In Proceedings of the 27th International Colloquium on Automata, Languages, and Programming, pages 902-913, 2000. Revised as [Lutz, 2003]. Google Scholar
  6. J. H. Lutz. Dimension in complexity classes. SIAM Journal on Computing, 32:1236-1259, 2003. Preliminary version appeared in Proceedings of the Fifteenth Annual IEEE Conference on Computational Complexity, pages 158-169, 2000. URL: https://doi.org/10.1137/S0097539701417723.
  7. J. H. Lutz. Dimensions of individual strings and sequences. Information and Computation, 187(1):49-79, 2003. URL: https://doi.org/10.1016/S0890-5401(03)00187-1.
  8. Jack H. Lutz and Neil Lutz. Algorithmic information, plane kakeya sets, and conditional dimension. ACM Trans. Comput. Theory, 10(2):7:1-7:22, 2018. URL: https://doi.org/10.1145/3201783.
  9. Jack H. Lutz, Neil Lutz, and Elvira Mayordomo. Extending the reach of the point-to-set principle. Information and Computation, 294:Paper No. 105078, 2023. URL: https://doi.org/10.1016/j.ic.2023.105078.
  10. Jack H. Lutz and Elvira Mayordomo. Dimensions of points in self-similar fractals. SIAM Journal on Computing, 38:1080-1112, 2008. URL: https://doi.org/10.1137/070684689.
  11. Jack H. Lutz and Elvira Mayordomo. Algorithmic fractal dimensions in geometric measure theory. CoRR, abs/2007.14346, 2020. URL: https://arxiv.org/abs/2007.14346.
  12. Jack H. Lutz and Klaus Weihrauch. Connectivity properties of dimension level sets. Math. Log. Q., 54(5):483-491, 2008. URL: https://doi.org/10.1002/malq.200710060.
  13. Neil Lutz and D. M. Stull. Bounding the dimension of points on a line. Information and Computation, 275:104601, 15, 2020. URL: https://doi.org/10.1016/j.ic.2020.104601.
  14. Neil Lutz and Donald M. Stull. Projection theorems using effective dimension. In Igor Potapov, Paul G. Spirakis, and James Worrell, editors, 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, volume 117 of LIPIcs, pages 71:1-71:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. URL: https://doi.org/10.4230/LIPIcs.MFCS.2018.71.
  15. Elvira Mayordomo. Effective hausdorff dimension in general metric spaces. Theory Comput. Syst., 62(7):1620-1636, 2018. URL: https://doi.org/10.1007/s00224-018-9848-3.
  16. André Nies. Computability and randomness, volume 51. OUP Oxford, 2009. Google Scholar
  17. D. M. Stull. The dimension spectrum conjecture for planar lines. In 49th EATCS International Conference on Automata, Languages, and Programming, volume 229 of LIPIcs. Leibniz Int. Proc. Inform., pages Art. No. 133, 20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPIcs.ICALP.2022.133.
  18. D. M. Stull. The dimension spectrum conjecture for planar lines. Journal of the London Mathematical Society. Second Series, 111(6):Paper No. e70216, 30, 2025. URL: https://doi.org/10.1112/jlms.70216.
  19. Donald M. Stull. Resource bounded randomness and its applications. Algorithmic Randomness: Progress and Prospects, 50:301, 2020. Google Scholar
  20. C. Sturm. Mémoire sur la résolution des équations numériques. Mémoires préséntés par divers savants à l'Acadèmie des Science de l'Institute de France, 6:273-318., 1835. Google Scholar
  21. Daniel Turetsky. Connectedness properties of dimension level sets. Theoretical Computer Science, 412(29):3598-3603, 2011. URL: https://doi.org/10.1016/j.tcs.2011.03.006.
  22. Joachim von zur Gathen and Jürgen Gerhard. Modern computer algebra. Cambridge University Press, Cambridge, third edition, 2013. URL: https://doi.org/10.1017/CBO9781139856065.
  23. Klaus Weihrauch. Computable Analysis. An Introduction. Springer-Verlag, 2000. Google Scholar
  24. Chee Keng Yap. Fundamental problems of algorithmic algebra. Oxford University Press, New York, 2000. Google Scholar
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact