Regular nanodomain vertex arrays in BiFeO3 single crystals

Domain patterns consisting of triangular nanodomains of less than 50 nm size, arranged into long regular vertex arrays separated by stripe domains, were observed by (scanning and high-resolution) transmission electron microscopy and piezoresponse force microscopy in BiFeO3 single crystals grown from solution flux. Piezoresponse force microscopy analysis together with crystallographic analysis by selected area and nanobeam electron diffraction indicate that these patterns consist of ferroelectric 109 degrees domains. A possibility for conserving Kittel's law is discussed in terms of the patterns being confined to the skin layer observed recently on BiFeO3 single crystals.

Exploring Vertex Interactions in Ferroelectric Flux-Closure Domains

Using piezoresponse force microscopy, we have observed the progressive development of ferroelectric flux-closure domain structures and Landau−Kittel-type domain patterns, in 300 nm thick single-crystal BaTiO3 platelets. As the microstructural development proceeds, the rate of change of the domain configuration is seen to decrease exponentially. Nevertheless, domain wall velocities throughout are commensurate with creep processes in oxide ferroelectrics. Progressive screening of macroscopic destabilizing fields, primarily the surface-related depolarizing field, successfully describes the main features of the observed kinetics. Changes in the separation of domain-wall vertex junctions prompt a consideration that vertex−vertex interactions could be influencing the measured kinetics. However, the expected dynamic signatures associated with direct vertex−vertex interactions are not resolved. If present, our measurements confine the length scale for interaction between vertices to the order of a few hundred nanometers.

Vertex Clustering of Augmented Graph Streams

In this paper we propose a graph stream clustering algorithm with a unied similarity measure on both structural and attribute properties of vertices, with each attribute being treated as a vertex. Unlike others, our approach does not require an input parameter for the number of clusters, instead, it dynamically creates new sketch-based clusters and periodically merges existing similar clusters. Experiments on two publicly available datasets reveal the advantages of our approach in detecting vertex clusters in the graph stream. We provide a detailed investigation into how parameters affect the algorithm performance. We also provide a quantitative evaluation and comparison with a well-known offline community detection algorithm which shows that our streaming algorithm can achieve comparable or better average cluster purity.

Clique Irreducibility and Clique Vertex Irreducibility of Graphs

A graphs G is clique irreducible if every clique in G of size at least two,has an edge which does not lie in any other clique of G and is clique reducible if it is not clique irreducible. A graph G is clique vertex irreducible if every clique in G has a vertex which does not lie in any other clique of G and clique vertex reducible if it is not clique vertex irreducible. The clique vertex irreducibility and clique irreducibility of graphs which are non-complete extended p-sums (NEPS) of two graphs are studied. We prove that if G(c) has at least two non-trivial components then G is clique vertex reducible and if it has at least three non-trivial components then G is clique reducible. The cographs and the distance hereditary graphs which are clique vertex irreducible and clique irreducible are also recursively characterized.

Mathematical Morphology on Hypergraphs Using Vertex-Hyperedge Correspondence

The focus of this paper is to develop computationally efficient mathematical morphology operators on hypergraphs. To this aim we consider lattice structures on hypergraphs on which we build morphological operators. We develop a pair of dual adjunctions between the vertex set and the hyperedge set of a hypergraph , by defining a vertex-hyperedge correspondence. This allows us to recover the classical notion of a dilation/erosion of a subset of vertices and to extend it to subhypergraphs of . This paper also studies the concept of morphological adjunction on hypergraphs for which both the input and the output are hypergraphs

Vertex splitting and connectivity augmentation in hypergraphs

We consider problems of splitting and connectivity augmentation in hypergraphs. In a hypergraph G = (V +s, E), to split two edges su, sv, is to replace them with a single edge uv. We are interested in doing this in such a way as to preserve a defined level of connectivity in V . The splitting technique is often used as a way of adding new edges into a graph or hypergraph, so as to augment the connectivity to some prescribed level. We begin by providing a short history of work done in this area. Then several preliminary results are given in a general form so that they may be used to tackle several problems. We then analyse the hypergraphs G = (V + s, E) for which there is no split preserving the local-edge-connectivity present in V. We provide two structural theorems, one of which implies a slight extension to Mader’s classical splitting theorem. We also provide a characterisation of the hypergraphs for which there is no such “good” split and a splitting result concerned with a specialisation of the local-connectivity function. We then use our splitting results to provide an upper bound on the smallest number of size-two edges we must add to any given hypergraph to ensure that in the resulting hypergraph we have λ(x, y) ≥ r(x, y) for all x, y in V, where r is an integer valued, symmetric requirement function on V*V. This is the so called “local-edge-connectivity augmentation problem” for hypergraphs. We also provide an extension to a Theorem of Szigeti, about augmenting to satisfy a requirement r, but using hyperedges. Next, in a result born of collaborative work with Zoltán Király from Budapest, we show that the local-connectivity augmentation problem is NP-complete for hypergraphs. Lastly we concern ourselves with an augmentation problem that includes a locational constraint. The premise is that we are given a hypergraph H = (V,E) with a bipartition P = {P1, P2} of V and asked to augment it with size-two edges, so that the result is k-edge-connected, and has no new edge contained in some P(i). We consider the splitting technique and describe the obstacles that prevent us forming “good” splits. From this we deduce results about which hypergraphs have a complete Pk-split. This leads to a minimax result on the optimal number of edges required and a polynomial algorithm to provide an optimal augmentation.

D*D rho vertex from QCD sum rules

We calculate the form factors and the coupling constant in the D*D rho vertex in the framework of QCD sum rules. We evaluate the three-point correlation functions of the vertex considering D, rho and D* mesons off-shell. The form factors obtained are very different but give the same coupling constant: g(D*D rho) = 4.3 +/- 0.9 GeV(-1). (C) 2011 Elsevier B.V. All rights reserved.

rho D*D* vertex from QCD sum rules

We calculate the form factors and the coupling constant in the rho D*D* vertex in the framework of QCD sum rules. We evaluate the three point correlation functions of the vertex considering both rho and D* mesons off-shell. The form factors obtained are very different but give the same coupling constant: g rho D*D* = 6.60 +/- 0.31. This number is 50% larger than what we would expect from SU(4) estimates. (c) 2007 Elsevier B.V. All rights reserved.

Scrutinizing the ZW(+)W(-) vertex at the Large Hadron Collider at 7 TeV

We analyze the potential of the CERN Large Hadron Collider running at 7 TeV to search for deviations from the Standard Model predictions for the triple gauge boson coupling ZW(+)W(-) assuming an integrated luminosity of 1 fb(-1). We show that the study of W(+)W(-) and W(+/-)Z productions, followed by the leptonic decay of the weak gauge bosons can improve the present sensitivity on the anomalous couplings Delta g(1)(Z), Delta kappa(Z), lambda(Z), g(4)(Z), and (lambda) over bar (Z) at the 2 sigma level. (C) 2010 Elsevier B.V. All rights reserved.

The spectrum of an open vertex model based on the U(q)[SU(2)] algebra at roots of unity

We study the exact solution of an N-state vertex model based on the representation of the U(q)[SU(2)] algebra at roots of unity with diagonal open boundaries. We find that the respective reflection equation provides us one general class of diagonal K-matrices having one free-parameter. We determine the eigenvalues of the double-row transfer matrix and the respective Bethe ansatz equation within the algebraic Bethe ansatz framework. The structure of the Bethe ansatz equation combine a pseudomomenta function depending on a free-parameter with scattering phase-shifts that are fixed by the roots of unity and boundary variables. (C) 2010 Elsevier B.V. All rights reserved.

The omega DD vertex in a sum rule approach

The study of charmonium dissociation in heavy ion collisions is generally performed in the framework of effective Lagrangians with meson exchange. Some studies are also developed with the intention of calculate form factors and coupling constants related with charmed and light mesons. These quantifies are important in the evaluation of charmonium cross sections. In this Letter we present a calculation of the omega DD vertex that is a possible interaction vertex in some meson-exchange models spread in the literature. We used the standard method of QCD sum rules in order to obtain the vertex form factor as a function of the transferred momentum. Our results are compatible with the value of this vertex form factor (at zero momentum transfer) obtained in the vector-meson dominance model. (c) 2006 Elsevier B.V. All rights reserved.