Related papers: Extension of Hyperspace Selections
Successful engineering requires environmentally adapted procedural and architectural approaches. While dealing with complicated issues has become an engineering standard mastering uncertainties in complex environment is still a major issue.…
A 1965 problem due to Danzer asks whether there exists a set with finite density in Euclidean space intersecting any convex body of volume one. A suitable weakening of the volume constraint leads to the (much more recent) problem of…
The problem of extending partial geometric graph representations such as plane graphs has received considerable attention in recent years. In particular, given a graph $G$, a connected subgraph $H$ of $G$ and a drawing $\mathcal{H}$ of $H$,…
Here we give a reformulation of a key lemma in the paper [2], "Spaces of Topological Complexity One", which is necessary due to an oversight.
In recent years, the development of large pretrained language models, such as BERT and GPT, significantly improved information extraction systems on various tasks, including relation classification. State-of-the-art systems are highly…
In this article we investigate the century-old continuous extension problem of the Riemann map. Let $G$ be a simply connected domain. We call $\lambda$ in $\partial G$ a multiple point if there are simply connected subdomains $ U$ and $V$…
Holomorphic (nondegenerate) mappings between complex manifolds of the same dimension are of special interest. For example, they appear as coverings of complex manifolds. At the same time they have very strong "extra" extension properties in…
This is a comment to the paper, Limitations on the superposition principle: superselection rules in non-relativistic quantum mechanics by C Cisneros et al 1998 Eur. J. Phys. 19 237. doi:10.1088/0143-0807/19/3/005. The proof that the authors…
We consider the possibility problem of determining if a document is a possible world of a probabilistic document, in the setting of probabilistic XML. This basic question is a special case of query answering or tree automata evaluation, but…
Why is the manifold topology in a spacetime taken for granted? Why do we prefer to use Riemann open balls as basic-open sets, while there also exists a Lorentz metric? Which topology is a best candidate for a spacetime; a topology…
We discuss an elementary, yet unsolved, problem of Niederreiter concerning the enumeration of a class of subspaces of finite dimensional vector spaces over finite fields. A short and self-contained account of some recent progress on this…
The point-to-set principle of J. Lutz and N. Lutz (2018) has recently enabled the theory of computing to be used to answer open questions about fractal geometry in Euclidean spaces $\mathbb{R}^n$. These are classical questions, meaning that…
The paper deals with extension of bounded bilinear maps$.$ It gives a necessary and sufficient condition for extending a bounded bilinear map on the Cartesian product of subspaces of Banach spaces$.$ This leads to a full characterization…
The task of artificial intelligence is to provide representation techniques for describing problems, as well as search algorithms that can be used to answer our questions. A widespread and elaborated model is state-space representation,…
This paper introduces a class of objects called decision rules that map infinite sequences of alternatives to a decision space. These objects can be used to model situations where a decision maker encounters alternatives in a sequence such…
In 1946 Emil Leon Post (Bulletin of Amer. Math. Soc. 52 (1946), 264 - 268) defined a famous correspondence decision problem which is nowadays called the Post Correspondence Problem, and he proved that the problem is undecidable. In this…
A novel selection principle was introduced by Dorantes-Aldama and Shakhmatov: a topological space $X$ is termed {\em selectively pseudocompact} if for any sequence $(U_n:n\in {\omega})$ of pairwise disjoint non-empty open sets of $X$, one…
Microcosm, Hyper-G, and the Web were developed and released after 1989. There were strengths and weaknesses associate with each of these hypertext systems. The architectures of these systems were relatively different from one another.…
Enumeration of hypermaps is widely studied in many fields. In particular, enumerating hypermaps with a fixed edge-type according to the number of faces and genus is one topic of great interest. However, it is challenging and explicit…
In 1919 A. Einstein suspected first that gravitational fields could play an essential role in the structure of elementary particles. In 1937, P.A.M. Dirac found a miraculous link between the properties of the visible Universe and elementary…