Báo cáo toán học: "On restricted unitary Cayley graphs and symplectic transformations modulo n" docx

... as the diameters and perfectness of the graphs G n . the electronic journal of combinatorics 17 (2010), #R69 4 On restricted unitary Cayley graphs and symplectic transformations modulo n Niel de ... on a restricted variant of unitary Cayley graphs modulo n, an d implications for a decomposition of elements of symplectic operators over the integers modulo n. W...

Ngày tải lên: 08/08/2014, 12:22

... Paper 52. [8] E. Fuchs and J. Sinz. Longest induced cycles in Cayley graphs. ArXiv: math/0410308v2 (2004). [9] W. Klotz and T. Sander. Some Properties of Unitary Cayley Graphs. Electronic Journal ... 121-124. [4] D. S. Dummit and R. M. Foote. Ab s tract Algebra. Third Edition, Wiley and Sons. [5] P. Erd˝os and A. B. Evans. Representations of graphs and orthogonal Latin s...

Ngày tải lên: 08/08/2014, 01:20

... v-equivalence ≡ v and the set V λ := T λ / ≡ v of vertical tableaux of shape λ. Consider a horizontal tableau Γ with rows r 1 , ,r p and a vertical tableau ∆ with columns c 1 , ,c q . Call Γ and ∆ orthogonal, ... inequality |r i ∩ c j |≤1 holds for all i, j . Equivalently, Γ and ∆ are orthogonal if and only if there exists a tableau ρ consistent with both Γ and ∆. Define the matrix...

Ngày tải lên: 07/08/2014, 08:22

... of X and the lower semicontinuity of f and p(u, ·), we know that (Y, d) is a nonempty complete metric space. Applying a generalization version of Ekeland’s variational principle due to Lin and ... Ekeland’s variational principle and their applications. Nonlinear Anal. 67, 187–199 (2007) [28] Lin, L-J, Du, W-S: On maximal element theorems, variants of Ekeland’s variational principle a...

Ngày tải lên: 20/06/2014, 20:20

Ngày tải lên: 05/08/2014, 15:20

... I ∆  and coincides with ϕ m on W m (we use Definition 4.2 and the fact that ϕ is induced by ϕ i ’s). Thus we are done by Theorem 3.2. References [1] C. Berge, Graphs and Hypergraphs, North-Holland ... that (h 1 ) U = h U (h 2 ) U where h 1 and h 2 are the bijections associated with U 1 and U 2 , U = U 1 ∩ U 2 and h U , (h 1 ) U and (h 2 ) U are the bijections obtained from h,...

Ngày tải lên: 07/08/2014, 06:20

... search tree T of size n ≥ 3, with left and right subtrees T 1 and T 2 , is a random LBST if and only if, both T 1 and T 2 are random independent LBSTs, and π n,k =  |T 1 | = k − 1    |T | ... other interesting relationships that hold for both random BSTs and random LBSTs. Proposition 1.2. Consider a random search tree of size n and let S n,j = # of comparisons in a successfu...

Ngày tải lên: 07/08/2014, 06:22

... embedded graphs and the surfaces in which they are embedded. Let κ max (Σ) denote the maximum connectivity among all graphs which embed in Σ and let κ gen (Σ) be the maximum connectivity among all graphs ... k, l)andH IC (s, k, l) are genus embeddings, and γ(H IB (s, k, l)) =  2γ(s, k)+l − 1fork =2, 5, 2γ(s, k)+l − 3fork =2, 5, and γ(H IC (s, k, l)) = 2γ(s, k)+l − 1fork =1, 6,...

Ngày tải lên: 07/08/2014, 07:21

... Linked Graphs, Combinatorica 16 (1996), no.3, 313–320. [2] G. Chartrand, L. Lesniak, Graphs & Digraphs”, Chapman and Hall, London, 1996. [3] L. Ng, M. Schultz, k-Ordered Hamiltonian Graphs, ... S,say[x i ,x i+1 ]. Let z 1 and z 2 be the immediate successor and predecessor on C to the neighbors of x and y respectively according to the orientation of C. Observe that we can choose...

Ngày tải lên: 07/08/2014, 07:21

... J. Friedman. On Cayley graphs of the symmetric group generated by transpositions. Combinatorica 20 (2000), 505–519. [Lu1] A. Lubotzky. Cayley graphs: eigenvalues, expanders and random walks. Surveys ... A. Lubotzky. Discrete groups, expanding graphs and invariant measures. Progress in Mathematics, vol. 125, Birkh¨auser Verlag, Basel 1994. [Na] D. Nash. Cayley graphs of symmet...

Ngày tải lên: 07/08/2014, 15:22