Related papers: Unitary Correlation Sets
Vector space models of words have long been claimed to capture linguistic regularities as simple vector translations, but problems have been raised with this claim. We decompose and empirically analyze the classic arithmetic word analogy…
Comparison of quantum objects is a task to determine whether two unknown quantum objects are the same or different. It is one of the most basic information processing tasks for learning property of quantum objects, and comparison of quantum…
We show that any two Hadamard subfactors arising from a pair of distinct complex Hadamard matrices of order 3 are either equal or conjugate by a unitary in the relative commutant of their intersection. Moreover, when the Hadamard subfactors…
We analyze properties of non-hermitian matrices of size M constructed as square submatrices of unitary (orthogonal) random matrices of size N>M, distributed according to the Haar measure. In this way we define ensembles of random matrices…
Text embeddings are numerical representations of text data, where words, phrases, or entire documents are converted into vectors of real numbers. These embeddings capture semantic meanings and relationships between text elements in a…
This paper follows up on a recent pre-print (Durham [2005]) by first deriving a set theoretic relationship between the generalized uncertainty relations and the Clauser-Horne inequalities. The physical, metaphysical, and metamathematical…
We investigate the spectral properties of the product of $M$ complex non-Hermitian random matrices that are obtained by removing $L$ rows and columns of larger unitary random matrices uniformly distributed on the group ${\rm U}(N+L)$. Such…
We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…
A unitary (Euclidean) representation of a quiver is given by assigning to each vertex a unitary (Euclidean) vector space and to each arrow a linear mapping of the corresponding vector spaces. We recall an algorithm for reducing the matrices…
Cosine similarity of contextual embeddings is used in many NLP tasks (e.g., QA, IR, MT) and metrics (e.g., BERTScore). Here, we uncover systematic ways in which word similarities estimated by cosine over BERT embeddings are understated and…
A set $\mathcal{G}$ of planar graphs on the same number $n$ of vertices is called simultaneously embeddable if there exists a set $P$ of $n$ points in the plane such that every graph $G \in \mathcal{G}$ admits a (crossing-free)…
The Gauss image problem for convex bodies asks for the existence of a convex body that "links" two given measures on the unit sphere in a certain way. We treat here a corresponding question for pseudo-cones, that is, for unbounded closed…
We study upward planar straight-line embeddings (UPSE) of directed trees on given point sets. The given point set $S$ has size at least the number of vertices in the tree. For the special case where the tree is a path $P$ we show that: (a)…
A key tool in recent advances in understanding arithmetic progressions and other patterns in subsets of the integers is certain norms or seminorms. One example is the norms on $\Z/N\Z$ introduced by Gowers in his proof of Szemer\'edi's…
Inspired by the classic problem of Boolean function monotonicity testing, we investigate the testability of other well-studied properties of combinatorial finite set systems, specifically \emph{intersecting} families and \emph{union-closed}…
Post Embedding Problems are a family of decision problems based on the interaction of a rational relation with the subword embedding ordering, and are used in the literature to prove non multiply-recursive complexity lower bounds. We refine…
A large number of embeddings trained on medical data have emerged, but it remains unclear how well they represent medical terminology, in particular whether the close relationship of semantically similar medical terms is encoded in these…
In this paper we deal with the feasibility-seeking problem for unions of convex sets (UCS) sets and propose an iterative process for its solution. Renewed interest in this problem stems from the fact that it was recently discovered to serve…
Automated theorem proving in first-order logic is an active research area which is successfully supported by machine learning. While there have been various proposals for encoding logical formulas into numerical vectors -- from simple…
Given a set of nonempty subsets of some universal set, their intersection graph is defined as the graph with one vertex for each set and two vertices are adjacent precisely when their representing sets have non-empty intersection. Sometimes…