Graph-null sets
Combinatorics
2026-02-03 v1 Classical Analysis and ODEs
Abstract
We say that a plane set is {\it graph-null,} if there is a function such that . A plane set has the {\it translational Kakeya property} if, for every translated copy of and for every , there is a finite sequence of vertical and horizontal translations bringing to such that the area touched during the horizontal translations is less than . These properties are equivalent if is compact. We show that the graph of every absolutely continuous function is graph-null. Also, the graph of a typical continuous function is graph-null. Therefore, there are nowhere differentiable continuous functions whose graphs are graph-null. Still, we show that there exists a continuous function whose graph is not graph-null.
Keywords
Cite
@article{arxiv.2602.01195,
title = {Graph-null sets},
author = {M. Laczkovich and A. Máthé},
journal= {arXiv preprint arXiv:2602.01195},
year = {2026}
}