相关论文: Algorithms for polynomials in two variables

We present three new, practical algorithms for polynomials in $\mathbb{Z}[x]$: one to test if a polynomial is cyclotomic, one to determine which cyclotomic polynomials are factors, and one to determine whether the given polynomial is…

Identifying and controlling bias is a key problem in empirical sciences. Causal diagram theory provides graphical criteria for deciding whether and how causal effects can be identified from observed (nonexperimental) data by covariate…

Perfect Matching-Cut is the problem of deciding whether a graph has a perfect matching that contains an edge-cut. We show that this problem is NP-complete for planar graphs with maximum degree four, for planar graphs with girth five, for…

We study the class of functions on the set of (generalized) Young diagrams arising as the number of embeddings of bipartite graphs. We give a criterion for checking when such a function is a polynomial function on Young diagrams (in the…

For a field $k$ of characteristic $0$, we present an algorithm for deciding if a morphism $\phi:k[X_1,...,X_m]\to k[X_1,...,X_m]$ has an inverse. The algorithm also shows how to find the inverse when it exists.

In this paper, we begin by partitioning the edges (or arcs) of a circulant (di)graph according to which generator in the connection set leads to each edge. We then further refine the partition by subdividing any part that corresponds to an…

For a graph G, we define a small automorphism as one that maps some vertex into its neighbour. We investigate the edge colourings of G that break every small automorphism of G. We show that such a colouring can be chosen from any set of…

The objective of this paper is the proof of a conjecture of Kontsevich on the isomorphism between groups of polynomial symplectomorphisms and automorphisms of the corresponding Weyl algebra in characteristic zero. The proof is based on the…

In this note we show that for a given irreducible binary quadratic form $f(x,y)$ with integer coefficients, whenever we have $f(x,y) = f(u,v)$ for integers $x,y,u,v$, there exists a rational automorphism of $f$ which sends $(x,y)$ to…

In this paper, we demonstrate that considering experiments in a graph-theoretic manner allows us to exploit automorphisms of the graph to reduce the number of evaluations of candidate designs for those experiments, and thus find optimal…

If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…

The task of approximating points with circular arcs is performed in many applications, such as polyline compression, noise filtering, and feature recognition. However, the development of algorithms that perform a significant amount of…

The Automorphism Theorem, discovered first by Jung in 1942, asserts that if $k$ is a field, then every polynomial automorphism of $k^2$ is a finite product of linear automorphisms and automorphisms of the form $(x,y)\mapsto(x+p(y), y) $ for…

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…

Let $\Phi(x,y)$ be a bivariate polynomial with complex coefficients. The zeroes of $\Phi(x,y)$ are given a combinatorial structure by considering them as arcs of a directed graph $G(\Phi)$. This paper studies some relationship between the…

We determine the factorization of X*f(X)-Y*g(Y) over K[X,Y] for all squarefree additive polynomials f,g in K[X] and all fields K of odd characteristic. This answers a question of Kaloyan Slavov, who needed these factorizations in connection…

A binary tanglegram is a pair <S,T> of binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example in phylogenetics or software engineering, it is required…

In this paper, we present two main results. First, by only one conjecture (Conjecture 2.9) for recognizing a vertex symmetric graph, which is the hardest task for our problem, we construct an algorithm for finding an isomorphism between two…

Euler diagrams are a tool for the graphical representation of set relations. Due to their simple way of visualizing elements in the sets by geometric containment, they are easily readable by an inexperienced reader. Euler diagrams where the…

Graph isomorphism is an important computer science problem. The problem for the general case is unknown to be in polynomial time. The base algorithm for the general case works in quasi-polynomial time. The solutions in polynomial time for…