Simple random coverage models, well studied in Euclidean space, can also be defined on a general compact metric space. By analogy with the geometric and discrete coupon collector's problem cover times for finite Markov chains, one expects weak concentration bound distribution of time to hold under minimal assumptions. We give two such results, fixed-radius balls other sequentially arriving rand...

Let B be a complete ccc Boolean algebra and let τs be the topology on B induced by the algebraic convergence of sequences in B. 1. Either there exists a Maharam submeasure on B or every nonempty open set in (B, τs) is topologically dense. 2. It is consistent that every weakly distributive complete ccc Boolean algebra carries a strictly positive Maharam submeasure. 3. The topological space (B, τ...

‎By considering a degenerate $p(x)-$Laplacian equation‎, ‎a generalized compact embedding in weighted variable‎ ‎exponent Sobolev space is presented‎. ‎Multiplicity of positive solutions are discussed by applying fibering map approach for the‎ ‎corresponding Nehari manifold‎. 

In this paper we de ne a metric on the collection of all translation invarinat spaces on a locally compact abelian group and we study some properties of the metric space.

Let A and B be closed, convex bounded subsets of a weakly sequentially complete Banach space E which both are not compact. Then there is linear form x0⁎∈E⁎ does attain its supremum on B. In particular, given any subset A⊂E, if every x⁎∈E⁎ either attains or infimum A, then relatively The same happens for finite family but compact subsets. result only remains true in arbitrary assuming, two σ(E⁎⁎...

There are several sections. The goal is to link complex analysis and imbeddings of graphs so that graph imbeddings can be performed systematically using identification spaces based on group actions in the complex plane. We give a short primer of basic calculus and then explain some of the finer aspects that obfuscate a complete solution to the Riemann Hypothesis. This is not central to our main...