English
Related papers

Related papers: Characteristic and Ehrhart polynomials

200 papers

Kamiya, Takemura, and Terao introduced a characteristic quasi-polynomial which enumerates the numbers of elements in the complement of hyperplane arrangements modulo positive integers. In this paper, we compute the characteristic…

Combinatorics · Mathematics 2026-03-03 Yusuke Mori , Norihiro Nakashima

The purpose of this paper is twofold. Firstly, we generalize the notion of characteristic polynomials of hyperplane and toric arrangements to those of certain abelian Lie group arrangements. Secondly, we give two interpretations for the…

Combinatorics · Mathematics 2019-12-30 Tan Nhat Tran , Masahiko Yoshinaga

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

We introduce a new method for showing that the roots of the characteristic polynomial of certain finite lattices are all nonnegative integers. This method is based on the notion of a quotient of a poset which will be developed to explain…

Combinatorics · Mathematics 2015-06-25 Joshua Hallam , Bruce E. Sagan

Let $\mathcal{A}$ be an affine hyperplane arrangement, $L(\mathcal{A})$ its intersection poset, and $\chi_{\mathcal{A}}(t)$ its characteristic polynomial. This paper aims to propose combinatorial structures for the factorization of…

Combinatorics · Mathematics 2026-02-03 Yanru Chen , Weikang Liang , Suijie Wang , Chengdong Zhao

Character polynomials are used to study the restriction of a polynomial representation of a general linear group to its subgroup of permutation matrices. A simple formula is obtained for computing inner products of class functions given by…

Representation Theory · Mathematics 2021-12-07 Sridhar Narayanan , Digjoy Paul , Amritanshu Prasad , Shraddha Srivastava

We primarily investigate the properties of characteristic polynomials of semimatroids. In particular, we provide a combinatorial interpretation of their coefficients, generalizing the Whitney's Broken Circuit Theorem. We also prove that the…

Combinatorics · Mathematics 2025-08-03 Houshan Fu

The resonance arrangement $\mathcal{A}_n$ is the arrangement of hyperplanes in $\mathbb{R}^n$ given by all hyperplanes of the form $\sum_{i \in I} x_i = 0$, where $I$ is a nonempty subset of $\{1,\dots,n\}$. We consider the characteristic…

Combinatorics · Mathematics 2021-06-30 Zachary Chroman , Mihir Singhal

A hyperplane arrangement is said to satisfy the ``Riemann hypothesis'' if all roots of its characteristic polynomial have the same real part. This property was conjectured by Postnikov and Stanley for certain families of arrangements which…

Combinatorics · Mathematics 2016-09-07 Christos A. Athanasiadis

Given a multiarrangement of hyperplanes we define a series by sums of the Hilbert series of the derivation modules of the multiarrangement. This series turns out to be a polynomial. Using this polynomial we define the characteristic…

Commutative Algebra · Mathematics 2007-10-11 Takuro Abe , Hiroaki Terao , Max Wakefield

Simplicial arrangements are a special class of hyperplane arrangements, having the property that every chamber is a simplicial cone. It is known that the simpliciality property is preserved under taking restrictions. In this article we…

Combinatorics · Mathematics 2026-05-07 Sebastian Degen , Lisa Henetmayr , Magdaléna Mišinová , Paweł Pielasa , Florian Rieg

In this paper, we will compute the characteristic polynomials for finite dimensional representations of classical complex Lie algebras and the exceptional Lie algebra of type G2, which can be obtained through the orbits of integral weights…

Representation Theory · Mathematics 2024-10-28 Chenyue Feng , Shoumin Liu , Xumin Wang

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

We show that the coefficients of the characteristic polynomial of a central hyperplane arrangement $\mathcal A$, coincide with the multidegrees of the Gauss map of a pencil of hypersurfaces naturally associated to $\mathcal A$. As a…

Algebraic Geometry · Mathematics 2025-06-05 Thiago Fassarella , Nivaldo Medeiros

We introduce the characteristic numbers and the chromatic polynomial of a tensor. Our approach generalizes and unifies the chromatic polynomial of a graph and of a matroid, characteristic numbers of quadrics in Schubert calculus, Betti…

Algebraic Geometry · Mathematics 2021-11-02 Austin Conner , Mateusz Michałek

We study a relation between roots of characteristic polynomials and intersection points of line arrangements. Using these results, we obtain a lot of applications for line arrangements. Namely, we give (i) a generalized addition theorem for…

Combinatorics · Mathematics 2014-04-17 Takuro Abe

The Ehrhart polynomial of a lattice polygon P is completely determined by the pair (b(P),i(P)) where b(P) equals the number of lattice points on the boundary and i(P) equals the number of interior lattice points. All possible pairs…

Combinatorics · Mathematics 2020-02-11 Johannes Hofscheier , Benjamin Nill , Dennis Öberg

The class of Worpitzky-compatible subarrangements of a Weyl arrangement together with an associated Eulerian polynomial was recently introduced by Ashraf, Yoshinaga and the first author, which brings the characteristic and Ehrhart…

Combinatorics · Mathematics 2022-01-26 Tan Nhat Tran , Akiyoshi Tsuchiya

Kamiya, Takemura, and Terao initiated the theory of the characteristic quasi-polynomial of an integral arrangement, which is a function counting the elements in the complement of the arrangement modulo positive integers. They gave a period…

Combinatorics · Mathematics 2023-03-08 Masamichi Kuroda , Shuhei Tsujie

In this article we give a computational study of combinatorics of the discriminantal arrangements. The discriminantal arrangements are parametrized by two positive integers n and k such that n>k. The intersection lattice of the…

Combinatorics · Mathematics 2013-01-14 Yasuhide Numata , Akimichi Takemura