Related papers: The baker's map with a convex hole

In pure integer linear programming it is often desirable to work with polyhedra that are full-dimensional, and it is well known that it is possible to reduce any polyhedron to a full-dimensional one in polynomial time. More precisely, using…

A linear cycle in a hypergraph $H$ is a cyclic sequence of hyperedges such that two consecutive hyperedges intersect in exactly one element and two nonconsecutive hyperedges are disjoint and $\alpha(H)$ denotes the size of a largest…

Given $\beta>1$, let $T_\beta$ be the $\beta$-transformation on the unit circle $[0,1)$, defined by $T_\beta(x)=\beta x-\lfloor \beta x\rfloor$. For each $t\in[0,1)$ let $K_\beta(t)$ be the survivor set consisting of all $x\in[0,1)$ whose…

Given a set of points $S \subseteq \mathbb{R}^2$, a subset $X \subseteq S$ with $|X|=k$ is called $k$-gon if all points of $X$ lie on the boundary of the convex hull of $X$, and $k$-hole if, in addition, no point of $S \setminus X$ lies in…

Given a finite set $A \subseteq \mathbb{R}^d$, points $a_1,a_2,\dotsc,a_{\ell} \in A$ form an $\ell$-hole in $A$ if they are the vertices of a convex polytope which contains no points of $A$ in its interior. We construct arbitrarily large…

Given $S= \{v_1, \dots, v_n\} \subset \mathbb{R} ^m$ and $p \in \mathbb{R} ^m$, testing if $p \in conv(S)$, the convex hull of $S$, is a fundamental problem in computational geometry and linear programming. First, we prove a Euclidean {\it…

Let $X$ be the regular dodecahedron, equipped with its intrinsic path metric. Given $p \in X$ let $G(p)=-q$ where $q$ is the point on $X$ which maximizes the distance to $p$. (Generically, $G$ is single-valued.) We give a complete…

For $\beta\in(1,2]$ the $\beta$-transformation $T_\beta: [0,1) \to [0,1)$ is defined by $T_\beta ( x) = \beta x \pmod 1$. For $t\in[0, 1)$ let $K_\beta(t)$ be the survivor set of $T_\beta$ with hole $(0,t)$ given by \[K_\beta(t):=\{x\in[0,…

Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…

We consider holomorphic mappings $H$ between a smooth real hypersurface $M\subset \bC^{n+1}$ and another $M'\subset \bC^{N+1}$ with $N\geq n$. We provide conditions guaranteeing that $H$ is transversal to $M'$ along all of $M$. In the…

A {\em convex hole} (or {\em empty convex polygon)} of a point set $P$ in the plane is a convex polygon with vertices in $P$, containing no points of $P$ in its interior. Let $R$ be a bounded convex region in the plane. We show that the…

We prove that a closed convex subset $C$ of a complete linear metric space $X$ is polyhedral in its closed linear hull if and only if no infinite subset $A\subset X\backslash C$ can be hidden behind $C$ in the sense $[x,y]\cap C\not =…

Let $G = V, E$ be a simple connected undirected graph. A set $X \subseteq V$ is \emph{geodesically convex} if for any pair of vertices $x, y \in X$, all vertices on all shortest paths in $G$ from $x$ to $y$ are contained in $X$. A set $H…

A full-homomorphism between a pair of graphs is a vertex mapping that preserves adjacencies and non-adjacencies. For a fixed graph $H$, a full $H$-colouring is a full-homomorphism of $G$ to $H$. A minimal $H$-obstruction is a graph that…

A unifying definition of trapped submanifold for arbitrary codimension by means of its mean curvature vector is presented. Then, the interplay between (generalized) symmetries and trapped submanifolds is studied, proving in particular that…

Let $f:\widehat{\mathbb{C}}\rightarrow \widehat{\mathbb{C}}$ be a hyperbolic rational map of degree $d \geq 2$, and let $J \subset \mathbb{C}$ be its Julia set. We prove that $J$ always has positive Fourier dimension. The case where $J$ is…

M. Goresky and R. MacPherson intersection homology is also defined from the singular chain complex of a filtered space by H. King, with a key formula to make selections among singular simplexes. This formula needs a notion of dimension for…

An orthoset is a non-empty set together with a symmetric and irreflexive binary relation $\perp$, called the orthogonality relation. An orthoset with 0 is an orthoset augmented with an additional element 0, called falsity, which is…

We study systems $(V,T,U_1,U_2)$ consisting of a finite dimensional vector space $V$, a nilpotent $k$-linear operator $T:V\to V$ and two $T$-invariant subspaces $U_1\subset U_2\subset V$. Let $\mathcal S(n)$ be the category of such systems…

We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…