Hopf monads

We introduce and study Hopf monads on autonomous categories (i.e., monoidal categories with duals). Hopf monads generalize Hopf algebras to a non-braided (and non-linear) setting. In particular, any monoidal adjunction between autonomous categories gives rise to a Hopf monad. We extend many fundamental results of the theory of Hopf algebras (such as the decomposition of Hopf modules, the existence of integrals, Maschke's criterium of semisimplicity, etc.) to Hopf monads. We also introduce and study quasitriangular and ribbon Hopf monads (again defined in a non-braided setting).     

A Fubini theorem

Let I₀ be the σ-ideal of subsets of a Polish group generated by Borel sets which have perfectly many pairwise disjoint translates. We prove that a Fubini-type theorem holds between I₀ and the σ-ideals of Haar measure zero sets and of meager sets. We use this result to give a simple proof of a generalization of a theorem of Balcerzak-Ros?anowski-Shelah stating that I₀ on N² strongly violates the countable chain condition.     

The Riesz decomposition of finely superharmonic functions

This paper answers a question of Fuglede about minimal positive harmonic functions associated with irregular boundary points. As a consequence, an old and central problem of fine potential theory, concerning the Riesz decomposition, is resolved. Namely, it is shown that, on certain fine domains, there exist positive finely superharmonic functions which do not admit any positive finely harmonic minorant and yet are not fine potentials.     

Realization of 2-solvable nilpotent groups as groups of classes of homotopy self-equivalences

Let X be a 1-connected CW-complex of finite type and ε_?(X) be the group of homotopy classes of self-equivalences of X which induce the identity on homotopy groups. In this paper, we prove that every finitely generated 2-solvable rational nilpotent group is realizable as ε_?(X) where X is the rationalization of a 1-connected CW-complex of finite type.     

Regular variation of order 1 nonlinear AR-ARCH models

We prove both geometric ergodicity and regular variation of the stationary distribution for a class of nonlinear stochastic recursions that includes nonlinear AR-ARCH models of order 1. The Lyapounov exponent for the model, the index of regular variation and the spectral measure for the regular variation all are characterized by a simple two-state Markov chain.     

A large deviation principle for 2D stochastic Navier–Stokes equation

In this paper one specifies the ergodic behavior of the 2D-stochastic Navier–Stokes equation by giving a Large Deviation Principle for the occupation measure for large time. It describes the exact rate of exponential convergence. The considered random force is non-degenerate and compatible with the strong Feller property.     

On Genuine Bernstein–Durrmeyer Operators

We continue the studies on the so–called genuine Bernstein–Durrmeyer operators U _n by establishing a recurrence formula for the moments and by investigating the semigroup T(t) approximated by U _n . Moreover, for sufficiently smooth functions the degree of this convergence is estimated. We also determine the eigenstructure of U _n , compute the moments of T(t) and establish asymptotic formulas. Received: January 26, 2007.     

On perfectly normal dense subspaces of products

Let M be a separable metric space consisting of more than one point. We construct perfectly normal dense subspaces Z⊂Mc² and (under additional set-theoretic assumption) Y⊂Mc which are not collectionwise Hausdorff.     

Eliminating graphs by means of parallel knock-out schemes

In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex eliminates exactly one of its neighbors. The parallel knock-out number of a graph is the minimum number of rounds after which all vertices have been eliminated (if possible). The parallel knock-out number is related to well-known concepts like perfect matchings, hamiltonian cycles, and 2-factors.We derive a number of combinatorial and algorithmic results on parallel knock-out numbers: for families of sparse graphs (like planar graphs or graphs of bounded tree-width), the parallel knock-out number grows at most logarithmically with the number n of vertices; this bound is basically tight for trees. Furthermore, there is a family of bipartite graphs for which the parallel knock-out number grows proportionally to the square root of n. We characterize trees with parallel knock-out number at most 2, and we show that the parallel knock-out number for trees can be computed in polynomial time via a dynamic programming approach (whereas in general graphs this problem is known to be NP-hard). Finally, we prove that the parallel knock-out number of a claw-free graph is either infinite or less than or equal to 2.