Chaotic motions for a perturbed nonlinear Schrödinger equation with the power-law nonlinearity in a nano optical fiber

Perturbed nonlinear Schrödinger (NLS) equation with the power-law nonlinearity in a nano optical fiber is studied with the help of its equivalent two-dimensional planar dynamic system and Hamiltonian. Via the bifurcation theory and qualitative theory, equilibrium points for the two-dimensional planar dynamic system are obtained. With the external perturbation taken into consideration, chaotic motions for the perturbed NLS equation with the power-law nonlinearity are derived based on the equilibrium points.     

Exact boundary controllability of partial nodal profile for network of strings

Based on the theory of exact boundary controllability of nodal profile for hyperbolic systems, the authors propose the concept of exact boundary controllability of partial nodal profile to expand the scope of applications. With the new concept, we can shorten the controllability time, save the number of controls, and increase the number of charged nodes with given nodal profiles. Furthermore, we introduce the concept of in-situ controlled node to deal with a new situation that one node can be charged and controlled simultaneously. The minimum number of boundary controls on the entire tree-like network is determined by using the concept of ‘degree of freedom of charged nodes’ introduced. And the concept of ‘control path’ is introduced to appropriately divide the network, so that we can determine the infimum of controllability time. General frameworks of constructive proof are given on a single interval, a star-like network, a chain-like network and a planar tree-like network for linear wave equation(s) with Dirichlet, Neumann, Robin and dissipative boundary conditions to establish a complete theory on the exact boundary controllability of partial nodal profile.     

Comparison of subwavelength focusing properties of diffraction and Fresnel zone plate plasmonic planar lenses

The subwavelength focusing properties of diffractive plasmonic planar lenses (DPLs) and Fresnel zone plate plasmonic planar lenses (FZPs) have been compared in this paper. To that end, we use the same lens material, incident wavelength, thickness and focal length for comparison. Both DPLs and FZPs consist of central circular slits surrounded by transparent and opaque zones and can get clear focusing performances. By using the rigorous electromagnetic numerical method, the fields in the focal region are analyzed in detail, and our results demonstrate that FZP can generate higher transmission efficiency, and higher peak field intensity at the focal plane. Focusing polarization properties of the lens illuminated by linearly polarized state, are calculated and analyzed also. The numerical results show that both the DPL and the FZP produce asymmetrical focal spot distributions with a low f-number. To the FZP, the full-width at half-maximum (FWHM) varies from 256 nm (along y-axis) to 516 nm(along x-axis) and to the DPL, the FWHM varies from 256 nm(along y-axis) to 580 nm(along x-axis), respectively. But for a high f-number, the asymmetrical performance of the focal spot will be reduced due to complicated electromagnetical field interferences and micro waveguide effect. Otherwise, the DPL can get a higher depolarization effect than the FZP does.     

Polynomial algorithms for (integral) maximum two-flows in vertex edge-capacitated planar graphs

In this paper we study the maximum two-flow problem in vertex- and edge-capacitated undirected ST₂-planar graphs, that is, planar graphs where the vertices of each terminal pair are on the same face. For such graphs we provide an O(n) algorithm for finding a minimum two-cut and an O(n log n) algorithm for determining a maximum two-flow and show that the value of a maximum two-flow equals the value of a minimum two-cut. We further show that the flow obtained is half-integral and provide a characterization of edge and vertex capacitated ST₂-planar graphs that guarantees a maximum two-flow that is integral. By a simple variation of our maximum two-flow algorithm we then develop, for ST₂-planar graphs with vertex and edge capacities, an O(n log n) algorithm for determining an integral maximum two-flow of value not less than the value of a maximum two-flow minus one.     

本原极小强连通有向图1—指数的下界

本文给出了n阶本原极小强连通有向图1-指数的下图:expD(1)4.且这个下界是可以达到的.     

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.