Singularity structure and chaotic behavior of the homopolar disk dynamo

We study in great detail a system of three first-order ordinary differential equations describing a homopolar disk dynamo (HDD). This system displays a large variety of behaviors, both regular and chaotic. Existence of periodic solutions is proved for certain ranges of parameters. Stability criteria for periodic solutions are given. The nonintegrability aspects of the HDD system are studied by investigating analytically the singularity structure of the system in the complex domain. Coexisting attractors (including period-doubling sequence) and coexisting strange attractors appear in some parametric regimes. The gluing of strange attractors and the ungluing of a strange attractor are also shown to occur. A period of bifurcation leading to chaos, not observed for other chaotic systems, is shown to characterize the chaotic behavior in some parametric ranges. The limiting case of the Lorenz system is also studied and is related to HDD.

Homogenization of periodic structures via Bloch decomposition

In this paper, the classical problem of homogenization of elliptic operators in arbitrary domains with periodically oscillating coefficients is considered. Using Bloch wave decomposition, a new proof of convergence is furnished. It sheds new light and offers an alternate way to view the classical results. In a natural way, this method leads us to work in the Fourier space and thus in a framework dual to the one used by L. Tartar [Problemes d'Homogeneisation dans les Equations aux: Derivees Partielles, Cours Peccot au College de Prance, 1977] in his method of homogenization. Further, this technique offers a nontraditional way of calculating the homogenized coefficients which is easy to implement in the computer.

Singularity structure of third-order dynamical systems .2

The singularity structure of the solutions of a general third-order system, with polynomial right-hand sides of degree less than or equal to two, is studied about a movable singular point, An algorithm for transforming the given third-order system to a third-order Briot-Bouquet system is presented, The dominant behavior of a solution of the given system near a movable singularity is used to construct a transformation that changes the given system directly to a third-order Briot-Bouquet system. The results of Horn for the third-order Briot-Bouquet system are exploited to give the complete form of the series solutions of the given third-order system; convergence of these series in a deleted neighborhood of the singularity is ensured, This algorithm is used to study the singularity structure of the solutions of the Lorenz system, the Rikitake system, the three-wave interaction problem, the Rabinovich system, the Lotka-Volterra system, and the May-Leonard system for different sets of parameter values. The proposed approach goes far beyond the ARS algorithm.

Solution of a hypersingular integral equation of the second kind

A straightforward analysis involving the complex function-theoretic method is employed to determine the closed-form solution of a special hypersingular integral equation of the second kind, and its known solution is recovered.

Solving linear programming problems exactly

A linear programming problem in an inequality form having a bounded solution is solved error-free using an algorithm that sorts the inequalities, removes the redundant ones, and uses the p-adic arithmetic. (C) Elsevier Science Inc., 1997

Strong shock approximation in the new theory of shock dynamics

This paper investigates the propagation of a strong shock into an inhomogeneous medium using the new theory of shock dynamics. The equations are simple to solve and involve no trial-and-error method commonly used in this case. The results compare favourably with earlier results obtained in the case of self-similar flows, which arise as a special case of this theory.

The existence of homeomorphic subgraphs in chordal graphs

We establish conditions for the existence, in a chordal graph, of subgraphs homeomorphic to K-n (n greater than or equal to 3), K-m,K-n (m,n greater than or equal to 2), and wheels W-r (r greater than or equal to 3). Using these results, we develop a simple linear time algorithm for testing planarity of chordal graphs. We also show how these results lead to simple polynomial time algorithms for the Fixed Subgraph Homeomorphism problem on chordal graphs for some special classes of pattern graphs.

Acyclic Edge-Coloring of Planar Graphs

A proper edge-coloring with the property that every cycle contains edges of at least three distinct colors is called an acyclic edge-coloring. The acyclic chromatic index of a graph G, denoted. chi'(alpha)(G), is the minimum k such that G admits an acyclic edge-coloring with k colors. We conjecture that if G is planar and Delta(G) is large enough, then chi'(alpha) (G) = Delta (G). We settle this conjecture for planar graphs with girth at least 5. We also show that chi'(alpha) (G) <= Delta (G) + 12 for all planar G, which improves a previous result by Fiedorowicz, Haluszczak, and Narayan Inform. Process. Lett., 108 (2008), pp. 412-417].

A note on surface water waves for finite depth in the presence of an ice-cover

A class of I boundary value problems involving propagation of two-dimensional surface water waves, associated with water of uniform finite depth, against a plane vertical wave maker is investigated under the assumption that the surface is covered by a thin sheet of ice. It is assumed that the ice-cover behaves like a thin isotropic elastic plate. Then the problems under consideration lead to those of solving the two-dimensional Laplace equation in a semi-infinite strip, under Neumann boundary conditions on the vertical boundary as well as on one of the horizontal boundaries, representing the bottom of the fluid region, and a condition involving upto fifth order derivatives of the unknown function on the top horizontal ice-covered boundary, along with the two appropriate edge-conditions, at the ice-covered corner, ensuring the uniqueness of the solutions. The mixed boundary value problems are solved completely, by exploiting the regularity property of the Fourier cosine transform.

A waveguide problem involving a thick iris in the theory of electromagnetism

The problem of electromagnetic wave propagation in a rectangular waveguide containing a thick iris is considered for its complete solution by reducing it to two suitable integral equations, one of which is of the first kind and the other is of the second kind. These integral equations are solved approximately, by using truncated Fourier series for the unknown functions. The reflection coefficient is computed numerically from the two integral equation approaches, and almost the same numerical results are obtained. This is also depicted graphically against the wave number and compared with thin iris results, which are computed by using complementary formulations coupled with Galerkin approximations. While the reflection coefficient for a thin iris steadily increases with the wave number, for a thick iris it fluctuates and zero reflection occurs. The number of zeros of the reflection coefficient for a thick iris increases with the thickness. Thus a thick iris becomes completely transparent for some discrete wave numbers. This phenomenon may be significant in the modelling of rectangular waveguides.

Conjugacy invariant pseudo-norms, representability and RNA secondary structures

To a reasonable approximation, a secondary structures of RNA is determined by Watson-Crick pairing without pseudo-knots in such a way as to minimise the number of unpaired bases: We show that this minimal number is determined by the maximal conjugacy-invariant pseudo-norm on the free group on two generators subject to bounds on the generators. This allows us to construct lower bounds on the minimal number of unpaired bases by constructing conjugacy invariant pseudo-norms. We show that one such construction, based on isometric actions on metric spaces, gives a sharp lower bound. A major goal here is to formulate a purely mathematical question, based on considering orthogonal representations, which we believe is of some interest independent of its biological roots.

Boxicity and Poset Dimension

Let G be a simple, undirected, finite graph with vertex set V (G) and edge set E(G). A k-dimensional box is a Cartesian product of closed intervals [a(1), b(1)] x [a(2), b(2)] x ... x [a(k), b(k)]. The boxicity of G, box(G), is the minimum integer k such that G can be represented as the intersection graph of k-dimensional boxes; i.e., each vertex is mapped to a k-dimensional box and two vertices are adjacent in G if and only if their corresponding boxes intersect. Let P = (S, P) be a poset, where S is the ground set and P is a reflexive, antisymmetric and transitive binary relation on S. The dimension of P, dim(P), is the minimum integer t such that P can be expressed as the intersection of t total orders. Let G(P) be the underlying comparability graph of P; i.e., S is the vertex set and two vertices are adjacent if and only if they are comparable in P. It is a well-known fact that posets with the same underlying comparability graph have the same dimension. The first result of this paper links the dimension of a poset to the boxicity of its underlying comparability graph. In particular, we show that for any poset P, box(G(P))/(chi(G(P)) - 1) <= dim(P) <= 2box(G(P)), where chi(G(P)) is the chromatic number of G(P) and chi(G(P)) not equal 1. It immediately follows that if P is a height-2 poset, then box(G(P)) <= dim(P) <= 2box(G(P)) since the underlying comparability graph of a height-2 poset is a bipartite graph. The second result of the paper relates the boxicity of a graph G with a natural partial order associated with the extended double cover of G, denoted as G(c): Note that G(c) is a bipartite graph with partite sets A and B which are copies of V (G) such that, corresponding to every u is an element of V (G), there are two vertices u(A) is an element of A and u(B) is an element of B and {u(A), v(B)} is an edge in G(c) if and only if either u = v or u is adjacent to v in G. Let P(c) be the natural height-2 poset associated with G(c) by making A the set of minimal elements and B the set of maximal elements. We show that box(G)/2 <= dim(P(c)) <= 2box(G) + 4. These results have some immediate and significant consequences. The upper bound dim(P) <= 2box(G(P)) allows us to derive hitherto unknown upper bounds for poset dimension such as dim(P) = 2 tree width (G(P)) + 4, since boxicity of any graph is known to be at most its tree width + 2. In the other direction, using the already known bounds for partial order dimension we get the following: (1) The boxicity of any graph with maximum degree Delta is O(Delta log(2) Delta), which is an improvement over the best-known upper bound of Delta(2) + 2. (2) There exist graphs with boxicity Omega(Delta log Delta). This disproves a conjecture that the boxicity of a graph is O(Delta). (3) There exists no polynomial-time algorithm to approximate the boxicity of a bipartite graph on n vertices with a factor of O(n(0.5-is an element of)) for any is an element of > 0 unless NP = ZPP.

A Numerical Scheme for Three-Dimensional Front Propagation and Control of Jordan Mode

As an example of a front propagation, we study the propagation of a three-dimensional nonlinear wavefront into a polytropic gas in a uniform state and at rest. The successive positions and geometry of the wavefront are obtained by solving the conservation form of equations of a weakly nonlinear ray theory. The proposed set of equations forms a weakly hyperbolic system of seven conservation laws with an additional vector constraint, each of whose components is a divergence-free condition. This constraint is an involution for the system of conservation laws, and it is termed a geometric solenoidal constraint. The analysis of a Cauchy problem for the linearized system shows that when this constraint is satisfied initially, the solution does not exhibit any Jordan mode. For the numerical simulation of the conservation laws we employ a high resolution central scheme. The second order accuracy of the scheme is achieved by using MUSCL-type reconstructions and Runge-Kutta time discretizations. A constrained transport-type technique is used to enforce the geometric solenoidal constraint. The results of several numerical experiments are presented, which confirm the efficiency and robustness of the proposed numerical method and the control of the Jordan mode.