English
Related papers

Related papers: A note on complementary knowledge spaces

200 papers

Using the theory of resolving classes, we show that if $X$ is a CW complex of finite type such that $\map_*(X, S^{2n+1})\sim *$ for all sufficiently large $n$, then $\map_*(X, K) \sim *$ for every simply-connected finite-dimensional CW…

Algebraic Topology · Mathematics 2012-05-04 Jeffrey Strom

For a metric compact space $L$ and a Banach space $E$, we provide a characterization of the complementability of the Banach space $\mathcal{C}(L)$ of continuous functions on $L$ inside $E$ in terms of the existence of a certain tree in the…

Functional Analysis · Mathematics 2026-03-16 Jakub Rondoš , Damian Sobota

In this position paper, we propose a new approach to generating a type of knowledge base (KB) from text, based on question generation and entity linking. We argue that the proposed type of KB has many of the key advantages of a traditional…

Artificial Intelligence · Computer Science 2022-07-05 Wenhu Chen , William W. Cohen , Michiel De Jong , Nitish Gupta , Alessandro Presta , Pat Verga , John Wieting

This paper presents two general criteria to determine spaceability results in the complements of unions of subspaces. The first criterion applies to countable unions of subspaces under specific conditions and is closely related to the…

Functional Analysis · Mathematics 2024-11-15 Gustavo Araújo , Anderson Barbosa , Anselmo Raposo , Geivison Ribeiro

Let $G$ be a group and let $K$ be a commensurated subgroup of $G$. Then there is a totally disconnected, locally compact (t.d.l.c.) group $\hat{G}_K$ that contains the profinite completion of $K$ as an open compact subgroup and also…

Group Theory · Mathematics 2015-09-03 Colin D. Reid

The notion of quantum matrix pairs is defined. These are pairs of matrices with non-commuting entries, which have the same pattern of internal relations, q-commute with each other under matrix multiplication, and are such that products of…

Quantum Algebra · Mathematics 2007-05-23 J. E. Nelson , R. F. Picken

A complementary Gray code for binary n-tuples is one that, when all the tuples are complemented, is identical to itself; this is equivalent to the complement of the first half of the code being identical to the second half. We generalize…

Combinatorics · Mathematics 2022-10-27 Adam Hoyt , Brett Stevens

We demonstrate that the concept of information offers a more complete description of complementarity than the traditional approach based on observables. We present the first experimental test of information complementarity for two-qubit…

In this paper, we consider the knot complement problem for not null-homologous knots in homology lens spaces. Let $M$ be a homology lens space with $H_1(M; \mathbb{Z}) \cong \mathbb{Z}_p$ and $K$ a not null-homologous knot in $M$. We show…

Geometric Topology · Mathematics 2021-03-31 Kazuhiro Ichihara , Toshio Saito

Let $P$ and $Q$ be finite point sets of the same cardinality in $\mathbb{R}^2$, each labelled from $1$ to $n$. Two noncrossing geometric graphs $G_P$ and $G_Q$ spanning $P$ and $Q$, respectively, are called compatible if for every face $f$…

We define a variant of intersection space theory that applies to many compact complex and real analytic spaces $X$, including all complex projective varieties; this is a significant extension to a theory which has so far only been shown to…

Algebraic Topology · Mathematics 2018-12-06 Christian Geske

The study of minimal complements in a group or a semigroup was initiated by Nathanson. The notion of minimal complements and being a minimal complement leads to the notion of co-minimal pairs which was considered in a prior work of the…

Number Theory · Mathematics 2021-08-10 Arindam Biswas , Jyoti Prakash Saha

A subgroup $H$ of a finite group $G$ is said to satisfy $\Pi$-property in $G$ if for every chief factor $L/K$ of $G$, $|G/K:N_{G/K}(HK/K\cap L/K)|$ is a $\pi(HK/K\cap L/K)$-number. A subgroup $H$ of $G$ is called to be $\Pi$-supplemented in…

Group Theory · Mathematics 2014-01-08 Xiaoyu Chen , Wenbin Guo

Knowledge Graphs (KGs) are widely employed in artificial intelligence applications, such as question-answering and recommendation systems. However, KGs are frequently found to be incomplete. While much of the existing literature focuses on…

Artificial Intelligence · Computer Science 2024-06-28 Sakher Khalil Alqaaidi , Krzysztof Kochut

We discuss a sufficient condition for a space to be filled with an arbitrary finite number of self-similar spaces using a topological concept.

General Topology · Mathematics 2015-07-27 Akihiko Kitada , Shousuke Ohmori , Tomoyuki Yamamoto

Commonsense question answering (QA) requires background knowledge which is not explicitly stated in a given context. Prior works use commonsense knowledge graphs (KGs) to obtain this knowledge for reasoning. However, relying entirely on…

Computation and Language · Computer Science 2020-09-22 Peifeng Wang , Nanyun Peng , Filip Ilievski , Pedro Szekely , Xiang Ren

Knowledge is only good if it is sound, consistent and complete. The same holds true for conceptual knowledge, which holds knowledge about concepts and its association. Conceptual knowledge no matter what format they are represented in, must…

Artificial Intelligence · Computer Science 2014-12-22 Gowri Shankar Ramaswamy , F Sagayaraj Francis

We introduce the notion of an orthocomplemented subspace of a Hilbert space H, that is, a pair of orthogonal closed subspaces of H, as a two-dimensional counterpart to the one-dimensional notion of a closed subspace of H. Orthocomplemented…

Quantum Physics · Physics 2025-08-25 Iosif Petrakis

How to design automated procedures which (i) accurately assess the knowledge of a student, and (ii) efficiently provide advices for further study? To produce well-founded answers, Knowledge Space Theory relies on a combinatorial viewpoint…

Combinatorics · Mathematics 2015-11-24 Jean-Paul Doignon , Jean-Claude Falmagne

We call a linear code $C$ with length $n$ over a field $F$, a linear complementary equi-dual code, when there exists a linear code $D$ over $F$ such that $D$ is permutation equivalent to $C^\perp$ and $(C,D)$ is a linear complementary pair…

Information Theory · Computer Science 2024-08-13 Ashkan Nikseresht , Shohreh Namazi , Marziyeh Beygi Khormaei