Related papers: Computing Pretropisms for the Cyclic n-Roots Probl…
We study the {\sc multicut on trees} and the {\sc generalized multiway Cut on trees} problems. For the {\sc multicut on trees} problem, we present a parameterized algorithm that runs in time $O^{*}(\rho^k)$, where $\rho = \sqrt{\sqrt{2} +…
The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same…
For polyhedral convex cones in ${\mathbb R}^d$, we give a proof for the conic kinematic formula for conic curvature measures, which avoids the use of characterization theorems. For the random cones defined as typical cones of an isotropic…
We present a combination of two algorithms that accurately calculate multiple roots of general polynomials. Algorithm I transforms the singular root-finding into a regular nonlinear least squares problem on a pejorative manifold, and…
The convex feasibility problem asks to find a point in the intersection of a collection of nonempty closed convex sets. This problem is of basic importance in mathematics and the physical sciences, and projection (or splitting) methods…
We describe a method that allows, under some hypotheses, to compute all the rational points of some genus 5 curves defined over a number field. This method is used to solve some arithmetic problems that remained open.
In this paper, a polynomial time algorithm for finding the set of all cyclic subsets in a graph is presented. The concept of cyclic subsets has already been introduced in an earlier paper. The algorithm finds cyclic subsets in a graph G by…
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…
Given an ordered sequence of $N$-choose-2 integers, we give necessary and sufficient conditions to have an ordered collection of $N$ simple closed curves on a torus such that the algebraic pairwise intersections of those curves are the…
Using a quadratic version of the Bott residue theorem, we give a quadratic refinement of the count of twisted cubic curves on hypersurfaces and complete intersections in a projective space.
Entropic regularization is a method for large-scale linear programming. Geometrically, one traces intersections of the feasible polytope with scaled toric varieties, starting at the Birch point. We compare this to log-barrier methods, with…
We show that Odd Cycle Transversal and Vertex Multiway Cut admit deterministic polynomial kernels when restricted to planar graphs and parameterized by the solution size. This answers a question of Saurabh. On the way to these results, we…
A graph H is a square root of a graph G if G can be obtained from H by adding an edge between any two vertices in H that are of distance 2. The Square Root problem is that of deciding whether a given graph admits a square root. This problem…
The main problem is to understand and to find periodic symmetric orbits in the $n$-body problem, in the sense of finding methods to prove or compute their existence, and more importantly to describe their qualitative and quantitative…
This article provides a simple trigonometric method for determining how many roots of a quartic equation are real and how many are complex, without solving the equation. The approach replaces the quartic's classical discriminant -- a…
The arc-routing problems are known to be notoriously hard. We study here a natural arc-routing problem on trees and more generally on bounded tree-width graphs and surprisingly show that it can be solved in a polynomial time. This implies a…
This article considers the problem of solving a system of $n$ real polynomial equations in $n+1$ variables. We propose an algorithm based on Newton's method and subdivision for this problem. Our algorithm is intended only for nondegenerate…
Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with…
Let $k$ be a field of characteristic $\neq 2$. We survey a general method of the field intersection problem of generic polynomials via formal Tschirnhausen transformation. We announce some of our recent results of cubic, quartic and quintic…
We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polynomial time algorithms for this problem, one randomized and the other deterministic. The randomized…