We present a deterministic algorithm running in space O ? log 2 n= log logn solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(logn) time-bounded algorithm for this problem running on a parallel pointer machine.

Non-statistical weak measurements yield weak values that are outside the range of eigenvalues and are not rare, suggesting that weak values are a property of every preand-post-selected ensemble. They also extend the applicability and valid regime of weak values.

We show that techniques inspired by Kollár and Viehweg’s study of weak positivity, combined with vanishing for log-canonical pairs, lead to new generation and vanishing results for direct images of pluricanonical bundles. We formulate the strongest such results as Fujita conjecture-type statements, which are then shown to govern a range of fundamental properties of direct images of pluricanonic...

In this paper, we prove the boundedness of multilinear Littlewood-Paley square operators and their commutators on weighted Morrey spaces, then give weak-type $$L\log L$$ estimates for g-functions Marcinkiewicz integrals spaces in form corollaries.

In this paper, we consider global weak solutions to compressible Navier–Stokes–Korteweg equations with density dependent viscosities, in a periodic domain $$\Omega = \mathbb T^3$$ , linear drag term respect the velocity. The main result concerns exponential decay equilibrium of such using log-sobolev type inequalities. order show result, starting point is weak-entropy definition, introduced D. ...

We introduce the weak gap property as a variant of the gap property. We show that in any metric space of bounded doubling dimension, any directed graph whose vertex set S has size n and which satisfies the weak gap property has total weight O(wt(MST (S)) log n), where wt(MST (S)) denotes the weight of a minimum spanning tree of S. We show that 2-optimal TSP tours and greedy spanners satisfy the...

By implementing algorithmic versions of Sapozhenko's graph container methods, we give new algorithms for approximating the number independent sets in bipartite graphs. Our first algorithm applies to d $$ -regular, graphs satisfying a weak expansion condition: when is constant, and Ω ( log 2 / ) \Omega \left({\log}^2d/d\right) -expander, obtain an FPTAS sets. Previously such result > 5 d>5 was k...

BACKGROUND In asthma, measurements of airway inflammation correlate poorly with clinical markers and airway hyperresponsiveness. While the relation between determinants of asthma severity is known, that for cough is unknown. We hypothesised that cough sensitivity changes relate to changes in cough scores and objectively measured cough frequency. AIMS To examine the relation between commonly u...

pH = pK' + log Totalconc.-Acidconc. (3) Acid conc. where pK' is the pK' of the weak acid, Acid conc. is the concentration of the weak acid, and Total conc. is the concentration of the anion of the weak acid not only in the free dissociated form but also in the undissociated form as the acid. This equation contains the three variables, pH, Total conc., and Acid conc. If the Total conc. remains t...