Related papers: An algebraic formula for the intersection number o…

There is presented a method for computing the algebraic number of cross-cap singularities for mapping from m dimensional compact manifold with boundary M into R^(2m-1), m is odd. As an application, the intersection number of an immersion g…

The definition of the intersection number of a map with a closed manifold can be extended to the case of a closed stratified set such that the difference between dimensions of its two biggest strata is greater than $1$. The set Sigma of…

For a polynomial mapping from S^{n-k} to the Stiefel manifold \widetilde{V}_k(\R^{n}), where n-k is even, there is presented an effective method of expressing the corresponding element of the homotopy group…

We show how the Eulcidean algorithm for polynomials can be used to find the intersection points, with multiplicities, of two plane algebraic curves.

We give a recipe to compute the geometric intersection number of an integral lamination with a particular type of integral lamination on an n-times punctured disk. This provides a way to find the geometric intersection number of two…

We provide formulas and algorithms for computing the excess numbers of certain ideals. The solution for monomial ideals is given by the mixed volumes of certain polytopes. These results enable us to design specific homotopies for numerical…

We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.

We study the intersection ring of the space $\M(\alpha_1,...,\alpha_m)$ of polygons in $\R^3$. We find homology cycles dual to generators of this ring and prove a recursion relation in $m$ (the number of steps) for their intersection…

We prove an intersection formula for two plane branches in terms of their semigroups and key polynomials. Then we provide a strong version of Bayer's theorem on the set of intersection numbers of two branches and apply it to the logarithmic…

Consider the set of solutions to a system of polynomial equations in many variables. An algebraic manifold is an open submanifold of such a set. We introduce a new method for computing integrals and sampling from distributions on algebraic…

We present an algorithm for calculating the geometric intersection number of two multicurves on the $n$-punctured disk, taking as input their Dynnikov coordinates. The algorithm has complexity $O(m^2n^4)$, where $m$ is the sum of the…

The M-polynomial provides a unifying framework for a wide class of degree-based topological indices. Despite its structural importance, general methods for computing the M-polynomial under graph constructions remain limited. In this paper,…

Let L be an algebraic set and let g : R^(n+1) \times L --> R^(2n) (n is even) be a polynomial mapping such that for each l in L there is r(l)>0 such that the mapping g_l = g(.,l) restricted to the sphere S^n(r) is an immersion for every…

We present a topological recursion formula for calculating the intersection numbers defined on the moduli space of open Riemann surfaces. The spectral curve is $x = \frac{1}{2}y^2$, the same as spectral curve used to calculate intersection…

By a numerical continuation method called a diagonal homotopy we can compute the intersection of two positive dimensional solution sets of polynomial systems. This paper proposes to use this diagonal homotopy as the key step in a procedure…

Let $G$ be a graph and let $m_{ij}(G)$, $i,j\ge 1$, be the number of edges $uv$ of $G$ such that $\{d_v(G), d_u(G)\} = \{i,j\}$. The {\em $M$-polynomial} of $G$ is introduced with $\displaystyle{M(G;x,y) = \sum_{i\le j} m_{ij}(G)x^iy^j}$.…

The Hermite interpolation formulas are based on the interpretation of interpolation nodes as roots of suitable polynomials. Therefore, such formulas belong to the class of algebraic interpolations. The article considers a multidimensional…

We prove a $p$-adic version of the Integral Geometry Formula for averaging the intersection of two $p$-adic projective algebraic sets. We apply this result to give bounds on the number of points in the modulo $p^m$ reduction of a projective…

We investigate the intersection body of a convex polytope using tools from combinatorics and real algebraic geometry. In particular, we show that the intersection body of a polytope is always a semialgebraic set and provide an algorithm for…

An algorithm is presented for the computation of the topology of a non-reduced space curve defined as the intersection of two implicit algebraic surfaces. It computes a Piecewise Linear Structure (PLS) isotopic to the original space curve.…