English
Related papers

Related papers: Expected covering radius of a translation surface

200 papers

This paper gives lower and upper bounds on the covering radius of codes over $\Z_{2^s}$ with respect to homogenous distance. We also determine the covering radius of various Repetition codes, Simplex codes (Type $\alpha$ and Type $\beta$)…

Information Theory · Computer Science 2012-06-26 Manish. K. Gupta , C. Durairajan

We study the quantity $\mbox{KVol}$ defined as the supremum, over all pairs of closed curves, of their algebraic intersection, divided by the product of their lengths, times the area of the surface. The surfaces we consider live in the…

Dynamical Systems · Mathematics 2022-09-27 Smaïl Cheboui , Arezki Kessi , Daniel Massart

We consider a family of embedded, mean convex hypersurfaces which evolve by the mean curvature flow. It follows from general results of White that the inscribed radius at each point on the surface is at least $\frac{c}{H}$, where $c$ is a…

Differential Geometry · Mathematics 2015-10-05 S. Brendle

For two-dimensional orientable hyperbolic orbifolds, we show that the radius of a maximal embedded disk is greater or equal to an explicit constant \rho_T, with equality if and only if the orbifold is a sphere with three cone points of…

Geometric Topology · Mathematics 2014-06-23 Federica Fanoni

A \emph{surface of translation} is a sum $(u,v)\mapsto\gt\alpha(u)+\gt\beta(v)$ of two space curves: a \emph{path} $\gt\alpha$ and a \emph{profile} $\gt\beta$. A fundamental problem of differential geometry and shell theory is to determine…

Differential Geometry · Mathematics 2023-12-27 Hussein Nassar

In this paper, we study spectral gaps of closed hyperbolic surfaces for large genus. We show that for any fixed $k\geq 1$, as the genus goes to infinity, the maximum of $\lambda_k-\lambda_{k-1}$ over any thick part of the moduli space of…

Differential Geometry · Mathematics 2025-01-17 Yunhui Wu , Haohao Zhang

The algebraic translational surface is a typical modeling surface in computer aided design and architecture industry. In this paper, we give a necessary and sufficient condition for that algebraic surface having a standard parametric…

Algebraic Geometry · Mathematics 2014-05-13 Sonia Perez-Diaz , Liyong Shen

We give sharp upper bounds on the maximal injectivity radius of finite-area hyperbolic surfaces and use them, for each g at least 2, to identify a constant r_{g-1,2} with the property that the set of closed genus-g hyperbolic surfaces with…

Geometric Topology · Mathematics 2015-05-27 Jason DeBlois

In this paper we are interested in the stratum H^{hyp}(4) of translation surfaces, which consists of pairs (M,\omega), where M is a hyper-elliptic Riemann surface of genus 3, and \omega is a holopmorphic 1-form on M having only one zero. We…

Geometric Topology · Mathematics 2016-01-20 Duc-Manh Nguyen

The percolation threshold and wrapping probability $R_{\infty}$ for the two-dimensional problem of continuum percolation on the surface of a Klein bottle have been calculated by the Monte Carlo method with the Newman--Ziff algorithm for…

Disordered Systems and Neural Networks · Physics 2015-06-09 V. D. Borman , A. M. Grekhov , V. N. Tronin , I. V. Tronin

Random packing of unoriented regular polygons and star polygons on a two-dimensional flat, continuous surface is studied numerically using random sequential adsorption algorithm. Obtained results are analyzed to determine saturated random…

Statistical Mechanics · Physics 2016-03-27 Michał Cieśla , Jakub Barbasz

Let $\Sigma_g$ be a closed Riemann surface of genus $g$. Let $G$ be a finite subgroup of the automorphism group of $\Sigma_g$. It is well known that there exists a smooth $G$-equivariant embedding from $\Sigma_g$ to some Euclidean space…

Geometric Topology · Mathematics 2025-11-21 Chao Wang , Zhongzi Wang

An embedding of a graph on a translation surface is said to be \emph{systolic} if each vertex of the graph corresponds to a singular point (or marked point) and each edge corresponds to a shortest saddle connection on the translation…

Geometric Topology · Mathematics 2025-07-15 Achintya Dey , Bidyut Sanki

We prove for the first time a pointwise lower estimate of the normal injectivity radius of an embedded hypersurface in an arbitrary Riemannian manifold. Main applications include: (i) a pointwise lower estimate of the graphing radius of a…

Differential Geometry · Mathematics 2025-11-26 Sebastian Boldt , Batu Güneysu , Stefano Pigola

We give a curvature dependent lower bound for the filling radius of all closed Riemannian manifolds as well as an upper one for manifolds which are the total space of a Riemannian submersion. The latter applies also to the case of…

Differential Geometry · Mathematics 2022-06-17 Manuel Cuerno , Luis Guijarro

If (M^n, g) is a complete Riemannian manifold with filling radius at least R, then we prove that it contains a ball of radius R and volume at least c(n)R^n. If (M^n, hyp) is a closed hyperbolic manifold and if g is another metric on M with…

Differential Geometry · Mathematics 2007-05-23 Larry Guth

If M is a closed simple 3-manifold whose fundamental group contains a genus-g surface group for some g>1, and if the dimension of H_1(M;Z_2) is at least max(3g-1,6), we show that M contains a closed, incompressible surface of genus at most…

Geometric Topology · Mathematics 2010-10-20 Marc Culler , Peter B. Shalen

This paper gives lower and upper bounds on the covering radius of codes over $\mathbb{Z}_{p^2}$ with respect to Lee distance. We also determine the covering radius of various Repetition codes over $\mathbb{Z}_{p^2}.$

Information Theory · Computer Science 2017-11-07 N. Annamalai , C. Durairajan

We prove several variations on the results of Ricci and Travaglini concerning bounds for convolution with all rotations of a measure supported by a fixed convex curve in the plane. Estimates are obtained for averages over higher-dimensional…

Classical Analysis and ODEs · Mathematics 2007-05-23 Luca Brandolini , Allan Greenleaf , Giancarlo Travaglini

The cover time of a finite connected graph is the expected number of steps needed for a simple random walk on the graph to visit all vertices of the graph. It is known that the cover time of any finite connected $n$-vertex graph is at least…

Discrete Mathematics · Computer Science 2022-05-10 Naoki Matsumoto , Yuuki Takai