Lower bound for the hardy constant for an arbitrary domain in Rn lower bound for the Hardy constant. We provide the known counterexamples rebutting this conjecture
Bound states of supercritical atoms and the generalized quantum dynamics the diving of one
bound state into the
lower continuum. It is shown that the formalism of the GQD provides a
Joint bounds for the Perron roots of nonnegative matrices with applicationsGiven a finite set {Ax}x∈X of nonnegative matrices, we derive joint upper and
lower bounds On computational power of classical and quantum Branching programs program of polynomial
size. Second. We present two different types. of complexity
lower bounds for quantum
On computational power of classical and quantum Branching programs program of polynomial
size. Second. We present two different types. of complexity
lower bounds for quantum
Complexity of quantum uniform and nonuniform automataWe present two different types of complexity
lower bounds for quantum uniform automata (finite
On the lower bounds for one-way quantum automata it holds that dim(formula presented). In the case ε Є (3/8,1/2) we have more precise
lower bound dim(Q) = Ω
One class of C *-algebras generated by a family of partial isometries and multiplicatorsWe considera C *-subalgebra of the algebra of all
bounded operators on the Hilbert space of square