Polysurfacic tori or kideas are three-dimensional objects formed by rotating a regular polygon around a central axis. These toric shapes are referred to as “polysurfacic” because their characteristics, such as the n...Polysurfacic tori or kideas are three-dimensional objects formed by rotating a regular polygon around a central axis. These toric shapes are referred to as “polysurfacic” because their characteristics, such as the number of sides or surfaces separated by edges, can vary in a non-trivial manner depending on the degree of twisting during the revolution. We use the term “Kideas” to specifically denote these polysurfacic tori, and we represent the number of sides (referred to as “facets”) of the original polygon followed by a point, while the number of facets from which the torus is twisted during its revolution is indicated. We then explore the use of concave regular polygons to generate Kideas. We finally give acceleration for the algorithm for calculating the set of prime numbers.展开更多
This letter is a continuation of refs.[1] and [2]. Let d≥2, S<sub>d</sub>={u<sub>k</sub>（1≤k≤n）} be a finiteset of points in the d-dimensional unit cube [0, 1)<sup>d</sup>, whe...This letter is a continuation of refs.[1] and [2]. Let d≥2, S<sub>d</sub>={u<sub>k</sub>（1≤k≤n）} be a finiteset of points in the d-dimensional unit cube [0, 1)<sup>d</sup>, where u<sub>k</sub>=(u<sub>1,k</sub>, u<sub>2,k</sub>,…,u<sub>d,k</sub>)展开更多
文摘Polysurfacic tori or kideas are three-dimensional objects formed by rotating a regular polygon around a central axis. These toric shapes are referred to as “polysurfacic” because their characteristics, such as the number of sides or surfaces separated by edges, can vary in a non-trivial manner depending on the degree of twisting during the revolution. We use the term “Kideas” to specifically denote these polysurfacic tori, and we represent the number of sides (referred to as “facets”) of the original polygon followed by a point, while the number of facets from which the torus is twisted during its revolution is indicated. We then explore the use of concave regular polygons to generate Kideas. We finally give acceleration for the algorithm for calculating the set of prime numbers.
基金Project supported in part by the National Natural Science Foundation of China a DAAD-K.C.Wong Research Grant.
文摘This letter is a continuation of refs.[1] and [2]. Let d≥2, S<sub>d</sub>={u<sub>k</sub>（1≤k≤n）} be a finiteset of points in the d-dimensional unit cube [0, 1)<sup>d</sup>, where u<sub>k</sub>=(u<sub>1,k</sub>, u<sub>2,k</sub>,…,u<sub>d,k</sub>)
