Longest convex lattice chains (Q390150): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / review text | |||
Let \(T\) be a triangle in the plane having two fixed vertices \(v_0,v_1\in{\mathbb Z}^2\), the integer lattice. A convex lattice chain in \(T\) (from \(v_0\) to \(v_1\)) of length \(n\) is a subset of points \(p_0,p_1,\dots,p_n\in{\mathbb Z}^2\cap T\) such that \(p_0=v_0\), \(p_n=v_1\) and the vertices of the convex hull \(\text{conv}\{p_0,\dots,p_n\}\) are precisely \(p_0,\dots,p_n\). Denoting by \(\ell(T)\) the largest \(n\) such that \(T\) contains a convex lattice chain of length \(n\), the authors study the maximum value of \(\ell(T)\) when the area \(|T|\) is given. More precisely, it is proved that there exists \(t_0>0\) such that if \(|T|>t_0\) then \[ \frac{1}{8}\bigl(\ell(T)-1\bigr)\ell(T)^2\leq|T|. \] Another bound on \(\ell(T)\) in terms of the lattice width is also obtained. | |||
Property / review text: Let \(T\) be a triangle in the plane having two fixed vertices \(v_0,v_1\in{\mathbb Z}^2\), the integer lattice. A convex lattice chain in \(T\) (from \(v_0\) to \(v_1\)) of length \(n\) is a subset of points \(p_0,p_1,\dots,p_n\in{\mathbb Z}^2\cap T\) such that \(p_0=v_0\), \(p_n=v_1\) and the vertices of the convex hull \(\text{conv}\{p_0,\dots,p_n\}\) are precisely \(p_0,\dots,p_n\). Denoting by \(\ell(T)\) the largest \(n\) such that \(T\) contains a convex lattice chain of length \(n\), the authors study the maximum value of \(\ell(T)\) when the area \(|T|\) is given. More precisely, it is proved that there exists \(t_0>0\) such that if \(|T|>t_0\) then \[ \frac{1}{8}\bigl(\ell(T)-1\bigr)\ell(T)^2\leq|T|. \] Another bound on \(\ell(T)\) in terms of the lattice width is also obtained. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 52A10 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6249156 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
lattice points | |||
Property / zbMATH Keywords: lattice points / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
convex chains in triangles | |||
Property / zbMATH Keywords: convex chains in triangles / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: María A. Hernández Cifre / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.comgeo.2013.09.002 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2051266346 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19:26, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Longest convex lattice chains |
scientific article |
Statements
Longest convex lattice chains (English)
0 references
22 January 2014
0 references
Let \(T\) be a triangle in the plane having two fixed vertices \(v_0,v_1\in{\mathbb Z}^2\), the integer lattice. A convex lattice chain in \(T\) (from \(v_0\) to \(v_1\)) of length \(n\) is a subset of points \(p_0,p_1,\dots,p_n\in{\mathbb Z}^2\cap T\) such that \(p_0=v_0\), \(p_n=v_1\) and the vertices of the convex hull \(\text{conv}\{p_0,\dots,p_n\}\) are precisely \(p_0,\dots,p_n\). Denoting by \(\ell(T)\) the largest \(n\) such that \(T\) contains a convex lattice chain of length \(n\), the authors study the maximum value of \(\ell(T)\) when the area \(|T|\) is given. More precisely, it is proved that there exists \(t_0>0\) such that if \(|T|>t_0\) then \[ \frac{1}{8}\bigl(\ell(T)-1\bigr)\ell(T)^2\leq|T|. \] Another bound on \(\ell(T)\) in terms of the lattice width is also obtained.
0 references
lattice points
0 references
convex chains in triangles
0 references