Related papers: Quasi-semilattices on networks
Tensor network decompositions offer an efficient description of certain many-body states of a lattice system and are the basis of a wealth of numerical simulation algorithms. We discuss how to incorporate a global symmetry, given by a…
We provide a graphical treatment of SAT and #SAT on equal footing. Instances of #SAT can be represented as tensor networks in a standard way. These tensor networks are interpreted by diagrams of the ZH-calculus: a system to reason about…
A finite semifield is a division algebra over a finite field where multiplication is not necessarily associative. We consider here the complexity of the multiplication in small semifields and finite field extensions. For this operation, the…
In the study of algebras related to non-classical logics, (distributive) semilattices are always present in the background. For example, the algebraic semantic of the $\{\rightarrow,\wedge,\top\}$-fragment of intuitionistic logic is the…
In this paper we propose an algebraic formalization of connectors in the quantitative setting, in order to address their non-functional features in architectures of component-based systems. We firstly present a weighted Algebra of…
The weak operator topology closed operator algebra on $L^2(R)$ generated by the one-parameter semigroups for translation, dilation and multiplication by $exp(i\lambda x), \lambda \geq 0$, is shown to be a reflexive operator algebra, in the…
Binary idempotent semirings govern classical path algebras. Their multiplicative structure is dyadic. We examine whether this restriction is structural or accidental. We define ternary idempotent $\Gamma$-semirings as higher-arity ordered…
Dlab and Ringel showed that algebras being quasi-hereditary in all orders for indices of primitive idempotents becomes hereditary. So, we are interested in for which orders a given quasi-hereditary algebra is again quasi-hereditary. As a…
We adapt the bialgebra and Hopf relations to expose internal structure in the ground state of a Hamiltonian with $Z_2$ topological order. Its tensor network description allows for exact contraction through simple diagrammatic rewrite rules.…
Recall first the algebraic treatment of flows or tensions in a transportation network $N$, i.e. a connected antisymmetric 1-graph $G(X, U)$. Assume that, unusually, we take the values of flows (resp. tensions) in $\mathbb{C}$. So the…
Tensor network contractions are widely used in statistical physics, quantum computing, and computer science. We introduce a method to efficiently approximate tensor network contractions using low-rank approximations, where each intermediate…
Tensor networks provide a natural language for non-invertible symmetries in general Hamiltonian lattice models. We use ZX-diagrams, which are tensor network presentations of quantum circuits, to define a non-invertible operator implementing…
Tensor network methods are taking a central role in modern quantum physics and beyond. They can provide an efficient approximation to certain classes of quantum states, and the associated graphical language makes it easy to describe and…
A family of graphs optimized as the topologies for supercomputer interconnection networks is proposed. The special needs of such network topologies, minimal diameter and mean path length, are met by special constructions of the weight…
A tensor network is a product of tensors associated with vertices of some graph $G$ such that every edge of $G$ represents a summation (contraction) over a matching pair of indexes. It was shown recently by Valiant, Cai, and Choudhary that…
A quasi-hereditary algebra is an Artin algebra together with a partial order on its set of isomorphism classes of simple modules which satisfies certain conditions. In this article we investigate all the possible choices that yield to…
Metanetworks are neural architectures designed to operate directly on pretrained weights to perform downstream tasks. However, the parameter space serves only as a proxy for the underlying function class, and the parameter-function mapping…
In evolutionary biology, phylogenetic networks are graphs that provide a flexible framework for representing complex evolutionary histories that involve reticulate evolutionary events. Recently phylogenetic studies have started to focus on…
We introduce gauge networks as generalizations of spin networks and lattice gauge fields to almost-commutative manifolds. The configuration space of quiver representations (modulo equivalence) in the category of finite spectral triples is…
Phylogenetic networks are graphs that are used to represent evolutionary relationships between different taxa. They generalize phylogenetic trees since for example, unlike trees, they permit lineages to combine. Recently, there has been…