#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2000

2006

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

The nucleus of a Veronese variety is the intersection of all its osculating hyperplanes. Various authors have given necessary and sufficient conditions for the nucleus to be empty. We present an explicit formula for the dimension of this nucleus for arbitrary characteristic of the ground field. As a corollary, we obtain a dimension formula for that subspace… (More)

- Johannes Gmainer
- Eur. J. Comb.
- 2001

Each normal rational curve Γ in PG(n, F ) admits a group PΓL(Γ) of automorphic collineations. It is well known that for characteristic zero only the empty and the entire subspace are PΓL(Γ)–invariant. In case of characteristic p > 0 there may be further invariant subspaces. For #F ≥ n+ 2, we give a construction of all PΓL(Γ)–invariant subspaces. It turns… (More)

A k–nucleus of a normal rational curve in PG(n, F ) is the intersection over all k–dimensional osculating subspaces of the curve (k ∈ {−1, 0, . . . , n− 1}). It is well known that for characteristic zero all nuclei are empty. In case of characteristic p > 0 and #F ≥ n the number of non–zero digits in the representation of n+ 1 in base p equals the number of… (More)

Let be Cayley’s ruled cubic surface in a projective three-space over any commutative field . We determine all collineations fixing , as a set, and all cubic forms defining . For both problems the cases turn out to be exceptional. On the other hand, if then the set of simple points of can be endowed with a non-symmetric distance function. We describe the… (More)

In this paper we study a class of plane self-affine lattice tiles that are defined using polyominoes. In particular, we characterize which of these tiles are homeomorphic to a closed disk. It turns out that their topological structure depends very sensitively on their defining parameters. In order to achieve our results we use an algorithm of Scheicher and… (More)

- ‹
- 1
- ›