On the third largest Laplacian eigenvalue of a graph

In this article, a sharp lower bound for the third largest Laplacian eigenvalue of a graph is given in terms of the third largest degree of the graph.     

A note on balance vertices in trees

The notion of balanced bipartitions of the vertices in a tree T was introduced and studied by Reid (Networks 34 (1999) 264). Reid proved that the set of balance vertices of a tree T consists of a single vertex or two adjacent vertices. In this note, we give a simple proof of that result.     

Measurements of edge-uncolorability

Cubic bridgeless graphs with chromatic index four are called uncolorable. We introduce parameters measuring the uncolorability of those graphs and relate them to each other. For k=2,3, let c_k be the maximum size of a k-colorable subgraph of a cubic graph G=(V,E). We consider r₃=|E|−c₃ and . We show that on one side r₃ and r₂ bound each other, but on the other side that the difference between them can be arbitrarily large. We also compare them to the oddness ω of G, the smallest possible number of odd circuits in a 2-factor of G. We construct cyclically 5-edge connected cubic graphs where r₃ and ω are arbitrarily far apart, and show that for each 1c<2 there is a cubic graph such that ωcr₃. For k=2,3, let ζ_k denote the largest fraction of edges that can be k-colored. We give best possible bounds for these parameters, and relate them to each other.     

High power diode single-end-pumped Nd:YVO4 laser

A fiber-coupled diode-single-end-pumped Nd:YVO₄ laser with an Nd:YVO₄ crystal of 0.3 at% doping concentration and 3×3×10 mm³ dimensions was reported. 14.850 W of continuous-wave output power in an M² factor of 1.12 was obtained under pump power of 27.365 W, with an optical conversion efficiency of 60.49%, and a slope efficiency of 64.5%.     

A $\Gamma$-convergence result for doubling metric measures and associated perimeters

Abstract. In this paper we study the notion of perimeter associated with doubling metric measures or strongly weights. We prove that the metric perimeter in the sense of L. Ambrosio and M. Miranda jr. coincides with the metric Minkowski content and can be obtained also as a -limit of Modica-Mortola type degenerate integral functionals. Received: 27 August 2001 / Accepted: 29 November 2001 / Published online: 10 June 2002 Investigation supported by University of Bologna, funds for selected research topics and by GNAMPA of INdAM, Italy. The authors are very grateful to Luigi Ambrosio and Francesco Serra Cassano for making their preprints available to them, for listening with patience and for many unvaluable suggestions.     

Group classification of unsteady boundary layer equations of a class of non-Newtonian fluids

Two dimensional unsteady boundary layer equations of a general model of non-Newtonian fluids were investigated in this study. In this model, the shear stress is taken as an arbitrary function of the velocity gradient. Group classification of the equations with respect to shear stress is done using two different approaches: (1) classical theory (2) equivalence transformations. Both approaches yield identical results. It is found that the principle Lie Algebra extends only for cases of Newtonian and Power-Law flows.     

Compact directed acyclic word graphs for a sliding window

Suffix trees are a well-known and widely-studied data structure highly useful for string matching. The suffix tree of a string w can be constructed in O(n) time and space, where n denotes the length of w. Larsson achieved an efficient algorithm to maintain suffix trees for a sliding window. It contributes to prediction by partial matching (PPM) style statistical data compression scheme. Compact directed acyclic word graphs (CDAWGs) are a more space-economical data structure for indexing strings. In this paper we propose a linear-time algorithm to maintain CDAWGs for a sliding window.     

Indexing text using the Ziv–Lempel trie

Let a text of u characters over an alphabet of size σ be compressible to n phrases by the LZ78 algorithm. We show how to build a data structure based on the Ziv–Lempel trie, called the LZ-index, that takes 4nlog₂n(1+o(1)) bits of space (that is, 4 times the entropy of the text for ergodic sources) and reports the R occurrences of a pattern of length m in worst case time O(m³logσ+(m+R)logn). We present a practical implementation of the LZ-index, which is faster than current alternatives when we take into consideration the time to report the positions or text contexts of the occurrences found.