Two elementary proofs of the Wigner theorem on symmetry in quantum mechanics

In quantum theory, symmetry has to be defined necessarily in terms of the family of unit rays, the state space. The theorem of Wigner asserts that a symmetry so defined at the level of rays can always be lifted into a linear unitary or an antilinear antiunitary operator acting on the underlying Hilbert space. We present two proofs of this theorem which are both elementary and economical. Central to our proofs is the recognition that a given Wigner symmetry can, by post-multiplication by a unitary symmetry, be taken into either the identity or complex conjugation. Our analysis often focuses on the behaviour of certain two-dimensional subspaces of the Hilbert space under the action of a given Wigner symmetry, but the relevance of this behaviour to the larger picture of the whole Hilbert space is made transparent at every stage.

Existence and approximations of solutions to some fractional order functional integral equations

In this paper we shall study a fractional order functional integral equation. In the first part of the paper, we proved the existence and uniqueness of mile and global solutions in a Banach space. In the second part of the paper, we used the analytic semigroups theory oflinear operators and the fixed point method to establish the existence, uniqueness and convergence of approximate solutions of the given problem in a separable Hilbert space. We also proved the existence and convergence of Faedo-Galerkin approximate solution to the given problem. Finally, we give an example.

Cubic and ultimate groups of complete symmetry

It is shown that the systems of definite actions described by polar and axial tensors of the second rank and their combinations during the superposition of their elements of complete symmetry with the elements of complete symmetry of the "grey" cube, result in 11 cubic crystallographical groups of complete symmetry. There are 35 ultimate groups (i.e., the groups having the axes of symmetry of infinite order) in complete symmetry of finite figures. 14 out of these groups are ultimate groups of symmetry of polar and axial tensors of the second rank and 24 are new groups. All these 24 ultimate groups are conventional groups since they cannot be presented by certain finite figures possessing the axes of symmetry {Mathematical expression}. Geometrical interpretation for some of the groups of complete symmetry is given. The connection between complete symmetry and physical properties of the crystals (electrical, magnetic and optical) is shown.

Approximation of solutions to fractional integral equation

In this paper we shall study a fractional integral equation in an arbitrary Banach space X. We used the analytic semigroups theory of linear operators and the fixed point method to establish the existence and uniqueness of solutions of the given problem. We also prove the existence of global solution. The existence and convergence of the Faedo–Galerkin solution to the given problem is also proved in a separable Hilbert space with some additional assumptions on the operator A. Finally we give an example to illustrate the applications of the abstract results.

Helical FDK Algorithms With No Backprojection Weight

In this paper, we present two new filtered backprojection (FBP) type algorithms for cylindrical detector helical cone-beam geometry with no position dependent backprojection weight. The algorithms are extension of the recent exact Hilbert filtering based 2D divergent beam reconstruction with no backprojection weight to the FDK type algorithm for reconstruction in 3D helical trajectory cone-beam tomography. The two algorithms named HFDK-W1 and HFDK-W2 result in better image quality, noise uniformity, lower noise and reduced cone-beam artifacts.

Epitaxial growth of Co3O4 films by low temperature, low pressure chemical vapour deposition

The growth of strongly oriented or epitaxial thin films of metal oxides generally requires relatively high growth temperatures or infusion of energy to the growth surface through means such as ion bombardment. We have grown high quality epitaxial thin films of Co3O4 on different substrates at a temperature as low as 400 degreesC by low-pressure metalorganic chemical vapour deposition (MOCVD) using cobalt(II) acetylacetonate as the precursor. With oxygen as the reactant gas, polycrystalline Co3O4 films are formed on glass and Si (100) in the temperature range 400-550 degreesC. Under similar conditions of growth. highly oriented films of Co3O4 are formed on SrTiO3 (100) and LaAlO3 (100). The activation energy for the growth of polycrystalline films on glass is significantly higher than that for epitaxial growth on SrTiO3 (100). The film on LaAlO3 (100) grown at 450 degreesC shows a rocking curve FWHM of 1.61 degrees, which reduces to 1.32 degrees when it is annealed in oxygen at 725 degreesC. The film on SrTiO3 (100) has a FWHM of 0.33 degrees (as deposited) and 0.29 (after annealing at 725 degreesC). The phi -scan analysis shows cube-on-cube epitaxy on both these substrates. The quality of epitaxy on SrTiO3 (100) is comparable to the best of the perovskite-based oxide thin films grown at significantly higher temperatures. A plausible mechanism is proposed for the observed low temperature epitaxy. (C) 2001 Published by Elsevier Science B.V.

The hardness of approximating the boxicity, cubicity and threshold dimension of a graph

A k-dimensional box is the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-dimensional boxes. A unit cube in k-dimensional space or a k-cube is defined as the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interval oil the real line of the form a(i), a(i) + 1]. The cubicity of G, denoted as cub(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-cubes. The threshold dimension of a graph G(V, E) is the smallest integer k such that E can be covered by k threshold spanning subgraphs of G. In this paper we will show that there exists no polynomial-time algorithm for approximating the threshold dimension of a graph on n vertices with a factor of O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. From this result we will show that there exists no polynomial-time algorithm for approximating the boxicity and the cubicity of a graph on n vertices with factor O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. In fact all these hardness results hold even for a highly structured class of graphs, namely the split graphs. We will also show that it is NP-complete to determine whether a given split graph has boxicity at most 3. (C) 2010 Elsevier B.V. All rights reserved.

Comparative Study of Predictions of Flexural Strength of Steel Fiber Concrete

Several methods are available for predicting flexural strength of steel fiber concrete composites. In these methods, direct tensile strength, split cylinder strength, and cube strength are the basic engineering parameters that must be determined to predict the flexural strength of such composites. Various simplified forms of stress distribution are used in each method to formulate the prediction equations for flexural strength. In this paper, existing methods are reviewed and compared, and a modified empirical approach is developed to predict the flexural strength of fiber concrete composites. The direct tensile strength of the composite is used as the basic parameter in this approach. Stress distribution is established from the findings of flexural tests conducted as part of this investigation on fiber concrete prisms. A comparative study of the test values of an earlier investigation on fiber concrete slabs and the computed values from existing methods, including the one proposed, is presented.

Solution of a Boundary-Value Problem associated with Diffraction of Water Waves by a Nearly Vertical Barrier

An exact solution is derived for a boundary-value problem for Laplace's equation which is a generalization of the one occurring in the course of solution of the problem of diffraction of surface water waves by a nearly vertical submerged barrier. The method of solution involves the use of complex function theory, the Schwarz reflection principle, and reduction to a system of two uncoupled Riemann-Hilbert problems. Known results, representing the reflection and transmission coefficients of the water wave problem involving a nearly vertical barrier, are derived in terms of the shape function.

Models for spin-state transitions in solids

The model for spin-state transitions described by Bari and Sivardiere (1972) is static and can be solved exactly even when the dynamics of the lattice are included; the dynamic model does not, however, show any phase transition. A coupling between the octahedra, on the other hand, leads to a phase transition in the dynamical two-sublattice displacement model. A coupling of the spin states to the cube of the sublattice displacement leads to a first-order phase transition. The most reasonable model appears to be a two-phonon model in which an ion-cage mode mixes the spin states, while a breathing mode couples to the spin states without mixing. This model explains the non-zero population of high-spin states at low temperatures, temperature-dependent variations in the inverse susceptibility and the spin-state population ratio, as well as the structural phase transitions accompanying spin-state transitions found in some systems.

Cubicity of Interval Graphs and the Claw Number

Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product l(1) x l(2) x ... x l(b), where each l(i) is a closed interval of unit length on the real line. The cub/city of G, denoted by cub(G), is the minimum positive integer b such that the vertices in G can be mapped to axis parallel b-dimensional cubes in such a way that two vertices are adjacent in G if and only if their assigned cubes intersect. An interval graph is a graph that can be represented as the intersection of intervals on the real line-i.e. the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. Suppose S(m) denotes a star graph on m+1 nodes. We define claw number psi(G) of the graph to be the largest positive integer m such that S(m) is an induced subgraph of G. It can be easily shown that the cubicity of any graph is at least log(2) psi(G)]. In this article, we show that for an interval graph G log(2) psi(G)-]<= cub(G)<=log(2) psi(G)]+2. It is not clear whether the upper bound of log(2) psi(G)]+2 is tight: till now we are unable to find any interval graph with cub(G)> (log(2)psi(G)]. We also show that for an interval graph G, cub(G) <= log(2) alpha], where alpha is the independence number of G. Therefore, in the special case of psi(G)=alpha, cub(G) is exactly log(2) alpha(2)]. The concept of cubicity can be generalized by considering boxes instead of cubes. A b-dimensional box is a Cartesian product l(1) x l(2) x ... x l(b), where each I is a closed interval on the real line. The boxicity of a graph, denoted box(G), is the minimum k such that G is the intersection graph of k-dimensional boxes. It is clear that box(G)<= cub(G). From the above result, it follows that for any graph G, cub(G) <= box(G)log(2) alpha]. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 65: 323-333, 2010

A heuristic clustering algorithm using union of overlapping pattern-cells

Relative geometric arrangements of the sample points, with reference to the structure of the imbedding space, produce clusters. Hence, if each sample point is imagined to acquire a volume of a small M-cube (called pattern-cell), depending on the ranges of its (M) features and number (N) of samples; then overlapping pattern-cells would indicate naturally closer sample-points. A chain or blob of such overlapping cells would mean a cluster and separate clusters would not share a common pattern-cell between them. The conditions and an analytic method to find such an overlap are developed. A simple, intuitive, nonparametric clustering procedure, based on such overlapping pattern-cells is presented. It may be classified as an agglomerative, hierarchical, linkage-type clustering procedure. The algorithm is fast, requires low storage and can identify irregular clusters. Two extensions of the algorithm, to separate overlapping clusters and to estimate the nature of pattern distributions in the sample space, are also indicated.

Complete Pick positivity and unitary invariance

The characteristic function for a contraction is a classical complete unitary invariant devised by Sz.-Nagy and Foias. Just as a contraction is related to the Szego kernel k(S) (z, w) = (1 - z (w) over tilde)(-1) for |z|, |w| < 1, by means of (1/k(S))(T,T*) >= 0, we consider an arbitrary open connected domain Omega in C-n, a complete Pick kernel k on Omega and a tuple T = (T-1, ..., T-n) of commuting bounded operators on a complex separable Hilbert space H such that (1/k)(T,T*) >= 0. For a complete Pick kernel the 1/k functional calculus makes sense in a beautiful way. It turns out that the model theory works very well and a characteristic function can be associated with T. Moreover, the characteristic function is then a complete unitary invariant for a suitable class of tuples T.

Spin-1 Kitaev model in one dimension

We study a one-dimensional version of the Kitaev model on a ring of size N, in which there is a spin S > 1/2 on each site and the Hamiltonian is J Sigma(nSnSn+1y)-S-x. The cases where S is integer and half-odd integer are qualitatively different. We show that there is a Z(2)-valued conserved quantity W-n for each bond (n, n + 1) of the system. For integer S, the Hilbert space can be decomposed into 2N sectors, of unequal sizes. The number of states in most of the sectors grows as d(N), where d depends on the sector. The largest sector contains the ground state, and for this sector, for S=1, d=(root 5+1)/2. We carry out exact diagonalization for small systems. The extrapolation of our results to large N indicates that the energy gap remains finite in this limit. In the ground-state sector, the system can be mapped to a spin-1/2 model. We develop variational wave functions to study the lowest energy states in the ground state and other sectors. The first excited state of the system is the lowest energy state of a different sector and we estimate its excitation energy. We consider a more general Hamiltonian, adding a term lambda Sigma W-n(n), and show that this has gapless excitations in the range lambda(c)(1)<=lambda <=lambda(c)(2). We use the variational wave functions to study how the ground-state energy and the defect density vary near the two critical points lambda(c)(1) and lambda(c)(2).

Analytical and simulation studies of a multiprocessor system for high-speed numerical computations

This paper describes the architecture of a multiprocessor system which we call the Broadcast Cube System (BCS) for solving important computation intensive problems such as systems of linear algebraic equations and Partial Differential Equations (PDEs), and highlights its features. Further, this paper presents an analytical performance study of the BCS, and it describes the main details of the design and implementation of the simulator for the BCS.