介质阻挡放电中白眼斑图的分子振动温度

在空气和氩气的混合气体介质阻挡放电中,得到了白眼斑图,其晶胞是由一个封闭六边形包围一个亮点所组成。观察发现,该斑图单个晶胞上中心点、六边形顶点及六边形边上呈现出三种不同的亮暗状态。该工作利用光谱方法,分别对白眼斑图单个晶胞以上三处的振动温度进行了测量,并研究了它们随氩气含量的变化。振动温度是根据氮分子的第二正带系(C3Π_u→B3Π_g)的发射谱线计算的。结果表明：白眼斑图中的中心点、六边形的顶点以及六边形边上中点的振动温度依次升高,且均随氩气含量的增加而减小。     

The Odd Eight-Vertex Model

We consider a vertex model on the simple-quartic lattice defined by line graphs on the lattice for which there is always an odd number of lines incident at a vertex. This is the odd 8-vertex model which has eight possible vertex configurations. We establish that the odd 8-vertex model is equivalent to a staggered8-vertex model. Using this equivalence we deduce the solution of the odd8-vertex model when the weights satisfy a free-fermion condition. It is found that the free-fermion model exhibits no phase transitions in the regime of positive vertex weights. We also establish the complete equivalence of the free-fermion odd 8-vertex model with the free-fermion 8-vertex model solved by Fan and Wu. Our analysis leads to several Ising model representations of thefree-fermion model with pure 2-spin interactions.     

Discrete symmetry groups of vertex models in statistical mechanics

We analyze discrete symmetry groups of vertex models in lattice statistical mechanics represented as groups of birational transformations. They can be seen as generated by involutions corresponding respectively to two kinds of transformations onq×q matrices: the inversion of theq×q matrix and an (involutive) permutation of the entries of the matrix. We show that the analysis of the factorizations of the iterations of these transformations is a precious tool in the study of lattice models in statistical mechanics. This approach enables one to analyze two-dimensionalq ⁴-state vertex models as simply as three-dimensional vertex models, or higher-dimensional vertex models. Various examples of birational symmetries of vertex models are analyzed. A particular emphasis is devoted to a three-dimensional vertex model, the 64-state cubic vertex model, which exhibits a polynomial growth of the complexity of the calculations. A subcase of this general model is seen to yield integrable recursion relations. We also concentrate on a specific two-dimensional vertex model to see how the generic exponential growth of the calculations reduces to a polynomial growth when the model becomes Yang-Baxter integrable. It is also underlined that a polynomial growth of the complexity of these iterations can occur even for transformations yielding algebraic surfaces, or higher-dimensional algebraic varieties.     

Primary vertex reconstruction based on the Kalman filter technique at BESⅢ

Primary vertex reconstruction is crucial to estimate the beam profile in collision experiments. We study the principle of an iterative process, called the Kalman filter method, and apply it to primary vertex reconstruction at BESⅢ. A Newton procedure to find the zero point of the distance function's gradient is used for primary vertex finding in 3-dimensional space. Results are obtained based on raw data at BESⅢ.     

Truncating First-Order Dyson–Schwinger Equations in Coulomb Gauge Yang–Mills Theory

The non-perturbative domain of QCD contains confinement, chiral symmetry breaking, and the bound state spectrum. For the calculation of the latter, the Coulomb gauge is particularly well-suited. Access to these non-perturbative properties should be possible by means of the Green’s functions. However, Coulomb gauge is also very involved, and thus hard to tackle. We introduce a novel BRST-type operator r, and show that the left-hand side of Gauss’ law is r-exact. We investigate a possible truncation scheme of the Dyson–Schwinger equations in first-order formalism for the propagators based on an instantaneous approximation. We demonstrate that this is insufficient to obtain solutions with the expected property of a linear-rising Coulomb potential. We also show systematically that a class of possible vertex dressings does not change this result.     

Free Bosonic Vertex Operator Algebras on Genus Two Riemann Surfaces I

We define the partition and n-point functions for a vertex operator algebra on a genus two Riemann surface formed by sewing two tori together. We obtain closed formulas for the genus two partition function for the Heisenberg free bosonic string and for any pair of simple Heisenberg modules. We prove that the partition function is holomorphic in the sewing parameters on a given suitable domain and describe its modular properties for the Heisenberg and lattice vertex operator algebras and a continuous orbifolding of the rank two fermion vertex operator super algebra. We compute the genus two Heisenberg vector n-point function and show that the Virasoro vector one point function satisfies a genus two Ward identity for these theories.     

Energy measurement and fragment identification using digital signals from partially depleted Si detectors

In this work we devise a new method to study quark-anti-quark interactions beyond simple ladder-exchange that yield massless pions in the chiral limit. The method is based on the requirement to have a representation of the quark-gluon vertex that is explicitly given in terms of quark dressings functions. We outline a general procedure to generate the Bethe-Salpeter kernel for a given vertex representation. Our method allows not only the identification of the mesons' masses but also the extraction of their Bethe-Salpeter wave functions exposing their internal structure. We exemplify our method with vertex models that are of phenomenological interest.     

Approximations of Quantum-Graph Vertex Couplings by Singularly Scaled Rank-One Operators

We investigate approximations of the vertex coupling on a star-shaped graph by families of operators with singularly scaled rank-one interactions. We find a family of vertex couplings, generalizing the δ′-interaction on the line, and show that with a suitable choice of the parameters they can be approximated in this way in the norm-resolvent sense. We also analyze spectral properties of the involved operators and demonstrate the convergence of the corresponding on-shell scattering matrices.     

Rumor Processes in Random Environment on \mathbb{N} and on Galton–Watson Trees

The aim of this paper is to study rumor processes in random environment. In a rumor process a signal starts from the stations of a fixed vertex (the root) and travels on a graph from vertex to vertex. We consider two rumor processes. In the firework process each station, when reached by the signal, transmits it up to a random distance. In the reverse firework process, on the other hand, stations do not send any signal but they “listen” for it up to a random distance. The first random environment that we consider is the deterministic 1-dimensional tree $\mathbb{N}$ with a random number of stations on each vertex; in this case the root is the origin of $\mathbb{N}$ . We give conditions for the survival/extinction on almost every realization of the sequence of stations. Later on, we study the processes on Galton–Watson trees with random number of stations on each vertex. We show that if the probability of survival is positive, then there is survival on almost every realization of the infinite tree such that there is at least one station at the root. We characterize the survival of the process in some cases and we give sufficient conditions for survival/extinction.     

The real topological vertex at work

We develop the real vertex formalism for the computation of the topological string partition function with D-branes and O-planes at the fixed point locus of an anti-holomorphic involution acting non-trivially on the toric diagram of any local toric Calabi–Yau manifold. Our results cover in particular the real vertex with non-trivial fixed leg. We give a careful derivation of the relevant ingredients using duality with Chern–Simons theory on orbifolds. We show that the real vertex can also be interpreted in terms of a statistical model of symmetric crystal melting. Using this latter connection, we also assess the constant map contribution in Calabi–Yau orientifold models. We find that there are no perturbative contributions beyond one-loop, but a non-trivial sum over non-perturbative sectors, which we compare with the non-perturbative contribution to the closed string expansion.     

The Schur function realization of vertex operators

We present a realization of untwisted vertex operators in terms of operations on Schur functions. Calculations of matrix elements and traces of products of vertex operators are performed using results from the classical theory of symmetric functions. The concepts of compound, composite and supersymmetric Schur functions naturally appear in this context. Furthermore, a trace formula for a product of vertex operators turns out to be a generalization of a MacDonald identity reformulated in terms of Schur functions.     

What can we learn from sum rules for vertex functions in QCD?

We demonstrate that the light-cone sum rules for vertex functions based on the operator product expansion and QCD perturbation theory lead to interesting relationships between various non-perturbative parameters associated with hadronic bound states (e.g. vertex couplings and decay constants). We also show that such sum rules provide a valuable means of estimating the matrix elements of the higher spin operators in the meson wave function.     

Symmetric vertex models on planar random graphs

We solve a 4-(bond)-vertex model on an ensemble of 3-regular (Φ³) planar random graphs, which has the effect of coupling the vertex model to 2D quantum gravity. The method of solution, by mapping onto an Ising model in field, is inspired by the solution by Wu et.al. of the regular lattice equivalent – a symmetric 8-vertex model on the honeycomb lattice, and also applies to higher valency bond vertex models on random graphs when the vertex weights depend only on bond numbers and not cyclic ordering (the so-called symmetric vertex models).The relations between the vertex weights and Ising model parameters in the 4-vertex model on Φ³ graphs turn out to be identical to those of the honeycomb lattice model, as is the form of the equation of the Ising critical locus for the vertex weights. A symmetry of the partition function under transformations of the vertex weights, which is fundamental to the solution in both cases, can be understood in the random graph case as a change of integration variable in the matrix integral used to define the model.Finally, we note that vertex models, such as that discussed in this paper, may have a role to play in the discretisation of Lorentzian metric quantum gravity in two dimensions.     

Modeling network growth with assortative mixing

We propose a model of an underlying mechanism responsible for the formation of assortative mixing in networks between “similar” nodes or vertices based on generic vertex properties. Existing models focus on a particular type of assortative mixing, such as mixing by vertex degree, or present methods of generating a network with certain properties, rather than modeling a mechanism driving assortative mixing during network growth. The motivation is to model assortative mixing by non-topological vertex properties, and the influence of these non-topological properties on network topology. The model is studied in detail for discrete and hierarchical vertex properties, and we use simulations to study the topology of resulting networks. We show that assortative mixing by generic properties directly drives the formation of community structure beyond a threshold assortativity of r ∼0.5, which in turn influences other topological properties. This direct relationship is demonstrated by introducing a new measure to characterise the correlation between assortative mixing and community structure in a network. Additionally, we introduce a novel type of assortative mixing in systems with hierarchical vertex properties, from which a hierarchical community structure is found to result. Electronic supplementary material Supplementary Online Material     

Operadic formulation of topological vertex algebras and Gerstenhaber or Batalin-Vilkovisky algebras

We give the operadic formulation of (weak, strong) topological vertex algebras, which are variants of topological vertex operator algebras studied recently by Lian and Zuckerman. As an application, we obtain a conceptual and geometric construction of the Batalin-Vilkovisky algebraic structure (or the Gerstenhaber algebra structure) on the cohomology of a topological vertex algebra (or of a weak topological vertex algebra) by combining this operadic formulation with a theorem of Getzler (or of Cohen) which formulates Batalin-Vilkovisky algebras (or Gerstenhaber algebras) in terms of the homology of the framed little disk operad (or of the little disk operad).The author is supported in part by NSF grant DMS-9104519     

Scale-Free Graph with Preferential Attachment and Evolving Internal Vertex Structure

We extend the classical Barabási-Albert preferential attachment procedure to graphs with internal vertex structure given by weights of vertices. In our model, weight dynamics depends on the current vertex degree distribution and the preferential attachment procedure takes into account both weights and degrees of vertices. We prove that such a coupled dynamics leads to scale-free graphs with exponents depending on parameters of the weight dynamics.     

Pion-nucleon vertex function with an off-shell nucleon

We present a model calculation for the π-N vertex function in the case in which there is a single off-mass-shell nucleon and a (nearly) on-mass-shell pion. We find very strong effects due to the P₁₁ resonance at 1470 MeV. We provide a simple parametrization of the vertex function in the case that at least one nucleon is on its mass shell.     

Reputational preference and other-regarding preference based rewarding mechanism promotes cooperation in spatial social dilemmas

To study the incentive mechanisms of cooperation, we propose a preference rewarding mechanism in the spatial prisoner's dilemma game, which simultaneously considers reputational preference, other-regarding preference and the dynamic adjustment of vertex weight. The vertex weight of a player is adaptively adjusted according to the comparison result of his own reputation and the average reputation value of his immediate neighbors. Players are inclined to pay a personal cost to reward the cooperative neighbor with the greatest vertex weight. The vertex weight of a player is proportional to the preference rewards he can obtain from direct neighbors. We find that the preference rewarding mechanism significantly facilitates the evolution of cooperation, and the dynamic adjustment of vertex weight has powerful effect on the emergence of cooperative behavior. To validate multiple effects, strategy distribution and the average payoff and fitness of players are discussed in a microcosmic view.     

Transverse Ward-Takahashi Relation to One Loop

We calculate the transverse Ward-Takahashi relation for the vector vertex in momentum space at one-loop order in four-dimensional Abelian gauge theory. We demonstrate explicitly that the result is exactly the same as that derived by using one-loop vector vertex calculations.     

Transverse Ward-Takahashi Relation to One Loop

We calculate the transverse Ward-Takahashi relation for the vector vertex in momentum space at one-loop order in four-dimensional Abelian gauge theory. We demonstrate explicitly that the result is exactly the same as that derived by using one-loop vector vertex calculations.