On subspace arrangements of type D

نویسندگان

  • Eva Maria Feichtner
  • Dmitry N. Kozlov
چکیده

Let D n;k denote the subspace arrangement formed by all linear subspaces in R n given by equations of the form k. Some important topological properties of such a subspace arrangement depend on the topology of its intersection lattice. In previous work on a larger class of subspace arrangements by Bjj orner & Sagan BS] the topology of the intersection lattice L(D n;k) = n;k turned out to be a particularly interesting and diicult case. We prove in this paper that Pure((

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Homology of the Real Complement of a k-parabolic Subspace Arrangement

The k-parabolic subspace arrangement, introduced by Barcelo, Severs and White, is a generalization of the well known k-equal arrangements of type-A and type-B. In this paper we use the discrete Morse theory of Forman to study the homology of the complements of k-parabolic subspace arrangements. In doing so, we recover some known results of Björner et al. and provide a combinatorial interpretati...

متن کامل

The Module of Derivations for an Arrangement of Subspaces

Let V be a linear space of dimension over a field K. By an arrangement we shall mean a finite collection of affine subspaces of V . If all of the subspaces in an arrangement A have codimension k then we say that A is an ( , k)arrangement. If k = 1 and so A is a hyperplane arrangement then we shall say that A is an -arrangement. Let A be an arrangement and S the coordinate ring for V . For each ...

متن کامل

Skeleton simplicial evaluation codes

For a subspace arrangement over a finite field we study the evaluation code defined on the arrangements set of points. The length of this code is given by the subspace arrangements characteristic polynomial. For coordinate subspace arrangements the dimension is bounded below by the face vector of the corresponding simplicial complex. The minimum distance is determined for coordinate subspace ar...

متن کامل

Subspace Arrangements of Type B N and D N Send Proofs To

Let Dn,k be the family of linear subspaces of R given by all equations of the form 1xi1 = 2xi2 = . . . = kxik , for 1 ≤ i1 < . . . < ik ≤ n and ( 1, . . . , k) ∈ {+1,−1}. Also let Bn,k,h be Dn,k enlarged by the subspaces xj1 = xj2 = . . . = xjh = 0, for 1 ≤ j1 < . . . < jh ≤ n. The special cases Bn,2,1 and Dn,2 are well known as the reflection hyperplane arrangements corresponding to the Coxete...

متن کامل

Edge Colored Hypergraphic Arrangements

A subspace arrangement defined by intersections of hyperplanes of the braid arrangement can be encoded by an edge colored hypergraph. It turns out that the characteristic polynomial of this type of subspace arrangement is given by a generalized chromatic polynomial of the associated edge colored hypergraph. The main result of this paper supplies a sufficient condition for the existence of non-t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 210  شماره 

صفحات  -

تاریخ انتشار 2000