Related papers: A characterization of positive spanning sets with …
Word embeddings are rich word representations, which in combination with deep neural networks, lead to large performance gains for many NLP tasks. However, word embeddings are represented by dense, real-valued vectors and they are therefore…
The dynamics of linear positive systems map the positive orthant to itself. In other words, it maps a set of vectors with zero sign variations to itself. This raises the following question: what linear systems map the set of vectors with…
We describe a basic correspondence between linear algebraic structures within vector embeddings in artificial neural networks and conditional independence constraints on the probability distributions modeled by these networks. Our framework…
We consider mappings between edge sets of graphs that lift tensions to tensions. Such mappings are called tension-continuous mappings (shortly TT mappings). Existence of a TT mapping induces a (quasi)order on the class of graphs, which…
The decomposition of a linkage into minimal components is a central tool of analysis and synthesis of linkages. In this paper we prove that every pinned d-isostatic (minimally rigid) graph (grounded linkage) has a unique decomposition into…
We show that if a subset $\Psi$ of the ends of a graph $G$ can be displayed by a tree-decomposition of finite adhesion, then it can also be displayed by a linked such tree-decomposition. This tree-decomposition captures all combinatorial…
This paper explores the kinds of probabilistic relations that are important in syntactic disambiguation. It proposes that two widely used kinds of relations, lexical dependencies and structural relations, have complementary disambiguation…
Given a set of points in the plane, we want to establish a connection network between these points that consists of several disjoint layers. Motivated by sensor networks, we want that each layer is spanning and plane, and that no edge is…
Spontaneous symmetry breaking (SSB) and exceptional points (EPs) are often assumed to be inherently linked. Here we investigate the intricate relationship between SSB and specific classes of EPs across three distinct, real-world scenarios…
In finite group theory, studying the prime graph of a group has been an important topic for almost the past half-century. Recently, prime graphs of solvable groups have been characterized in graph theoretical terms only. This now allows the…
Relations between users on social media sites often reflect a mixture of positive (friendly) and negative (antagonistic) interactions. In contrast to the bulk of research on social networks that has focused almost exclusively on positive…
Visual and audio signals often coexist in natural environments, forming audio-visual events (AVEs). Given a video, we aim to localize video segments containing an AVE and identify its category. In order to learn discriminative features for…
This article introduces planar shape signatures derived from homology nerves, which are intersecting 1-cycles in a collection of homology groups endowed with a proximal relator (set of nearness relations) that includes a descriptive…
Recent developments have yielded significant progress towards systematically understanding loop corrections to de Sitter (dS) correlators. In close analogy with physics in Anti-de Sitter (AdS), large logarithms can result from loops that…
We study BPS-saturated classical solutions for the world-sheet theory of a D-string in the presence of a point charge. These solutions are interpreted as describing planar 3-string junctions, which arise because the original D-string is…
Let $\PP^d$ be the $d$-fold direct product of the set of primes. We prove that if $A$ is a subset of $\PP^d$ of positive relative upper density then $A$ contains infinitely many "corners", that is sets of the form $\{x,x+te_1,...,x+te_d\}$…
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
In this work, we study the correlation between attribute sets and the occurrence of dense subgraphs in large attributed graphs, a task we call structural correlation pattern mining. A structural correlation pattern is a dense subgraph…
The concepts of P- and P$_0$-matrices are generalized to P- and P$_0$-tensors of even and odd orders via homogeneous formulae. Analog to the matrix case, our P-tensor definition encompasses many important classes of tensors such as the…
Series photo selection (SPS) is an important branch of the image aesthetics quality assessment, which focuses on finding the best one from a series of nearly identical photos. While a great progress has been observed, most of the existing…