We construct the N = 1 supergravity analog of the Green-Schwarz and heterotic superstring theories in 10D. We find the SO(8) theory previously found by compactification of 10D on K3. We also find eleven G 2 × G 2 theories, two with symmetric matter content. It is not obvious how tenof the G 2 × G 2 theories can be gotten from 10D. Ten-dimensional superstrings [1], [2], [3], [4] are one of the m...

Following the program, proposed in hep-th/0310113, of systematizing known properties of matrix model partition functions (defined as solutions to the Virasoro-like sets of linear differential equations), we proceed to consideration of non-Gaussian phases of the Hermitean one-matrix model. A unified approach is proposed for description of “connected correlators” in the form of the phaseindepende...

We develop the formalism discussed previously in hep-ph/0601209 and hep-ph/0605246 to construct a kinetic theory that provides insight into the earliest “Glasma” stage of a high energy heavy ion collision. Particles produced from the decay of classical fields in the Glasma obey a Boltzmann equation whose novel features include an inhomogeneous source term and new contributions to the collision ...

This paper documents the extent to which homeowners use housing equity to smooth their consumption over time. Unlike drawing down other forms of saving, accessing accumulated home equity can be quite costly. Theoretically and empirically, a key distinction can be drawn between those refinancing their home mortgage to improve their wealth position from those who had a consumption smoothing motiv...

Let G1 and G2 be two graphs on disjoint sets of n1 and n2 vertices, respectively. The corona of graphs G1 and G2, denoted by G1 ◦ G2, is the graph formed from one copy of G1 and n1 copies of G2 where the i-th vertex of G1 is adjacent to every vertex in the i-th copy of G2. The neighborhood corona of G1 and G2, denoted by G1 ⋄ G2, is the graph obtained by taking one copy of G1 and n1 copies of G...

Let G = (V,E) be a simple undirected graph. The neighborhood hypergraph N (G) = (V, EN ) of G has the edge set EN = {e ⊆ V | |e| ≥ 1 ∧ ∃x ∈ V : e = NG(x)}. In a certain sense, this is a generalization of the well-known notion of the neighborhood graph N(G) = (V,EN ). For several products G1 ◦G2 of simple undirected graphs G1 and G2, we investigate the question how N(G1 ◦G2) / N (G1 ◦G2) can be ...

Two graphs G1 and G2 of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets do not intersect. Sauer and Spencer proved that if (G1) (G2) < 0.5n, then G1 and G2 pack. In this note, we study an Ore-type analogue of the Sauer–Spencer Theorem. Let θ(G) = max{d(u)+ d(v) : uv ∈ E(G)}. We show that if θ(G1) (G2) < n, then G1 and G2 pack. ...

The study was conducted on 90 serum samples of people with prostate diseases (G1-include 24 for patients cancer-PC , G2- include benign prostatic hyperplasia-BPH and 22 prostatitis G3), compared 20 healthy individuals as control group. Prostate-specific antigen-PSA, human kallikrein-2-hK2, fibrinogen gamma-FGG, total anti-oxidant capacity-TAC, Vitamin D3-VD3. results showed that the activity PS...

Let G1,G2 be two connected graphs. Denote the corona and the edge corona of G1, G2 by G1 ◦ G2 and G = G1 G2, respectively. In this paper, we compute the Laplacian spectrum of the corona G◦H of two arbitrary graphs G and H and the edge corona of a connected regular graph G1 and an arbitrary graph G2.