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 Model Ground State of Polyampholytes

The ground state of randomly charged polyampholytes is conjectured to have a structure similar to a necklace, made of weakly charged parts of the chain, compacting into globules, connected by highly charged stretched `strings'. We suggest a specific structure, within the necklace model, where all the neutral parts of the chain compact into globules: The longest neutral segment compacts into a globule; in the remaining part of the chain, the longest neutral segment (the 2nd longest neutral segment) compacts into a globule, then the 3rd, and so on. We investigate the size distributions of the longest neutral segments in random charge sequences, using analytical and Monte Carlo methods. We show that the length of the n-th longest neutral segment in a sequence of N monomers is proportional to N/(n^2), while the mean number of neutral segments increases as sqrt(N). The polyampholyte in the ground state within our model is found to have an average linear size proportional to sqrt(N), and an average surface area proportional to N^(2/3).Comment: 8 two-column pages. 5 eps figures. RevTex. Submitted to Phys. Rev.

Collapse of Randomly Self-Interacting Polymers

We use complete enumeration and Monte Carlo techniques to study self--avoiding walks with random nearest--neighbor interactions described by $v_0q_iq_j$, where $q_i=\pm1$ is a quenched sequence of ``charges'' on the chain. For equal numbers of positive and negative charges ($N_+=N_-$), the polymer with $v_0>0$ undergoes a transition from self--avoiding behavior to a compact state at a temperature $\theta\approx1.2v_0$. The collapse temperature $\theta(x)$ decreases with the asymmetry $x=|N_+-N_-|/(N_++N_-)$Comment: 8 pages, TeX, 4 uuencoded postscript figures, MIT-CMT-

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

Effects of Self-Avoidance on the Tubular Phase of Anisotropic Membranes

We study the tubular phase of self-avoiding anisotropic membranes. We discuss the renormalizability of the model Hamiltonian describing this phase and derive from a renormalization group equation some general scaling relations for the exponents of the model. We show how particular choices of renormalization factors reproduce the Gaussian result, the Flory theory and the Gaussian Variational treatment of the problem. We then study the perturbative renormalization to one loop in the self-avoiding parameter using dimensional regularization and an epsilon-expansion about the upper critical dimension, and determine the critical exponents to first order in epsilon.Comment: 19 pages, TeX, uses Harvmac. Revised Title and updated references: to appear in Phys. Rev.

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

Division, adjoints, and dualities of bilinear maps

The distributive property can be studied through bilinear maps and various morphisms between these maps. The adjoint-morphisms between bilinear maps establish a complete abelian category with projectives and admits a duality. Thus the adjoint category is not a module category but nevertheless it is suitably familiar. The universal properties have geometric perspectives. For example, products are orthogonal sums. The bilinear division maps are the simple bimaps with respect to nondegenerate adjoint-morphisms. That formalizes the understanding that the atoms of linear geometries are algebraic objects with no zero-divisors. Adjoint-isomorphism coincides with principal isotopism; hence, nonassociative division rings can be studied within this framework. This also corrects an error in an earlier pre-print; see Remark 2.11

Crumpling a Thin Sheet

Crumpled sheets have a surprisingly large resistance to further compression. We have studied the crumpling of thin sheets of Mylar under different loading conditions. When placed under a fixed compressive force, the size of a crumpled material decreases logarithmically in time for periods up to three weeks. We also find hysteretic behavior when measuring the compression as a function of applied force. By using a pre-treating protocol, we control this hysteresis and find reproducible scaling behavior for the size of the crumpled material as a function of the applied force.Comment: revtex 4 pages, 6 eps figures submitted to Phys Rev. let

Optimal competitiveness for the Rectilinear Steiner Arborescence problem

We present optimal online algorithms for two related known problems involving Steiner Arborescence, improving both the lower and the upper bounds. One of them is the well studied continuous problem of the {\em Rectilinear Steiner Arborescence} ($RSA$). We improve the lower bound and the upper bound on the competitive ratio for $RSA$ from $O(\log N)$ and $\Omega(\sqrt{\log N})$ to $\Theta(\frac{\log N}{\log \log N})$, where $N$ is the number of Steiner points. This separates the competitive ratios of $RSA$ and the Symetric-$RSA$, two problems for which the bounds of Berman and Coulston is STOC 1997 were identical. The second problem is one of the Multimedia Content Distribution problems presented by Papadimitriou et al. in several papers and Charikar et al. SODA 1998. It can be viewed as the discrete counterparts (or a network counterpart) of $RSA$. For this second problem we present tight bounds also in terms of the network size, in addition to presenting tight bounds in terms of the number of Steiner points (the latter are similar to those we derived for $RSA$)

Ground States of Two-Dimensional Polyampholytes

We perform an exact enumeration study of polymers formed from a (quenched) random sequence of charged monomers $\pm q_0$, restricted to a 2-dimensional square lattice. Monomers interact via a logarithmic (Coulomb) interaction. We study the ground state properties of the polymers as a function of their excess charge $Q$ for all possible charge sequences up to a polymer length N=18. We find that the ground state of the neutral ensemble is compact and its energy extensive and self-averaging. The addition of small excess charge causes an expansion of the ground state with the monomer density depending only on $Q$. In an annealed ensemble the ground state is fully stretched for any excess charge $Q>0$.Comment: 6 pages, 6 eps figures, RevTex, Submitted to Phys. Rev.