Entropy maximization to maximum likelihood, constrained jointly by the best available experimental phases and by a sufficiently good envelope, can bring about substantial model-independent map improvement, even at medium (3.1 A) resolution [Xiang, Carter, Bricogne & Gilmore (1993). Acta Cryst. D49, 193-212]. In the crystal structure determination of the Bacillus stearothermophilus tryptophanyl-...

Greedy score-based algorithms for learning the structure of Bayesian networks may produce very different models depending on the order in which variables are scored. These models often vary significantly in quality when applied to inference. Unfortunately, finding the optimal ordering of inputs entails search through the permutation space of variables. Furthermore, in real-world applications of...

The torus and the Klein bottle amplitude coefficients are computed in permutation orbifolds of RCFT-s in terms of the same quantities in the original theory and the twist group. An explicit expression is presented for the number of self conjugate primaries in the orbifold as a polynomial of the total number of primaries and the number of self conjugate ones in the parent theory. The formulae in...

Given a random permutation f : [N ] → [N ] as a black box and y ∈ [N ], we want to output x = f(y). Supplementary to our input, we are given classical advice in the form of a precomputed data structure; this advice can depend on the permutation but not on the input y. Classically, there is a data structure of size Õ(S) and an algorithm that with the help of the data structure, given f(x), can i...

The set of synchronizing words a given n-state automaton forms regular language recognizable by an with \(2^n - n\) states. size recognizing for the is linked to computational problems related synchronization and length words. Hence, it natural investigate automata extremal this property, i.e., such that minimal deterministic has sync-maximal permutation groups have been introduced in [S. Hoffm...