Related papers: Tripartite information at long distances
Four-dimensional state space geometry is worked out for the exactly solved one-dimensional spin-3/2 lattice with a Blume-Emery-Griffiths (BEG) Hamiltonian as well as a more general one with a term containing a non-zero field coupling to the…
In the first part of the thesis we consider the constraints of causality and unitarity for particles interacting via strictly finite-range interactions. We generalize Wigner's causality bound to the case of non-vanishing partial-wave…
Recently, In [Phys. Rev. Lett. 104, 018701 (2010)] the authors studied a spatial network which is constructed from a regular lattice by adding long-range edges (shortcuts) with probability $P_{ij}\sim r_{ij}^{-\alpha}$, where $r_{ij}$ is…
Information theoretically secure multi-party computation (MPC) is a central primitive of modern cryptography. However, relatively little is known about the communication complexity of this primitive. In this work, we develop powerful…
The distance of a graph from being triangle-free is a fundamental graph parameter, counting the number of edges that need to be removed from a graph in order for it to become triangle-free. Its corresponding computational problem is the…
We propose a linear algebraic method, rooted in the spectral properties of graphs, that can be used to prove lower bounds in communication complexity. Our proof technique effectively marries spectral bounds with information-theoretic…
We present Monte Carlo simulation results for the three dimensional Thirring model on moderate sized lattices using a hybrid molecular dynamics algorithm which permits an odd or non-integer number Nf of fermion flavors. We find a continuous…
We study the Erdos distance conjecture on the unit sphere in three dimensions using Fourier analytic methods.
We study the possible scaling limits of percolation interfaces in two dimensions on the triangular lattice. When one lets the percolation parameter p(N) vary with the size N of the box that one is considering, three possibilities arise in…
In this paper we complete the first step, namely the uniform bound on completely convergent contributions, towards proving that a three dimensional interacting system of Fermions is a Fermi liquid in the sense of Salmhofer. The analysis…
FERM3D is a three-dimensional finite element program, for the elastic scattering of a low energy electron from a general polyatomic molecule, which is converted to a potential scattering problem. The code is based on tricubic polynomials in…
We describe an efficient theoretical criterion suitable for the evaluation of the tripartite entanglement of any mixed three-boson or -fermion state, based on the notion of the entanglement of particles for bipartite systems of identical…
High temperature one-dimensional (1D) ferromagnetic (FM) chains in Ca3Co2O6 spin system are subjected to a magnetic field and temperature induced first order phase transition (FOPT) to 3D ferrimagnetic (FIM) ground state with decrease in…
We propose a new way of investigating phase transitions in the context of information theory. We use an information-entropic measure of spatial complexity known as configurational entropy (CE) to quantify both the storage and exchange of…
First we argue in an informal, qualitative way that it is natural to enlarge space-time to five dimensions to be able to solve the problem of elementary particle masses. Several criteria are developed for the success of this program.…
We discuss an effective field theory of a triangular-lattice three-spin interaction model defined by the ${\mathbb Z}_p$ variables. Based on the symmetry properties and the ideal-state graph concept, we show that the vector dual sine-Gordon…
The nearest lattice point problem in $\mathbb{R}^n$ is formulated in a distributed network with $n$ nodes. The objective is to minimize the probability that an incorrect lattice point is found, subject to a constraint on inter-node…
The natural pseudo-distance of spaces endowed with filtering functions is precious for shape classification and retrieval; its optimal estimate coming from persistence diagrams is the bottleneck distance, which unfortunately suffers from…
Two-party one-way quantum communication has been extensively studied in the recent literature. We target the size of minimal information that is necessary for a feasible party to finish a given combinatorial task, such as distinction of…
I give a review of existing frameworks, which are designed to analyse lattice data in the three-particle sector. A particular emphasis is laid on the foundations of the theory, where the separation of the short- and long-range effects plays…