PreprintCC BY-SA 4.0arXiv
The Table Problem for Convex Domains
Abstract
We prove a generalized Table Theorem for bounded convex domains in the plane. Then we prove a variation of the Table Problem for compactly supported functions on the plane. Our method is based on relating the table problem on a surface to the square peg problem for a configuration of star-shaped curves in the tangent bundle of the surface.
Related
- W1,p error estimates of an IPDG and a class of HDG methods for the Poisson problem on convex polyhedral domains
- SLOPE DETERMINATION ON CONVEX DOMAINS: DIRICHLET DATA AND CRANDALL-PAZY DIRECTIONS
- Kobayashi visibility of strictly convex domains
- Strongly linearly convex exhaustion of a class of ℂ-convex domains
- Optimal transport to non-convex polyhedral domains
BibTeX
@misc{sadr2026table,
title = {{The Table Problem for Convex Domains}},
author = {Ali Naseri Sadr},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.41010},
eprint = {2610.41010},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.41010},
note = {CC BY-SA 4.0},
}
RIS
TY - UNPB
TI - The Table Problem for Convex Domains
AU - Ali Naseri Sadr
PY - 2026
DA - 2026/10/29
PB - arXiv
DO - 10.48550/arxiv.2610.41010
UR - https://arxiv.org/abs/2610.41010
AB - We prove a generalized Table Theorem for bounded convex domains in the plane. Then we prove a variation of the Table Problem for compactly supported functions on the plane. Our method is based on relating the table problem on a surface to the square peg problem for a configuration of star-shaped curves in the tangent bundle of the surface.
ER -