Related papers: Efficient Detection of Borromean Linking in Ellips…
We analyze the characteristic polynomial associated to an ellipsoid and another quadric in the context of the contact detection problem. We obtain a necessary and sufficient condition for an efficient method to detect contact. This…
A scheme to distinguish entangled two-photon-polarization states (ETP) from two independent entangled one-photon-polarization states (EOP) is proposed. Using this scheme, the experimental generation of ETP by parametric down-conversion is…
Images of heavily occluded objects in cluttered scenes, such as fruit clusters in trees, are hard to segment. To further retrieve the 3D size and 6D pose of each individual object in such cases, bounding boxes are not reliable from multiple…
We present an algorithm for evaluating a linear ``intersection transform'' of a function defined on the lattice of subsets of an $n$-element set. In particular, the algorithm constructs an arithmetic circuit for evaluating the transform in…
We study graphs that are formed by independently-positioned needles (i.e., line segments) in the unit square. To mathematically characterize the graph structure, we derive the probability that two line segments intersect and determine…
We present a simplification of the recursive algorithm for the evaluation of intersection numbers for differential $n$-forms, by combining the advantages emerging from the choice of delta-forms as generators of relative twisted cohomology…
Trisecting an angle has been proved to be impossible by Euclidean Geometry, using only straight edge and compass. However, there is a method using Origami (paper folding) procedure to trisect an angle. The algebraic analysis of the same…
Two numerical methods are proposed for detection of coupling between multiple time series generated by deterministic nonlinear systems. The first detects interdependence or the existence of coupling between time series. The second…
We prove that the cohomology algebra of elliptic arrangements depends only on the poset of layers. In the particular case of braid elliptic arrangements, we study the cohomology as representation and we compute some Hodge numbers. Finally,…
The presence of outliers can significantly degrade the performance of ellipse fitting methods. We develop an ellipse fitting method that is robust to outliers based on the maximum correntropy criterion with variable center (MCC-VC), where a…
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…
This article is a survey on recent contributions to an effective version of Bautin's theory about the bifurcation of periodic orbits (limit cycles). The analysis of Hopf bifurcations of higher order is possible by use of the return mapping.…
In an earlier note [arXiv:2301.00295] it was shown that there is an upper bound to the number of disjoint Hopf links (and certain related links) that can be embedded in the unit cube where there is a fixed separation required between the…
To determine that two given undirected graphs are isomorphic, we construct for them auxiliary graphs, using the breadth-first search. This makes capability to position vertices in each digraph with respect to each other. If the given graphs…
We present efficient algorithms for detecting central and mirror symmetry for the case of algebraic curves defined by means of polynomial parametrizations. The algorithms are based on the existence of a linear relationship between two…
We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…
We provide a closed form expression for linear Hodge integrals on the hyperelliptic locus. Specifically, we find a succinct combinatorial formula for all intersection numbers on the hyperelliptic locus with one $\lambda$-class, and powers…
Efficient methods to determine the relative position of two conics are of great interest for applications in robotics, computer animation, CAGD, computational physics, and other areas. We present a method to obtain the relative position of…
An isomorphism between two graphs is a bijection between their vertices that preserves the edges. We consider the problem of determining whether two finite undirected weighted graphs are isomorphic, and finding an isomorphism relating them…
Intuitively, an envelope of a family of curves is a curve that is tangent to a member of the family at each point. Here we use envelopes of families of circles to study objects from matrix theory and hyperbolic geometry. First we explore…