Related papers: Computing the Tutte polynomial of a hyperplane arr…

We study the complexity of computing the sign of the Tutte polynomial of a graph. As there are only three possible outcomes (positive, negative, and zero), this seems at first sight more like a decision problem than a counting problem.…

We consider here a particular quadratic equation linking two elements of a C-Algebra. By analysing powers of the unknowns, it appears a double sequence of polynomials related to classical Bernoulli polynomials. We get the generating…

A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…

The Tutte polynomial is a well-studied invariant of matroids. The polymatroid Tutte polynomial $\mathcal{J}_{P}(x,y)$, introduced by Bernardi et al., is an extension of the classical Tutte polynomial from matroids to polymatroids $P$. In…

Characteristic elements of the Tits algebra of a real hyperplane arrangement carry information about the characteristic polynomial. We present this notion and its basic properties, and apply it to derive various results about the…

In this paper, we present a novel approach to construct multiclass classifiers by means of arrangements of hyperplanes. We propose different mixed integer (linear and non linear) programming formulations for the problem using extensions of…

We reduce the calculation of the simplest Hodge integrals to some sums over decorated trees. Since Hodge integrals are already calculated, this gives a proof of a rather interesting combinatorial theorem and a new representation of…

We give closed form expressions for the numbers of multi-rooted plane trees with specified degrees of root vertices. This results in an infinite number of integer sequences some of which are known to have an alternative interpretation. We…

In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…

This paper presents an algorithm to compute the value of the inverse Laplace transforms of rational functions with poles on arrangements of hyperplanes. As an application, we present an efficient computation of the partition function for…

We develop the theory of arrangements of spheres. Consider a finite collection of codimension-$1$ subspheres in a positive-dimensional sphere. There are two posets associated with this collection: the poset of faces and the poset of…

We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…

Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…

A celebrated result of F. Jaeger states that the Tutte polynomial of a planar graph is determined by the HOMFLY polynomial of an associated link. Here we are interested in the converse of this result. We consider the question `to what…

In the present paper we compute Alexander polynomials for certain classes of conic-line arrangements in the complex projective plane which are related to pencils. We prove two general results for curve arrangements coming from Halphen…

The multivariate arithmetic Tutte polynomial of arithmetic matroids is a generalization of the multivariate Tutte polynomial of matroids. In this note, we give the convolution formulas for the multivariate arithmetic Tutte polynomial of the…

We give algorithms to compute decompositions of a given polynomial, or more generally mixed tensor, as sum of rank one tensors, and to establish whether such a decomposition is unique. In particular, we present methods to compute the…

We present a complete computational classification of the combinatorial types of hyperplane sections, or slices, of the regular cube up to dimension six. For each dimension, we determine the exact number of distinct combinatorial types.…

We present those properties of planar doodles, especially when regarded as 4-valent graphs, that enable us to classify them into {\it prime} and {\it super prime} doodles by analogy to a knot sum. We describe a method for partially…

We follow the example of Tutte in his construction of the dichromate of a graph (that is, the Tutte polynomial) as a unification of the chromatic polynomial and the flow polynomial in order to construct a new polynomial invariant of maps…