English
Related papers

Related papers: Curves on the torus intersecting at most k times

200 papers

A tiling (edge-to-edge) of the plane is a family of tiles that cover the plane without gaps or overlaps. Vertex figure of a vertex in a tiling to be the union of all edges incident to that vertex. A tiling is $k$-vertex-homogeneous if any…

Combinatorics · Mathematics 2022-01-21 Marbarisha M. Kharkongor , Dipendu Maity

The intersection graph of a collection of trapezoids with corner points lying on two parallel lines is called a trapezoid graph. Using binary indexed tree data structure, we improve algorithms for calculating the size and the number of…

Data Structures and Algorithms · Computer Science 2011-06-14 Aleksandar Ilic , Andreja Ilic

We discover that tautological intersection numbers on $\bar{\mathcal{M}}_{g, n}$, the moduli space of stable genus $g$ curves with $n$ marked points, are evaluations of Ehrhart polynomials of partial polytopal complexes. In order to prove…

Algebraic Geometry · Mathematics 2022-09-29 Adam Afandi

In \emph{$k$-bootstrap percolation}, we fix $p\in (0,1)$, an integer $k$, and a plane graph $G$. Initially, we infect each face of $G$ independently with probability $p$. Infected faces remain infected forever, and if a healthy (uninfected)…

Combinatorics · Mathematics 2019-11-18 Neal Bushaw , Daniel W. Cranston

Let $k$, $t$ and $m$ be positive integers. A $k$-multiset of $[m]$ is a collection of $k$ integers from the set $\{1,...,m\}$ in which the integers can appear more than once. We use graph homomorphisms and existing theorems for intersecting…

Combinatorics · Mathematics 2015-05-28 Karen Meagher , Alison Purdy

Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error…

Computational Geometry · Computer Science 2018-01-11 Sunil Arya , Guilherme D. da Fonseca , David M. Mount

The size-Ramsey number $R^{(k)}(H)$ of a $k$-uniform hypergraph $H$ is the minimum number of edges in a $k$-uniform hypergraph $G$ with the property that every `$2$-edge coloring' of $G$ contains a monochromatic copy of $H$. For $k\ge2$ and…

Combinatorics · Mathematics 2022-06-22 Christian Winter

We study the intersection theory of punctured pseudoholomorphic curves in $4$-dimensional symplectic cobordisms. We first study the local intersection properties of such curves at the punctures. We then use this to develop topological…

Symplectic Geometry · Mathematics 2019-03-20 Richard Siefring

Let P be a set of n points in the Euclidean plane and let O be the origin point in the plane. In the k-tour cover problem (called frequently the capacitated vehicle routing problem), the goal is to minimize the total length of tours that…

Data Structures and Algorithms · Computer Science 2009-04-20 Anna Adamaszek , Artur Czumaj , Andrzej Lingas

Using periodic-orbit theory beyond the diagonal approximation we investigate the form factor, $K(\tau)$, of a generic quantum graph with mixing classical dynamics and time-reversal symmetry. We calculate the contribution from pairs of…

Chaotic Dynamics · Physics 2007-05-23 Gregory Berkolaiko , Holger Schanz , Robert S. Whitney

We discuss an analogue of Riemann-Roch theorem for curves with an infinite number of handles. We represent such a curve X by its Shottki model, which is an open subset U of CP^{1} with infinite union of circles as a boundary. An appropriate…

alg-geom · Mathematics 2007-05-23 Ilya Zakharevich

Let $\mathcal{H}$ be a $t$-regular hypergraph on $n$ vertices and $m$ edges. Let $M$ be the $m \times n$ incidence matrix of $\mathcal{H}$ and let us denote $\lambda =\max_{v \perp \overline{1},\|v\| = 1}\|Mv\|$. We show that the…

Combinatorics · Mathematics 2020-05-05 Aditya Potukuchi

Consider a face F in an arrangement of n Jordan curves in the plane, no two of which intersect more than s times. We prove that the combinatorial complexity of F is O(\lambda_s(n)), O(\lambda_{s+1}(n)), and O(\lambda_{s+2}(n)), when the…

Computational Geometry · Computer Science 2011-08-23 Boris Aronov , Dmitriy Drusvyatskiy

We describe a new approach to the study of the set of all simple geodesics on a hyperbolic punctured torus. We introduce a valuation on the first integral homology group of the torus. This valuation associates to each homology class the…

Geometric Topology · Mathematics 2007-05-23 Greg McShane , Igor Rivin

In this paper we prove that inf_{|z_k| => 1} max_{v=1,...,n^2} |sum_{k=1}^n z_k^v| = sqrt n+O(n^{0.2625+epsilon}). This improves on the bound O(sqrt (n log n)) of Erdos and Renyi. In the special case of $n+1$ being a prime we have…

Number Theory · Mathematics 2007-06-28 Johan Andersson

In this paper, we study the deformation theory of degenerate algebraic curves on singular varieties which appear as the degenerate limit of families of varieties. For this purpose, we systematically develop a new method to calculate the…

Algebraic Geometry · Mathematics 2017-05-03 Takeo Nishinou

In this paper, we investigate Erd\H os--Ko--Rado type theorems for families of vectors from $\{0,\pm 1\}^n$ with fixed numbers of $+1$'s and $-1$'s. Scalar product plays the role of intersection size. In particular, we sharpen our earlier…

Combinatorics · Mathematics 2020-04-21 Peter Frankl , Andrey Kupavskii

We prove a "gluing" theorem for monotone homotopies; a monotone homotopy is a homotopy through simple contractible closed curves which themselves are pairwise disjoint. We show that two monotone homotopies which have appropriate overlap can…

Differential Geometry · Mathematics 2016-10-06 Gregory R. Chambers , Regina Rotman

Let X be the base locus of a linear system W of k quadrics. Let also S be the intersection of W with the discriminant hypersurface in the space of all homogeneous polynomials of degree two. We prove a formula relating the topology of X with…

Algebraic Topology · Mathematics 2012-11-08 Antonio Lerario

In 1968, Ore determined the maximum size of $k$-connected graphs with given order and diameter. In this note, we give a new short proof.

Combinatorics · Mathematics 2023-03-10 Leilei Zhang