Related papers: Lecture on the combinatorial algebraic method for …
Given a planar curve defined by means of a real rational parametrization, we prove that the affine values of the parameter generating the real singularities of the offset are real roots of a univariate polynomial that can be derived from…
We combine the newly discovered technique, which computes explicit formulas for the image of an algebraic curve under rational transformation, with techniques that enable to compute braid monodromies of such curves. We use this combination…
We present novel, deterministic, efficient algorithms to compute the symmetries of a planar algebraic curve, implicitly defined, and to check whether or not two given implicit planar algebraic curves are similar, i.e. equal up to a…
Polynomial algebra offers a standard approach to handle several problems in geometric modeling. A key tool is the discriminant of a univariate polynomial, or of a well-constrained system of polynomial equations, which expresses the…
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…
Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…
We give a new method for the evaluation of a class of integrals of rational symmetric functions in N pairs of variables {x_a, y_a}_{a=1,... N} arising in coupled matrix models, valid for a broad class of two-variable measures. The result is…
The goal of this paper is to lay the foundations for a combinatorial study, via orthogonal functions and intertwining operators, of category O for the rational Cherednik algebra of type G(r,p,n). As a first application, we give a…
A collocation method is presented for numerical solution of a typical integral equation Rh :=\int_D R(x, y)h(y)dy = f(x), x {\epsilon} D of the class R, whose kernels are of positive rational functions of arbitrary selfadjoint elliptic…
Let $C$ be a generic complex plane plane curve with a given Newton polygon $P$. We compute the number of its inflection points and bitangents (equivalently, the number of singularities of the projectively dual curve $C^\vee$). We also prove…
In this paper, we consider a family of closed planar algebraic curves $\mathcal{C}$ which are given in parametrization form via a trigonometric polynomial $p$. When $\mathcal{C}$ is the boundary of a compact convex set, the polynomial $p$…
Computing the closed convex envelope or biconjugate is the core operation that bridges the domain of nonconvex with convex analysis. We focus here on computing the conjugate of a bivariate piecewise quadratic function defined over a…
We construct bivariate orthogonal polynomials (OPs) on algebraic curves of the form $y^m = \phi(x)$ in $\mathbb{R}^2$ where $m = 1, 2$ and $\phi$ is a polynomial of arbitrary degree $d$, in terms of univariate semiclassical OPs. We compute…
This work presents spectral, mesh-free, Green's theorem-based numerical quadrature schemes for integrating functions over planar regions bounded by rational parametric curves. Our algorithm proceeds in two steps: (1) We first find…
The ideas behind the concept of algebraic ("integration-by-parts") algorithms for multiloop calculations are reviewed. For any topology and mass pattern, a finite iterative algebraic procedure is proved to exist which transforms the…
We review the method of symplectic invariants recently introduced to solve matrix models loop equations, and further extended beyond the context of matrix models. For any given spectral curve, one defined a sequence of differential forms,…
We are concerned with the behavior of the polynomial maps $F=(P,Q)$ of $\mathbb{C}^2$ with finite fibres and satisfying the condition that all of the curves $aP+bQ=0$, $(a:b)\in \mathbb{P}^1$, are irreducible rational curves. The obtained…
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…
Integration By Parts (IBP) is an important method for computing Feynman integrals. This work describes a formulation of the theory involving a set of differential equations in parameter space, and especially the definition and study of an…
This survey may be seen as an introduction to the use of toric and tropical geometry in the analysis of plane curve singularities, which are germs $(C,o)$ of complex analytic curves contained in a smooth complex analytic surface $S$. The…