Related papers: The arithmetic Tutte polynomials of the classical …

We develop the necessary machinery in order to prove that hexagonal tilings are uniquely determined by their Tutte polynomial, showing as an example how to apply this technique to the toroidal hexagonal tiling.

The methods of classical invariant theory are used to construct generic polynomials for groups $S_5$ and $A_5$, along with explicit reductions to specializations of the generic polynomials defining any desired field extension with those…

We derive a number of summation and transformation formulas for elliptic hypergeometric series on the root systems A_n, C_n and D_n. In the special cases of classical and q-series, our approach leads to new elementary proofs of the…

This paper deals with the use of numerical methods based on random root sampling techniques to solve some theoretical problems arising in the analysis of polynomials. These methods are proved to be practical and give solutions where…

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…

Macdonald polynomials are orthogonal polynomials associated to root systems, and in the type A case, the symmetric kind is a common generalization of Schur functions, Macdonald spherical functions, and Jack polynomials. We use the…

In a recent paper, we studied the interaction between the automorphism group of a graph and its Tutte polynomial. More precisely, we proved that certain symmetries of graphs are clearly reflected by their Tutte polynomials. The purpose of…

For a homogeneous polynomial of $n$ variables, we present a new method to compute the roots of Bernstein-Sato polynomial supported at the origin, assuming that general hyperplane sections of the associated projective hypersurface have at…

We consider natural polynomial truncations of hypergeometric power series defined over finite fields. For these truncations, we establish asymptotic upper bounds of order $O(p^{11/12})$ on the number of roots in the prime field…

We survey various classical results on invariants of polynomials, or equivalently, of binary forms, focussing on explicit calculations for invariants of polynomials of degrees 2, 3, 4.

There are several researches on Lie algebras and Lie superalgebras graded by finite root systems. In this paper, we study Leibniz algebras graded by finite root systems and obtain some results in simply-laced cases.

We define a new topological invariant of line arrangements in the complex projective plane. This invariant is a root of unity defined under some combinatorial restrictions for arrangements endowed with some special torsion character on the…

In this article we describe a new inductive approach to compute the chromatic polynomial of simple graphs and the characteristic polynomial of central hyperplane arrangements.

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…

For bivariate polynomials of degree $n\le 5$ we give fast numerical constructions of determinantal representations with $n\times n$ matrices. Unlike some other available constructions, our approach returns matrices of the smallest possible…

The graph algebra is a commutative, cocommutative, graded, connected incidence Hopf algebra, whose basis elements correspond to finite simple graphs and whose Hopf product and coproduct admit simple combinatorial descriptions. We give a new…

Let A be a subspace arrangement and let chi(A,t) be the characteristic polynomial of its intersection lattice L(A). We show that if the subspaces in A are taken from L(B_n), where B_n is the type B Weyl arrangement, then chi(A,t) counts a…

We show that for any constant d, complex roots of degree d univariate rational (or Gaussian rational) polynomials---given by a list of coefficients in binary---can be computed to a given accuracy by a uniform TC^0 algorithm (a uniform…

We give combinatorial formulas for F-polynomials in cluster algebras of classical types in terms of the weighted paths in certain directed graphs. As a consequence we prove the positivity of F-polynomials in cluster algebras of classical…

In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…