Related papers: Implicitization Of A Plane Curve Germ
Nowhere dense classes of graphs are very general classes of uniformly sparse graphs with several seemingly unrelated characterisations. From an algorithmic perspective, a characterisation of these classes in terms of uniform quasi-wideness,…
A (possibly denerate) drawing of a graph $G$ in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a straight-line drawing of a planar graph…
Tropicalization is a procedure for associating a polyhedral complex in Euclidean space to a subvariety of an algebraic torus. We study the question of which graphs arise from tropicalizing algebraic curves. By using Baker's specialization…
Tree decompositions were developed by Robertson and Seymour. Since then algorithms have been developed to solve intractable problems efficiently for graphs of bounded treewidth. In this paper we extend tree decompositions to allow cycles to…
Symplectic invariants introduced in math-ph/0702045 can be computed for an arbitrary spectral curve. For some examples of spectral curves, those invariants can solve loop equations of matrix integrals, and many problems of enumerative…
The mapping class group of a closed surface of genus $g$ is an extension of the Torelli group by the symplectic group. This leads to two natural problems: (a) compute (stably) the symplectic decomposition of the lower central series of the…
We give lower bounds for the degree of the discriminant with respect to y of separable polynomials f in K[x,y] over an algebraically closed field of characteristic zero. Depending on the invariants involved in the lower bound, we give a…
We study tropical line arrangements associated to a three-regular graph $G$ that we refer to as \emph{tropical graph curves}. Roughly speaking, the tropical graph curve associated to $G$, whose genus is $g$, is an arrangement of $2g-2$…
The aim of the inverse Galois problem is to find extensions of a given field whose Galois group is isomorphic to a given group. In this article, we are interested in subgroups of GL(2,Z/nZ) where n is an integer. We know that, in general,…
If a (weighted) spherical design is defined as an integration (cubature) rule for a unitarily invariant space P of polynomials (on the sphere), then any unitary image of it is also such a spherical design. It therefore follows that such…
We present an algorithm to determine the Galois group of an irreducible monic polynomial $f(x) \in \mathbb{Z}[x]$ of degree at most five. Following work of Conrad, Dummit, and Stauduhar this comes down to answering two questions: Is a given…
In this paper, we explain a new Iterative Method-Fixed Point and develop its convergence theory for finding approximate solutions of nonlinear equations in the setting of Banach spaces. First, we discuss the convergence analysis of our…
We consider the tropicalization of tangent lines to a complete intersection curve $X$ in $\mathbb{P}^n$. Under mild hypotheses, we describe a procedure for computing the tropicalization of the image of the Gauss map of $X$ in terms of the…
We study the construction of local subtraction schemes through the lenses of tropical geometry. We focus on individual Feynman integrals in parametric presentation, and think of them as particular instances of Euler integrals. We provide a…
An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained…
Performing efficient inference on Bayesian Networks (BNs), with large numbers of densely connected variables is challenging. With exact inference methods, such as the Junction Tree algorithm, clustering complexity can grow exponentially…
In this paper, an algorithm to compute a certified $G^1$ rational parametric approximation for algebraic space curves is given by extending the local generic position method for solving zero dimensional polynomial equation systems to the…
We give explicit computational algorithms to construct minimal degree (always $\le 4$) ramified covers of $\Prj^1$ for algebraic curves of genus 5 and 6. This completes the work of Schicho and Sevilla (who dealt with the $g \le 4$ case) on…
The notion of a (polynomial) kernelization from parameterized complexity is a well-studied model for efficient preprocessing for hard computational problems. By now, it is quite well understood which parameterized problems do or…
The class of graph deletion problems has been extensively studied in theoretical computer science, particularly in the field of parameterized complexity. Recently, a new notion of graph deletion problems was introduced, called deletion to…