Short chaotic strings and their behaviour in the scaling region

Coupled map lattices are a paradigm of higher-dimensional dynamical systems exhibiting spatio-temporal chaos. A special case of non-hyperbolic maps are one-dimensional map lattices of coupled Chebyshev maps with periodic boundary conditions, called chaotic strings. In this short note we show that the fine structure of the self energy of this chaotic string in the scaling region (i.e. for very small coupling) is retained if we reduce the length of the string to three lattice points.     

Pseudorandom permutation

A number-theoretical approach to the permutation of a sequence of objects performed by means of a linear congruential generator of pseudorandom numbers is presented. A sufficient condition is found for obtaining permutations with the property that each object definitely abandons its initial position. Since cryptography is among the possible applications, the generator performing the inverse transformation is also given.     

Bit strings withoutq-separation

LetB(n, q) denote the number of bit strings of lengthn withoutq-separation. In a bit string withoutq-separation no two 1's are separated by exactlyq – 1 bits.B(n, q) is known to be expressible in terms of a product of powers of Fibonacci numbers. Two new and independent proofs are given. The first proof is by combinatorial enumeration, while the second proof is inductive and expressesB(n, q) in terms of a recurrence relation.     

Selfgravitating electroweak strings

We obtain selfgravitating multi-string configurations for the Einstein-Weinberg-Salam model, in terms of solutions for a nonlinear elliptic system of Liouville type whose solvability was posed as an open problem in Yang (Solitons in Field Theory and Nonlinear Analysis, Springer, New York, 2001).     

Periods in strings

In this paper we explore the notion of periods of a string. A period can be thought of as a shift that causes the string to match over itself. We obtain two sets of necessary and sufficient conditions for a set of integers to be the set of periods of some string (what we call the correlation of the string). We show that the number of distinct correlations of length n is independent of the alphabet size and is of order n^logn. By using generating function methods we enumerate the strings having a given correlation, and investigate certain related questions.     

On permutation polytopes

In this paper we lay the foundations for the study of permutation polytopes: the convex hull of a group of permutation matrices.We clarify the relevant notions of equivalence, prove a product theorem, and discuss centrally symmetric permutation polytopes. We provide a number of combinatorial properties of (faces of) permutation polytopes. As an application, we classify ?4-dimensional permutation polytopes and the corresponding permutation groups. Classification results and further examples are made available online.We conclude with several questions suggested by a general finiteness result.     

On permutation labeling

We determine all permutation graphs of order ?9. We prove that every bipartite graph of order ?50 is a permutation graph. We convert the conjecture stating that “every tree is a permutation graph” to be “every bipartite graph is a permutation graph”.     

Some permutation problems

Put Z_n = {1, 2,…, n} and let π denote an arbitrary permutation of Z_n. Problem I. Let π = (π(1), π(2), …, π(n)). π has an up, down, or fixed point at a according as a < π(a), a > π(a), or a = π(a). Let $\text{A}\text{(r, s, t)}$ be the number of π ∈ Z_n with r ups, s downs, and t fixed points. Problem II. Consider the triple π^?1(a), a, π(a). Let R denote an up and F a down of π and let B(n, r, s) denote the number of π ∈ Z_n with r occurrences of π^?1(a)RaRπ(a) and s occurrences of π^?1(a)FaFπ(a). Generating functions are obtained for each enumerant as well as for a refinement of the second. In each case use is made of the cycle structure of permutations.     

Collapsing permutation groups

It is shown in [3] that any nonregular quasiprimitive permutation group is collapsing. In this paper we describe a wider class of collapsing permutation groups. Received June 6, 2000; accepted in final form August 11, 2000.     

Double-threshold permutation graphs

Journal of Algebraic Combinatorics - Double-threshold graphs are defined in terms of two real thresholds that break the real line into three regions, alternating as NO-YES-NO. If real ranks can be...     

On permutation graphs

We give an upper bound of the number of edges of a permutation graph. We introduce some necessary conditions for a graph to be a permutation graph, and we discuss the independence of these necessary conditions. We show that they are altogether not sufficient for a graph to be a permutation graph.     

TheL-sharp permutation groups

An answer is given to a problem proposed by Bannai and Ito for {I, I + s, I + s + t}-sharp permutation group, and the result is used to determineL-sharp groups for L={I, I + 1, I + 3} and {I, I + 2, I + 3}.     

Frequency permutation arrays

Motivated by recent interest in permutation arrays, we introduce and investigate the more general concept of frequency permutation arrays (FPAs). An FPA of length n = mλ and distance d is a set T of multipermutations on a multiset of m symbols, each repeated with frequency λ, such that the Hamming distance between any distinct x,y ∈ T is at least d. Such arrays have potential applications in powerline communication. In this article, we establish basic properties of FPAs, and provide direct constructions for FPAs using a range of combinatorial objects, including polynomials over finite fields, combinatorial designs, and codes. We also provide recursive constructions, and give bounds for the maximum size of such arrays. © 2006 Wiley Periodicals, Inc. J Combin Designs 14: 463–478, 2006     

Connected permutation graphs

A permutation graph is a simple graph associated with a permutation. Let c_n be the number of connected permutation graphs on n vertices. Then the sequence {c_n} satisfies an interesting recurrence relation such that it provides partitions of n! as . We also see that, if uniformly chosen at random, asymptotically almost all permutation graphs are connected.