17 citations · 34 across the 7 of their papers we have counts for
7 papers
The Covering Radius of the Reed-Muller Code in
Randall Dougherty, R. Daniel Mauldin, Mark Tiefenbruck
We present methods for computing the distance from a Boolean polynomial on variables of degree (i.e., a member of the Reed-Muller code ) to the space of lower-…
On the Steinhaus tiling problem in three dimensions
Daniel Goldstein, R. Daniel Mauldin
H. Steinhaus asked in the 1950's whether there exists a set in the plane R^2 meeting every isometric copy of Z^2 in precisely one point. Such a "Steinhaus set" was constructed by J…
CH, V=L, Disintegrations of Measures, and Π^1_1 Sets
Karl Backs, Steve Jackson, R. Daniel Mauldin
In 1950 Maharam asked whether every disintegration of a -finite measure into -finite measures is necessarily uniformly -finite. Over the years under special conditions on…
The motif problem
E. Rodney Canfield, Ron Fertig, R. Daniel Mauldin +1
Fix a choice and ordering of four pairwise non-adjacent vertices of a parallelepiped, and call a motif a sequence of four points in R^3 that coincide with these vertices for some,…
Translating the Cantor set by a random
Randall Dougherty, Jack Lutz, R. Daniel Mauldin +1
We determine the constructive dimension of points in random translates of the Cantor set. The Cantor set "cancels randomness" in the sense that some of its members, when added to M…
Divergent Square Averages
Zoltan Buczolich, R. Daniel Mauldin
We answer a question of J. Bourgain. We show that the sequence n^2 is L^1-universally bad.