Search results for "Combinatorics"

Escape transition of a polymer chain from a nanotube: How to avoid spurious results by use of the force-biased pruned-enriched Rosenbluth algorithm

2008

A polymer chain containing $N$ monomers confined in a finite cylindrical tube of diameter $D$ grafted at a distance $L$ from the open end of the tube may undergo a rather abrupt transition, where part of the chain escapes from the tube to form a "crown-like" coil outside of the tube. When this problem is studied by Monte Carlo simulation of self-avoiding walks on the simple cubic lattice applying a cylindrical confinement and using the standard pruned-enriched Rosenbluth method (PERM), one obtains spurious results, however: with increasing chain length the transition gets weaker and weaker, due to insufficient sampling of the "escaped" states, as a detailed analysis shows. In order to solve…

Table of periodic properties of human immunodeficiency virus inhibitors

2010

Classification algorithms are proposed based on information entropy. The feasibility of mixing a given human immunodeficiency virus (HIV) inhibitor with dissimilar ones is studied. The 31 inhibitors are classified by their structural chemical properties. Many classification algorithms are based on information entropy. An excessive number of results appear compatible with the data and suffer combinatorial explosion. However, after the equipartition conjecture one has a selection criterion. According to this conjecture, the best configuration is that in which entropy production is most uniformly distributed. The structural elements of an inhibitor can be ranked according to their inhibitory a…

On the Efficiency of Affine Invariant Multivariate Rank Tests

1998

AbstractIn this paper the asymptotic Pitman efficiencies of the affine invariant multivariate analogues of the rank tests based on the generalized median of Oja are considered. Formulae for asymptotic relative efficiencies are found and, under multivariate normal and multivariatetdistributions, relative efficiencies with respect to Hotelling'sT2test are calculated.

Quantum Identification of Boolean Oracles

2004

The oracle identification problem (OIP) is, given a set S of M Boolean oracles out of 2 N ones, to determine which oracle in S is the current black-box oracle. We can exploit the information that candidates of the current oracle is restricted to S. The OIP contains several concrete problems such as the original Grover search and the Bernstein-Vazirani problem. Our interest is in the quantum query complexity, for which we present several upper bounds. They are quite general and mostly optimal: (i) The query complexity of OIP is \(O(\sqrt{N {\rm log} M {\rm log} N}{\rm log log} M)\) for anyS such that M = |S| > N, which is better than the obvious bound N if M \(< 2^{N/log^3 N}\). (ii) It is \…

The best choice problem with an unknown number of objects

1993

The secretary problem with a known prior distribution of the number of candidates is considered. Ifp(i)=p(N=i),i ∈ [α, β] ∩ ℕ, whereα=inf{i ∈ℕ:p(i) > 0} andβ=sup{i ∈ℕ:p(i)≳0}, is the prior distribution of the numberN of candidates it will be shown that, if the optimal stopping rule is of the simple form, then the optimal stopping indexj=minΓ satisfies asymptotically (asβ → ∞) the equationj=exp $${{\left[ {\left( {\sum\limits_{i = max(\alpha ,j)}^\beta {p(i) \log (i)/i} } \right)} \right]} \mathord{\left/ {\vphantom {{\left[ {\left( {\sum\limits_{i = max(\alpha ,j)}^\beta {p(i) \log (i)/i} } \right)} \right]} {\left. {\left( {\sum\limits_{i = max(\alpha ,j)}^\beta {p(i)/i} } \right) - 1} \ri…

Normed vector spaces consisting of classes of convex sets

1965

Transitive permutation groups in which all derangements are involutions

2006

AbstractLet G be a transitive permutation group in which all derangements are involutions. We prove that G is either an elementary abelian 2-group or is a Frobenius group having an elementary abelian 2-group as kernel. We also consider the analogous problem for abstract groups, and we classify groups G with a proper subgroup H such that every element of G not conjugate to an element of H is an involution.

A reduction theorem for perfect locally finite minimal non-FC groups

1999

A group G is said to be a minimal non-FC group, if G contains an infinite conjugacy class, while every proper subgroup of G merely has finite conjugacy classes. The structure of imperfect minimal non-FC groups is quite well-understood. These groups are in particular locally finite. At the other end of the spectrum, a perfect locally finite minimal non-FC group must be a p-group. And it has been an open question for quite a while now, whether such groups exist or not.

On 𝓕-subnormal subgroups and Frattini-like subgroups of a finite group

1994

Throughout the paper we consider only finite groups.J. C. Beidleman and H. Smith [3] have proposed the following question: “If G is a group and Ha subnormal subgroup of G containing Φ(G), the Frattini subgroup of G, such that H/Φ(G)is supersoluble, is H necessarily supersoluble? “In this paper, we give not only an affirmative answer to this question but also we see that the above result still holds if supersoluble is replaced by any saturated formation containing the class of all nilpotent groups.

On-line construction of two-dimensional suffix trees

1997

We present a new technique, which we refer to as implicit updates, based on which we obtain: (a) an algorithm for the on-line construction of the Lsuffix tree of an n x n matrix A — this data structure, described in [13], is the two-dimensional analog of the suffix tree of a string; (b) simple algorithms implementing primitive operations for LZ1-type on-dine lossless image compression methods. Those methods, recently introduced by Storer [35], are generalizations of LZl-type compression methods for strings (see also [24, 31]). For the problem in (a), we get nearly an order of magnitude improvement over algorithms that can be derived from known techniques [13]. For the problem in (b), we do …