Related papers: On Blocking Numbers of Surfaces

We consider systems of simple closed curves on surfaces and their total number of intersection points, their so-called crossing number. For a fixed number of curves, we aim to minimise the crossing number. We determine the minimal crossing…

We show that for a rational polygonal billiard, the set of pairs of points that do not illuminate each other (not connected by a billiard trajectory) is finite, and use the same method to extend the results of Leli\`evre, Monteil and Weiss,…

In this survey article, we are interested on minimal triangulations of closed pl manifolds. We present a brief survey on the works done in last 25 years on the following: (i) Finding the minimal number of vertices required to triangulate a…

For a closed manifold $M$, let Fib$(M)$ be the number of distinct fiberings of $M$ as a fiber bundle with fiber a closed surface. In this paper we give the first computation of Fib$(M)$ where $1<\text{Fib}(M)<\infty$ but $M$ is not a…

This expository paper discusses some conjectures related to visibility and blockers for sets of points in the plane.

A plane curve $C\subset\mathbb{P}^2$ of degree $d$ is called \emph{blocking} if every $\mathbb{F}_q$-line in the plane meets $C$ at some $\mathbb{F}_q$-point. We prove that the proportion of blocking curves among those of degree $d$ is…

A translation surface S is said to have the finite blocking property if for every pair (O,A) of points in S there exists a finite number of "blocking" points B_1,...,B_n such that every geodesic from O to A meets one of the B_i's. S is said…

This paper studies intersections of principal blocks of a finite group with respect to different primes. We first define the block graph of a finite group $G$, whose vertices are the prime divisors of $|G|$ and there is an edge between two…

We prove some restriction theorems for flat homogeneous surfaces of codimension greater than one.

Let S be a set of 2n+1 points in the plane such that no three are collinear and no four are concyclic. A circle will be called point-splitting if it has 3 points of S on its circumference, n-1 points in its interior and n-1 in its exterior.…

A $t$-fold blocking set of the finite Desarguesian plane $\mathrm{PG}(2,p^n)$, $p$ prime, is a set of points meeting each line of the plane in at least $t$ points. The minimum size of such sets is of interest for numerous reasons; however,…

It is proved that one can choose a control function on an arbitrary small open subset of the boundary of an obstacle so that the total radiation from this obstacle for a fixed direction of the incident plane wave and for a fixed wave number…

One can embed arbitrarily many disjoint, non-parallel, non-boundary parallel, incompressible surfaces in any three manifold with at least one boundary component of genus two or greater [4]. This paper proves the contrasting, but not…

There are just 10 closed flat 3-manifolds, following [1], we call them platycosms. The aim of this paper is to classify types of n-coverings over amphicosms, i.e. some kinds of platycosms, and enumerate the numbers of them. Key words:…

Let $G$ be a connected Lie group and $\Gamma \subset G$ a lattice. Connection curves of the homogeneous space $M=G/\Gamma$ are the orbits of one parameter subgroups of $G$. To $block$ a pair of points $m_1,m_2 \in M$ is to find a finite set…

We study smooth maps between smooth manifolds with only fold points as their singularities, and clarify the obstructions to the existence of such a map in a given homotopy class for certain dimensions. The obstructions are described in…

Given a map f: M \to M of closed topological manifolds we define torsion obstructions whose vanishing is a necessary condition for f being homotopy equivalent to a projection of a locally trivial fiber bundle. If N = S^1, these torsion…

We compute the minimum number of critical points of a small codimension smooth map between two manifolds. We give as well some partial results for the case of higher codimension when the manifolds are spheres.

The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…

In this paper we present a complete characterization of the smallest sets that block all the simple spanning trees (SSTs) in a complete geometric graph. We also show that if a subgraph is a blocker for all SSTs of diameter at most 4, then…