Papers
Topics
Authors
Recent
Search
2000 character limit reached

Signotopes with few plus signs

Published 28 Nov 2024 in math.CO | (2411.19208v2)

Abstract: Arrangements of pseudohyperplanes are widely studied in computational geometry. A rich subclass of pseudohyerplane arrangements, which has gained more attention in recent years, is the so-called signotopes. Introduced by Manin and Schechtman (1989), the higher Bruhat order is a natural order of rr-signotopes on nn elements, with the signotope corresponding to the cyclic arrangement as the minimal element. In this paper, we show that the lower (and by symmetry upper) levels of this higher Bruhat order contain the same number of elements for a fixed difference n−rn-r. This result implies that given the difference d=n−rd=n-r and pp, the number of one-element extensions of the cyclic arrangement of nn hyperplanes in R<sup>d\mathbb{R}<sup>d with at most pp points on one side of the extending pseudohyperplane does not depend on nn, as long as n≥d+pn \geq d + p.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.