Prospects of reactor neutrino experiments

Since the energy of a reactor neutrino is a few MeV, all , and oscillations are accessible by reactor neutrino experiments. KamLAND observed the oscillation and currently Double Chooz, RENO and Dayabay experiments are under construction aiming to detect oscillation. There are still good prospects for future reactor neutrino experiments after them. For example, there is room to further improve sin²2θ₁₃ accuracy at a baseline of ∼1.5 km, a very precise sin²2θ₁₂ measurement and the determination of mass hierarchy may be possible at a baseline ∼50 km, and if KamLAND is enlarged to the SuperKamiokande size, better measurement of and sin²2θ₁₂ will be anticipated. It is important to take into account such possibilities when planning future neutrino program after θ₁₃ is measured by current experiments.     

Mean wind: Its velocity and temperature fluctuation in low-Prandtl-number thermal convection

Large-scale circulation in the confined thermal turbulence of mercury is studied experimentally. The instantaneous velocity profile at 128 points is directly measured using ultrasonic velocimetry and the temperature fluctuation is simultaneously obtained by a small thermistor at the cell center. The periodic velocity oscillation is observed for aspect ratios Γ=1,2, but for Γ=0.5. The temperature oscillation is confirmed only in the Γ=2 cell. It is found that the flow patterns depending on the aspect ratio are characterized sufficiently by the joint probability density function up to Ra=4×10⁸.     

Terahertz spectroscopy of oxygen, O2, in its Σg and Δ electronic states : THz Spectroscopy of O2

High precision rotational spectra of isotopic oxygen O₂ (with or ) in its electronic ground state have been measured in selected frequency regions between 0.4 and 2.0 THz. The main isotopic species, , was also investigated in its first excited electronic state . The new data, analyzed together with previous measurements, yielded improved spectroscopic parameters.     

Linear-time certifying algorithms for near-graphical sequences

A sequence 〈d₁,d₂,…,d_n〉 of non-negative integers is graphical if it is the degree sequence of some graph, that is, there exists a graph G on n vertices whose ith vertex has degree d_i, for 1≤i≤n. The notion of a graphical sequence has a natural reformulation and generalization in terms of factors of complete graphs.If H=(V,E) is a graph and g and f are integer-valued functions on the vertex set V, then a (g,f)-factor of H is a subgraph G=(V,F) of H whose degree at each vertex v∈V lies in the interval [g(v),f(v)]. Thus, a (0,1)-factor is just a matching of H and a (1, 1)-factor is a perfect matching of H. If H is complete then a (g,f)-factor realizes a degree sequence that is consistent with the sequence of intervals 〈[g(v₁),f(v₁)],[g(v₂),f(v₂)],…,[g(v_n),f(v_n)]〉.Graphical sequences have been extensively studied and admit several elegant characterizations. We are interested in extending these characterizations to non-graphical sequences by introducing a natural measure of “near-graphical”. We do this in the context of minimally deficient (g,f)-factors of complete graphs. Our main result is a simple linear-time greedy algorithm for constructing minimally deficient (g,f)-factors in complete graphs that generalizes the method of Hakimi and Havel (for constructing (f,f)-factors in complete graphs, when possible). It has the added advantage of producing a certificate of minimum deficiency (through a generalization of the Erdös-Gallai characterization of (f,f)-factors in complete graphs) at no additional cost.     

A short note on the overpartition function

In this brief note, we give a combinatorial proof of a variation of Gauss’s q-binomial theorem, and we determine arithmetic properties of the overpartition function modulo 8.     

On (d,1)-total numbers of graphs

A (d,1)-total labelling of a graph G assigns integers to the vertices and edges of G such that adjacent vertices receive distinct labels, adjacent edges receive distinct labels, and a vertex and its incident edges receive labels that differ in absolute value by at least d. The span of a (d,1)-total labelling is the maximum difference between two labels. The (d,1)-total number, denoted , is defined to be the least span among all (d,1)-total labellings of G. We prove new upper bounds for , compute some for complete bipartite graphs K_m,n, and completely determine all for d=1,2,3. We also propose a conjecture on an upper bound for in terms of the chromatic number and the chromatic index of G.     

On spanning tree congestion of graphs

Let G be a connected graph and T be a spanning tree of G. For e∈E(T), the congestion of e is the number of edges in G connecting two components of T−e. The edge congestion ofGinT is the maximum congestion over all edges in T. The spanning tree congestion ofG is the minimum congestion of G in its spanning trees. In this paper, we show the spanning tree congestion for the complete k-partite graphs and the two-dimensional tori. We also address lower bounds of spanning tree congestion for the multi-dimensional grids and the hypercubes.     

Graph designs for the eight-edge five-vertex graphs

The existence of graph designs for the two nonisomorphic graphs on five vertices and eight edges is determined in the case of index one, with three possible exceptions in total. It is established that for the unique graph with vertex sequence (3, 3, 3, 3, 4), a graph design of order n exists exactly when and n≠16, with the possible exception of n=48. For the unique graph with vertex sequence (2,3,3,4,4), a graph design of order n exists exactly when , with the possible exceptions of n∈{32,48}.     

The rate of quasi sure convergence in the functional limit theorem for increments of a Brownian motion

We investigate the quasi sure convergence of the functional limit for increments of a Brownian motion. The rate of quasi sure convergence in the functional limit for increments of a d-dimensional Brownian motion is derived. The main tool in the proof is large deviation and small deviation for Brownian motion in terms of (r,p)-capacity.