962 resultados para Vertex Transitive Graph


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Bosonized q-vertex operators related to the four-dimensional evaluation modules of the quantum affine superalgebra U-q[sl((2) over cap\1)] are constructed for arbitrary level k=alpha, where alpha not equal 0,-1 is a complex parameter appearing in the four-dimensional evaluation representations. They are intertwiners among the level-alpha highest weight Fock-Wakimoto modules. Screen currents which commute with the action of U-q[sl((2) over cap/1)] up to total differences are presented. Integral formulas for N-point functions of type I and type II q-vertex operators are proposed. (C) 2000 American Institute of Physics. [S0022-2488(00)00608-3].

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We obtain a class of non-diagonal solutions of the reflection equation for the trigonometric A(n-1)((1)) vertex model. The solutions can be expressed in terms of intertwinner matrix and its inverse, which intertwine two trigonometric R-matrices. In addition to a discrete (positive integer) parameter l, 1 less than or equal to l less than or equal to n, the solution contains n + 2 continuous boundary parameters.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The elevated plus-maze is a device widely used to assess rodent anxiety under the effect of several treatments, including pharmacological agents. The animal is placed at the center of the apparatus, which consists of two open arms and two arms enclosed by walls, and the number of entries and duration of stay in each arm are measured for a 5-min exposure period. The effect of an anxiolytic drug is to increase the percentage of time spent and number of entries into the open arms. In this work, we propose a new measure of anxiety levels in the rat submitted to the elevated plus-maze. We represented the spatial structure of the elevated plus-maze in terms of a directed graph and studied the statistics of the rat`s transitions between the nodes of the graph. By counting the number of times each transition is made and ordering them in descending frequency we represented the rat`s behavior in a rank-frequency plot. Our results suggest that the curves obtained under different pharmacological conditions can be well fitted by a power law with an exponent sensitive to both the drug type and the dose used. (C) 2009 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A G-design of order n is a pair (P,B) where P is the vertex set of the complete graph K-n and B is an edge-disjoint decomposition of K-n into copies of the simple graph G. Following design terminology, we call these copies ''blocks''. Here K-4 - e denotes the complete graph K-4 with one edge removed. It is well-known that a K-4 - e design of order n exists if and only if n = 0 or 1 (mod 5), n greater than or equal to 6. The intersection problem here asks for which k is it possible to find two K-4 - e designs (P,B-1) and (P,B-2) of order n, with \B-1 boolean AND B-2\ = k, that is, with precisely k common blocks. Here we completely solve this intersection problem for K-4 - e designs.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

An m-cycle system of order upsilon is a partition of the edge-set of a complete graph of order upsilon into m-cycles. The mu -way intersection problem for m-cycle systems involves taking mu systems, based on the same vertex set, and determining the possible number of cycles which can be common to all mu systems. General results for arbitrary m are obtained, and detailed intersection values for (mu, m) = (3, 4), (4, 5),(4, 6), (4, 7), (8, 8), (8, 9). (For the case (mu, m)= (2, m), see Billington (J. Combin. Des. 1 (1993) 435); for the case (Cc,m)=(3,3), see Milici and Quattrochi (Ars Combin. A 24 (1987) 175. (C) 2001 Elsevier Science B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A 4-wheel is a simple graph on 5 vertices with 8 edges, formed by taking a 4-cycle and joining a fifth vertex (the centre of the 4-wheel) to each of the other four vertices. A lambda -fold 4-wheel system of order n is an edge-disjoint decomposition of the complete multigraph lambdaK(n) into 4-wheels. Here, with five isolated possible exceptions when lambda = 2, we give necessary and sufficient conditions for a lambda -fold 4-wheel system of order n to be transformed into a lambda -fold Ccyde system of order n by removing the centre vertex from each 4-wheel, and its four adjacent edges (retaining the 4-cycle wheel rim), and reassembling these edges adjacent to wheel centres into 4-cycles.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A k-star is the graph K-1,K-k. We prove a general theorem about k-star factorizations of Cayley graphs. This is used to give necessary and sufficient conditions for the existence of k-star factorizations of any power (K-q)(S) of a complete graph with prime power order q, products C-r1 x C-r2 x ... x C-rk of k cycles of arbitrary lengths, and any power (C-r)(S) of a cycle of arbitrary length. (C) 2001 John Wiley & Sons, Inc.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A systematic method for constructing trigonometric R-matrices corresponding to the (multiplicity-free) tensor product of any two affinizable representations of a quantum algebra or superalgebra has been developed by the Brisbane group and its collaborators. This method has been referred to as the Tensor Product Graph Method. Here we describe applications of this method to untwisted and twisted quantum affine superalgebras.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, we show that K-10n can be factored into alpha C-5-factors and beta 1-factors for all non-negative integers alpha and beta satisfying 2alpha + beta = 10(n) - 1.