In this paper we extend the classical notion of offset to the concept of generalized offset to hypersurfaces. In addition, we present a complete theoretical analysis of the rationality and unirationality of generalized offsets. Characterizations for deciding whether the generalized offset to a hyper
Generation of random hypersurfaces
โ Scribed by M.Y. Youakim; C.H. Liu; K.C. Yeh
- Publisher
- Elsevier Science
- Year
- 1971
- Tongue
- English
- Weight
- 499 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper, we propose an algorithm for the random generation of underdiagonal walks. We consider the plane walks which are made up of different kinds of east, north-east and north steps and which start from the origin and remain under the main diagonal. The algorithm is very simple: it randomly
We present a bijection between the set of factors of given length of Sturmian words and some set of triples of nonnegative integers. This bijection and its inverse are both computable in linear time. Its applications are: a bijective proof of Mignosi's formula for counting Sturmian words, a linear p