English
Related papers

Related papers: Refinements of the braid arrangement and two param…

200 papers

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

We establish counting formulas and bijections for deformations of the braid arrangement. Precisely, we consider real hyperplane arrangements such that all the hyperplanes are of the form $x\_i-x\_j=s$ for some integer $s$. Classical…

Combinatorics · Mathematics 2021-06-15 Olivier Bernardi

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

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

A topological hyperplane is a subspace of R^n (or a homeomorph of it) that is topologically equivalent to an ordinary straight hyperplane. An arrangement of topological hyperplanes in R^n is a finite set H such that k topological…

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

We show new bijective proofs of previously known formulas for the number of regions of some deformations of the braid arrangement, by means of a bijection between the no-broken-circuit sets of the corresponding integral gain graphs and some…

Combinatorics · Mathematics 2014-08-26 Sylvie Corteel , David Forge , Véronique Ventos

The resonance arrangement $\mathcal{A}_n$ is the arrangement of hyperplanes which has all non-zero $0/1$-vectors in $\mathbb{R}^n$ as normal vectors. It is the adjoint of the Braid arrangement and is also called the all-subsets arrangement.…

Combinatorics · Mathematics 2025-05-21 Lukas Kühne

In 1996, Stanley extended the classical Catalan arrangement and semiorder arrangement, which are called the Catalan-type arrangement $\mathcal{C}_{n,A}$ and the semiorder-type arrangement $\mathcal{C}_{n,A}^*$ in this paper. By establishing…

Combinatorics · Mathematics 2025-07-08 Yanru Chen , Suijie Wang , Jinxing Yang , Chengdong Zhao

The collection of reflecting hyperplanes of a finite Coxeter group is called a reflection arrangement and it appears in many subareas of combinatorics and representation theory. We focus on the problem of counting regions of reflection…

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

Consider the collection of hyperplanes in $\mathbb{R}^n$ whose defining equations are given by $\{x_i + x_j = 0\mid 1\leq i<j\leq n\}$. This arrangement is called the threshold arrangement since its regions are in bijection with labeled…

Combinatorics · Mathematics 2021-08-10 Priyavrat Deshpande , Krishna Menon , Anurag Singh

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

The Catalan numbers $C_n$ are an extremely well-studied sequence of numbers that appear as the answer to many combinatorial problems. Two generalizations of these numbers that have been studied are the Fuss-Catalan numbers and the…

Combinatorics · Mathematics 2022-02-03 Parth Chavan , Andrew Lee , Karthik Seetharaman

The Catalan numbers (C_n)_{n >= 0} = 1,1,2,5,14,42,... form one of the most venerable sequences in combinatorics. They have many combinatorial interpretations, from counting bracketings of products in non-associative algebra to counting…

Combinatorics · Mathematics 2021-02-11 Paul E. Gunnells

We classify one-element extensions of a hyperplane arrangement by the induced adjoint arrangement. Based on the classification, several kinds of combinatorial invariants including Whitney polynomials, characteristic polynomials, Whitney…

Combinatorics · Mathematics 2023-08-22 Hang Cai , Houshan Fu , Suijie Wang

We characterize in simple terms the Pak-Stanley labels $\lambda(R)$ of the regions $R$ of the $m$-Catalan arrangement. We also propose a simple algorithm that returns $R$ from $\lambda(R)$. Finally, we characterize in close terms the labels…

Combinatorics · Mathematics 2019-12-12 Rui Duarte , António Guedes de Oliveira

We establish a general bijective framework for encoding faces of some classical hyperplane arrangements. Precisely, we consider hyperplane arrangements in $\mathbb{R}^n$ whose hyperplanes are all of the form $\{x_i-x_j=s\}$ for some…

Combinatorics · Mathematics 2025-03-04 Olivier Bernardi

We investigate several hyperplane arrangements that can be viewed as deformations of Coxeter arrangements. In particular, we prove a conjecture of Linial and Stanley that the number of regions of the arrangement x_i - x_j = 1, 1 \leq i<j…

Combinatorics · Mathematics 2007-05-23 Alexander Postnikov , Richard P. Stanley

Let $\Phi$ be an irreducible crystallographic root system with Weyl group $W$ and coroot lattice $\check{Q}$, spanning a Euclidean space $V$. Let $m$ be a positive integer and $\aA^m_\Phi$ be the arrangement of hyperplanes in $V$ of the…

Combinatorics · Mathematics 2007-05-23 C. A. Athanasiadis , E. Tzanaki

We give a complete formula for the characteristic polynomial of hyperplane arrangements $\mathcal J_n$ consisting of the hyperplanes $x_i+x_j=1$, $x_k=0$, $x_l=1$, $ 1\leq i, j, k, l\leq n$. The formula is obtained by associating hyperplane…

Combinatorics · Mathematics 2017-01-26 Joungmin Song

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
‹ Prev 1 2 3 10 Next ›