Drake University

Conference: CBMS Conference: Algorithmic Fractal Dimensions -this Award Funds a Conference Board of the Mathematical Sciences (CBMS) Regional Research Conference on Algorithmic Fractal Dimensions to Be Held May 20-24, 2024, at Drake University in Des Moines, Iowa. the Central Focus of the Conference Will Be Ten Lectures to Be Given by Professor Jack Lutz of Iowa State University. Algorithmic Fractal Dimensions Were First Developed at the Beginning of This Century as Measures of the Density of Information in Various Mathematical Objects. as the Name Suggests, They Are Versions of Classical Fractal Dimensions That Have the Theory of Computing Embedded in Their Definitions. They Have Already Had Applications in Computability Theory, Computational Complexity, Information Theory, and Number Theory. Most Strikingly, Algorithmic Fractal Dimensions Are Being Used With Increasing Frequency to Prove New Theorems--some Answering Long-standing Open Problems--in Classical Fractal Geometry, Theorems Whose Statements Do Not Involve Computability or Related Aspects of Mathematical Logic. the Conference Will Thus Be of Interest to Participants From Multiple Research Communities. Invitations to the Conference Will Reflect This Breadth and Will Prioritize Early-career Researchers, Members of Historically Underrepresented Groups, and a Range of Institutions in the Midwest. the Conference Lectures Will Begin With an Introduction to the Classical Hausdorff and Packing Dimensions and an Overview of the Lectures to Come. Following That Will Be a Discussion of What It Means to Effectivize a Mathematical Concept. the Lectures Will Then Proceed to Use Effectivization to Define Algorithmic Versions of Classical Hausdorff and Packing Dimensions. Application of These Dimensions Will Be Discussed, Along With How They Unify Hausdorff Dimension With the Later Information Theories of Shannon and Kolmogorov. the Use of Algorithmic Dimensions to Develop Useful Notions of the Dimensions of Individual Points in Euclidean Space Will Be Emphasized, as It Leads to the Point-to-set Principle That Has Enabled Several Surprising Applications in Geometric Measure Theory. the Lectures Will Also Discuss Applications in Computational Complexity, Information Theory, and the Theory of Borel Normal Numbers. Beyond the Lectures, the Conference Will Provide Ample Time for Open Problem Sessions and Other Discussions. This Award Reflects NSF'S Statutory Mission and Has Been Deemed Worthy of Support Through Evaluation Using the Foundation's Intellectual Merit and Broader Impacts Review Criteria.