Báo cáo toán học: "Some design theoretic results on the Conway group ·0" pps
... analogous conditions for other elements of the group and to certain subgroups. In Section 2 we recall some notation along with the basic construction of the Leech lattice and the group ·0. In Section ... Section 5 we see how these results restrict to some subgroups of ·0. 2 The Leech Lattice and ·0 In this section we shall define the Leech lattice and the Conway group ·...
Ngày tải lên: 08/08/2014, 11:20
... been done for nonoscillation of all solutions of nonlinear functional differential equations. In this connection, Parhi 10 established some sufficient conditions for oscillation of all solutions ... Solutions of 1.1 In this section, we obtain sufficient conditions for the nonoscillation of solutions of 1.1. Theorem 2.1. Let qt ≤ 0.Iflim t →∞ ft/|pt|∞, then all bounded solutions .....
Ngày tải lên: 22/06/2014, 02:20
... 3, the sections S (n) i exhibit the following property: they form a dissection of an (n −1)-dimensional simplex (Section 1) or parellelipiped (Section 2). In particular, the union of the sections ... precisely the following 2(n −i) + 1 insertions: (i) insert either 1 or 1 after the smaller element of one of the ascents of τ; (ii) insert 1 at the front of τ. The initial condi...
Ngày tải lên: 07/08/2014, 06:22
Báo cáo toán học: "Revisiting two classical results on graph spectra" pps
... well-known results on graph spectra. The first one, following from Frobenius’s theorem on nonnegative matrices, asserts that if H is a proper subgraph of a connected graph G, then µ (G) > µ (H) . The ... (H) . The second one, due to H. Sachs [7], asserts that if G is a connected nonbipartite graph, then µ (G) > −µ min (G) . Our main result is the following theorem. the el...
Ngày tải lên: 07/08/2014, 15:22
Báo cáo toán học: "Developing new locality results for the Pr¨fer Code u using a remarkable linear-time decoding algorithm" pdf
... 4 Further locality results for the Pr¨ufer Code Theorem 2 completely characterises the distribution of ∆ under the Pr¨ufer Code when the mutation position µ is equal to one. In this section, we ... partition of [1, n]; secondly, the {M S } partition of M. 4.1 Additional notation 4.1.1 The {X, y, Z} partition of [1, n] Our first piece of additional notation is motivated by the u...
Ngày tải lên: 07/08/2014, 15:22
Báo cáo toán học: "K-theory for actions of the circle group on C*-algebras " pot
Ngày tải lên: 05/08/2014, 10:20
Báo cáo toán học: "A Beurling-Lax theorem for the Lie group U(m,n) which contains most classical interpolation theory " pot
Ngày tải lên: 05/08/2014, 15:20
Báo cáo toán học: "A new upper bound on the total domination number of a graph" pdf
... N ∗ uv = ∅, the P 1 -component consisting of the degree-2 vertex in the copy of Z, are precisely the components of G[S] minus the path-component P and the P 1 -component consisting of the vertex ... Furthermore, ∆(G ) ≥ 3 as the link vertex in the copy of X has degree at least three. The components of G [S ], other than the P 2 -component consisting of the two d...
Ngày tải lên: 07/08/2014, 15:23
Báo cáo toán hoc:"A New Lower Bound on the Density of Vertex Identifying Codes for the Infinit" doc
... 4 1 2 3 4 5 6 7 8 9 10 11 12 Fig. 7a: The first induction step. 1 2 3 4 5 6 7 8 Fig. 7b: The second induction step. Proof: We use induction on the size of C, growing C by one vertex at each step. The base case |C| ... C, of size k, for which the induction hypothesis holds; let P be the desired partion for C of size k. We consider different induction steps, depending on whether v...
Ngày tải lên: 08/08/2014, 01:20
Báo cáo toán học: "ombinatorial Constructions of Weight Bases: The Gelfand-Tsetlin Basis" pps
... representation of g on V [P ] if and only if P satisfies the diamon d, crossing, and structure conditions. If the given conditions hold, the set {v s } s∈P is a weight basis of the given representa- tion, ... interpretation of the Gelfand-Tsetlin formulas, which sheds new light on them, we show that the corresponding construction relies on nothing more than a simple rational...
Ngày tải lên: 08/08/2014, 12:22