相关论文: Algorithms for polynomials in two variables

We study the interaction between two structures on the group of polynomial automorphisms of the affine plane: its structure as an amalgamated free product and as an infinite-dimensional algebraic variety. We introduce a new conjecture, and…

We present efficient algorithms for detecting central and mirror symmetry for the case of algebraic curves defined by means of polynomial parametrizations. The algorithms are based on the existence of a linear relationship between two…

We study z-automorphisms of the polynomial algebra K[x,y,z] and the free associative algebra K<x,y,z> over a field K, i.e., automorphisms which fix the variable z. We survey some recent results on such automorphisms and on the corresponding…

Geometric constraint systems underly popular Computer Aided Design soft- ware. Automated approaches for detecting dependencies in a design are critical for developing robust solvers and providing informative user feedback, and we provide…

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…

A graph is said to be circular-arc if the vertices can be associated with arcs of a circle so that two vertices are adjacent if and only if the corresponding arcs overlap. It is proved that the isomorphism of circular-arc graphs can be…

It has been proved several times in the literature that a polynomial map from $C^2$ to $C$ with irreducible rational fibers cannot be a component of a counterexample to the Jacobian Conjecture. This note points out that this result is…

In 2010, A. Shpilka and I. Volkovich established a prominent result on the equivalence of polynomial factorization and identity testing. It follows from their result that a multilinear polynomial over the finite field of order 2 can be…

Let $\Phi(x,y)\in\mathbb{C}[x,y]$ be a symmetric polynomial of partial degree $d$. The graph $G(\Phi)$ is defined by taking $\mathbb{C}$ as set of vertices and the points of $\mathbb{V}(\Phi(x,y))$ as edges. We study the following problem:…

In this paper, we show the existence of a polynomial time graph isomorphism algorithm for all graphs excluding graphs that are locally trianglefree. This particular class of graphs allows to divide the graph into neighbourhood sub-graph…

The Profinite Isomorphism Problem for a class of groups \mathcal{C} asks for an algorithm that decides for any two groups in \mathcal{C} whether they have isomorphic profinite completions. We present the positive solution to this problem…

Let $A \in \mathbb{Z}^{m \times n}$ be an integral matrix and $a$, $b$, $c \in \mathbb{Z}$ satisfy $a \geq b \geq c \geq 0$. The question is to recognize whether $A$ is $\{a,b,c\}$-modular, i.e., whether the set of $n \times n$…

Although NP-Complete problems are the most difficult decisional problems, it is possible to discover in them polynomial (or easy) observables. We study the Graph Partitioning Problem showing that it is possible to recognize in it two…

It is unknown whether two graphs can be tested for isomorphism in polynomial time. A classical approach to the Graph Isomorphism Problem is the d-dimensional Weisfeiler-Lehman algorithm. The d-dimensional WL-algorithm can distinguish many…

It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for…

Many combinatorial optimization problems can be formulated as the search for a subgraph that satisfies certain properties and minimizes the total weight. We assume here that the vertices correspond to points in a metric space and can take…

In this work, under a mild assumption, we give the classification of the complete polynomial vector fields in two variables up to algebraic automorphisms of $\C^2$. The general problem is also reduced to the study of the combinatorics of…

We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It…

We consider the problem of finding a Young diagram minimizing the sum of evaluations of a given pair of functions on the parts of the associated pair of conjugate partitions. While there are exponentially many diagrams, we show it is…

We give a polynomial-time algorithm for detecting very long cycles in dense regular graphs. Specifically, we show that, given $\alpha \in (0,1)$, there exists a $c=c(\alpha)$ such that the following holds: there is a polynomial-time…