Related papers: Quantum Systems on Non-$k$-Hyperfinite Complexes: …
This paper gives a complete selfcontained proof of our result announced in hep-th/9909126 showing that renormalization in quantum field theory is a special instance of a general mathematical procedure of extraction of finite values based on…
For real application and theoretical investigation of ordinary hypergraphs and non-ordinary hypergraphs, researchers need to establish standard rules and feasible operating methods. We propose a visualization tool for investigating…
We generalize the concept of token graphs to obtain supertoken graphs. In the latter case, there can be more than one token in a vertex. We formally define supertoken graphs and establish their basic properties. Moreover, we provide some…
Recent work has demonstrated the existence of universal Hamiltonians - simple spin lattice models that can simulate any other quantum many body system to any desired level of accuracy. Until now proofs of universality have relied on…
We propose a nonperturbative construction of Hopf algebras that represent categories of line operators in topological quantum field theory, in terms of semi-extended operators (spark algebras) on pairs of transverse topological boundary…
We present a construction of integrable hierarchies without or with boundary, starting from a single R-matrix, or equivalently from a ZF algebra. We give explicit expressions for the Hamiltonians and the integrals of motion of the hierarchy…
Recent experimental advances in controlling dissipation have brought about unprecedented flexibility in engineering non-Hermitian Hamiltonians in open classical and quantum systems. A particular interest centers on the topological…
For any acyclic quiver $Q$ without multiple edges, we construct a monoidal category $\mathcal{R}_Q$ whose indecomposable objects are tensor products (over the base field) of finite-dimensional modules over the path algebra of $Q$. We show…
All hyperK\"ahler ALE 4-manifolds with a given non-trivial finite group $\Gamma$ in $SU(2)$ at infinity are parameterized by an open dense subset of a real linear space of dimension $3$rank$\Phi$. Here, $\Phi$ denotes the root system…
Topological Signal Processing (TSP) over simplicial complexes is a framework that has been recently proposed, as a generalization of graph signal processing (GSP), to extend GSP to analyzing signals defined over sets of any order (i.e., not…
We introduce graphical complexes of groups, which can be thought of as a generalisation of Coxeter systems with 1-dimensional nerves. We show that these complexes are strictly developable, and we equip the resulting Basic Construction with…
We discuss the topological properties of the independence complex of Kneser graphs, Ind(KG$(n, k))$, with $n\geq 3$ and $k\geq 1$. By identifying one kind of maximal simplices through projective planes, we obtain homology generators for the…
Using duality and topological theory of well behaved Hopf algebras (as defined in [2]) we construct star-product models of non compact quantum groups from Drinfeld and Reshetikhin standard deformations of enveloping Hopf algebras of simple…
We introduce the magic hierarchy, a quantum circuit model that alternates between arbitrary-sized Clifford circuits and constant-depth circuits with two-qubit gates ($\textsf{QNC}^0$). This model unifies existing circuit models, such as…
We study the numerical topology of the clique complex $K_n=\mathrm{Cl}(G_n)$, where $G_n$ is the partition graph on the set of integer partitions of $n$. Building on the previously established homotopy equivalence $K_n \simeq \vee^{\,b_n}…
Given a finite, simple, vertex-weighted graph, we construct a graded associative (non-commutative) algebra, whose generators correspond to vertices and whose ideal of relations has generators that are graded commutators corresponding to…
The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…
As a fundamental metric for quantifying quantum advantage in non-local games, the quantum chromatic number reveals the power of entanglement in distributed tasks. In this paper, we investigate this parameter for $q$-ary Hamming graphs and a…
The cohomology of the degree-$n$ general linear group over a finite field of characteristic $p$, with coefficients also in characteristic $p$, remains poorly understood. For example, the lowest degree previously known to contain nontrivial…
A long-standing open question is which graph class is the most general one permitting constant-time constant-factor approximations for dominating sets. The approximation ratio has been bounded by increasingly general parameters such as…