相关论文: Continuum Many Planar Embeddings of the Knaster Ac…

We consider the problem of finding embeddings of arc-like continua in the plane for which each point in a given subset is accessible. We establish that, under certain conditions on an inverse system of arcs, there exists a plane embedding…

We show that if $f\colon I\to I$ is piecewise monotone, post-critically finite, and locally eventually onto, then for every point $x\in X=\underleftarrow{\lim}(I,f)$ there exists a planar embedding of $X$ such that $x$ is accessible. In…

We investigate the relationship between persistent currents in multi-channel rings containing an embedded scatterer and the conductance through the same scatterer attached to leads. The case of two uncoupled channels corresponds to a…

Given a planar digraph $G$ and a positive even integer $k$, an embedding of $G$ in the plane is k-modal, if every vertex of $G$ is incident to at most $k$ pairs of consecutive edges with opposite orientations, i.e., the incoming and the…

We prove that for a chainable continuum $X$ and every non-zigzag $x\in X$ there exists a planar embedding $\phi:X\to \phi(X)\subset\mathbb R^2$ such that $\phi(x)$ is accessible, partially answering the question of Nadler and Quinn from…

We show that if $X$ is an arc-like continuum, then any continuum which is the union of $X$ and a ray $R$ such that $X \cap R = \emptyset$ and $\overline{R} \setminus R \subseteq X$ can be embedded in the plane $\mathbb{R}^2$. Further, we…

We introduce the notion of a combinatorial $n$-od cover, for $n \geq 3$, which is a tool that may be used to show that certain continua embedded in the plane are not simple $n$-od-like. Using this tool, we generalize a classic example of…

Sequence classification has numerous applications in various fields. Despite extensive studies in the last decades, many challenges still exist, particularly in pattern-based methods. Existing pattern-based methods measure the…

Knaster continua and solenoids are well-known examples of indecomposable continua whose composants (maximal arcwise-connected subsets) are one-to-one images of lines. We show that essentially all non-trivial one-to-one composant images of…

We recall a characterization of hereditary indecomposability originally obtained by Krasinkiewicz and Minc, and show how it may be used to give unified constructions of various hereditarily indecomposable continua. In particular we answer a…

In this paper, two results are obtained on a hypergraph embedding problem. The proof technique is itself of interest, being the first time amalgamations have been used to address the embedding of hypergraphs. The first result finds…

This article aims to provide exponential lower bounds on the number of non-isomorphic $k$-gonal biembeddings of the complete multipartite graph into orientable surfaces. For this purpose, we use the concept, introduced by Archdeacon in…

A planar compactum with connected complement can be an embedded in a cellular continuum by attaching a null sequence of arcs. Two based maps f and g from a planar Peano continuum X to a planar set Y are homotopic iff f and g induce the same…

It is shown that any smooth closed orientable manifold of dimension $2k + 1$, $k \geq 2$, admits a smooth polynomially convex embedding into $\mathbb C^{3k}$. This improves by $1$ the previously known lower bound of $3k+1$ on the possible…

If a convex body $K \subset \mathbb{R}^n$ is covered by the union of convex bodies $C_1, \ldots, C_N$, multiple subadditivity questions can be asked. Two classical results regard the subadditivity of the width (the smallest distance between…

Let $K(a^{(p)};\lambda,\mu )$ be a graph with $p$ parts, each part having size $a$, in which the multiplicity of each pair of vertices in the same part (in different parts) is $\lambda$ ($\mu $, respectively). In this paper we consider the…

It is important to design separation algorithms of low computational complexity in mixed integer programming. We study the separation problems of the two continuous knapsack polyhedra with divisible capacities. The two polyhedra are the…

The relations between two construction methods (called multiplier and embedding methods) for conserved currents of general systems of ordinary or partial differential equations (DEs) are investigated. Recent studies indicate that the…

We obtain an embedding theorem for compact strongly pseudoconvex CR manifolds which are bounadries of some complete Hermitian manifolds. We use this to compactify some negatively curved Kaehler manifolds with compact strongly pseudoconvex…

We study monotone simultaneous embeddings of upward planar digraphs, which are simultaneous embeddings where the drawing of each digraph is upward planar, and the directions of the upwardness of different graphs can differ. We first…