On deterministic and random rolling of polyhedra (Q2820180)

From MaRDI portal





scientific article; zbMATH DE number 6627343
Language Label Description Also known as
default for all languages
No label defined
    English
    On deterministic and random rolling of polyhedra
    scientific article; zbMATH DE number 6627343

      Statements

      0 references
      14 September 2016
      0 references
      convex polyhedron
      0 references
      Finsler connection, random rolling
      0 references
      On deterministic and random rolling of polyhedra (English)
      0 references
      Let \(\mathcal P\) be a convex polyhedron standing with one of its face on a fixed plane \(\Sigma\). Assume that the touching face \(\mathcal F\) is a \(k\)-gon. A rolling of \(\mathcal P\) means that it is rotated into another similar position around any of its edge lying on the plane \(\Sigma\). So after rolling another face of \(\mathcal P\) will lean on the plane. A subset \(Y\) of \(\Sigma\) is locally-dense if there is a point \(P\in \Sigma\) and a neighborhood \(U(P)\) of \(P\) such that \(Y\cap U(P)\) is dense in \(U(P)\). The set \({\mathcal M}_{{\mathcal P}} =\{X\in \Sigma : X\) coincides of some vertex of \(\mathcal P\) in some position of \(\mathcal P\}\) is called a trace of \(\mathcal P\) after all rolling and \({\mathcal P}\) is \(D\)-polyhedron if the set \({\mathcal M}_{{\mathcal P}}\) is everywhere dense on \(\Sigma\). Now randomly roll \(\mathcal P\) around one of the edges of \(\mathcal F\) or keep the position of \(\mathcal P\) with probability \({1\over{k+1}}\). Define the trace in similar way as it is for non random case and denote it by \(RAN({\mathcal M}_{{\mathcal P}})\). Let \(S\) be a disc and \(\varepsilon>0\). A set \({\mathcal X}\) is said to be \(\varepsilon\)-dense if for every point \(P\in S\) there is a point \(X\in{\mathcal X} \cap S\) for which \(\rho(P, X)<\varepsilon\), where \(\rho\) is the metric. The main results of the paper are the following statements:NEWLINENEWLINE\textbf{Theorem 1.} If a polyhedron \({\mathcal P}\) is locally-dense then it is a \(D\)-polyhedron.NEWLINENEWLINE\textbf{Theorem 2.} For almost all tetrahedron \({\mathcal P}\) with probability 1 there are infinitely many discs \(S\) for which \(RAN({\mathcal M}_{{\mathcal P}})\cap S\) is an \(\varepsilon\)-dense set in \(S\).
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references