On hyperbolic once-punctured-torus bundles II: fractal tessellations of the plane

We describe fractal tessellations of the complex plane that arise naturally from Cannon–Thurston maps associated to complete, hyperbolic, once-punctured-torus bundles. We determine the symmetry groups of these tessellations. To our wives, Ardyth and Elena.     

Cubic planar hamiltonian graphs of various types

Let U be the set of cubic planar hamiltonian graphs, A the set of graphs G in U such that G-v is hamiltonian for any vertex v of G, B the set of graphs G in U such that G-e is hamiltonian for any edge e of G, and C the set of graphs G in U such that there is a hamiltonian path between any two different vertices of G. With the inclusion and/or exclusion of the sets A,B, and C, U is divided into eight subsets. In this paper, we prove that there is an infinite number of graphs in each of the eight subsets.     

Comparison of experimental data with the numerical simulation of planar entry flow: Role of the constitutive equation

The goal of this research was to determine whether there is any interaction between the type of constitutive equation used and the degree of mesh refinement, as well as how the type of constitutive equation might affect the convergence and quality of the solution, for a planar 4:1 contraction in the finite eiement method. Five constitutive equations were used in this work: the Phan-Thien–Tanner (PTT), Johnson–Segalman (JS), White–Metzner (WM), Leonov-like and upper convected Maxwell (UCM) models. A penalty Galerkin finite element technique was used to solve the system of non-linear differential equations. The constitutive equations were fitted to the steady shear viscosity and normal stress data for a polystyrene melt. In general it was found that the convergence limit based on the Deborah number De and the Weissenberg number We varied from model to model and from mesh to mesh. From a practical point of view it was observed that the wall shear stress in the downstream region should also be indicated at the point where convergence is lost, since this parameter reflects the throughput conditions. Because of the dependence of convergence on the combination of mesh size and constitutive equation, predictions of the computations were compared with birefringence data obtained for the same polystyrene melt flowing through a 4:1 planar contraction. Refinement in the mesh led to better agreement between the predictions using the PTT model and flow birefringence, but the oscillations became worse in the corner region as the mesh was further refined, eventually leading to the loss of convergence of the numerical algorithm. In comparing results using different models at the same wall shear stress conditions and on the same mesh, it was found that the PTT model gave less overshoot of the stresses at the re-entrant corner. Away from the corner there were very small differences between the quality of the solutions obtained using different models. All the models predicted solutions with oscillations. However, the values of the solutions oscillated around the experimental birefringence data, even when the numerical algorithm would not converge. Whereas the stresses are predicted to oscillate, the streamlines and velocity field remained smooth. Predictions for the existence of vortices as well as for the entrance pressure loss (ΔP_ent) varied from model to model. The UCM and WM models predicted negative values for ΔP_ent.     

The planar algebra of a semisimple and cosemisimple Hopf algebra

To a semisimple and cosemisimple Hopf algebra over an algebraically closed field, we associate a planar algebra defined by generators and relations and show that it is a connected, irreducible, spherical, non-degenerate planar algebra with non-zero modulus and of depth two. This association is shown to yield a bijection between (the isomorphism classes, on both sides, of) such objects.     

The Star Chromatic Numbers of Some Planar Graphs Derived from Wheels

The notion of the star chromatic number of a graph is a generalization of the chromatic number. In this paper, we calculate the star chromatic numbers of three infinite families of planar graphs. The first two families are derived from a 3-or 5-wheel by subdivisions, their star chromatic numbers being 2+2/(2n + 1), 2+3/(3n + 1), and 2+3(3n−1), respectively. The third family of planar graphs are derived from n odd wheels by Hajos construction with star chromatic numbers 3 + 1/n, which is a generalization of one result of Gao et al. Received September 21, 1998, Accepted April 9, 2001.     

Kinetic Limit for a System of Coagulating Planar Brownian Particles

We study a model of mass-bearing coagulating planar Brownian particles. The coagulation occurs when two particles are within a distance of order ε. We assume that the initial number of particles N is of order |logε|. Under suitable assumptions of the initial distribution of particles and the microscopic coagulation propensities, we show that the macroscopic particle densities satisfy a Smoluchowski-type equation.     

On the complexity of the planar directed edge-disjoint paths problem

The edge-disjoint paths problem and many special cases of it are known to be NP-complete. We present a new NP-completeness result for a special case of the problem, namely the directed edge-disjoint paths problem restricted to planar supply graphs and demand graphs consisting of two sets of parallel edges.     

Caterpillar arboricity of planar graphs

We solve a conjecture of Roditty, Shoham and Yuster [P.J. Cameron (Ed.), Problems from the 17th British Combinatorial Conference, Discrete Math., 231 (2001) 469-478; Y. Roditty, B. Shoham, R. Yuster, Monotone paths in edge-ordered sparse graphs, Discrete Math. 226 (2001) 411-417] on the caterpillar arboricity of planar graphs. We prove that for every planar graph G=(V,E), the edge set E can be partitioned into four subsets (E_i)_1?i?4 in such a way that G[E_i], for 1?i?4, is a forest of caterpillars. We also provide a linear-time algorithm which constructs for a given planar graph G, four forests of caterpillars covering the edges of G.     

The surface shear viscosity of a planar liquid-vapor interface I. Theory

In this paper we develop a theory for the calculation of the surface shear viscosity of a planar liquid-vapor interface. The theory is an extension of the generalized hydrodynamics formalism, originally developed for the calculation of linear transport coefficients in isotropic bulk fluids. We develop an expression for the surface shear viscosity in terms of the actual shear viscosity profile in the interfacial region. We derive an expression for this profile in terms of the first four moments of the autocorrelation function of the transverse parallel velocity (the component of velocity parallel to k, which is the projection of k on to the interface). Finally, we calculate these moments for a planar liquid-vapor interface.     

On the Characterization of the Dynamic Performances of Planar Manipulators

The characterization of the dynamic performances of a manipulator is important both to compare different manipulators and to improve the dynamic performances of a manipulator during the design stage. In a previous paper the concepts of swiftness and of dynamic isotropy were used to characterize some dynamic performances of 3-dof manipulators. This paper analyzes the usefulness of these concepts for three-dof planar manipulators and shows that the concept of swiftness is still significant, whereas the concept of dynamic isotropy has no practical interest. Moreover, it introduces three new dynamic properties that are useful in the design of a 3-dof planar manipulator. Finally, it proposes some indices that measure both the swiftness and the three new dynamic properties and shows how to use them, both for evaluating the dynamic performances of a given 3-dof planar manipulator and for improving the dynamic performances during its design.