Finite sets of d-planes in affine space

Publication date 10 September 2009

Abstract: Let

A

be a subvariety of affine space

m a t h b b A^{n}

whose irreducible components are

d

-dimensional linear or affine subspaces of

m a t h b b A^{n}

. Denote by

D (A) s u b s e t m a t h b b N^{n}

the set of exponents of standard monomials of

A

. We show that the combinatorial object

D (A)

reflects the geometry of

A

in a very direct way. More precisely, we define a

d

-plane in

m a t h b b N^{n}

as being a set

g a m m a + o p l u s_{j i n J} m a t h b b N e_{j}

, where

and

g a m m a_{j} = 0

for all

j i n J

. We call the

d

-plane thus defined to be parallel to

o p l u s_{j i n J} m a t h b b N e_{j}

. We show that the number of

d

-planes in

D (A)

equals the number of components of

A

. This generalises a classical result, the finiteness algorithm, which holds in the case

d = 0

. In addition to that, we determine the number of all

d

-planes in

D (A)

parallel to

o p l u s_{j i n J} m a t h b b N e_{j}

, for all

J

. Furthermore, we describe

D (A)

in terms of the standard sets of the intersections

A c a p X_{1} = l a m b d a

, where

l a m b d a

runs through

m a t h b b A^{1}

.

Recommendations

Cites work

Cited in

(3)

Describes a project that uses

Uses Software

This page was built for publication: Finite sets of \(d\)-planes in affine space