Exactly soluble non-perturbative model of pure gauge QCD is suggested as the weak coupling limit of lattice theory in loop formulation [1]. The model provides exact calculation of any loop average in the continuum limit. Wilson loop is computed for abelian and non-abelian unitary groups in various dimensions, including D = 4 where it reproduces perimeter law for U(1) and gives area law for SU(N...

It is shown that, contrary to recent suggestions, the exponent ν, characterizing self-avoiding walks in a diluted lattice at the percolation threshold is determined by a fixed point, different from the pure-lattice one. The full phase diagram of this system is obtained by a real-space renormalization-group treatment and five nontrivial fixed points are identified. A field-theoretical treatment ...

Here we propose an experimental set-up in which it is possible to obtain the entanglement of a two-mode Gaussian state, be it pure or mixed, using only simple linear optical measurement devices. After a proper unitary manipulation of the two-mode Gaussian state only number and purity measurements of just one of the modes suffice to give us a complete and exact knowledge of the state’s entanglem...

A new fast and exact algorithm for determining the -NN classification of multichannel image data, and a new distance transform algorithm are described. Complexity analysis and empirical studies with magnetic resonance images (MRI) demonstrate the effectiveness of the new classification algorithm.

This article presents the preliminary results on a new branch-and-bound algorithm proposed for the single machine total tardiness problem with arbitrary release dates. The algorithm relies on dominance properties from the literature as well as a new branching condition. A new lower bounding technique for the problem is also introduced. The performance of the algorithm is compared to the perform...

The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of genes within chromosomes. Computing this distance is NP-hard. In the present work, we give a tight connection between syntenic distance and the incomplete gossip problem, a novel generalization of the classical gossip p...

A q-analog of a Steiner system (briefly, q-Steiner system), denoted by S = Sq[t, k, n], is a set of k-dimensional subspaces of F n q such that each t-dimensional subspace of Fq is contained in exactly one element of S. Presently, q-Steiner systems are known only for t = 1 and in the trivial cases t = k and k = n. In this paper, the first known nontrivial q-Steiner systems with t ≥ 2 are constru...