English
Related papers

Related papers: Characterizing indecomposable plane continua from …

200 papers

We find an infinite number of noncommutative geometries which posses a differential structure. They generalize the two dimensional noncommutative plane, and have infinite dimensional representations. Upon applying generalized coherent…

High Energy Physics - Theory · Physics 2009-11-07 A. Pinzul , A. Stern

Given two graphs, a mapping between their edge-sets is cycle-continuous, if the preimage of every cycle is a cycle. The motivation for this notion is Jaeger's conjecture that for every bridgeless graph there is a cycle-continuous mapping to…

Combinatorics · Mathematics 2013-01-01 Robert Šámal

It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a drawing in which no three edges pairwise cross. We further…

Computational Geometry · Computer Science 2019-09-05 Michael Hoffmann , Csaba D. Tóth

Given two irreducible curves of the plane which have isomorphic complements, it is natural to ask whether there exists an automorphism of the plane that sends one curve on the other. This question has a positive answer for a large family of…

Algebraic Geometry · Mathematics 2010-11-22 Jérémy Blanc

The (chordal) Loewner differential equation encodes certain curves in the half-plane (aka traces) by continuous real-valued driving functions. Not all curves are traces; the latter can be defined via a geometric condition called the local…

Complex Variables · Mathematics 2022-07-05 Yizheng Yuan

We show that all density operators of 2$\times N$--dimensional quantum systems that remain invariant after partial transposition with respect to the first system are separable. Based on this criterion, we derive a sufficient separability…

Quantum Physics · Physics 2007-05-23 M. Lewenstein , J. I. Cirac , S. Karnas

A subspace of the space, L(n), of traceless complex $n\times n$ matrices can be specified by requiring that the entries at some positions $(i,j)$ be zero. The set, $I$, of these positions is a (zero) pattern and the corresponding subspace…

Representation Theory · Mathematics 2010-06-15 Jinpeng An , Dragomir Z. Djokovic

We use the notion of collapse of generalized indiscernible sequences to classify various model theoretic dividing lines. In particular, we use collapse of n-multi-order indiscernibles to characterize op-dimension n; collapse of…

Logic · Mathematics 2015-11-24 Vincent Guingona , Cameron Donnay Hill , Lynn Scow

Positive bi-linear maps between matrix algebras play important roles to detect tri-partite entanglement by the duality between bi-linear maps and tri-tensor products. We exhibit indecomposable positive bi-linear maps between $2\times 2$…

Functional Analysis · Mathematics 2017-09-21 Seung-Hyeok Kye

Two plane drawings of graphs on the same set of points are called disjoint compatible if their union is plane and they do not have an edge in common. Let $S$ be a convex point set of $2n \geq 10$ points and let $\mathcal{H}$ be a family of…

Computational Geometry · Computer Science 2024-09-06 Oswin Aichholzer , Julia Obmann , Pavel Paták , Daniel Perz , Josef Tkadlec , Birgit Vogtenhuber

It is proved that any polynomial vector field in two complex variables which is complete on a non-algebraic trajectory is complete.

Complex Variables · Mathematics 2014-09-03 Alvaro Bustinduy , Luis Giraldo

A graph is pseudo-outerplanar if each of its blocks has an embedding in the plane so that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. It is proved that…

Combinatorics · Mathematics 2013-04-24 Xin Zhang

A metric space is indivisible if for any partition of it into finitely many pieces one piece contains an isometric copy of the whole space. Continuing our investigation of indivisible metric spaces, we show that a countable ultrametric…

Metric Geometry · Mathematics 2007-05-23 Christian Delhommé , Claude Laflamme , Maurice Pouzet , Norbert Sauer

For a given graph whose edges are labeled with general real numbers, we consider the set of functions from the vertex set into the Euclidean plane such that the distance between the images of neighbouring vertices is equal to the…

Combinatorics · Mathematics 2025-07-23 Niels Lubbes , Mehdi Makhul , Josef Schicho , Audie Warren

In this paper we have shown that a double sequence in a topological space satisfies certain conditions which in turn are capable to generate a topology on a non empty set. Also we have used the idea of I-convergence of double sequences to…

General Topology · Mathematics 2016-09-05 Amar Kumar Banerjee , Rahul Mondal

Let $X_{2k}$ be a set of $2k$ labeled points in convex position in the plane. We consider geometric non-intersecting straight-line perfect matchings of $X_{2k}$. Two such matchings, $M$ and $M'$, are disjoint compatible if they do not have…

Combinatorics · Mathematics 2014-03-24 Oswin Aichholzer , Andrei Asinowski , Tillmann Miltzow

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$,…

Combinatorics · Mathematics 2019-09-16 Toshinori Sakai , Jorge Urrutia

We prove that a continuum $X$ is tree-like (resp. circle-like, chainable) if and only if for each open cover $\U_4=\{U_1,U_2,U_3,U_4\}$ of $X$ there is a $\U_4$-map $f:X\to Y$ onto a tree (resp. onto the circle, onto the interval). A…

General Topology · Mathematics 2011-08-23 Taras Banakh , Zdzislaw Kosztolowicz , Slawomir Turek

The invisibility graph $I(X)$ of a set $X \subseteq \mathbb{R}^d$ is a (possibly infinite) graph whose vertices are the points of $X$ and two vertices are connected by an edge if and only if the straight-line segment connecting the two…

Metric Geometry · Mathematics 2017-06-08 Josef Cibulka , Miroslav Korbelář , Jan Kynčl , Viola Mészáros , Rudolf Stolař , Pavel Valtr

We prove that octants are cover-decomposable, i.e., any 12-fold covering of any subset of the space with a finite number of translates of a given octant can be decomposed into two coverings. As a corollary, we obtain that any 12-fold…

Combinatorics · Mathematics 2015-03-17 Balázs Keszegh , Dömötör Pálvölgyi