Algebraic Geometry Commons^™

A Question Of Transparency, John Adam

Mathematics & Statistics Faculty Publications

Question 1: Why is it easier to see through rain than fog?

Start thinking about this by imagining a fixed volume (V) of water being dispersed into, say, N identical droplets of diameter d. Surface area and volume considerations should lead to the answer in terms of V and d.

Question 2: (a) How "long" (in meters) might such a rain shower or fog bank be?

Hint: Suppose you are looking along a linear stack of S cubes with 1-m sides (through the rain or fog). Each cube contains N drops. If p is the visibility (i.e., the fraction of …

Model-Free Organization Of Patient Reported Outcomes Data: Geometrical Rep-Resentation Of The Modified Compartmen-Talization Method, Manasi Sheth, N. Rao Chaganty

Mathematics & Statistics Faculty Publications

There is a recent advancement in the field of mathematics and statistics to understand the geometry or connectedness of the data due to the massive amounts of data being generated. The data provided for analyses are usually very large and need to be organized and minimized in order to make it more useful and meaningful. In biostatistics or medical field, it is important for patients to have access to high-quality, safe and effective and/ or efficacious medical products. It is quite necessary to ascertain that the patients and their care-partners stay at the center of the regulatory decision-making process. In …

A Question Of Transparency: Solutions For Fermi Questions, March 2025, John Adam

Mathematics & Statistics Faculty Publications

Question 1: Why is it easier to see through rain than fog?

Start thinking about this by imagining a fixed volume (V) of water being dispersed into, say, N identical droplets of diameter d. Surface area and volume considerations should lead to the answer in terms of V and d.

Solution to Question 1: N = VI(πd³/6) = 6V/πd³ ≈ 2V/d³.

The cross-sectional area A of each drop is πd²/4 ≈ 3d²/4, so the total area blocked off (assuming no overlapping drops—so this is an upper bound) is NA ≈ 1.5V/d, so the area blocked off is inversely proportional to …

More Properties Of Optimal Polynomial Approximants In Hardy Spaces, Raymond Cheng, Christopher Felder

Mathematics & Statistics Faculty Publications

We study optimal polynomial approximants (OPAs) in the classical Hardy spaces on the unit disk, H^p (1 < p < ∞). For fixed f ∈ H^p and n ∈ N, the OPA of degree n associated to f is the polynomial which minimizes the quantity ∥qf −1∥_p over all complex polynomials q of degree less than or equal to n. We begin with some examples which illustrate, when p ≠ 2, how the Banach space geometry makes the above minimization problem interesting. We then weave through various results concerning limits and roots of these polynomials, including results which show that OPAs can be witnessed as solutions …

Another Angle On Perspective: Solutions For Fermi Questions, May 2023, John Adam

Mathematics & Statistics Faculty Publications

No abstract provided.

Ellipses, Leaves, And Solar Crescents, John Adam

Mathematics & Statistics Faculty Publications

No abstract provided.

Like A Bridge Over Colored Water: A Mathematical Review Of The Rainbow Bridge: Rainbows In Art, Myth, And Science, John A. Adam

Mathematics & Statistics Faculty Publications

Commenting on a recent book, the author discusses various views of the rainbow: its role in culture, its scientific description, and its mathematical theory.