Randomly Charged Polymers, Random Walks, and Their Extremal Properties

Motivated by an investigation of ground state properties of randomly charged polymers, we discuss the size distribution of the largest Q-segments (segments with total charge Q) in such N-mers. Upon mapping the charge sequence to one--dimensional random walks (RWs), this corresponds to finding the probability for the largest segment with total displacement Q in an N-step RW to have length L. Using analytical, exact enumeration, and Monte Carlo methods, we reveal the complex structure of the probability distribution in the large N limit. In particular, the size of the longest neutral segment has a distribution with a square-root singularity at l=L/N=1, an essential singularity at l=0, and a discontinuous derivative at l=1/2. The behavior near l=1 is related to a another interesting RW problem which we call the "staircase problem". We also discuss the generalized problem for d-dimensional RWs.Comment: 33 pages, 19 Postscript figures, RevTe

A Census Of Highly Symmetric Combinatorial Designs

As a consequence of the classification of the finite simple groups, it has been possible in recent years to characterize Steiner t-designs, that is t-(v,k,1) designs, mainly for t = 2, admitting groups of automorphisms with sufficiently strong symmetry properties. However, despite the finite simple group classification, for Steiner t-designs with t > 2 most of these characterizations have remained longstanding challenging problems. Especially, the determination of all flag-transitive Steiner t-designs with 2 < t < 7 is of particular interest and has been open for about 40 years (cf. [11, p. 147] and [12, p. 273], but presumably dating back to 1965). The present paper continues the author's work [20, 21, 22] of classifying all flag-transitive Steiner 3-designs and 4-designs. We give a complete classification of all flag-transitive Steiner 5-designs and prove furthermore that there are no non-trivial flag-transitive Steiner 6-designs. Both results rely on the classification of the finite 3-homogeneous permutation groups. Moreover, we survey some of the most general results on highly symmetric Steiner t-designs.Comment: 26 pages; to appear in: "Journal of Algebraic Combinatorics

MUBs inequivalence and affine planes

There are fairly large families of unitarily inequivalent complete sets of N+1 mutually unbiased bases (MUBs) in C^N for various prime powers N. The number of such sets is not bounded above by any polynomial as a function of N. While it is standard that there is a superficial similarity between complete sets of MUBs and finite affine planes, there is an intimate relationship between these large families and affine planes. This note briefly summarizes "old" results that do not appear to be well-known concerning known families of complete sets of MUBs and their associated planes.Comment: This is the version of this paper appearing in J. Mathematical Physics 53, 032204 (2012) except for format changes due to the journal's style policie

Theta-point universality of polyampholytes with screened interactions

By an efficient algorithm we evaluate exactly the disorder-averaged statistics of globally neutral self-avoiding chains with quenched random charge $q_i=\pm 1$ in monomer i and nearest neighbor interactions $\propto q_i q_j$ on square (22 monomers) and cubic (16 monomers) lattices. At the theta transition in 2D, radius of gyration, entropic and crossover exponents are well compatible with the universality class of the corresponding transition of homopolymers. Further strong indication of such class comes from direct comparison with the corresponding annealed problem. In 3D classical exponents are recovered. The percentage of charge sequences leading to folding in a unique ground state approaches zero exponentially with the chain length.Comment: 15 REVTEX pages. 4 eps-figures . 1 tabl

Bundles of Interacting Strings in Two Dimensions

Bundles of strings which interact via short-ranged pair potentials are studied in two dimensions. The corresponding transfer matrix problem is solved analytically for arbitrary string number N by Bethe ansatz methods. Bundles consisting of N identical strings exhibit a unique unbinding transition. If the string bundle interacts with a hard wall, the bundle may unbind from the wall via a unique transition or a sequence of N successive transitions. In all cases, the critical exponents are independent of N and the density profile of the strings exhibits a scaling form that approaches a mean-field profile in the limit of large N.Comment: 8 pages (latex) with two figure