Results 1  10
of
33,571
On the planewave cubic vertex
"... The exact bosonic Neumann matrices of the cubic vertex in planewave lightcone string field theory are derived using the contour integration techniques developed in our earlier paper. This simplifies the original derivation of the vertex. In particular, the Neumann matrices are written in terms of ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
The exact bosonic Neumann matrices of the cubic vertex in planewave lightcone string field theory are derived using the contour integration techniques developed in our earlier paper. This simplifies the original derivation of the vertex. In particular, the Neumann matrices are written in terms
Cubic vertextransitive graphs on up to 1280 vertices
 J. Symbolic Comput
"... Abstract. A graph is called cubic and tetravalent if all of its vertices have valency 3 and 4, respectively. It is called vertextransitive and arctransitive if its automorphism group acts transitively on its vertexset and on its arcset, respectively. In this paper, we combine some new theoretica ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
Abstract. A graph is called cubic and tetravalent if all of its vertices have valency 3 and 4, respectively. It is called vertextransitive and arctransitive if its automorphism group acts transitively on its vertexset and on its arcset, respectively. In this paper, we combine some new
A CubicVertex Kernel for Flip Consensus Tree
"... ABSTRACT. Given a bipartite graph G = (Vc,Vt,E) and a nonnegative integer k, the NPcomplete MINIMUMFLIP CONSENSUS TREE problem asks whether G can be transformed, using up to k edge insertions and deletions, into a graph that does not contain an induced P5 with its first vertex in Vt (a socalled ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
ABSTRACT. Given a bipartite graph G = (Vc,Vt,E) and a nonnegative integer k, the NPcomplete MINIMUMFLIP CONSENSUS TREE problem asks whether G can be transformed, using up to k edge insertions and deletions, into a graph that does not contain an induced P5 with its first vertex in Vt (a so
Witten’s cubic vertex in the comma theory
, 1999
"... In is shown explicitly that the Witten’s interaction 3vertex is a solution to the comma overlap equations; hence establishing the equivalence between the conventional and the “comma ” formulation of interacting string theory at the level of vertices. Pacs: 11.10.z,11.25.Sq ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In is shown explicitly that the Witten’s interaction 3vertex is a solution to the comma overlap equations; hence establishing the equivalence between the conventional and the “comma ” formulation of interacting string theory at the level of vertices. Pacs: 11.10.z,11.25.Sq
SEMIREGULAR AUTOMORPHISMS OF CUBIC VERTEX TRANSITIVE GRAPHS
, 2008
"... It is shown that for a connected cubic graph Γ, a vertex transitive group G ≤ Aut Γ contains a large semiregular subgroup. This confirms a conjecture of Cameron and Sheehan (2001). ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
It is shown that for a connected cubic graph Γ, a vertex transitive group G ≤ Aut Γ contains a large semiregular subgroup. This confirms a conjecture of Cameron and Sheehan (2001).
HigherSpin Gauge Fields Interacting with Scalars: The Lagrangian Cubic Vertex
 JHEP 0710 (2007) 021, [arXiv:0708.1399 [hepth
"... Abstract: We apply a recently presented BRST procedure to construct the Largangian cubic vertex of higherspin gauge field triplets interacting with massive free scalars. In flat space, the spins triplet propagates the series of irreducible spins, s − 2,..,0/1 modes which couple independently to c ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
Abstract: We apply a recently presented BRST procedure to construct the Largangian cubic vertex of higherspin gauge field triplets interacting with massive free scalars. In flat space, the spins triplet propagates the series of irreducible spins, s − 2,..,0/1 modes which couple independently
Higher Spin Gauge Fields Interacting with Scalars: The Lagrangian Cubic Vertex
, 708
"... We apply a recently presented BRST procedure to construct the Largangian cubic vertex of higherspin gauge field triplets interacting with massive free scalars. In flat space, the spins triplet propagates the series of irreducible spins, s − 2,..,0/1 modes which couple independently to correspondin ..."
Abstract
 Add to MetaCart
We apply a recently presented BRST procedure to construct the Largangian cubic vertex of higherspin gauge field triplets interacting with massive free scalars. In flat space, the spins triplet propagates the series of irreducible spins, s − 2,..,0/1 modes which couple independently
Cubic vertextransitive nonCayley graphs of order 8p
, 2012
"... A graph is vertextransitive if its automorphism group acts transitively on its vertices. A vertextransitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this paper, the cubic vertextransitive nonCayley graphs of order 8p are classified ..."
Abstract
 Add to MetaCart
A graph is vertextransitive if its automorphism group acts transitively on its vertices. A vertextransitive graph is a Cayley graph if its automorphism group contains a subgroup acting regularly on its vertices. In this paper, the cubic vertextransitive nonCayley graphs of order 8p
Results 1  10
of
33,571