Papers
Topics
Authors
Recent
Search
2000 character limit reached

The weak separation in higher dimensions

Published 22 Apr 2019 in math.CO | (1904.09798v3)

Abstract: For an odd integer $r>0$ and an integer $n>r$, we introduce a notion of weakly $r$-separated collections of subsets of $[n]={1,2,\ldots,n}$. When $r=1$, this corresponds to the concept of weak separation introduced by Leclerc and Zelevinsky. In this paper, extending results due to Leclerc-Zelevinsky, we develop a geometric approach to establish a number of nice combinatorial properties of maximal weakly r-separated collections. As a supplement, we also discuss an analogous concept when $r$ is even.

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.

Collections

Sign up for free to add this paper to one or more collections.