Related papers: An algorithm to classify the asymptotic set associ…

We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of graphs that exclude K_{i,j} as a subgraph, for any fixed i, j >= 1. This strictly includes every class of graphs for…

For a class of flows on polytopes, including many examples from Evolutionary Game Theory, we describe a piecewise linear model which encapsulates the asymptotic dynamics along the heteroclinic network formed out of the polytope's vertexes…

The learning complexity of special sets of vertices in graphs is studied in the model(s) of exact learning by (extended) equivalence and membership queries. Polynomial-time learning algorithms are described for vertex covers, independent…

In this article we analyze the global diffeomorphism property of polynomial maps $F:\mathbb{R}^n\rightarrow\mathbb{R}^n$ by studying the properties of the Newton polytopes at infinity corresponding to the sum of squares polynomials…

We enumerate rooted 2-connected and 3-connected surface maps with respect to vertices and edges. We also derive the bivariate version of the large face-width result for random 3-connected maps. These results are then used to derive…

We propose a new method of computing cohomology groups of spaces of knots in $\R^n$, $n \ge 3$, based on the topology of configuration spaces and two-connected graphs, and calculate all such classes of order $\le 3.$ As a byproduct we…

Polynomial ensembles are determinantal point processes associated with (non necessarily orthogonal) projections onto polynomial subspaces. The aim of this survey article is to put forward the use of recurrence coefficients to obtain the…

In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…

We describe the topology of a general polynomial mapping $F=(f, g):X\to\Bbb C^2$, where $X$ is a complex plane or a complex sphere.

In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…

A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph $G$ is the generating function of the number of domination sets of each cardinality in $G$, and its…

We describe a rigorous and efficient computer algorithm for building a model of the dynamics of a polynomial diffeomorphism of C^2 on its chain recurrent set, and for sorting points into approximate chain transitive components. Further, we…

Nous donnons une m\'ethode naturelle, que nous appelons {\it "la m\'ethode des fa\c{c}ons"} pour stratifier la vari\'et\'e asymptotique associ\'ee \`a une application polynomiale dominante $F: \mathbb{C}^n \to \mathbb{C}^n$. La…

In the recent years, several polynomial algorithms of a dynamical nature have been proposed to address the graph isomorphism problem. In this paper we propose a generalization of an approach exposed in cond-mat/0209112 and find that this…

We present a FFT-based algorithm for the computation of a polynomial's coefficients from its roots, and apply it to obtain the coefficients of interpolation polynomials, to invert Vandermondians and to evaluate the symmetric functions of a…

Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…

Here we present some revised arguments to a randomized algorithm proposed by Sudan to find the polynomials of bounded degree agreeing on a dense fraction of a set of points in $\mathbb{F}^{2}$ for some field $\mathbb{F}$.

We present the asymptotically fastest known algorithms for some basic problems on univariate polynomial matrices: rank, nullspace, determinant, generic inverse, reduced form. We show that they essentially can be reduced to two computer…

Vladimir Shpilrain and Jie-Tai Yu have asked for an effective algorithm to decide if two elements of C[x,y] are related by an automorphism of C[x,y]. We describe here an efficient algorithm that decides this question and finds the…

The study of the topology of polynomial maps originates from classical questions in affine geometry, such as the Jacobian Conjecture, as well as from works of Whitney, Thom, and Mather in the 1950-70s on diffeomorphism types of smooth maps.…