English
Related papers

Related papers: Counting Shi regions with a fixed separating wall

200 papers

Given a Shi arrangement $\mathcal{A}_\Phi$, it is well-known that the total number of regions is counted by the parking number of type $\Phi$ and the total number of regions in the dominant cone is given by the Catalan number of type…

Combinatorics · Mathematics 2025-11-19 Aram Dermenjian , Eleni Tzanaki

This paper is about two arrangements of hyperplanes. The first --- the Shi arrangement --- was introduced by Jian-Yi Shi to describe the Kazhdan-Lusztig cells in the affine Weyl group of type $A$. The second --- the Ish arrangement --- was…

Combinatorics · Mathematics 2010-09-13 Drew Armstrong , Brendon Rhoades

In 1986, Shi derived the famous formula $(n+1)^{n-1}$ for the number of regions of the Shi arrangement, a hyperplane arrangement in $\mathbb{R}^n$. There are at least two different bijective explanations of this formula, one by Pak and…

Combinatorics · Mathematics 2020-08-07 Duncan Levear

The number of flats of a hyperplane arrangement is considered as a generalization of the Bell number and the Stirling number of the second kind. Robert Gill gave the exponential generating function of the number of flats of the extended…

Combinatorics · Mathematics 2021-11-10 Norihiro Nakashima , Shuhei Tsujie

In "Faces of a Hyperplane Arrangement Enumerated by Ideal Dimension, with Applications to Plane, Plaids, and Shi," Zaslavsky showed how to compute the number $r_\ell(\mathcal{A})$ of regions of a real hyperplane arrangement $\mathcal{A}$…

Combinatorics · Mathematics 2026-05-21 Finn Southerland , Lani Southern , Su Zhou

Hyperplanes of the form x_j = x_i + c are called affinographic. For an affinographic hyperplane arrangement in R^n, such as the Shi arrangement, we study the function f(M) that counts integral points in [1,M]^n that do not lie in any…

Combinatorics · Mathematics 2010-01-24 David Forge , Thomas Zaslavsky

In this paper we consider the hyperplane arrangement in $\mathbb{R}^n$ whose hyperplanes are $\{x_i + x_j = 1\mid 1\leq i < j\leq n\}\cup \{x_i=0,1\mid 1\leq i\leq n\}$. We call it the \emph{boxed threshold arrangement} since we show that…

Combinatorics · Mathematics 2021-02-25 Priyavrat Deshpande , Krishna Menon , Anurag Singh

A reduced divisor on a nonsingular variety defines the sheaf of logarithmic 1-forms. We introduce a certain coherent sheaf whose double dual coincides with this sheaf. It has some nice properties, for example, the residue exact sequence…

Algebraic Geometry · Mathematics 2007-05-23 Igor V. Dolgachev

We introduce a new family of hyperplane arrangements in dimension $n\geq3$ that includes both the Shi arrangement and the Ish arrangement. We prove that all the members of a given subfamily have the same number of regions - the connected…

Combinatorics · Mathematics 2018-11-19 Rui Duarte , António Guedes de Oliveira

We give an interpretation of the coefficients of the two variable refinement $D_{\Sh_n}(q,t)$ of the distance enumerator of the Shi hyperplane arrangement $\Sh_n$ in $n$ dimensions. This two variable refinement was defined by Stanley…

Combinatorics · Mathematics 2007-05-23 Sivaramakrishnan Sivasubramanian

We define arrangements of codimension-1 submanifolds in a smooth manifold which generalize arrangements of hyperplanes. When these submanifolds are removed the manifold breaks up into regions, each of which is homeomorphic to an open disc.…

Combinatorics · Mathematics 2014-03-04 Priyavrat Deshpande

It is well-known that Catalan numbers $C_n = \frac{1}{n+1} \binom{2n}{n}$ count the number of dominant regions in the Shi arrangement of type $A$, and that they also count partitions which are both $n$-cores as well as $(n+1)$-cores. These…

Combinatorics · Mathematics 2009-04-22 Susanna Fishel , Monica Vazirani

This paper explores and proves the one-seventh area triangle using a purely algebraic approach as opposed to a geometric one. A triangle set purely in the complex plane is used so that we can utilise features of the complex number system to…

General Mathematics · Mathematics 2025-10-21 Mathew Miltonhardy

We consider real hyperplane arrangements whose hyperplanes are of the form $\{x_i - x_j = s\}$ for some integer $s$, which we call deformations of the braid arrangement. In 2018, Bernardi gave a counting formula for the number of regions of…

Combinatorics · Mathematics 2026-03-27 Neha Goregaokar , Aaron Lin

Combining Carver's variant of the Farkas' lemma with the Flow Decomposition Theorem we show that the regions of any deformation of a graphical arrangement may be bijectively labeled with a set of weighted digraphs containing directed cycles…

Combinatorics · Mathematics 2026-04-14 Gábor Hetyei

The braid arrangement is the Coxeter arrangement of the type $A_\ell$. The Shi arrangement is an affine arrangement of hyperplanes consisting of the hyperplanes of the braid arrangement and their parallel translations. In this paper, we…

Combinatorics · Mathematics 2015-07-21 Daisuke Suyama , Hiroaki Terao

An arrangement of hyperplanes is a finite collection of hyperplanes in a real Euclidean space. To such a collection one associates the characteristic polynomial that encodes the combinatorics of intersections of the hyperplanes. Finding the…

Combinatorics · Mathematics 2019-04-19 A. R. Balasubramanian

This work introduces a locally refined version of the Adini finite element for the planar biharmonic equation on rectangular partitions with at most one hanging node per edge. If global continuity of the discrete functions is enforced, for…

Numerical Analysis · Mathematics 2025-05-12 Dietmar Gallistl

A hyperplane arrangement in $\mathbb{R}^n$ is a finite collection of affine hyperplanes. The regions are the connected components of the complement of these hyperplanes. By a theorem of Zaslavsky, the number of regions of a hyperplane…

Combinatorics · Mathematics 2023-09-12 Priyavrat Deshpande , Krishna Menon

The Separating Hyperplane theorem is a fundamental result in Convex Geometry with myriad applications. Our first result, Random Separating Hyperplane Theorem (RSH), is a strengthening of this for polytopes. $\rsh$ asserts that if the…

Machine Learning · Computer Science 2023-07-24 Chiranjib Bhattacharyya , Ravindran Kannan , Amit Kumar
‹ Prev 1 2 3 10 Next ›