The Dynkin system generated by balls in contains all Borel sets

We show that for every each Borel subset of the space with the Euclidean metric can be generated from closed balls by complements and countable disjoint unions.

     

Mazur intersection property for Asplund spaces

The main result of the present note states that it is consistent with the ZFC axioms of set theory (relying on Martin's Maximum MM axiom), that every Asplund space of density character ω₁ has a renorming with the Mazur intersection property. Combined with the previous result of Jiménez and Moreno (based upon the work of Kunen under the continuum hypothesis) we obtain that the MIP renormability of Asplund spaces of density ω₁ is undecidable in ZFC.     

Crown reductions for the Minimum Weighted Vertex Cover problem

The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown rules: some new directions in FPT, in: Proceedings of the 29th International Workshop on Graph Theoretic Concepts in Computer Science (WG’03), Lecture notes in computer science, vol. 2880, 2003, pp. 1-12, Kernelization algorithms for the vertex cover problem: theory and experiments, in: Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, Louisiana, January 2004, pp. 62-69]. We describe in detail a close relation of crown reductions to Nemhauser and Trotter reductions that are based on the linear programming relaxation of the problem. We introduce and study the so-called strong crown reductions, suitable for finding (or counting) all minimum vertex covers, or finding a minimum vertex cover under some additional constraints. It is described how crown decompositions and strong crown decompositions suitable for such problems can be computed in polynomial time. For weighted König-Egerváry graphs (G,w) we observe that the set of vertices belonging to all minimum vertex covers, and the set of vertices belonging to no minimum vertex covers, can be efficiently computed.Further, for some specific classes of graphs, simple algorithms for the MIN-VC problem with a constant approximation factor r<2 are provided. On the other hand, we conclude that for the regular graphs, or for the Hamiltonian connected graphs, the problem is as hard to approximate as for general graphs.It is demonstrated how the results about strong crown reductions can be used to achieve a linear size problem kernel for some related vertex cover problems.     

A mean value theorem on bounded symmetric domains

Let be a Cartan domain of rank and genus and , , the Berezin transform on ; the number can be interpreted as a certain invariant-mean-value of a function around . We show that a Lebesgue integrable function satisfying , , must be -harmonic. In a sense, this result is reminiscent of Delsarte's two-radius mean-value theorem for ordinary harmonic functions on the complex -space , but with the role of radius played by the quantity .

     

On dimension-free Sobolev imbeddings I

We prove dimension-invariant imbedding theorems for Sobolev spaces using the Gross logarithmic inequality.     

On the Hahn-Banach Extension Property in Hardy and mixed norm spaces on the unit ball

For a nonempty setE of nonnegative integers letH _E ^{p, q, a} andH _E ^p be the closed linear span of

Congruence-preserving functions on Stone and Kleene algebras

We investigate local polynomial functions on Stone algebras and on Kleene algebras. We find a generating set for the clone of all local polynomial functions. We also represent local polynomial functions on a given algebra by polynomial functions of some canonical extension of this algebra.     

Analytic models for commuting operator tuples on bounded symmetric domains

For a domain in and a Hilbert space of analytic functions on which satisfies certain conditions, we characterize the commuting -tuples of operators on a separable Hilbert space  such that is unitarily equivalent to the restriction of to an invariant subspace, where is the operator -tuple on the Hilbert space tensor product  . For the unit disc and the Hardy space , this reduces to a well-known theorem of Sz.-Nagy and Foias; for a reproducing kernel Hilbert space on such that the reciprocal of its reproducing kernel is a polynomial in and  , this is a recent result of Ambrozie, Müller and the second author. In this paper, we extend the latter result by treating spaces for which ceases to be a polynomial, or even has a pole: namely, the standard weighted Bergman spaces (or, rather, their analytic continuation) on a Cartan domain corresponding to the parameter in the continuous Wallach set, and reproducing kernel Hilbert spaces for which is a rational function. Further, we treat also the more general problem when the operator is replaced by ,  being a certain generalization of a unitary operator tuple. For the case of the spaces on Cartan domains, our results are based on an analysis of the homogeneous multiplication operators on , which seems to be of an independent interest.

     

Separation in distributive congruence lattices

We define separable sets in algebraic lattices. For a finitely generated congruence distributive variety V \mathcal{V} , we show a close connection between non-separable sets in congruence lattices of algebras in V \mathcal{V} and the structure of subdirectly irreducible algebras in V \mathcal{V} . We apply the general results to some lattice varieties.     

End-labeling of peptide nucleic acid with osmium complex. Voltammetry at carbon and mercury electrodes

Peptide nucleic acid (PNA), the DNA mimic with electrically neutral pseudopeptide backbone, is intensively used in biotechnologies and particularly in single-base mismatch detection in DNA hybridization sensors. We propose a simple method of covalent end-labeling of PNA with osmium tetroxide, 2,2′-bipyridine (Os,bipy). Os,bipy-modified PNA (PNA–Os,bipy) produces voltammetric stripping peaks at carbon and mercury electrodes. Peak potential (E_p) of one of the anodic peaks of PNA–Os,bipy at the pyrolytic graphite electrode (PGE) differs from E_p of the reagent, allowing PNA–Os,bipy analysis directly in the reaction mixture. At the hanging mercury drop electrode (HMDE) the PNA–Os,bipy yields a catalytic peak Cat_p, in addition to the redox couples. Using Cat_p it is possible to detect purified PNA–Os,bipy down to 1 pM concentration at accumulation time 60 s. To our knowledge this is the highest sensitivity of the electrochemical detection of PNA.