Marianne Fangting Chen, violin and Yu Jin, piano, February 4, 2017

This is the concert program of the Marianne Fangting Chen, violin and Yu Jin, piano performance on Saturday, February 4, 2017 at 4:00 p.m., at the Concert Hall, 855 Commonwealth Avenue. Works performee were Sonata for Violin and Piano in A major, OP. 162, D. 574 by Franz Schubert, Violin concerto NO. 2 in G minor, Op. 63 by Sergei Prokofiev, and 3 Preludes for Violin and Piano by George Gershwin, arranged by Jascha Heifetz. Digitization for Boston University Concert Programs was supported by the Boston University Humanities Library Endowed Fund

Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights

Let $G$ be a graph and $\mathcal {S}$ be a subset of $Z$. A vertex-coloring $\mathcal {S}$-edge-weighting of $G$ is an assignment of weight $s$ by the elements of $\mathcal {S}$ to each edge of $G$ so that adjacent vertices have different sums of incident edges weights. It was proved that every 3-connected bipartite graph admits a vertex-coloring $\{1,2\}$-edge-weighting (Lu, Yu and Zhang, (2011) \cite{LYZ}). In this paper, we show that the following result: if a 3-edge-connected bipartite graph $G$ with minimum degree $\delta$ contains a vertex $u\in V(G)$ such that $d_G(u)=\delta$ and $G-u$ is connected, then $G$ admits a vertex-coloring $\mathcal {S}$-edge-weighting for $\mathcal {S}\in \{\{0,1\},\{1,2\}\}$. In particular, we show that every 2-connected and 3-edge-connected bipartite graph admits a vertex-coloring $\mathcal {S}$-edge-weighting for $\mathcal {S}\in \{\{0,1\},\{1,2\}\}$. The bound is sharp, since there exists a family of infinite bipartite graphs which are 2-connected and do not admit vertex-coloring $\{1,2\}$-edge-weightings or vertex-coloring $\{0,1\}$-edge-weightings.Comment: In this paper, we show that every 2-connected and 3-edge-connected bipartite graph admits a vertex-coloring S-edge-weighting for S\in {{0,1},{1,2}

On the nature and order of the deconfining transition in QCD

The determination of the parameters of the deconfining transition in N_f=2 QCD is discussed, and its relevance to the understanding of the mechanism of color confinement.Comment: 10 pages. In honour of Yu. A. Simonov on his seventyth birthday; to be published in Yadernaya Fizik

Vertex coloring of plane graphs with nonrepetitive boundary paths

A sequence $s_1,s_2,...,s_k,s_1,s_2,...,s_k$ is a repetition. A sequence $S$ is nonrepetitive, if no subsequence of consecutive terms of $S$ form a repetition. Let $G$ be a vertex colored graph. A path of $G$ is nonrepetitive, if the sequence of colors on its vertices is nonrepetitive. If $G$ is a plane graph, then a facial nonrepetitive vertex coloring of $G$ is a vertex coloring such that any facial path is nonrepetitive. Let $\pi_f(G)$ denote the minimum number of colors of a facial nonrepetitive vertex coloring of $G$. Jendro\vl and Harant posed a conjecture that $\pi_f(G)$ can be bounded from above by a constant. We prove that $\pi_f(G)\le 24$ for any plane graph $G$

Erratum: First-principles study on the intrinsic stability of the magic Fe13O8 Cluster [Phys. Rev. B 61, 5781 (2000)]

See Also: Original Article: Q. Sun, Q. Wang, K. Parlinski, J. Z. Yu, Y. Hashi, X. G. Gong, and Y. Kawazoe, First-principles studies on the intrinsic stability of the magic Fe13O8 cluster, Phys. Rev. B 61, 5781 (2000)