The binding energy of the six quark system with strangeness s=-3 is investigated under the chiral SU(3) constituent quark model in the framework of RGM. The calculations of the single NΩ channel with spin S=2 and the single ∆Ω channel with spin S=3 are performed. The results show that both systems could be dibaryons and the interaction induced by the chiral field plays a very important role on ...

An arithmetic circuit or formula is multilinear if the polynomial computed at each of its wires is multilinear. We give an explicit polynomial f (x1, . . . ,xn) with coefficients in {0,1} such that over any field: 1. f can be computed by a polynomial-size multilinear circuit of depth O(log2 n). 2. Any multilinear formula for f is of size nΩ(logn). This gives a superpolynomial gap between multil...

The decays of excited nonstrange baryons into the final states ∆η and ∆ω are examined in a relativized quark pair creation model. The wavefunctions and parameters of the model are fixed by previous calculations of Nπ and Nππ, etc., decays through various quasi-two body channels including Nη and Nω. Our results show that the combination of thresholds just below the region of interest and the iso...

The girth of a graph, i.e. the length of its shortest cycle, is a fundamental graph parameter. Unfortunately all known algorithms for computing, even approximately, the girth and girthrelated structures in directed weighted m-edge and n-node graphs require Ω(min{nω,mn}) time (for 2 ≤ ω < 2.373). In this paper, we drastically improve these runtimes as follows: • Multiplicative Approximations in ...

BACKGROUND Arginase competes with nitric oxide synthase for their common substrate L-arginine. Up-regulation of arginase in coronary artery disease (CAD) and diabetes mellitus may reduce nitric oxide bioavailability contributing to endothelial dysfunction and ischemia-reperfusion injury. Arginase inhibition reduces infarct size in animal models. Therefore the aim of the current study was to inv...

Given a message msg ∈ {0, 1}N , its k-wise direct product encoding is the sequence of k-tuples (msg(i1), . . . ,msg(ik)) over all possible k-tuples of indices (i1, . . . , ik) ∈ {1, . . . , N}k. We give an efficient randomized algorithm for approximate local list-decoding of direct product codes. That is, given oracle access to a word which agrees with a k-wise direct product encoding of some m...