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.

Vertical uplift capacity of two interfering horizontal anchors in sand using an upper bound limit analysis

The vertical uplift resistance of two interfering rigid rough strip anchors embedded horizontally in sand at shallow depths has been examined. The analysis is performed by using an upper bound theorem o limit analysis in combination with finite elements and linear programming. It is specified that both the anchors are loaded to failure simultaneously at the same magnitude of the failure load. For different clear spacing (S) between the anchors, the magnitude of the efficiency factor (xi(gamma)) is determined. On account of interference, the magnitude of xi(gamma) is found to reduce continuously with a decrease in the spacing between the anchors. The results from the numerical analysis were found to compare reasonably well with the available theoretical data from the literature.

ON POLYTOPAL UPPER BOUND SPHERES

Generalizing a result (the case k = 1) due to M. A. Perles, we show that any polytopal upper bound sphere of odd dimension 2k + 1 belongs to the generalized Walkup class K-k(2k + 1), i.e., all its vertex links are k-stacked spheres. This is surprising since it is far from obvious that the vertex links of polytopal upper bound spheres should have any special combinatorial structure. It has been conjectured that for d not equal 2k + 1, all (k + 1)-neighborly members of the class K-k(d) are tight. The result of this paper shows that the hypothesis d not equal 2k + 1 is essential for every value of k >= 1.

Upper bound solution for pullout capacity of vertical anchors in sand using finite elements and limit analysis

The horizontal pullout capacity of vertical anchors embedded in sand has been determined by using an upper bound theorem of the limit analysis in combination with finite elements. The numerical results are presented in nondimensional form to determine the pullout resistance for various combinations of embedment ratio of the anchor (H/B), internal friction angle (ϕ) of sand, and the anchor-soil interface friction angle (δ). The pullout resistance increases with increases in the values of embedment ratio, friction angle of sand and anchor-soil interface friction angle. As compared to earlier reported solutions in literature, the present solution provides a better upper bound on the ultimate collapse load.

REDUCING COMPUTATIONAL EFFORT IN SOLVING GEOMECHANICS PROBLEMS WITH UPPER BOUND FINITE ELEMENTS LIMIT ANALYSIS AND LINEAR OPTIMIZATION

This paper presents a simple technique for reducing the computational effort while solving any geotechnical stability problem by using the upper bound finite element limit analysis and linear optimization. In the proposed method, the problem domain is discretized into a number of different regions in which a particular order (number of sides) of the polygon is chosen to linearize the Mohr-Coulomb yield criterion. A greater order of the polygon needs to be selected only in that region wherein the rate of the plastic strains becomes higher. The computational effort required to solve the problem with this implementation reduces considerably. By using the proposed method, the bearing capacity has been computed for smooth and rough strip footings and the results are found to be quite satisfactory.

Solving Axisymmetric Stability Problems by Using Upper Bound Finite Elements, Limit Analysis, and Linear Optimization

A numerical formulation has been proposed for solving an axisymmetric stability problem in geomechanics with upper bound limit analysis, finite elements, and linear optimization. The Drucker-Prager yield criterion is linearized by simulating a sphere with a circumscribed truncated icosahedron. The analysis considers only the velocities and plastic multiplier rates, not the stresses, as the basic unknowns. The formulation is simple to implement, and it has been employed for finding the collapse loads of a circular footing placed over the surface of a cohesive-frictional material. The formulation can be used to solve any general axisymmetric geomechanics stability problem.

Effect of the Flow Rule on the Bearing Capacity of Strip Foundations on Sand by the Upper-Bound Limit Analysis and Slip Lines

The influence of the flow rule on the bearing capacity of strip foundations placed on sand was investigated using a new kinematic approach of upper-bound limit analysis. The method of stress characteristics was first used to find the mechanism of the failure and to compute the stress field by using the Mohr-Coulomb yield criterion. Once the failure mechanism had been established, the kinematics of the plastic deformation was established, based on the requirements of the upper-bound limit theorem. Both associated and nonassociated plastic flows were considered, and the bearing capacity was obtained by equating the rate of external plastic work to the rate of the internal energy dissipation for both smooth and rough base foundations. The results obtained from the analysis were compared with those available from the literature. (C) 2014 American Society of Civil Engineers.

Bearing capacity factors for a conical footing using lower- and upper-bound finite elements limit analysis

Bearing capacity factors, N-c, N-q, and N-gamma, for a conical footing are determined by using the lower and upper bound axisymmetric formulation of the limit analysis in combination with finite elements and optimization. These factors are obtained in a bound form for a wide range of the values of cone apex angle (beta) and phi with delta = 0, 0.5 phi, and phi. The bearing capacity factors for a perfectly rough (delta = phi) conical footing generally increase with a decrease in beta. On the contrary, for delta = 0 degrees, the factors N-c and N-q reduce gradually with a decrease in beta. For delta = 0 degrees, the factor N-gamma for phi >= 35 degrees becomes a minimum for beta approximate to 90 degrees. For delta = 0 degrees, N-gamma for phi <= 30 degrees, as in the case of delta = phi, generally reduces with an increase in beta. The failure and nodal velocity patterns are also examined. The results compare well with different numerical solutions and centrifuge tests' data available from the literature.

Upper bound on cubicity in terms of boxicity for graphs of low chromatic number

The boxicity (respectively cubicity) of a graph G is the least integer k such that G can be represented as an intersection graph of axis-parallel k-dimensional boxes (respectively k-dimensional unit cubes) and is denoted by box(G) (respectively cub(G)). It was shown by Adiga and Chandran (2010) that for any graph G, cub(G) <= box(G) log(2) alpha(G], where alpha(G) is the maximum size of an independent set in G. In this note we show that cub(G) <= 2 log(2) X (G)] box(G) + X (G) log(2) alpha(G)], where x (G) is the chromatic number of G. This result can provide a much better upper bound than that of Adiga and Chandran for graph classes with bounded chromatic number. For example, for bipartite graphs we obtain cub(G) <= 2(box(G) + log(2) alpha(G)] Moreover, we show that for every positive integer k, there exist graphs with chromatic number k such that for every epsilon > 0, the value given by our upper bound is at most (1 + epsilon) times their cubicity. Thus, our upper bound is almost tight. (c) 2015 Elsevier B.V. All rights reserved.

Lower-bound collapse load Of square footing

Based on a radial moment field and the square yield criterion, a lower-bound collapse load is developed for a square footing subjected to a generalized contact pressure distribution. The current lower-bound collapse load compares well with the available upper-bound solutions.

Lower Bound Limit Analysis of Rectangular Slabs

A general method for the development of valid lower bound solutions to uniformly distributed and orthotropically reinforced rectangular concrete slabs obeying normal moment criterion is described. General expressions for moment field have been obtained for nine cases of slabs having all combinations of simply supported and clamped-edge conditions. The lower bound collapse loads have been compared with the upper bound values obtained by the yield line theory. The paper also focuses attention to the need for the development of valid upper bound solutions with the satisfaction of kinematical admissibility and the flow rules associated with the normal moment criterion.

Can the viscosity in astrophysical black hole accretion disks be close to its string theory bound?

String theory and gauge/gravity duality suggest the lower bound of shear viscosity (eta) to entropy density (s) for any matter to be mu h/4 pi k(B), when h and k(B) are reduced Planck and Boltzmann constants respectively and mu <= 1. Motivated by this, we explore eta/s in black hole accretion flows, in order to understand if such exotic flows could be a natural site for the lowest eta/s. Accretion flow plays an important role in black hole physics in identifying the existence of the underlying black hole. This is a rotating shear flow with insignificant molecular viscosity, which could however have a significant turbulent viscosity, generating transport, heat and hence entropy in the flow. However, in presence of strong magnetic field, magnetic stresses can help in transporting matter independent of viscosity, via celebrated Blandford-Payne mechanism. In such cases, energy and then entropy produces via Ohmic dissipation. In,addition, certain optically thin, hot, accretion flows, of temperature greater than or similar to 10(9) K, may be favourable for nuclear burning which could generate/absorb huge energy, much higher than that in a star. We find that eta/s in accretion flows appears to be close to the lower bound suggested by theory, if they are embedded by strong magnetic field or producing nuclear energy, when the source of energy is not viscous effects. A lower bound on eta/s also leads to an upper bound on the Reynolds number of the flow.

Viscosity bound for anisotropic superfluids in higher derivative gravity

In the present paper, based on the principles of gauge/gravity duality we analytically compute the shear viscosity to entropy (eta/s) ratio corresponding to the super fluid phase in Einstein Gauss-Bonnet gravity. From our analysis we note that the ratio indeed receives a finite temperature correction below certain critical temperature (T < T-c). This proves the non universality of eta/s ratio in higher derivative theories of gravity. We also compute the upper bound for the Gauss-Bonnet coupling (lambda) corresponding to the symmetry broken phase and note that the upper bound on the coupling does not seem to change as long as we are close to the critical point of the phase diagram. However the corresponding lower bound of the eta/s ratio seems to get modified due to the finite temperature effects.

A Closer Look at Multiple Forking: Leveraging (In)Dependence for a Tighter Bound

Boldyreva, Palacio and Warinschi introduced a multiple forking game as an extension of general forking. The notion of (multiple) forking is a useful abstraction from the actual simulation of cryptographic scheme to the adversary in a security reduction, and is achieved through the intermediary of a so-called wrapper algorithm. Multiple forking has turned out to be a useful tool in the security argument of several cryptographic protocols. However, a reduction employing multiple forking incurs a significant degradation of , where denotes the upper bound on the underlying random oracle calls and , the number of forkings. In this work we take a closer look at the reasons for the degradation with a tighter security bound in mind. We nail down the exact set of conditions for success in the multiple forking game. A careful analysis of the cryptographic schemes and corresponding security reduction employing multiple forking leads to the formulation of `dependence' and `independence' conditions pertaining to the output of the wrapper in different rounds. Based on the (in)dependence conditions we propose a general framework of multiple forking and a General Multiple Forking Lemma. Leveraging (in)dependence to the full allows us to improve the degradation factor in the multiple forking game by a factor of . By implication, the cost of a single forking involving two random oracles (augmented forking) matches that involving a single random oracle (elementary forking). Finally, we study the effect of these observations on the concrete security of existing schemes employing multiple forking. We conclude that by careful design of the protocol (and the wrapper in the security reduction) it is possible to harness our observations to the full extent.