Related papers: On multiple connectedness of regions visible due t…
Let $\pi:E\to M$ be a vector bundle over a simply connected manifold and $\nabla$ a linear connection in $\pi$. Let $\sigma: U \rightarrow E$ be a $\nabla$-parallel section of $\pi$ defined on a connected open subset $U$ of $M$. We give…
Ehrenborg noted that all tilings of a bipartite planar graph are encoded by its cubical matching complex and claimed that this complex is collapsible. We point out to an oversight in his proof and explain why these complexes can be the…
Let C be a simple, closed, directed curve on the surface of a convex polyhedron P. We identify several classes of curves C that "live on a cone," in the sense that C and a neighborhood to one side may be isometrically embedded on the…
A wealth of observations, recently supported by rigorous analysis, indicate that, asymptotically in time, most multi-soliton solutions of the Kadomtsev-Petviashvili II equation self-organize in webs comprised of solitons and…
Let the circle act effectively in a Hamiltonian fashion on a compact symplectic manifold $(M, \omega)$. Assume that the fixed point set $M^{S^1}$ has exactly two components, $X$ and $Y$, and that $\dim(X) + \dim(Y) +2 = \dim(M)$. We first…
A parallelohedron is called reducible, if it can be represented as a direct product of two parallelohedra of lower dimension. In his Ph.D. thesis (2005) the first author proved a criterion of reducibility of a parallelohedron in terms of…
Let $\Pi$ be a convex decomposition of a set $P$ of $n\geq 3$ points in general position in the plane. If $\Pi$ consists of more than one polygon, then either $\Pi$ contains a deletable edge or $\Pi$ contains a contractible edge.
We will describe some results regarding the algorithmic nature of homeomorphism problems for manifolds; in particular, the following theorem. Theorem 1: Every PL or smooth simply connected manifold M^n of dimension n at least 5 can be…
Let S be a surface obtained from a plane polygon by identifying infinitely many pairs of segments along its boundary. A condition is given under which the complex structure in the interior of the polygon extends uniquely across the quotient…
Surface plasmon polaritons (plasmons) have the potential to interface electronic and optical devices. They could prove extremely useful for integrated quantum information processing. Here we demonstrate on-chip electrical detection of…
This paper studies how spatial thinking interacts with simplicity in [informal] proof, by analysing a set of example proofs mainly concerned with Ferrers diagrams (visual representations of partitions of integers, and comparing them to…
Let $M$ be a compact surface and $P$ be a one dimensional manifold without boundary, that is the line $\mathbb{R}^1$ or a circle $S^1$. The classification of path-components of the space of Morse maps from $M$ into $P$ was recently obtained…
The purpose of the paper is to suggest a new method which allows one to study multiple coherent reflection/transmissions by partially transparent interfaces (e.g. in multi-layer mesoscopic structures or grain boundaries in high-Tc's) in the…
Illumination complexes are examples of 'flat polyhedral complexes' which arise if several copies of a convex polyhedron (convex body) Q are glued together along some of their common faces (closed convex subsets of their boundaries). A…
A lamination $\lambda$ is $\epsilon$-thick (with respect to a basepoint $X$), if the Teichm\"uller ray from $X$ in the direction of $\lambda$ stays in the $\epsilon$-thick part. We show that, for surfaces of high enough genus, any two…
A standard reconfigurable intelligent surface (RIS) can be configured to reflect signals from an arbitrary impinging direction to an arbitrary outgoing direction. However, if a signal impinges from any other direction, said signal is…
Given a point configuration A, we uncover a connection between polynomial-reproducing spline spaces over subsets of conv(A) and fine zonotopal tilings of the zonotope Z(V) associated to the corresponding vector configuration. This link…
We prove that a connected simplicial complex is uniquely determined by its complex of discrete Morse functions. This settles a question raised by Chari and Joswig. In the 1-dimensional case, this implies that the complex of rooted forests…
Consider a random geometric graph defined on $n$ vertices uniformly distributed in the $d$-dimensional unit torus. Two vertices are connected if their distance is less than a "visibility radius" $r_n$. We consider {\sl Bluetooth networks}…
2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level…