The Influence of Beating of Pulp on Fiber Length and Fiber Length Distribution

1. Introduction Recent studies and researchers assume that certain relationships exist between different properties of pulp - such as between bulk, tearing resistance, bursting strength, tensile strength, freeness, and fiber length index. It has been found furthermore that such relations are different for different types of pulp and that some may even vary from pulp to pulp of the same type

The symplectic ideal and a double centraliser theorem

Let G be a reductive connected linear algebraic group over an algebraically closed field of positive characteristic and let g be its Lie algebra. First we correct and generalise a well-known result about the Picard group of G. Then we prove that, if the derived group is simply connected and \g satisfies a mild condition, the algebra K[G]^g of regular functions on G that are invariant under the action of g derived from the conjugation action, is a unique factorisation domain

Coarse median structures and homomorphisms from Kazhdan groups

We study Bowditch's notion of a coarse median on a metric space and formally introduce the concept of a coarse median structure as an equivalence class of coarse medians up to closeness. We show that a group which possesses a uniformly left-invariant coarse median structure admits only finitely many conjugacy classes of homomorphisms from a given group with Kazhdan's property (T). This is a common generalization of a theorem due to Paulin about the outer automorphism group of a hyperbolic group with property (T) as well as of a result of Behrstock-Drutu-Sapir on the mapping class groups of orientable surfaces. We discuss a metric approximation property of finite subsets in coarse median spaces extending the classical result on approximation of Gromov hyperbolic spaces by trees.Comment: 23 pages, v2: Minor revision following the referee's suggestions. The final publication is available at link.springer.com via https://doi.org/10.1007/s10711-015-0090-

Persisting randomness in randomly growing discrete structures: graphs and search trees

The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values. Using examples from random graph theory and search algorithms we show how such persistence of randomness can be detected and quantified with techniques from discrete potential theory. We also show that this approach can be used to obtain strong limit theorems in cases where previously only distributional convergence was known.Comment: Official journal fil