Related papers: Arcs Intersecting at Most Once on the 4-Punctured …
We study arc graphs and curve graphs for surfaces of infinite topological type. First, we define an arc graph relative to a finite number of (isolated) punctures and prove that it is a connected, uniformly hyperbolic graph of infinite…
The aim of this paper is a construction of quartic parametric polynomial interpolants of a circular arc, where two boundary points of a circular arc are interpolated. For every unit circular arc of inner angle not greater than $\pi$ we find…
We show that any surface of infinite type admits an ideal triangulation. Furthermore, we show that a set of disjoint arcs can be completed into a triangulation if and only if, as a set, they intersect every simple closed curve a finite…
We study the set of lines that meet a fixed line and are tangent to two spheres and classify the configurations consisting of a single line and three spheres for which there are infinitely many lines tangent to the three spheres that also…
We determine the maximum number of edges that a planar graph can have as a function of its maximum degree and matching number.
We show a generalization of the crossing lemma for multi-graphs drawn on orientable surfaces in which pairs of edges are assumed to be drawn by non-homotopic simple arcs which pairwise cross at most $k$ times.
The structure of the densest crystal packings is determined for a variety of concave shapes in 2D constructed by the overlap of two or three disks. The maximum contact number per particle pair is defined and proposed as a useful means of…
We identify the intersection of the multibrot set of $z^d+c$ with the rays ${\mathbb R}^+\omega$, where $\omega^{d-1}=\pm1$.
In this note, we examine the arrangements of lines and configurations of points that emerge from Fermat (von Dyck) and Komiya-Kuribayashi quartics. These quartics are characterized by having the maximum number of lines of maximal tangency,…
This is a note on calculating intersection numbers on moduli spaces of curves. A codimension 3 relation among tautological classes on the moduli space of genus 4 curves is given.
Stars are most likely to merge or collide in regions of the highest stellar densities, and our own Galactic Center contains many stars packed into a relatively small volume -- even the ambient stellar number density in the central 50 pc is…
The maximum rectilinear crossing number of a graph $G$ is the maximum number of crossings in a good straight-line drawing of $G$ in the plane. In a good drawing any two edges intersect in at most one point (counting endpoints), no three…
In this short note, we construct a minimally intersecting pair of simple closed curves that fill a genus 2 surface with an odd, greater than 3, number of punctures. This finishes the determination of minimally intersecting filling pairs for…
We find the maximum number of maximal independent sets in two families of graphs: all graphs with $n$ vertices and at most $r$ cycles, and all such graphs that are also connected. In addition, we characterize the extremal graphs.
In 1991 S{\o}rensen proposed a conjecture for the maximum number of points on the intersection of a surface of degree $d$ and a non-degenerate Hermitian surface in $\PP^3(\Fqt)$. The conjecture was proven to be true by Edoukou in the case…
A point P on a smooth hypersurface X of degree d in an N-dimensional projective space is called a star point if and only if the intersection of X with the embedded tangent space T_P(X) is a cone with vertex P. This notion is a…
We study the lattices of algebraic and transcendental cycles of cubic fourfolds.
In a geometry, a maximal cap is a collection of points of largest size containing no lines. In AG(4,3), maximal caps contain 20 points. The 81 points of AG(4,3) can be partitioned into 4 mutually disjoint maximal caps together with a single…
The problem of interpolation at $(n+1)^2$ points on the unit sphere $\mathbb{S}^2$ by spherical polynomials of degree at most $n$ is proved to have a unique solution for several sets of points. The points are located on a number of circles…
Simonovits and S\'{o}s conjectured that the maximal size of a triangle-intersecting family of graphs on $n$ vertices is $2^{\binom{n}{2}-3}$. Their conjecture has recently been proved using spectral methods. We provide an elementary proof…