Random compact set meets the graph of nonrandom continuous function
Authors: Boris Tsirelson
Abstract: On the plane, every random compact set with almost surely uncountable first projection intersects with a high probability the graph of some continuous function. Implication: every black noise over the plane fails to factorize when the plane is split by such graph.
Explore the paper tree
Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant
Look for similar papers (in beta version)
By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.