Extensions of dually bipartite regular polytopes

This paper addresses the problem of finding abstract regular polytopes with preassigned facets and preassigned last entry of the Schläfli symbol. Using C-group permutation representation (CPR) graphs we give a solution to this problem for dually bipartite regular polytopes when the last entry of the Schläfli symbol is even. This construction is related to a previous construction by Schulte that solves the problem when the entry of the Schläfli symbol is 6.     

Non‐rainbow colorings of 3‐, 4‐ and 5‐connected plane graphs

We study vertex‐colorings of plane graphs that do not contain a rainbow face, i.e., a face with vertices of mutually distinct colors. If G is a 3 ‐connected plane graph with n vertices, then the number of colors in such a coloring does not exceed . If G is 4 ‐connected, then the number of colors is at most , and for n≡3(mod8), it is at most . Finally, if G is 5 ‐connected, then the number of colors is at most . The bounds for 3 ‐connected and 4 ‐connected plane graphs are the best possible as we exhibit constructions of graphs with colorings matching the bounds. © 2009 Wiley Periodicals, Inc. J Graph Theory 63: 129–145, 2010     

Coloring plane graphs with independent crossings

We show that every plane graph with maximum face size four in which all faces of size four are vertex‐disjoint is cyclically 5‐colorable. This answers a question of Albertson whether graphs drawn in the plane with all crossings independent are 5‐colorable. © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 184–205, 2010     

Collision and escape orbits in a generalized Hénon–Heiles model

The motion of a material point of unit mass in a field determined by a generalized Hénon–Heiles potential $U=A{q}_1^2+B{q}_2^2+C{q}_1^2{q}_2+D{q}_2^3$, with $(q_1,q_2)=$ standard Cartesian coordinates and $(A,B,C,D)\in {(0,\infty )}^2\times R^2$, is addressed for two limit situations: collision and escape. Using McGehee-type transformations, the corresponding collision and infinity boundary manifolds pasted on the phase space are determined. These are fictitious manifolds, but, due to the continuity with respect to initial data, their flow determines the near by orbit behaviour.The dynamics on the collision and infinity manifolds is fully described. The topology of the flow on the collision manifold is independent of the parameters. In the full phase space, while spiraling collision orbits are present, most of the orbits avoid collision. The topology of the flow on the infinity manifold changes as the ratio between $C$ and $D$ varies. More precisely, there are two symmetric pitchfork bifurcations along the line $2C?3D=0$, due to the reshaping of the potential along the bifurcation line. Besides rectilinear and spiraling orbits, the near-escape dynamics includes oscillatory orbits, for which angular momentum alternates sign.     

An iterated local search algorithm for the vehicle routing problem with backhauls

The Vehicle Routing Problem with Backhauls (VRPB) is an extension of the VRP that deals with two types of customers: the consumers (linehaul) that request goods from the depot and the suppliers (backhaul) that send goods to the depot. In this paper, we propose a simple yet effective iterated local search algorithm for the VRPB. Its main component is an oscillating local search heuristic that has two main features. First, it explores a broad neighborhood structure at each iteration. This is efficiently done using a data structure that stores information about the set of neighboring solutions. Second, the heuristic performs constant transitions between feasible and infeasible portions of the solution space. These transitions are regulated by a dynamic adjustment of the penalty applied to infeasible solutions. An extensive statistical analysis was carried out in order to identify the most important components of the algorithm and to properly tune the values of their parameters. The results of the computational experiments carried out show that this algorithm is very competitive in comparison to the best metaheuristic algorithms for the VRPB. Additionally, new best solutions have been found for two instances in one of the benchmark sets. These results show that the performance of existing metaheuristic algorithms can be considerably improved by carrying out a thorough statistical analysis of their components. In particular, it shows that by expanding the exploration area and improving the efficiency of the local search heuristic, it is possible to develop simpler and faster metaheuristic algorithms without compromising the quality of the solutions obtained.     

ℤ/k-manifolds and families of Dirac operators

Summary The index of a family of a family of Dirac operators is aK-Theory element in the parameter space. Sullivan's/k-manifolds are used to detect this index completely. For the first Chern class this gives a topological interpretation of Witten's global anomaly. The relationship with the geometry of the index bundle is considered.To my teacher Isadore M. SingerThe author is partially supported by an NSF Postdoctoral Research Fellowship     

Optimization for pattern classification using biased random search techniques

We demonstrate how optimization problems arise in the field of pattern classification, in particular in using piecewise-linear classification and classification based on an optimal linear separator. We motivate the need in this area for a general purpose optimization approach. We discuss ALOPEX, a biased random search approach, from the point of view of this need. While ALOPEX itself failed to fulfil our need, a newly-introduced generalization of it (iterated ALOPEX) was found to be appropriate for the optimization problems of our particular concern. We conclude the paper with a brief critical evaluation of this approach as compared to our original aims.     

Multiple ergodic theorems

Given measure preserving transformationsT ₁,T ₂,...,T _s of a probability space (X,B, μ) we are interested in the asymptotic behaviour of ergodic averages of the form $$\frac{1}{N}\sum\limits_{n = 0}^{N - 1} {T_1^n f_1 \cdot T_2^n f_2 } \cdot \cdots \cdot T_s^n f_s $$ wheref ₁,f ₂,...,f _s ?L ^∞(X,B,μ). In the general case we study, mainly for commuting transformations, conditions under which the limit of (1) inL ²-norm is ∫ _x f ₁ dμ·∫ _x f ₂ dμ...∫ _x f _s dμ for anyf ₁,f ₂...,f _s ?L ^∞(X,B,μ). If the transformations are commuting epimorphisms of a compact abelian group, then this limit exists almost everywhere. A few results are also obtained for some classes of non-commuting epimorphisms of compact abelian groups, and for commuting epimorphisms of arbitrary compact groups.