Generalized threshold arrangements

by   A. R. Balasubramanian, et al.

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 characteristic polynomial of the Shi threshold and the Catalan threshold arrangements was an open problem in Stanley's list of problems in [1]. Seunghyun Seo solved both the problems by clever arguments using the finite field method in [3,4]. However, in his paper, he left open the problem of computing the characteristic polynomial of a broader class of threshold arrangements, the so-called "generalized threshold" arrangements whose defining set of hyperplanes is given by x_i + x_j = -l,-l+1,...,m-1,m for 1 < i < j < n where l,m ∈N. In this paper, we present a method for computing the characteristic polynomial of this family of arrangements.



There are no comments yet.


page 1

page 2

page 3

page 4


On the Seidel spectrum of threshold graphs

In this paper, we analyse spectral properties of Seidel matrix (denoted ...

Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic

We prove that the discrete logarithm problem can be solved in quasi-poly...

Faster Algorithms via Waring Decompositions

We show that decompositions of certain polynomials as sums of powers of ...

Computing the Characteristic Polynomial of a Finite Rank Two Drinfeld Module

Motivated by finding analogues of elliptic curve point counting techniqu...

On a fast and nearly division-free algorithm for the characteristic polynomial

We review the Preparata-Sarwate algorithm, a simple O(n^3.5) method for ...

A numerical approach for the filtered generalized Cech complex

In this paper, we present an algorithm to compute the filtered generaliz...

Fast Multivariate Multipoint Evaluation Over All Finite Fields

Multivariate multipoint evaluation is the problem of evaluating a multiv...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.