The q-deformed supersymmetric t-J model on a semi-infinite lattice is diagonalized by using the level-one vertex operators of the quantum affine superalgebra Uq[ ̂ sl(2|1)]. We give the bosonization of the boundary states. We give an integral expression of the correlation functions of the boundary model, and derive the difference equations which they satisfy. E-mail: [email protected] E-mail:...

We have measured the B hadron energy distribution in Z 0 decays using a sample of semi-leptonic B decays recorded in the SLD experiment at SLAC. The energy of each tagged B hadron was reconstructed using information from the lepton and a partially-reconstructed charm-decay vertex. We compared the scaled energy distribution with several models of heavy quark fragmentation. The average scaled ene...

We present the results from a calculation of the full electroweak two-loop fermionic contributions to the effective leptonic mixing angle of the Z boson, sin θeff , in the Standard Model. On-shell renormalization and analytic calculations are performed for the three-point vertex functions at zero external momenta, whereas irreducible three-point integrals for non-vanishing external momenta are ...

Let Z2 = {0, 1} and G = (V ,E) be a graph. A labeling f : V → Z2 induces an edge labeling f* : E →Z2 defined by f*(uv) = f(u).f (v). For i ε Z2 let vf (i) = v(i) = card{v ε V : f(v) = i} and ef (i) = e(i) = {e ε E : f*(e) = i}. A labeling f is said to be Vertex-friendly if | v(0) − v(1) |≤ 1. The vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. In this paper ...

A graph X is max-λ if λ(X) = δ(X). A graph X is super-λ if X is max-λ and every minimum edge-cut set of X isolates one vertex. In this paper, we proved that for all but a few exceptions, the mixed Cayley graph which is defined as a new kind of semi-regular graph is max-λ and super-λ. c © 2008 Elsevier B.V. All rights reserved.

We describe techniques that are useful for the detection of dense subgraphs (quasi-cliques) in massive sparse graphs whose vertex set, but not the edge set, fits in RAM. The algorithms rely on efficient semi-external memory algorithms used to preprocess the input and on greedy randomized adaptive search procedures (GRASP) to extract the dense subgraphs. A software platform was put together allo...

Many enumerative problems can be expressed using the scalar product of symmetric functions. As we shall see, we can set up expressions for the generating functions of objects which possess a certain kind of regularity as a scalar product. Two examples of this are k-regular graphs (graphs in which each vertex is of degree k), and secondly we have a class of semi-standard Young tableaux in which ...

‎in this paper we defined the vertex removable cycle in respect of the following‎, ‎if $f$ is a class of graphs(digraphs)‎ ‎satisfying certain property‎, ‎$g in f $‎, ‎the cycle $c$ in $g$ is called vertex removable if $g-v(c)in in f $.‎ ‎the vertex removable cycles of eulerian graphs are studied‎. ‎we also characterize the edge removable cycles of regular‎ ‎graphs(digraphs).‎

We revisit semi-supervised learning on hypergraphs. Same as previous approaches, our method uses a convex program whose objective function is not everywhere differentiable. We exploit the non-uniqueness of the optimal solutions, and consider confidence intervals which give the exact ranges that unlabeled vertices take in any optimal solution. Moreover, we give a much simpler approach for solvin...

In this paper, we propose a semi-supervised online graph labelling method that a↵ords early learning capability. We use mean field approximation for predicting the unknown labels of the vertices of the graph with high accuracy on the standard benchmark datasets. The minimum cut is the energy function of our probabilistic model that encodes the uncertainty about the labels of the vertices. Our m...