About a result of S.M. Kozlov
نویسنده
چکیده
We give an alternative proof and improve upon a result of S.M. Kozlov [7]. It deals with the asymptotic of the integrated density of states of the acoustic operator Hω = −∇ρω∇, at the bottom of the spectrum. 2000 Mathematics Subject Classification :81Q10, 35P05, 37A30, 47F05.
منابع مشابه
The Effect of Asymmetric Water Entry on the Hydrodynamic Impact
The effect of the asymmetric water entry over a submerged part of a ship on the hydrodynamic impact is investigated numerically. A wedge body is considered to study and the problem is assumed to be two-dimensional. The Results of symmetric and asymmetric impacts are compared together. The effect is found significant in the numerical simulation. The maximum hydrodynamic pressure at a heel angle ...
متن کاملComplexes of Directed Trees of Complete Multipartite Graphs
For every directed graph D we consider the complex of all directed subforests Δ(D). The investigation of these complexes was started by D. Kozlov. We generalize a result of Kozlov and prove that complexes of directed trees of complete multipartite graphs are shellable. We determine the h-vector of Δ(Km,n) and the homotopy type of Δ( −→ Kn1,n2,...,nk ).
متن کاملModeling and Crack-growth and Calculate First Intensity Factor with Ansys Software
Study about Fracture Mechanics and the root cause of fracture in order to estimates lifetime for Mechanical parts in designing process and manufacturing have tremendous role in this realm. Stress intensity factor comes into design which not only is dependent to geometry also extremely to load condition; for instance, it is important in failure processes (brittle and ductile Materials) or to pre...
متن کاملColoring Vertices and Edges of a Path by Nonempty Subsets of a Set
A graph G is strongly set colorable if V (G) ∪ E(G) can be assigned distinct nonempty subsets of a set of order n, where |V (G)| + |E(G)| = 2n − 1, such that each edge is assigned the symmetric difference of its end vertices. The principal result is that the path P2n−1 is strongly set colorable for n ≥ 5, disproving a conjecture of S.M. Hegde. We also prove another conjecture of S.M. Hegde on a...
متن کاملar X iv : m at h / 04 10 33 5 v 1 [ m at h . C O ] 1 4 O ct 2 00 4 HIGHER CONNECTIVITY OF GRAPH COLORING COMPLEXES SONJA
The main result of this paper is a proof of the following conjecture of Babson & Kozlov: Theorem. Let G be a graph of maximal valency d, then the complex Hom (G, Kn) is k-connected, whenever n ≥ d + k + 2. Here Hom (−,−) denotes the polyhedral complex introduced by Lovász to study the topological lower bounds for chromatic numbers of graphs. We will also prove, as a corollary to the main theore...
متن کامل