Related papers: Control measures on Boolean algebras
We present a necessary and sufficient condition for a Boolean algebra to carry a finitely additive measure.
We present necessary and sufficient conditions for the existence of a countably additive measure on a complete Boolean algebra.
A Boolean $\sigma$-algebra $B$ is a measure algebra if and only if it is weakly distributive and uniformly concentrated.
The paper investigates possible generalisations of Maharam's theorem to a classification of Boolean algebras that support a finitely additive measure. We prove that Boolean algebras that support a finitely additive non-atomic uniformly…
Let $K\subset R^n$ be a compact basic semi-algebraic set. We provide a necessary and sufficient condition (with no a priori bounding parameter) for a real sequence $y=(y_\alpha)$, $\alpha\in N^n$, to have a finite representing Borel measure…
Let $M$ be a multimeasure defined on a $\sigma$-algebra and taking values in the family of bounded non-empty subsets of a Banach space $X$. We prove that $M$ admits a control measure whenever $X$ contains no subspace isomorphic to…
We study the interplay between properties of measures on a Boolean algebra A and forcing names for ultrafilters on A. We show that several well known measure theoretic properties of Boolean algebras (such as supporting a strictly positive…
This paper considers control systems defined on Lie algebroids. After deriving basic controllability tests for general control systems, we specialize our discussion to the class of mechanical control systems on Lie algebroids. This class of…
A Boolean algebra carries a strictly positive exhaustive submeasure if and only if it has a sequential topology that is uniformly Frechet.
We show how the measure theory of regular compacted-Borel measures defined on the $\delta$-ring of compacted-Borel subsets of a weighted locally compact group $(G,\omega)$ provides a compatible framework for defining the corresponding…
We present a collection of observations and results concerning submeasures on Boolean algebras. They are all motivated by Maharam's problem and Talagrand's construction that solved it.
We investigate some properties of balayage, or, sweeping (out), of measures with respect to subclasses of subharmonic functions. The following issues are considered: relationships between balayage of measures with respect to classes of…
We prove general results about separation and weak$^\#$-convergence of boundedly finite measures on separable metric spaces and Souslin spaces. More precisely, we consider an algebra of bounded real-valued, or more generally a $*$-algebra…
We introduce the antipodal pairs property for probability measures on finite Boolean algebras and prove that conditional versions imply strong forms of log-concavity. We give several applications of this fact, including improvements of some…
We investigate reflection-type problems on the class SPM, of Boolean algebras carrying strictly positive finitely additive measures. We show, in particular, that in the constructible universe there is a Boolean algebra $\mathfrak A$ which…
We prove new quantitative bounds on the additive structure of sets obeying an $L^3$ 'control' assumption, which arises naturally in several questions within additive combinatorics. This has a number of applications - in particular we…
We prove a new lower bound for the Mahler measure of a polynomial in one and in several variables that depends on the complex coefficients, and the number of monomials. In one variable our result generalizes a classical inequality of…
Analytic properties of right topological groups have been extensively studied in the compact admissible case (i.e when the group has a dense topological center). This was inspired by the existence of a Haar measure on such groups. In this…
We will study the controllability problem of a bilinear control system on $\mathbb{R}^2:$ the main result is the characterization of the Lie algebra rank condition for the system. On the other hand, using elementary techniques, we recover…
New measures for the quantization of systems with constraints are discussed and applied to several examples, in particular, examples of alternative but equivalent formulations of given first-class constraints, as well as a comparison of…