Related papers: Computing the Tutte polynomial of a hyperplane arr…
The Poincar\'e polynomial of the complement of an arrangements in a non compact group is a specialization of the $G$-Tutte polynomial associated with the arrangement. In this article we show two unimodular elliptic arrangements (built up…
We compute the l^2-Betti numbers of the complement of a finite collection of affine hyperplanes in complex space. At most one of the l^2-Betti numbers is non-zero.
We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…
Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate…
The Tutte polynomial is a significant invariant of graphs and matroids. It is well-known that it has three equivalent definitions: bases expansion, rank generating function, and deletion-contraction formula. The polymatroid Tutte polynomial…
M. Mustata used jet schemes to compute the multiplier ideals of reduced hyperplane arrangements. We give an alternate proof using a log resolution, which is simpler and allows us to consider non-reduced arrangements. By applying the idea of…
We compute the cohomology of the complement of toric arrangements associated to root systems as representations of the corresponding Weyl groups. Specifically, we develop an algorithm for computing the cohomology of the complement of toric…
The multiplicity Tutte polynomial, which includes the arithmetic Tutte polynomial, is a generalization of the classical Tutte polynomial of matroids. In this paper, we obtain an expression of the general coefficient and the expressions of…
The Tutte polynomial is a well-studied invariant of graphs and matroids. We first extend the Tutte polynomial from graphs to hypergraphs, and more generally from matroids to polymatroids, as a two-variable polynomial. Our definition is…
The computation of a maximal order of an order in a semisimple algebra over a global field is a classical well-studied problem in algorithmic number theory. In this paper we consider the related problems of computing all minimal overorders…
In this paper, we compute the (total) Milnor-Witt motivic cohomology of the complement of a hyperplane arrangement in an affine space as an algebra with given generators and relations. We also obtain some corollaries by realization to…
We compute the multiplier ideals of hyperplane arrangements via the interpretation of these ideals in terms of spaces of arcs, due to Ein, Lazarsfeld and the author.
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…
We prove that the Ehrhart polynomial of a zonotope is a specialization of the multiplicity Tutte polynomial. We derive some formulae for the volume and the number of integer points of the zonotope.
A toric hyperplane is the preimage of a point $x \in S^1$ of a continuous surjective group homomorphism $\theta: \mathbb{T}^n \to S^1$. A finite hyperplane arrangement is a finite collection of such hyperplanes. In this paper, we study the…
We express classical, free, Boolean and monotone cumulants in terms of each other, using combinatorics of heaps, pyramids, Tutte polynomials and permutations. We completely determine the coefficients of these formulas with the exception of…
We show that the Bernstein-Sato polynomial (that is, the b-function) of a hyperplane arrangement with a reduced equation is calculable by combining a generalization of Malgrange's formula with the theory of Aomoto complexes due to Esnault,…
A class of counting problems ask for the number of regions of a central hyperplane arrangement. By duality, this is the same as counting the vertices of a zonotope. We give several efficient algorithms, based on a linear optimization…
We define a combinatorial object that can be associated with any conic-line arrangement with ordinary singularities, which we call the combinatorial Poincar\'e polynomial. We prove a Terao-type factorization statement on the splitting of…
We realize several combinatorial Hopf algebras based on set compositions, plane trees and segmented compositions in terms of noncommutative polynomials in infinitely many variables. For each of them, we describe a trialgebra structure, an…