相关论文: Packing curves on surfaces with few intersections

Let $\Omega=(\omega_{j})_{j\in I}$ be a collection of pairwise non-isotopic simple closed curves on the closed, orientable, genus $g$ surface $S_{g}$, such that $\omega_{i}$ and $\omega_{j}$ intersect exactly once for $i\neq j$. It was…

Given a point set $S=\{s_1,\ldots , s_n\}$ in the unit square $U=[0,1]^2$, an anchored square packing is a set of $n$ interior-disjoint empty squares in $U$ such that $s_i$ is a corner of the $i$th square. The reach $R(S)$ of $S$ is the set…

Our main results concern complete intersections of three real quadrics. We prove that the maximal number $B^0_2(N)$ of connected components that a regular complete intersection of three real quadrics in $\Bbb{P}^N$ can have differs at most…

We first show that the union of a projective curve with one of its extremal secant lines satisfies the linear general position principle for hyperplane sections. We use this to give an improved approximation of the Betti numbers of curves…

For $1\leq s_1 \le s_2 \le \ldots \le s_k$ and a graph $G$, a packing $(s_1, s_2, \ldots, s_k)$-coloring of $G$ is a partition of $V(G)$ into sets $V_1, V_2, \ldots, V_k$ such that, for each $1\leq i \leq k$, the distance between any two…

We characterize the largest point sets in the plane which define at most 1, 2, and 3 angles. For $P(k)$ the largest size of a point set admitting at most $k$ angles, we prove $P(2)=5$ and $P(3)=5$. We also provide the general bounds of $k+2…

We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1\oplus{}P_2$, of two $d$-dimensional convex polytopes $P_1$ and $P_2$, as a function of the number of vertices of the polytopes.…

For a sequence $S=(s_1, \ldots, s_k)$ of non-decreasing integers, a packing $S$-coloring of a graph $G$ is a partition of its vertex set $V(G)$ into $V_1, \ldots, V_k$ such that for every pair of distinct vertices $u,v \in V_i$, where $1…

We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…

We show that the number of simple closed geodesics of length bounded by L on a hyperbolic surface of genus g with c cusps and b boundary components grows roughly like L^{6g+2b+2c-6}. This has been conjectured for some time.

The maximum number of vertices in a graph of maximum degree $\Delta\ge 3$ and fixed diameter $k\ge 2$ is upper bounded by $(1+o(1))(\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance,…

A classical result of Bondy and Simonovits in extremal graph theory states that if a graph on $n$ vertices contains no cycle of length $2k$ then it has at most $O(n^{1+1/k})$ edges. However, matching lower bounds are only known for…

In this paper, we show that any subgroup of a semidirect product of Z^n with Z has bounded packing as long as the action of Z on Z^n is by diagonalizable automorphisms all of whose eigenvalues are real. We use this result to show that any…

Let $S$ be a surface isogenous to a product of curves of unmixed type. After presenting several results useful to study the cohomology of $S$ we prove a structure theorem for the cohomology of regular surfaces isogenous to a product of…

We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…

Given a set $P$ of $n$ points in the plane, the unit-disk graph $G(P)$ is a graph with $P$ as its vertex set such that two points of $P$ have an edge if their Euclidean distance is at most $1$. We consider the problem of computing a maximum…

In a graph $G$, a subset of vertices $S \subseteq V(G)$ is said to be cyclable if there is a cycle containing the vertices in some order. $G$ is said to be $k$-cyclable if any subset of $k \geq 2$ vertices is cyclable. If any $k$…

We consider growing spheres seeded by random injection in time and space. Growth stops when two spheres meet leading eventually to a jammed state. We study the statistics of growth limited by packing theoretically in d dimensions and via…

We study the optimal packing of short, hard spherocylinders confined to lie tangential to a spherical surface, using simulated annealing and molecular dynamics simulations. For clusters of up to twelve particles, we map out the changes in…

Given an undirected graph $G$, a collection $\{(s_1,t_1),..., (s_k,t_k)\}$ of pairs of vertices, and an integer $p$, the Edge Multicut problem ask if there is a set $S$ of at most $p$ edges such that the removal of $S$ disconnects every…