Finite field computation technique for exact solution of systems of linear equations and interval linear programming problems

An error-free computational approach is employed for finding the integer solution to a system of linear equations, using finite-field arithmetic. This approach is also extended to find the optimum solution for linear inequalities such as those arising in interval linear programming probloms.

Solution of singular integral equations with logarithmic and Cauchy kernels

A direct method of solution is presented for singular integral equations of the first kind, involving the combination of a logarithmic and a Cauchy type singularity. Two typical cages are considered, in one of which the range of integration is a Single finite interval and, in the other, the range of integration is a union of disjoint finite intervals. More such general equations associated with a finite number (greater than two) of finite, disjoint, intervals can also be handled by the technique employed here.

An upper bound for Cubicity in terms of Boxicity

An axis-parallel b-dimensional box is a Cartesian product R-1 x R-2 x ... x R-b where each R-i (for 1 <= i <= b) is a closed interval of the form [a(i), b(i)] on the real line. The boxicity of any graph G, box(G) is the minimum positive integer b such that G can be represented as the intersection graph of axis-parallel b-dimensional boxes. A b-dimensional cube is a Cartesian product R-1 x R-2 x ... x R-b, where each R-i (for 1 <= i <= b) is a closed interval of the form [a(i), a(i) + 1] on the real line. When the boxes are restricted to be axis-parallel cubes in b-dimension, the minimum dimension b required to represent the graph is called the cubicity of the graph (denoted by cub(G)). In this paper we prove that cub(G) <= inverted right perpendicularlog(2) ninverted left perpendicular box(G), where n is the number of vertices in the graph. We also show that this upper bound is tight.Some immediate consequences of the above result are listed below: 1. Planar graphs have cubicity at most 3inverted right perpendicularlog(2) ninvereted left perpendicular.2. Outer planar graphs have cubicity at most 2inverted right perpendicularlog(2) ninverted left perpendicular.3. Any graph of treewidth tw has cubicity at most (tw + 2) inverted right perpendicularlog(2) ninverted left perpendicular. Thus, chordal graphs have cubicity at most (omega + 1) inverted right erpendicularlog(2) ninverted left perpendicular and circular arc graphs have cubicity at most (2 omega + 1)inverted right perpendicularlog(2) ninverted left perpendicular, where omega is the clique number.

Cubicity, boxicity, and vertex cover

A k-dimensional box is the cartesian product R-1 x R-2 x ... x R-k where each R-i is a closed interval on the real line. The boxicity of a graph G,denoted as box(G), is the minimum integer k such that G is the intersection graph of a collection of k-dimensional boxes. A unit cube in k-dimensional space or a k-cube is defined as the cartesian product R-1 x R-2 x ... x R-k where each Ri is a closed interval on the real line of the form [a(i), a(i) + 1]. The cubicity of G, denoted as cub(G), is the minimum k such that G is the intersection graph of a collection of k-cubes. In this paper we show that cub(G) <= t + inverted right perpendicularlog(n - t)inverted left perpendicular - 1 and box(G) <= left perpendiculart/2right perpendicular + 1, where t is the cardinality of a minimum vertex cover of G and n is the number of vertices of G. We also show the tightness of these upper bounds. F.S. Roberts in his pioneering paper on boxicity and cubicity had shown that for a graph G, box(G) <= left perpendicularn/2right perpendicular and cub(G) <= inverted right perpendicular2n/3inverted left perpendicular, where n is the number of vertices of G, and these bounds are tight. We show that if G is a bipartite graph then box(G) <= inverted right perpendicularn/4inverted left perpendicular and this bound is tight. We also show that if G is a bipartite graph then cub(G) <= n/2 + inverted right perpendicularlog n inverted left perpendicular - 1. We point out that there exist graphs of very high boxicity but with very low chromatic number. For example there exist bipartite (i.e., 2 colorable) graphs with boxicity equal to n/4. Interestingly, if boxicity is very close to n/2, then chromatic number also has to be very high. In particular, we show that if box(G) = n/2 - s, s >= 0, then chi (G) >= n/2s+2, where chi (G) is the chromatic number of G.

On the Cubicity of Interval Graphs

A k-cube (or ``a unit cube in k dimensions'') is defined as the Cartesian product R-1 x . . . x R-k where R-i (for 1 <= i <= k) is an interval of the form [a(i), a(i) + 1] on the real line. The k-cube representation of a graph G is a mapping of the vertices of G to k-cubes such that the k-cubes corresponding to two vertices in G have a non-empty intersection if and only if the vertices are adjacent. The cubicity of a graph G, denoted as cub(G), is defined as the minimum dimension k such that G has a k-cube representation. An interval graph is a graph that can be represented as the intersection of intervals on the real line - i. e., the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. We show that for any interval graph G with maximum degree Delta, cub(G) <= inverted right perpendicular log(2) Delta inverted left perpendicular + 4. This upper bound is shown to be tight up to an additive constant of 4 by demonstrating interval graphs for which cubicity is equal to inverted right perpendicular log(2) Delta inverted left perpendicular.

Boxicity of Halin graphs

A k-dimensional box is the Cartesian product R-1 x R-2 x ... x R-k where each R-i is a closed interval on the real line. The boxicity of a graph G, denoted as box(G) is the minimum integer k such that G is the intersection graph of a collection of k-dimensional boxes. Halin graphs are the graphs formed by taking a tree with no degree 2 vertex and then connecting its leaves to form a cycle in such a way that the graph has a planar embedding. We prove that if G is a Halin graph that is not isomorphic to K-4, then box(G) = 2. In fact, we prove the stronger result that if G is a planar graph formed by connecting the leaves of any tree in a simple cycle, then box(G) = 2 unless G is isomorphic to K4 (in which case its boxicity is 1).

Applying pure mathematics: mathematics in the natural sciences

The book of nature is written in the language of mathematics. This quotation, attributed to Galileo, seemed to hold to an unreasonable1 extent in the era of quantum mechanics.

Interval Data Classification under Partial Information: A Chance-Constraint Approach

This paper presents a Chance-constraint Programming approach for constructing maximum-margin classifiers which are robust to interval-valued uncertainty in training examples. The methodology ensures that uncertain examples are classified correctly with high probability by employing chance-constraints. The main contribution of the paper is to pose the resultant optimization problem as a Second Order Cone Program by using large deviation inequalities, due to Bernstein. Apart from support and mean of the uncertain examples these Bernstein based relaxations make no further assumptions on the underlying uncertainty. Classifiers built using the proposed approach are less conservative, yield higher margins and hence are expected to generalize better than existing methods. Experimental results on synthetic and real-world datasets show that the proposed classifiers are better equipped to handle interval-valued uncertainty than state-of-the-art.

Unsteady laminar boundary layers in a compressible stagnation flow

The unsteady laminar compressible boundary-layer flow in the immediate vicinity of a two-dimensional stagnation point due to an incident stream whose velocity varies arbitrarily with time is considered. The governing partial differential equations, involving both time and the independent similarity variable, are transformed into new co-ordinates with finite ranges by means of a transformation which maps an infinite interval into a finite one. The resulting equations are solved by converting them into a matrix equation through the application of implicit finite-difference formulae. Computations have been carried out for two particular unsteady free-stream velocity distributions: (1) a constantly accelerating stream and (2) a fluctuating stream. The results show that in the former case both the skin-friction and the heat-transfer parameter increase steadily with time after a certain instant, while in the latter they oscillate thus responding to the fluctuations in the free-stream velocity.

A playful side to twelfth-century mathematics

As editors of the book Lilavati's Daughters: The Women Scientists of India, reviewed by Asha Gopinathan (Nature 460, 1082; 2009), we would like to elaborate on the background to its title. Lilavati was a mathematical treatise of the twelfth century, composed by the mathematician and astronomer Bhaskaracharya (1114–85) — also known as Bhaskara II — who was a teacher of repute and author of several other texts. The name Lilavati, which literally means 'playful', is a surprising title for an early scientific book. Some of the mathematical problems posed in the book are in verse form, and are addressed to a girl, the eponymous Lilavati. However, there is little real evidence concerning Lilavati's historicity. Tradition holds that she was Bhaskaracharya's daughter and that he wrote the treatise to console her after an accident that left her unable to marry. But this could be a later interpolation, as the idea was first mentioned in a Persian commentary. An alternative view has it that Lilavati was married at an inauspicious time and was widowed shortly afterwards. Other sources have implied that Lilavati was Bhaskaracharya's wife, or even one of his students — raising the possibility that women in parts of the Indian subcontinent could have participated in higher education as early as eight centuries ago. However, given that Bhaskara was a poet and pedagogue, it is also possible that he chose to address his mathematical problems to a doe-eyed girl simply as a whimsical and charming literary device.

Unsteady Natural Convection Flow over a Heated Cylinder Buried in a Fluid Saturated Porous Medium

Transient natural convection flow on a heated cylinder buried in a semi-infinite liquid-saturated porous medium has been studied. The unsteadiness in the problem arises due to the cylinder which is heated (cooled) suddenly and then maintained at that temperature. The coupled partial differential equations governing the flow and heat transfer are cast into stream function-temperature formulation, and the solutions are obtained from the initial time to the time when steady state is reached. The heat transfer is found to change significantly with increasing time in a small time interval immediately after the start of the impulsive change, and steady state is reached after some time. The average Nusselt number is found to increase with Rayleigh number When the surface of the cylinder is suddenly cooled, there is a change in the direction of the heat transfer in a small time interval immediately after the start of the impulsive change in the surface temperature;however when the surface temperature is suddenly increased, no such phenomenon is observed.

Topological properties of the one dimensional exponential random geometric graph

In this article we study the one-dimensional random geometric (random interval) graph when the location of the nodes are independent and exponentially distributed. We derive exact results and limit theorems for the connectivity and other properties associated with this random graph. We show that the asymptotic properties of a graph with a truncated exponential distribution can be obtained using the exponential random geometric graph. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008.

Unsteady natural convection from a horizontal annulus filled with a porous medium

The unsteady natural convection flow from a horizontal cylindrical annulus filled with a non-Darcy porous medium has been studied. The unsteadiness in the problem arises due to the impulsive change in the wall temperature of the outer cylinder. The Navier–Stokes equations along with the energy equation governing the unsteady natural convection flow have been solved by the finite-volume method. The effect of time variation on the heat transfer is more pronounced only in a small time interval immediately after the start of the impulsive motion and the steady state is reached after certain time. The results show that the annulus completely filled with a porous medium has the best insulating effectiveness. Convection in the horizontal annulus is confined mostly at top and bottom regions. Hence, only these regions should be insulated. In case of annulus partially filled with a porous material, insulating the region near the outer cylinder is more effective than insulating the region near the inner cylinder. The effect of Darcy number on the heat transfer is more pronounced than that of the Grashof number.

Unsteady MHD mixed convection flow over an impulsively stretched permeable vertical surface in a quiescent fluid

The unsteady mixed convection flow of an incompressible laminar electrically conducting fluid over an impulsively stretched permeable vertical surface in an unbounded quiescent fluid in the presence of a transverse magnetic field has been investigated. At the same time, the surface temperature is suddenly increased from the surrounding fluid temperature or a constant heat flux is suddenly imposed on the surface. The problem is formulated in such a way that for small time it is governed by Rayleigh type of equation and for large time by Crane type of equation. The non-linear coupled parabolic partial differential equations governing the unsteady mixed convection flow under boundary layer approximations have been solved analytically by using the homotopy analysis method as well as numerically by an implicit finite difference scheme. The local skin friction coefficient and the local Nusselt number are found to decrease rapidly with time in a small time interval and they tend to steady-state values for t* >= 5. They also increase with the buoyancy force and suction, but decrease with injection rate. The local skin friction coefficient increases with the magnetic field, but the local Nusselt number decreases. There is a smooth transition from the unsteady state to the steady state. (C) 2010 Elsevier Ltd. All rights reserved.