相关论文: Computing the Tutte polynomial of a hyperplane arr…

The Tutte polynomial is a fundamental invariant associated to a graph, matroid, vector arrangement, or hyperplane arrangement. This short survey focuses on some of the most important results on Tutte polynomials of hyperplane arrangements.…

Many combinatorial and topological invariants of a hyperplane arrangement can be computed in terms of its Tutte polynomial. Similarly, many invariants of a hypertoric arrangement can be computed in terms of its arithmetic Tutte polynomial.…

The Tutte polynomial is originally a bivariate polynomial which enumerates the colorings of a graph and of its dual graph. Ardila extended in 2007 the definition of the Tutte polynomial on the real hyperplane arrangements. He particularly…

The Tutte polynomial is originally a bivariate polynomial enumerating the colorings of a graph and of its dual graph. But it reveals more of the internal structure of the graph like its number of forests, of spanning subgraphs, and of…

We give an analogue of the Tutte polynomial for hypermaps. This polynomial can be defined as either a sum over subhypermaps, or recursively through deletion-contraction reductions where the terminal forms consist of isolated vertices. Our…

We show that the 4-variable generating function of certain orientation related parameters of an ordered oriented matroid is the evaluation at (x + u, y+v) of its Tutte polynomial. This evaluation contains as special cases the counting of…

We establish a connection between linear codes and hyperplane arrangements using the Thomas decomposition of polynomial systems and the resulting counting polynomial. This yields both a generalization and a refinement of the weight…

This article computes the Tutte polynomial of the hyperplane arrangements associated to the complex reflection groups. The calculations are based on both formulas of De Concini and Procesi for Tutte polynomial and the normaliser of…

Originally in 1954 the Tutte polynomial was a bivariate polynomial associated to a graph in order to enumerate the colorings of this graph and of its dual graph at the same time. However the Tutte polynomial reveals more of the internal…

Hyperplane arrangements form the latest addition to the zoo of combinatorial objects dealt with by polymake. We report on their implementation and on a algorithm to compute the associated cell decomposition. The implemented algorithm…

We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.

We associate a quotient of superspace to any hyperplane arrangement by considering the differential closure of an ideal generated by powers of certain homogeneous linear forms. This quotient is a superspace analogue of the external…

We introduce a new algorithm computing the characteristic polynomials of hyperplane arrangements which exploits their underlying symmetry groups. Our algorithm counts the chambers of an arrangement as a byproduct of computing its…

In this survey of graph polynomials, we emphasize the Tutte polynomial and a selection of closely related graph polynomials. We explore some of the Tutte polynomial's many properties and applications and we use the Tutte polynomial to…

We introduce a multiplicity Tutte polynomial M(x,y), with applications to zonotopes and toric arrangements. We prove that M(x,y) satisfies a deletion-restriction recurrence and has positive coefficients. The characteristic polynomial and…

This is a survey recent works on topological extensions of the Tutte polynomial.

Tutte paths are one of the most successful tools for attacking Hamiltonicity problems in planar graphs. Unfortunately, results based on them are non-constructive, as their proofs inherently use an induction on overlapping subgraphs and…

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…

We introduce certain lattice sums associated with hyperplane arrangements, which are (multiple) sums running over integers, and can be regarded as generalizations of certain linear combinations of zeta-functions of root systems. We also…

This paper considers a hyperplane arrangement constructed with a subset of a set of all simple paths in a graph. A connection of the constructed arrangement to the maximum matching problem is established. Moreover, the problem of finding…