Related papers: Efficient Detection of Borromean Linking in Ellips…
The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…
We demonstrate a new approach to the computation of ratios of elliptic integrals. It turns out that almost closed polygons interscribed between two conics retain some of the properties of such closed polygons. We apply these retained…
We give new bounds for the number of integral points on elliptic curves. The method may be said to interpolate between approaches via diophantine techniques ([BP], [HBR]) and methods based on quasiorthogonality in the Mordell-Weil lattice…
Metric embedding is a powerful tool used extensively in mathematics and computer science. We devise a new method of using metric embeddings recursively, which turns out to be particularly effective in $\ell_p$ spaces, $p>2$, yielding…
We classify the solutions to an overdetermined elliptic problem in the plane in the finite connectivity case. This is achieved by establishing a one-to-one correspondence between the solutions to this problem and a certain type of minimal…
Ellipsometry is a powerful and well-established optical technique used in the characterisation of materials. It works by combining the components of elliptically polarized light in order to draw information about the optical system. We…
Equivalence between algebraic equations of motion may be detected by using a $p$-adic method, methods using factorization and linear algebra, or by systematic computer search of suitable Tschirnhausen transformations. Here, we show standard…
We are interested in geometric approximation by parameterization of two-dimensional multiple-component shapes, in particular when the number of components is a priori unknown. Starting a standard method based on successive shape…
We show that for a class of two-loop diagrams, the on-shell part of the integration-by-parts (IBP) relations correspond to exact meromorphic one-forms on algebraic curves. Since it is easy to find such exact meromorphic one-forms from…
We propose a pattern recognition method that identifies the common tangent lines of a set of ellipses. The detection of the tangent lines is attained by applying the Legendre transform on a given set of ellipses. As context, we consider a…
Consider a Jacobian elliptic surface $E \to C$ with a section $P$ of infinite order. Previous work of the first author and Urz\'ua over the complex numbers gives a bound on the number of tangencies between $P$ and a torsion section of $E$…
It is often the case that a Selmer group of an abelian variety and a group related to an ideal class group can both be naturally embedded into the same cohomology group. One hopes to compute one from the other by finding how close each is…
An accurate method to compute enclosures of Abelian integrals is developed. This allows for an accurate description of the phase portraits of planar polynomial systems that are perturbations of Hamiltonian systems. As an example, it is…
We present an algorithm to express Wilson lines that are defined on piecewise linear paths in function of their individual segments, reducing the number of diagrams needed to be calculated. The important step lies in the observation that…
We investigate several topological and combinatorial properties of line arrangements. We associate to a line arrangement a link obtained by intersecting the arrangement with some sphere. Several topics are discussed: (a) some link…
Boolean operations of geometric models is an essential issue in computational geometry. In this paper, we develop a simple and robust approach to perform Boolean operations on closed and open triangulated surfaces. Our method mainly has two…
Intersection algorithms are very important in computation of geometrical problems. Algorithms for a line intersection with linear or quadratic surfaces are quite efficient. However, algorithms for a line intersection with other surfaces are…
We study the connected sum of Hopf links in $S^3$. Particularly, we compute the entanglement entropy (EE) as a function of the number of link components. We find evidence of lower and upper bounds for the entanglement entropy. We show that…
Polyominoes are a subset of polygons which can be constructed from integer-length squares fused at their edges. A system of polygons P is interlocked if no subset of the polygons in P can be removed arbitrarily far away from the rest. It is…
We explain how to use bordered algebras to compute a version of link Floer homology. As a corollary, we also give a fast computation of the Thuston polytope for links in the three-sphere.