Complexity, Tunneling and Geometrical Symmetry

It is demonstrated in the context of the simple one-dimensional example of a barrier in an infinite well, that highly complex behavior of the time evolution of a wave function is associated with the almost degeneracy of levels in the process of tunneling. Degenerate conditions are obtained by shifting the position of the barrier. The complexity strength depends on the number of almost degenerate levels which depend on geometrical symmetry. The presence of complex behavior is studied to establish correlation with spectral degeneracy.Comment: 9 revtex pages, 6 Postscript figures (uuencoded

Average Symmetry and Complexity of Binary Sequences

The concept of complexity as average symmetry is here formalised by introducing a general expression dependent on the relevant symmetry and a related discrete set of transformations. This complexity has hybrid features of both statistical complexities and of those related to algorithmic complexity. Like the former, random objects are not the most complex while they still are more complex than the more symmetric ones (as in the latter). By applying this definition to the particular case of rotations of binary sequences, we are able to find a precise expression for it. In particular, we then analyse the behaviour of this measure in different well-known automatic sequences, where we find interesting new properties. A generalisation of the measure to statistical ensembles is also presented and applied to the case of i.i.d. random sequences and to the equilibrium configurations of the one-dimensional Ising model. In both cases, we find that the complexity is continuous and differentiable as a function of the relevant parameters and agrees with the intuitive requirements we were looking for.Comment: 9 pages, 5 figure

Symmetry and Complexity

Symmetry and complexity are the focus of a selection of outstanding papers, ranging from pure Mathematics and Physics to Computer Science and Engineering applications. This collection is based around fundamental problems arising from different fields, but all of them have the same task, i.e. breaking the complexity by the symmetry. In particular, in this Issue, there is an interesting paper dealing with circular multilevel systems in the frequency domain, where the analysis in the frequency domain gives a simple view of the system. Searching for symmetry in fractional oscillators or the analysis of symmetrical nanotubes are also some important contributions to this Special Issue. More papers, dealing with intelligent prognostics of degradation trajectories for rotating machinery in engineering applications or the analysis of Laplacian spectra for categorical product networks, show how this subject is interdisciplinary, i.e. ranging from theory to applications. In particular, the papers by Lee, based on the dynamics of trapped solitary waves for special differential equations, demonstrate how theory can help us to handle a practical problem. In this collection of papers, although encompassing various different fields, particular attention has been paid to the common task wherein the complexity is being broken by the search for symmetry

Counting loop diagrams: computational complexity of higher-order amplitude evaluation

We discuss the computational complexity of the perturbative evaluation of scattering amplitudes, both by the Caravaglios-Moretti algorithm and by direct evaluation of the individual diagrams. For a self-interacting scalar theory, we determine the complexity as a function of the number of external legs. We describe a method for obtaining the number of topologically inequivalent Feynman graphs containing closed loops, and apply this to one- and two-loop amplitudes. We also compute the number of graphs weighted by their symmetry factors, thus arriving at exact and asymptotic estimates for the average symmetry factor of diagrams. We present results for the asymptotic number of diagrams up to 10 loops, and prove that the average symmetry factor approaches unity as the number of external legs becomes large.Comment: 27 pages, 17 table

Complexity, BioComplexity, the Connectionist Conjecture and Ontology of Complexity\ud

This paper develops and integrates major ideas and concepts on complexity and biocomplexity - the connectionist conjecture, universal ontology of complexity, irreducible complexity of totality & inherent randomness, perpetual evolution of information, emergence of criticality and equivalence of symmetry & complexity. This paper introduces the Connectionist Conjecture which states that the one and only representation of Totality is the connectionist one i.e. in terms of nodes and edges. This paper also introduces an idea of Universal Ontology of Complexity and develops concepts in that direction. The paper also develops ideas and concepts on the perpetual evolution of information, irreducibility and computability of totality, all in the context of the Connectionist Conjecture. The paper indicates that the control and communication are the prime functionals that are responsible for the symmetry and complexity of complex phenomenon. The paper takes the stand that the phenomenon of life (including its evolution) is probably the nearest to what we can describe with the term “complexity”. The paper also assumes that signaling and communication within the living world and of the living world with the environment creates the connectionist structure of the biocomplexity. With life and its evolution as the substrate, the paper develops ideas towards the ontology of complexity. The paper introduces new complexity theoretic interpretations of fundamental biomolecular parameters. The paper also develops ideas on the methodology to determine the complexity of “true” complex phenomena.\u

Strong CP and Mu Problems in Theories with Gauge Mediated Supersymmetry Breaking

We provide a simple solution to the $\mu$ and strong CP problems in the context of gauge mediated supersymmetry breaking. The generic appearance of R symmetry in dynamical supersymmetry breaking is used to implement Peccei-Quinn symmetry. Acceptable $\mu$ and $B$ terms as well as the large symmetry breaking scale are induced in the presence of nonrenormalizable interactions. Cosmological consequences of this scheme turn out to yield constraints on the PQ symmetry breaking scale and the number of the messenger/heavy quarks. Complexity in introducing non-R Peccei-Quinn symmetry is contrasted with the case of R symmetry.Comment: 10 pages, Revtex. Significantly modified version to apear in Phys. Rev.