Báo cáo toán học: "Almost Product Evaluation of Hankel Determinants" ppsx
... applicable. These methods provide product formulas for a large class of Hankel determinants. A modern treatment of the theory of determinant evaluation including Hankel determinants as well as a ... further difficulties that arise in the consideration of other (β, α)-cases in Section 7. A number of additional almost product evaluations of Hankel determinants are given in...
Ngày tải lên: 07/08/2014, 15:22
... any mild solution u on R of Eq. (1) is almost periodic provided that the sequence {u(n)} n∈Z is almost periodic. Proof. The proof of this proposition is suggested by that of [20]. We first prove the ... t)u(t)dt. The notion of Beurling spectrum of a function u ∈ BUC(R, X) coincides with the one of Carleman spectrum, which consists of all ξ ∈ R such that the Carleman– Fourier tran...
Ngày tải lên: 06/08/2014, 05:20
Ngày tải lên: 05/08/2014, 09:46
Báo cáo toán học: "On the smoothness of sphere extensions " ppsx
Ngày tải lên: 05/08/2014, 10:20
Báo cáo toán học: "Minimal Cycle Bases of Outerplanar Graphs" ppsx
... (V C ,C)ofG(V,E). The set C of all cycles forms a subspace of (E, ⊕, ·) which is called the cycle space of G.AbasisBof the cycle space C is called a cycle basis of G(V, E) [2]. The dimension of the ... minimal cycle basis of G. The remainder G ∗ of G after all cycles C β , β ∈ K are removed by the above procedure is composed of Y ∗ and those edges of H that are not contained...
Ngày tải lên: 07/08/2014, 06:22
Báo cáo toán học: "The arc-width of a graph" ppsx
... to the set of arcs of a base circle, such that adjacent vertices of G are mapped to intersecting arcs. The width (in a representation) of a point P of the base circle is the number of representing ... .Thewidth of is the maximum width of the points of the base circle. (This is not the maximum number of pairwise intersecting arcs.) The arc-width of a g raph G is the min...
Ngày tải lên: 07/08/2014, 06:22
Báo cáo toán học: "n the number of distributive lattices" ppsx
... components of a lattice are intervals of that lattice. For graph theorists it may be of interest that the ordinal decomposition of a poset into indecomposable summands corresponds to the partition of ... w C (n − 1). The set P 1 of all maximal elements in a finite poset P is called the first level of P .One recursively defines the i-th level P i of P to be the first level of the...
Ngày tải lên: 07/08/2014, 06:23
Báo cáo toán học: "Hyperbolicity and chordality of a graph" ppsx
... concept of hyperbolicity comes from the work of Gromov in geometric group theory which encapsulates many of the global features of the geometry of complete, simply connected manifolds of negative ... examination of var io us low chordality graph classes in algorithmic graph theory from the viewpoint of the hyperbolicity parameter. 2 Proof of Theorem 4 In the course of our...
Ngày tải lên: 08/08/2014, 12:23
Báo cáo toán học: "Almost uniformly continuous automorphism groups of operator algebras " ppt
Ngày tải lên: 05/08/2014, 15:20