Cyclic colliding permutations

We study lower and upper bounds for the maximum size of a set of pairwise cyclic colliding permutations.     

Alternating permutations and symmetric functions

We use the theory of symmetric functions to enumerate various classes of alternating permutations w of {1,2,…,n}. These classes include the following: (1) both w and w⁻¹ are alternating, (2) w has certain special shapes, such as (m−1,m−2,…,1), under the RSK algorithm, (3) w has a specified cycle type, and (4) w has a specified number of fixed points. We also enumerate alternating permutations of a multiset. Most of our formulas are umbral expressions where after expanding the expression in powers of a variable E, Ek is interpreted as the Euler number Ek. As a small corollary, we obtain a combinatorial interpretation of the coefficients of an asymptotic expansion appearing in Ramanujan's “Lost” Notebook.     

Spherically symmetric random permutations

We consider random permutations which are spherically symmetric with respect to a metric on the symmetric group S_n and are consistent as n varies. The extreme infinitely spherically symmetric permutation‐valued processes are identified for the Hamming, Kendall‐tau and Cayley metrics. The proofs in all three cases are based on a unified approach through stochastic monotonicity.     

Cyclic permutations and evolutionary trees

Given a tree with leaf set X, there are certain ways of arranging the elements of X in a circular order so that can be embedded in the plane and ‘preserve’ this ordering. We investigate some new combinatorial properties of these ‘circular orderings.’ We then use these properties to establish two results concerning dissimilarity maps on X that are induced by edge-weighted trees with leaf set X.     

On permutations of order dividing a given integer

We give a detailed analysis of the proportion of elements in the symmetric group on n points whose order divides m, for n sufficiently large and m≥n with m=O(n).      

Algorithms for highly symmetric linear and integer programs

This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic properties of linear representations of finite groups can be used to reduce symmetric linear programming to solving linear programs of lower dimension. Combining this approach with knowledge of the geometry of feasible integer solutions yields an algorithm for solving highly symmetric integer linear programs which only takes time which is linear in the number of constraints and quadratic in the dimension.     

Sets of permutations that generate the symmetric group pairwise

The paper contains proofs of the following results. For all sufficiently large odd integers n, there exists a set of ²n−1 permutations that pairwise generate the symmetric group Sn. There is no set of ²n−1+1 permutations having this property. For all sufficiently large integers n with n≡2mod4, there exists a set of ²n−2 even permutations that pairwise generate the alternating group An. There is no set of ²n−2+1 permutations having this property.     

Horseshoes for the nearly symmetric heavy top

We prove the existence of horseshoes in the nearly symmetric heavy top. This problem was previously addressed but treated inappropriately due to a singularity of the equations of motion. We introduce an (artificial) inclined plane to remove this singularity and use a Melnikov-type approach to show that there exist transverse homoclinic orbits to periodic orbits on four-dimensional level sets. The price we pay for removing the singularity is that the Hamiltonian system becomes a three-degree-of-freedom system with an additional first integral, unlike the two-degree-of-freedom formulation in the classical treatment. We therefore have to analyze three-dimensional stable and unstable manifolds of periodic orbits in a six-dimensional phase space. A new Melnikov-type technique is developed for this situation. Numerical evidence for the existence of transverse homoclinic orbits on a four-dimensional level set is also given.     

Cyclic vectors for Hilbert algebras

In this paper, we give a simple proof of the Stone-von Neumann theorem about the irreducible unitary representations of Heisenberg groups. First of all, we prove a result about the representations of Hilbert algebras of Hilbert-Schmidt operators on a Hilbert space. Then we use it to give a simple proof of the Stone-von Neumann theorem. Applications to theoretical physics are mentioned.     

Modal properties of stable,nearly symmetric distributions

Translated from:Problemy Ustoichivosti Stokhasticheskikh Modelei, Trudy Seminara, 1989, pp. 142–144.     

Product decompositions of the symmetric group induced by separable permutations

In this paper we consider the rank generating function of a separable permutation π in the weak Bruhat order on the two intervals [id,π] and [π,w₀], where w₀=n,n−1,…,1. We show a surprising result that the product of these two generating functions is the generating function for the symmetric group with the weak order. We then obtain explicit formulas for the rank generating functions on [id,π] and [π,w₀], leading to the rank-symmetry and unimodality of the two graded posets.     

Cyclic scheduling via integer programs with circular ones

A fundamental problem of cyclic staffing is to size and schedule a minimum-cost workforce so that sufficient workers are on duty during each time period. This may be modeled as an integer linear program with a cyclically structured 0-1 constraint matrix. We identify a large class of such problems for which special structure permits the ILP to be solved parametrically as a bounded series of network flow problems. Moreover, an alternative solution technique is shown in which the continuous-valued LP is solved and the result rounded in a special way to yield an optimum solution to the ILP.     

Minimax and symmetric duality for nonlinear multiobjective mixed integer programming

We formulate two pairs of symmetric duality for nonlinear multiobjective mixed integer programs for arbitrary cones. By using the concept of efficiency, we establish the weak, strong, converse and self-duality theorems for our symmetric models. Several known results are obtained as special cases.     

Cyclic subsemigroups of symmetric inverse semigroups

A generalization of the cycle notation for permutations is introduced for partial one-one transformations (charts). Notational representation theorems for charts that generalize those of permutations are given. Notational multiplication of charts is developed and then applied to yield a transparent proof of Frobenius' result which bounds the idempotent in the cyclic subsemigroup. Lastly, the well known result that the structure of the cyclic subgroups of the finite symmetric groups is determined from combinations of disjoint cycles is generalized to the cyclic subsemigroups of the finite symmetric inverse semigroups.     

On generation of permutations through decomposition of symmetric groups into cosets

A hardware-oriented algorithm for generating permutations is presented that takes as a theoretic base an iterative decomposition of the symmetric groupS _n into cosets. It generates permutations in a new order. Simple ranking and unranking algorithms are given. The construction of a permutation generator is proposed which contains a cellular permutation network as a main component. The application of the permutation generator for solving a class of combinatorial problems on parallel computers is suggested.     

Minimax mixed integer symmetric duality for multiobjective variational problems

A Mond–Weir type multiobjective variational mixed integer symmetric dual program over arbitrary cones is formulated. Applying the separability and generalized F-convexity on the functions involved, weak, strong and converse duality theorems are established. Self duality theorem is proved. A close relationship between these variational problems and static symmetric dual minimax mixed integer multiobjective programming problems is also presented.     

Cyclic odd-even reduction for symmetric circulant matrices

A cyclic odd-even reduction algorithm for symmetric circulant matrices is defined, and a subclass of problems to which the algorithm may be applied is identified. Also, sufficient conditions are established which guarantee that the off-diagonal elements of the reduced matrices converge quadratically to zero.