Related papers: Quasi-semilattices on networks
This paper presents a unified algebraic, topological, and logical framework for electrical one-port networks based on \v{S}are's $m$-theory. Within this formalism, networks are represented by $m$-words (jorbs) over an ordered alphabet,…
Quasi-lattices are introduced in terms of 'join' and 'meet' operations. It is observed that quasi-lattices become lattices when these operations are associative and when these operations satisfy 'modularity' conditions. A fundamental…
The Lattice Gauge Theory Hilbert space is divided into gauge-invariant sectors selected by the background charges. Such a projector can be directly embedded in a tensor network ansatz for gauge-invariant states as originally discussed in…
Decompositions of tensors into factor matrices, which interact through a core tensor, have found numerous applications in signal processing and machine learning. A more general tensor model which represents data as an ordered network of…
For a rank two root system and a pair of nonnegative integers, using only elementary combinatorics we construct two posets. The constructions are uniform across the root systems A1+A1, A2, C2, and G2. Examples appear in Figures 3.2 and 3.3.…
The trace on matrix rings, along with the augmentation map and Kaplansky trace on group rings, are some of the many examples of linear functions on algebras that vanish on all commutators. We generalize and unify these examples by studying…
Semi-supervised learning algorithms typically construct a weighted graph of data points to represent a manifold. However, an explicit graph representation is problematic for neural networks operating in the online setting. Here, we propose…
A (Hasse) diagram of a finite partially ordered set (poset) P will be called quasiplanar if for any two incomparable elements u and v, either v is on the left of all maximal chains containing u, or v is on the right of all these chains.…
Sparse incidence tensors can represent a variety of structured data. For example, we may represent attributed graphs using their node-node, node-edge, or edge-edge incidence matrices. In higher dimensions, incidence tensors can represent…
Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…
Let $\Gamma$ denote a finite, undirected, connected graph, with vertex set $X$. Fix a vertex $x \in X$. Associated with $x$ is a certain subalgebra $T=T(x)$ of ${\rm Mat}_X(\mathbb C)$, called the subconstituent algebra. The algebra $T$ is…
Similar to linear spaces, many examples of quasilinear spaces have a notion of multiplication of the elements. To characterising these examples, in the present paper we generalize the notion of quasilinear spaces and introduce…
Building on prior work that established Matrix Quasi-tree Theorems for special embedded graphs, in this paper, we develop a comprehensive theory applicable to all embedded graphs. We introduce symbolic skew-adjacency matrices and reduction…
This paper extends previous work with network fragments and situation-specific network construction. We formally define the asymmetry network, an alternative representation for a conditional probability table. We also present an…
A vertex whose removal in a graph $G$ increases the number of components of $G$ is called a cut vertex. For all $n,c$, we determine the maximum number of connected induced subgraphs in a connected graph with order $n$ and $c$ cut vertices,…
We introduce a simple initial working system in which relations (such as part-whole) are directly represented via an architecture with operating and learning rules fundamentally distinct from standard artificial neural network methods.…
An important building block in all current asymptotically fast algorithms for matrix multiplication are tensors with low border rank, that is, tensors whose border rank is equal or very close to their size. To find new asymptotically fast…
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…
We introduce a new decomposition of a graphs into quasi-4-connected components, where we call a graph quasi-4-connected if it is 3-connected and it only has separations of order 3 that remove a single vertex. Moreover, we give a cubic time…
In this paper we develop a structure called Link Algebra, in which we present a Set with two binary operations and an axiom system developed from the study of graph theory and set/antiset theory, sowing main theorems and definitions. Once…