Related papers: T-systems with boundaries from network solutions
We prove tight network topology dependent bounds on the round complexity of computing well studied $k$-party functions such as set disjointness and element distinctness. Unlike the usual case in the CONGEST model in distributed computing,…
Given a finite set T of maps on a finite ring R, we look at the finite simple graph G=(V,E) with vertex set V=R and edge set E={(a,b) | exists t in T, b=t(a), b not equal to a}. An example is when R=Z_n and T consists of a finite set of…
A T-variety is an algebraic variety X with an effective regular action of an algebraic torus T. Altmann and Hausen gave a combinatorial description of an affine T-variety X by means of polyhedral divisors. In this paper we compute the…
We show that finding the classical bound of broad families of Bell inequalities can be naturally framed as the contraction of an associated tensor network, but in tropical algebra, where the sum is replaced by the minimum and the product is…
We study the entanglement entropy of a random tensor network (RTN) using tools from free probability theory. Random tensor networks are simple toy models that help the understanding of the entanglement behavior of a boundary region in the…
We analyze the threshold network model in which a pair of vertices with random weights are connected by an edge when the summation of the weights exceeds a threshold. We prove some convergence theorems and central limit theorems on the…
We are surrounded by spatio-temporal patterns resulting from the interaction of the numerous basic units constituting natural or human-made systems. In presence of diffusive-like coupling, Turing theory has been largely applied to explain…
We notice a remarkable connection between Bazhanov-Sergeev solution of Zamolodchikov tetrahedron equation and certain well-known cluster algebra expression. The tetrahedron transformation is then identified with a sequence of four…
In this work we start the investigation of tight complexity bounds for connectivity problems parameterized by cutwidth assuming the Strong Exponential-Time Hypothesis (SETH). Van Geffen et al. posed this question for odd cycle transversal…
We effectively bound T-singularities on non-rational projective surfaces with an arbitrary amount of T-singularities and ample canonical class. This fully generalizes the previous work for the case of one singularity, and illustrates the…
Using the recently-proposed ``activation-relaxation technique'' for optimizing complex structures, we develop a structural model appropriate to a-GaAs which is almost free of odd-membered rings, i.e., wrong bonds, and possesses an almost…
Tree tensor network descriptions of critical quantum spin chains are empirically known to reproduce correlation functions matching CFT predictions in the continuum limit. It is natural to seek a more complete correspondence, additionally…
Random tensor networks are a powerful toy model for understanding the entanglement structure of holographic quantum gravity. However, unlike holographic quantum gravity, their entanglement spectra are flat. It has therefore been argued that…
The T and Y-systems are ubiquitous structures in classical and quantum integrable systems. They are difference equations having a variety of aspects related to commuting transfer matrices in solvable lattice models, q-characters of…
In this work we consider the problem of extracting a set of interaction parameters from an high-dimensional dataset describing T independent configurations of a complex system composed of N binary units. This problem is formulated in the…
This paper is devoted to tetrahedron maps, which are set-theoretical solutions to the Zamolodchikov tetrahedron equation. We construct a family of tetrahedron maps on associative rings. We show that matrix tetrahedron maps presented in…
Threshold graphs are recursive deterministic network models that have been proposed for describing certain economic and social interactions. One drawback of this graph family is that it has limited generative attachment rules. To mitigate…
An LR-structure is a tetravalent vertex-transitive graph together with a special type of a decomposition of its edge-set into cycles. LR-structures were introduced in a paper by P. Poto\v{c}nik and S. Wilson, titled `Linking rings…
We propose a simple connection between matrix quantum mechanics and tensor networks. This allows us to imbue tensor networks with some interesting additional structure. The geometry of the graph describing the tensor network state is…
Although two-dimensional periodic structures have functioned as the primary platform for exploring topological phenomena, recent advances have substantially expanded this research boundary to include more intricate, aperiodic structures:…