Profiling of late Tertiary-early Quaternary surface in the lower reaches of Narmada valley using microtremors

In this paper, we propose the first approximation for thickness of Quaternary sediment and late Quaternary early Tertiary topography for the part of lower reaches of Narmada valley in a systematic way using the shallow seismic method, that records both horizontal and vertical components of the microtremor (ambient noise) caused by natural processes. The measurements of microtremors were carried out at 31 sites spaced at a grid interval of 5 km s using Lennartz seismometer (5 s period) and City shark-II data acquisition system. The signals recorded were analysed for horizontal to the vertical (H/V) spectral ratio using GEOPSY software. For the present study, we concentrate on frequency range between 0.2 Hz and 10 Hz. The thickness of unconsolidated sediments at various sites is calculated based on non-linear regression equations proposed by Ibs-von Seht and Wohlenberg (1999) and Parolai et al. (2002). The estimated thickness is used to plot digital elevation model and cross profiles correlating with geomorphology and geology of the study area. (C) 2011 Elsevier Ltd. All rights reserved.

The Wiener-Hopf solution of a class of mixed boundary value problems arising in surface water wave phenomena

Two mixed boundary value problems associated with two-dimensional Laplace equation, arising in the study of scattering of surface waves in deep water (or interface waves in two superposed fluids) in the linearised set up, by discontinuities in the surface (or interface) boundary conditions, are handled for solution by the aid of the Weiner-Hopf technique applied to a slightly more general differential equation to be solved under general boundary conditions and passing on to the limit in a manner so as to finally give rise to the solutions of the original problems. The first problem involves one discontinuity while the second problem involves two discontinuities. The reflection coefficient is obtained in closed form for the first problem and approximately for the second. The behaviour of the reflection coefficient for both the problems involving deep water against the incident wave number is depicted in a number of figures. It is observed that while the reflection coefficient for the first problem steadily increases with the wave number, that for the second problem exhibits oscillatory behaviour and vanishes at some discrete values of the wave number. Thus, there exist incident wave numbers for which total transmission takes place for the second problem. (C) 1999 Elsevier Science B.V. All rights reserved.

Two dimensional weak pseudomanifolds on seven vertices

In this article we have explicitly determined all the 2-dimensional weak pseudomanifolds on 7 vertices. We have proved that there are (up to isomorphism) 13 such weak pseudomanifolds. The geometric carriers of them are 6 topological spaces, three of which are not manifolds.

Unsteady axisymmetric stagnation-point flow of a viscous fluid on a cylinder

The unsteady viscous flow in the vicinity of an axisymmetric stagnation point of an infinite circular cylinder is investigated when both the free stream velocity and the velocity of the cylinder vary arbitrarily with time. The cylinder moves either in the same direction as that of the free stream or in the opposite direction. The flow is initially (t = 0) steady and then at t > 0 it becomes unsteady. The semi-similar solution of the unsteady Navier-Stokes equations has been obtained numerically using an implicit finite-difference scheme. Also the self-similar solution of the Navier-Stokes equations is obtained when the velocity of the cylinder and the free stream velocity vary inversely as a linear function of time. For small Reynolds number, a closed form solution is obtained. When the Reynolds number tends to infinity, the Navier-Stokes equations reduce to those of the two-dimensional stagnation-point flow. The shear stresses corresponding to stationary and the moving cylinder increase with the Reynolds number. The shear stresses increase with time for the accelerating flow but decrease with increasing time for the decelerating flow. For the decelerating case flow reversal occurs in the velocity profiles after a certain instant of time. (C) 1999 Elsevier Science Ltd. All rights reserved.

Unsteady flow and heat transfer on a semi-infinite flat plate with an aligned magnetic field

The unsteady laminar boundary layer flow of an electrically conducting fluid past a semi-infinite flat plate with an aligned magnetic field has been studied when at time t > 0 the plate is impulsively moved with a constant velocity which is in the same or opposite direction to that of free stream velocity. The effect of the induced magnetic field has been included in the analysis. The non-linear partial differential equations have been solved numerically using an implicit finite-difference method. The effect of the impulsive motion of the surface is found to be more pronounced on the skin friction but its effect on the x-component of the induced magnetic field and heat transfer is small. Velocity defect occurs near the surface when the plate is impulsively moved in the same direction as that of the free stream velocity. The surface shear stress, x-component of the induced magnetic field on the surface and the surface heat transfer decrease with an increasing magnetic field, but they increase with the reciprocal of the magnetic Prandtl number. However, the effect of the reciprocal of the magnetic Prandtl number is more pronounced on the x-component of the induced magnetic field. (C) 1999 Elsevier Science Ltd. All rights reserved.

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].

Thermal instability in a three-dimensional rigid container with prescribed heat flux at lower boundary

The Bénard–Marangoni convection is studied in a three-dimensional container with thermally insulated lateral walls and prescribed heat flux at lower boundary. The upper surface of the incompressible, viscous fluid is assumed to be flat with temperature dependent surface tension. A Galerkin–Tau method with odd and even trial functions satisfying all the essential boundary conditions except the natural boundary conditions at the free surface has been used to solve the problem. The critical Marangoni and Rayleigh numbers are determined for the onset of steady convection as a function of aspect ratios x0 and y0 for the cases of Bénard–Marangoni, pure Marangoni and pure Bénard convections. It is observed that critical parameters are decreasing with an increase in aspect ratios. The flow structures corresponding to the values of the critical parameters are presented in all the cases. It is observed that the critical parameters are higher for case with heat flux prescribed than those corresponding to the case with prescribed temperature. The critical Marangoni number for pure Marangoni convection is higher than critical Rayleigh number corresponding to pure Bénard convection for a given aspect ratio whereas the reverse was observed for two-dimensional infinite layer.

Unsteady mhd flow and heat transfer on a rotating disk in an ambient fluid

An unsteady flow and heat transfer of a viscous incompressible electrically conducting fluid over a rotating infinite disk in an otherwise ambient fluid are studied. The unsteadiness in the flow field is caused by the angular velocity of the disk which varies with time. The magnetic field is applied normal to the disk surface. The new self-similar solution of the Navier-Stokes and energy equations is obtained numerically. The solution obtained here is not only the solution of the Navier-Stokes equations, but also of the boundary layer equations. Also, for a simple scaling factor, it represents the solution of the flow and heat transfer in the forward stagnation-point region of a rotating sphere or over a rotating cone. The asymptotic behaviour of the solution for a large magnetic field or for a large independent variable is also examined. The surface shear stresses in the radial and tangential directions and the surface heat transfer increase as the acceleration parameter increases. Also the surface shear stress in the radial direction and the surface heat transfer decrease with increasing magnetic field, but the surface shear stress in the tangential direction increases. (C) 2002 Editions scientifiques et medicales Elsevier SAS. All rights reserved.

Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related Problems

Given an undirected unweighted graph G = (V, E) and an integer k ≥ 1, we consider the problem of computing the edge connectivities of all those (s, t) vertex pairs, whose edge connectivity is at most k. We present an algorithm with expected running time Õ(m + nk3) for this problem, where |V| = n and |E| = m. Our output is a weighted tree T whose nodes are the sets V1, V2,..., V l of a partition of V, with the property that the edge connectivity in G between any two vertices s ε Vi and t ε Vj, for i ≠ j, is equal to the weight of the lightest edge on the path between Vi and Vj in T. Also, two vertices s and t belong to the same Vi for any i if and only if they have an edge connectivity greater than k. Currently, the best algorithm for this problem needs to compute all-pairs min-cuts in an O(nk) edge graph; this takes Õ(m + n5/2kmin{k1/2, n1/6}) time. Our algorithm is much faster for small values of k; in fact, it is faster whenever k is o(n5/6). Our algorithm yields the useful corollary that in Õ(m + nc3) time, where c is the size of the global min-cut, we can compute the edge connectivities of all those pairs of vertices whose edge connectivity is at most αc for some constant α. We also present an Õ(m + n) Monte Carlo algorithm for the approximate version of this problem. This algorithm is applicable to weighted graphs as well. Our algorithm, with some modifications, also solves another problem called the minimum T-cut problem. Given T ⊆ V of even cardinality, we present an Õ(m + nk3) algorithm to compute a minimum cut that splits T into two odd cardinality components, where k is the size of this cut.

Faster algorithms for all-pairs small stretch distances in weighted graphs

Abstract. Let G = (V,E) be a weighted undirected graph, with non-negative edge weights. We consider the problem of efficiently computing approximate distances between all pairs of vertices in G. While many efficient algorithms are known for this problem in unweighted graphs, not many results are known for this problem in weighted graphs. Zwick [14] showed that for any fixed ε> 0, stretch 1 1 + ε distances between all pairs of vertices in a weighted directed graph on n vertices can be computed in Õ(n ω) time, where ω < 2.376 is the exponent of matrix multiplication and n is the number of vertices. It is known that finding distances of stretch less than 2 between all pairs of vertices in G is at least as hard as Boolean matrix multiplication of two n×n matrices. It is also known that all-pairs stretch 3 distances can be computed in Õ(n 2) time and all-pairs stretch 7/3 distances can be computed in Õ(n 7/3) time. Here we consider efficient algorithms for the problem of computing all-pairs stretch (2+ε) distances in G, for any 0 < ε < 1. We show that all pairs stretch (2 + ε) distances for any fixed ε> 0 in G can be computed in expected time O(n 9/4 logn). This algorithm uses a fast rectangular matrix multiplication subroutine. We also present a combinatorial algorithm (that is, it does not use fast matrix multiplication) with expected running time O(n 9/4) for computing all-pairs stretch 5/2 distances in G. 1

Boxicity of line graphs

The boxicity of a graph H, denoted by box(H), is the minimum integer k such that H is an intersection graph of axis-parallel k-dimensional boxes in R(k). In this paper we show that for a line graph G of a multigraph, box(G) <= 2 Delta (G)(inverted right perpendicularlog(2) log(2) Delta(G)inverted left perpendicular + 3) + 1, where Delta(G) denotes the maximum degree of G. Since G is a line graph, Delta(G) <= 2(chi (G) - 1), where chi (G) denotes the chromatic number of G, and therefore, box(G) = 0(chi (G) log(2) log(2) (chi (G))). For the d-dimensional hypercube Q(d), we prove that box(Q(d)) >= 1/2 (inverted right perpendicularlog(2) log(2) dinverted left perpendicular + 1). The question of finding a nontrivial lower bound for box(Q(d)) was left open by Chandran and Sivadasan in [L. Sunil Chandran, Naveen Sivadasan, The cubicity of Hypercube Graphs. Discrete Mathematics 308 (23) (2008) 5795-5800]. The above results are consequences of bounds that we obtain for the boxicity of a fully subdivided graph (a graph that can be obtained by subdividing every edge of a graph exactly once). (C) 2011 Elsevier B.V. All rights reserved.

The Goldman bracket characterizes homeomorphisms

We show that a homotopy equivalence between compact, connected, oriented surfaces with non-empty boundary is homotopic to a homeomorphism if and only if it commutes with the Goldman bracket. (C) 2011 Academie des sciences. Published by Elsevier Masson SAS. All rights reserved.

Minimal Triangulations of Manifolds

Finding vertex-minimal triangulations of closed manifolds is a very difficult problem. Except for spheres and two series of manifolds, vertex-minimal triangulations are known for only few manifolds of dimension more than 2 (see the table given at the end of Section 5). In this article, we present a brief survey on the works done in last 30 years on the following:(i) Finding the minimal number of vertices required to triangulate a given pl manifold. (ii) Given positive integers n and d, construction of n-vertex triangulations of different d-dimensional pl manifolds. (iii) Classifications of all the triangulations of a given pl manifold with same number of vertices.In Section 1, we have given all the definitions which are required for the remaining part of this article. A reader can start from Section 2 and come back to Section 1 as and when required. In Section 2, we have presented a very brief history of triangulations of manifolds. In Section 3,we have presented examples of several vertex-minimal triangulations. In Section 4, we have presented some interesting results on triangulations of manifolds. In particular, we have stated the Lower Bound Theorem and the Upper Bound Theorem. In Section 5, we have stated several results on minimal triangulations without proofs. Proofs are available in the references mentioned there. We have also presented some open problems/conjectures in Sections 3 and 5.

Constructing a wire-frame from views on arbitrary view planes for objects with conic sections inclined to all view planes

A new and efficient approach to construct a 3D wire-frame of an object from its orthographic projections is described. The input projections can be two or more and can include regular and complete auxiliary views. Each view may contain linear, circular and other conic sections. The output is a 3D wire-frame that is consistent with the input views. The approach can handle auxiliary views containing curved edges. This generality derives from a new technique to construct 3D vertices from the input 2D vertices (as opposed to matching coordinates that is prevalent in current art). 3D vertices are constructed by projecting the 2D vertices in a pair of views on the common line of the two views. The construction of 3D edges also does not require the addition of silhouette and tangential vertices and subsequently splitting edges in the views. The concepts of complete edges and n-tuples are introduced to obviate this need. Entities corresponding to the 3D edge in each view are first identified and the 3D edges are then constructed from the information available with the matching 2D edges. This allows the algorithm to handle conic sections that are not parallel to any of the viewing directions. The localization of effort in constructing 3D edges is the source of efficiency of the construction algorithm as it does not process all potential 3D edges. Working of the algorithm on typical drawings is illustrated. (C) 2011 Elsevier Ltd. All rights reserved.

Polynomial Approximation, Local Polynomial convexity, and Degenerate CR Singularities- II

We provide some conditions for the graph of a Holder-continuous function on (D) over bar, where (D) over bar is a closed disk in C, to be polynomially convex. Almost all sufficient conditions known to date - provided the function (say F) is smooth - arise from versions of the Weierstrass Approximation Theorem on (D) over bar. These conditions often fail to yield any conclusion if rank(R)DF is not maximal on a sufficiently large subset of (D) over bar. We bypass this difficulty by introducing a technique that relies on the interplay of certain plurisubharmonic functions. This technique also allows us to make some observations on the polynomial hull of a graph in C(2) at an isolated complex tangency.