We prove bounds of the form ZΛ^e a{Λl and ( S Z ) ^ ^ 1 in the Y2 Euclidean field theory and from this obtain Glimm's Hamiltonian bound and Schrader's linear lower bound.

We compute the pressure of the random energy model (REM) and generalized random energy model (GREM) by establishing variational upper and lower bounds. For the upper bound, we generalize Guerra’s “broken replica symmetry bounds”, and identify the random probability cascade as the appropriate random overlap structure for the model. For the REM the lower bound is obtained, in the high temperature...

Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...

An experimental search for nuclear fusion inside imploding bubbles of degassed deuterated acetone at 0 degrees C driven by a 15 atm sound field and seeded with a neutron generator reveals an upper bound that is a factor of 10 000 less than the signal reported by Taleyarkhan et al. The strength of our upper bound is limited by the weakness of sonoluminescence, which we ascribe to the relatively ...

In supersymmetric models the lightest Higgs boson may decay with a sizable branching ratio into a pair of light neutralinos. We analyze such decays within the context of the minimal supersymmetric standard model with R-parity violation, where the neutralino itself is unstable and decays into Standard Model fermions. We show that the R-parity violating couplings induce novel Higgs decay signals ...

Precision forging process is widely used for the production of spur gears due to its advantages such as improved strength and surface finish, little waste of materials and reduction in the machining time of the gear. An important aspect of precision forging process is the load required to perform the process successfully and design the forging tools. In this research, a new kinematically admiss...

We propose a method for upper bounding the general adversary bound for certain boolean functions. Due to the the tightness of query complexity and the general adversary bound [5], this gives an upper bound on the quantum query complexity of those functions. We give an example where this upper bound is smaller than the query complexity of any known quantum algorithm.