相关论文: The Number of Intersection Points Made by the Diag…
The goal of this paper is to determine the number of perpendicularly inscribed polygons that intersect a given side of a regular polygon with an odd number of sides. This is done using circular permutations with repetition, and some special…
In this paper, we analyze the time complexity of finding regular polygons in a set of n points. We combine two different approaches to find regular polygons, depending on their number of edges. Our result depends on the parameter alpha,…
What is the maximum number of intersections of the boundaries of a simple $m$-gon and a simple $n$-gon, assuming general position? This is a basic question in combinatorial geometry, and the answer is easy if at least one of $m$ and $n$ is…
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 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 investigate the maximum number of intersections between two polygons with p and q vertices, respectively, in the plane. The cases where p or q is even or the polygons do not have to be simple are quite easy and already known, but when p…
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…
The regular 2n-gon (square, hexagon, octagon, ...) is subdivided into smaller polygons (tiles) by the subset of diagonals which run parallel to any of the 2n sides. The manuscript reports on the number of tiles up to the 78-gon.
In this short article, we find an explicit formula for Maslov index of Whitney n-gons joining intersections points of n half-dimensional tori in the symmetric product of a surface. The method also yields a formula for the intersection…
If $I$ is a perfect ideal in a local Cohen-Macaulay ring, the generators of ideals linked to $I$ are well understood. However, the generators of the residual intersections of $I$ have only been computed in a few special cases. In this…
In this paper we use an elementary approach by using numerical semigroups (specifically, those with two generators) to give a formula for the number of integral points inside a right-angled triangle with rational vertices. This is the basic…
Consider two regions in the plane, bounded by an $n$-gon and an $m$-gon, respectively. At most how many connected components can there be in their intersection? This question was asked by Croft. We answer this asymptotically, proving the…
In this paper, we compute the number of self-intersections of a plane projection of a generic complete intersection curve defined by polynomials with the given support. Moreover, we discuss the tropical counterpart of this problem.
We study the packing of a large number of congruent and non--overlapping circles inside a regular polygon. We have devised efficient algorithms that allow one to generate configurations of $N$ densely packed circles inside a regular polygon…
The average value of the number of intersection points of two plane curves given by trigonometrical polynomial maps of degree $N$ and bounded $L_2$- or $W_2^r$- norms is calculated
For any positive integers $a$ and $b$, we enumerate all colored partitions made by noncrossing diagonals of a convex polygon into polygons whose number of sides is congruent to $b$ modulo $a$. For the number of such partitions made by a…
The arithmetic rank of an ideal in a polynomial ring over an algebraically closed field is the smallest number of equations needed to define its vanishing locus set-theoretically. We determine the arithmetic rank of the generic $m$-residual…
We study the mean and variance of the number of self-intersections of the equilateral isotropic random walk in the plane, as well as the corresponding quantities for isotropic equilateral random polygons (random walks conditioned to return…
In this paper, we derive a formula to express the maximum number of non-intersecting diagonals of arbitrary length that can be drawn in n x n square arrays, where n is a multiple of l+1.
Based on Nielsen fixed point theory and Gr\"{o}bner-Shirshov basis, we obtain a simple method to compute geometric intersection numbers and self-intersection geometric numbers of loops on surfaces.