Related papers: Steiner-tree confinement and tetraquarks
A dynamical quark model of hadron and nucleus structure is proposed. In the frame of the model, called the Strongly Correlated Quark Model, quarks and nucleons inside nuclei are arranged in a crystal--like structure.
We construct an example of an infinite planar embedded self-similar binary tree $\Sigma$ which is the essentially unique solution to the Steiner problem of finding the shortest connection of a given planar self-similar fractal set $C$ of…
For the line of critical antiferromagnetic XXZ chains with coupling $J>0$ and anisotropy $0<\Delta \leq 1$, we describe how the block-spin renormalization procedure preserving the $SU_q(2)$ symmetry introduced by Martin-Delgado and Sierra…
A generalized linear sigma model is employed to study the quark structure of low lying scalar as well as pseudoscalar states. The model allows the possible mixing of quark anti-quark states with others made of two quarks and two antiquarks…
An overview of some issues discussed is given, including the following ones: (i) the mechanism of confinement, (ii) the structure of the string, (iii) non-perturbative glue in vacuum and hadrons, and (v) quark-hadron duality. In doing so I…
In this talk, multiquarks are studied microscopically in a standard quark model. In pure ground-state pentaquarks the short-range interaction is computed and it is shown to be repulsive, a narrow pentaquark cannot be in the groundstate. As…
Representations of Spin groups and Clifford algebras derived from the structure of qubit trees are introduced in this work. For ternary trees the construction is more general and reduction to binary trees is formally defined by deletion of…
A tree tensor network variational method is proposed to simulate quantum many-body systems with global symmetries where the optimization is reduced to individual charge configurations. A computational scheme is presented, how to extract the…
We study compact straight-line embeddings of trees. We show that perfect binary trees can be embedded optimally: a tree with $n$ nodes can be drawn on a $\sqrt n$ by $\sqrt n$ grid. We also show that testing whether a given binary tree has…
The seemingly disparate notions of chiral color and quark-lepton nonuniversality are combined, and shown to be essential to each other as part of an underlying (and unifying) larger symmetry, i.e. supersymmetric SU(3)^6. Both phenomena are…
We report some recent results obtained for large N gauge theories which support the idea of volume reduction. Results for the string tension of the Twisted Eguchi-Kawai model match with those obtained from extrapolation from finite N.…
Recent lattice QCD calculations suggest a rather abrupt transition in the confinig potential from a linear to a constant behavior. We analyze the effects of such a fast deconfinement in the simplest non-relativistic system, bottomonium.
Phylogenetic trees and networks are leaf-labelled graphs that are used to describe evolutionary histories of species. The Tree Containment problem asks whether a given phylogenetic tree is embedded in a given phylogenetic network. Given a…
Large N QCD is mostly governed by planar diagrams and should show linear confinement when these diagrams are suitably summed. The linear confinement of quarks in a class of these theories using gravity duals that capture the logarithmic…
The contraction cost of a tensor network depends on the contraction order. However, the optimal contraction ordering problem is known to be NP-hard. We show that the linear contraction ordering problem for tree tensor networks admits a…
Final revision. To appear in the Journal of Differential Geometry. This paper studies knots that are transversal to the standard contact structure in $\reals^3$, bringing techniques from topological knot theory to bear on their transversal…
The Steiner Tree problem is a classical problem in combinatorial optimization: the goal is to connect a set $T$ of terminals in a graph $G$ by a tree of minimum size. Karpinski and Zelikovsky (1996) studied the $\delta$-dense version of…
A self-contained account of the theory of structure trees for edge cuts in networks is given. Applications include a generalisation of the Max-Flow Min-Cut Theorem to infinite networks and a short proof of a conjecture of Kropholler. This…
The main goal of this paper is to study the topological properties of tensors in tree-based Tucker format. These formats include the Tucker format and the Hierarchical Tucker format. A property of the so-called minimal subspaces is used for…
We study three subjects on quark confinement in hadrons in SU(3)$_{\rm c}$ lattice QCD. From the accurate lattice calculation for more than 300 different patterns of three-quark (3Q) systems, we find that the static 3Q potential is well…