English
Related papers

Related papers: Reconstructing a Polyhedron between Polygons in Pa…

200 papers

For a hypergraph $\mathcal{H}=(X,\mathcal{E})$ a \emph{support} is a graph $G$ on $X$ such that for each $E\in\mathcal{E}$, the induced subgraph of $G$ on the elements in $E$ is connected. If $G$ is planar, we call it a planar support. A…

Computational Geometry · Computer Science 2024-10-04 Ambar Pal , Rajiv Raman , Saurabh Ray , Karamjeet Singh

We construct a family of manifolds, one for each $n\geq 2$, having a nontrivial Massey $n$-product in their cohomology. These manifolds turn out to be smooth closed 2-connected manifolds with a compact torus action called moment-angle…

Algebraic Topology · Mathematics 2017-11-15 Ivan Limonchenko

Topological semimetal states which are constrained by symmetries and give birth to innovative excitations are the frontiers of topological quantum matter. Nodal chains in which two nodal rings connect at one point were first discovered in…

Materials Science · Physics 2022-12-21 Hong-Ao Yang , Hao-Yu Wei , Bing-Yang Cao

Let D = {D_{1},...,D_{l}} be an arrangement of smooth hypersurfaces with normal crossings on the complex projective space P^n and let \Omega^{1}_{P^n}(log D) be the logarithmic bundle attached to it. Following [1], we show that…

Algebraic Geometry · Mathematics 2015-06-08 Elena Angelini

We consider the problem of finding minimum-link rectilinear paths in rectilinear polygonal domains in the plane. A path or a polygon is rectilinear if all its edges are axis-parallel. Given a set $\mathcal{P}$ of $h$ pairwise-disjoint…

Computational Geometry · Computer Science 2015-04-28 Joseph S. B. Mitchell , Valentin Polishchuk , Mikko Sysikaski , Haitao Wang

The Subgraph Isomorphism problem asks, given a host graph G on n vertices and a pattern graph P on k vertices, whether G contains a subgraph isomorphic to P. The restriction of this problem to planar graphs has often been considered. After…

Discrete Mathematics · Computer Science 2015-03-19 Paul Bonsma

Let $P: {\mathbb C} \to {\mathbb C}$ be a polynomial map with disconnected filled Julia set $K_P$ and let $z_0$ be a repelling or parabolic periodic point of $P$. We show that if the connected component of $K_P$ containing $z_0$ is…

Dynamical Systems · Mathematics 2023-09-06 Carsten L. Petersen , Saeed Zakeri

A surface with boundary is randomly generated by gluing polygons along some of their sides. We show that its genus and number of boundary components asymptotically follow a bivariate normal distribution.

Combinatorics · Mathematics 2021-04-21 Chaim Even-Zohar , Michael Farber

We investigate constraints on embeddings of a non-orientable surface in a $4$-manifold with the homology of $M \times I$, where $M$ is a rational homology $3$-sphere. The constraints take the form of inequalities involving the genus and…

Geometric Topology · Mathematics 2015-05-27 Ira M. Gessel , Adam Simon Levine , Daniel Ruberman , Saso Strle

Theoretical and experimental studies have verified the existence of ``magic angles'' in twisted bilayer graphene, where the twist between layers gives rise to flat bands and consequently highly correlated phases. Narrow bands can also exist…

Strongly Correlated Electrons · Physics 2024-03-20 D. C. W. Foo , Z. Zhan , Mohammed M. Al Ezzi , L. Peng , S. Adam , F. Guinea

We study the shape of inflated surfaces introduced in \cite{B1} and \cite{P1}. More precisely, we analyze profiles of surfaces obtained by inflating a convex polyhedron, or more generally an almost everywhere flat surface, with a symmetry…

Differential Geometry · Mathematics 2015-05-13 Igor Pak , Jean-Marc Schlenker

We explore several families of flip-graphs, all related to polygons or punctured polygons. In particular, we consider the topological flip-graphs of once-punctured polygons which, in turn, contain all possible geometric flip-graphs of…

Combinatorics · Mathematics 2018-09-10 Hugo Parlier , Lionel Pournin

Polygons are cycles embedded into the plane; their vertices are associated with $x$- and $y$-coordinates and the edges are straight lines. Here, we consider a set of polygons with pairwise non-overlapping interior that may touch along their…

Computational Geometry · Computer Science 2024-09-23 Carsten R. Seemann , Peter F. Stadler , Marc Hellmuth

The associahedron is a convex polytope whose face poset is based on nonintersecting diagonals of a convex polygon. In this paper, given an arbitrary simple polygon P, we construct a polytopal complex analogous to the associahedron based on…

Combinatorics · Mathematics 2015-06-16 Satyan L. Devadoss , Rahul Shah , Xuancheng Shao , Ezra Winston

In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of G in R^2, with a bounding face defined by a polygonal…

Computational Geometry · Computer Science 2009-08-13 Christian A. Duncan , Michael T. Goodrich , Stephen G. Kobourov

Given a set of $n$ points $P$ in the plane, the first layer $L_1$ of $P$ is formed by the points that appear on $P$'s convex hull. In general, a point belongs to layer $L_i$, if it lies on the convex hull of the set $P \setminus…

Computational Geometry · Computer Science 2017-03-17 Raimi A. Rufai , Dana S. Richards

Our main result is that the Steiner Point Removal (SPR) problem can always be solved with polylogarithmic distortion, which answers in the affirmative a question posed by Chan, Xia, Konjevod, and Richa (2006). Specifically, we prove that…

Data Structures and Algorithms · Computer Science 2015-08-21 Lior Kamma , Robert Krauthgamer , Huy L. Nguyen

The surface-impedance matrix method is used to study interfacial waves polarized in a plane of symmetry of anisotropic elastic materials. Although the corresponding Stroh polynomial is a quartic, it turns out to be analytically solvable in…

Soft Condensed Matter · Physics 2013-04-08 Michel Destrade , YiBin Fu

A balanced V-shape is a polygonal region in the plane contained in the union of two crossing equal-width strips. It is delimited by two pairs of parallel rays that emanate from two points x, y, are contained in the strip boundaries, and are…

Computational Geometry · Computer Science 2011-08-11 Boris Aronov , Muriel Dulieu

Consider the following problem: given a graph with edge costs and a subset Q of vertices, find a minimum-cost subgraph in which there are two edge-disjoint paths connecting every pair of vertices in Q. The problem is a failure-resilient…

Data Structures and Algorithms · Computer Science 2015-10-01 Glencora Borradaile , Philip Klein