We show that proving the conjectured sharp constant in a theorem of Dennis Sullivan concerning convex sets in hyperbolic 3-space would imply the Brennan conjecture. We also prove that any conformal map$f$:$D$→Ω can be factored as a$K$-quasiconformal self-map of the disk (with$K$independent of Ω) and a map$g$:$D$→Ω with derivative bounded away from zero. In particular, there is always a Lipschitz homeomorphism from any simply connected Ω (with its internal path metric) to the unit disk.

The statistical structure on a manifold M is predicated upon a special kind of coupling between the Riemannian metric g and a torsion-free affine connection ∇ on the TM, such that ∇g is totally symmetric, forming, by definition, a “Codazzi pair” t∇, gu. In this paper, we first investigate various transformations of affine connections, including additive translation (by an arbitrary (1,2)-tensor K), multiplicative perturbation (through an arbitrary invertible operator L on TM), and conjugation (through a non-degenerate two-form h). We then study the Codazzi coupling of ∇ with h and its coupling with L, and the link between these two couplings. We introduce, as special cases of K-translations, various transformations that generalize traditional projective and dual-projective transformations, and study their commutativity with L-perturbation and h-conjugation transformations. Our derivations allow affine connections to carry torsion, and we investigate conditions under which torsions are preserved by the various transformations mentioned above. While reproducing some known results regarding Codazzi transform, conformal-projective transformation, etc., we extend much of these geometric relations, and hence obtain new geometric insights, for the general case of a non-degenerate two-form h (instead of the symmetric g) and an affine connection with possibly non-vanishing torsion. Our systematic approach establishes a general setting for the study of Information Geometry based on transformations and coupling relations of affine connections.

Szemerédi's regularity lemma and its variants are some of the most powerful tools in combinatorics. In this paper, we establish several results around the regularity lemma. First, we prove that whether or not we include the condition that the desired vertex partition in the regularity lemma is equitable has a minimal effect on the number of parts of the partition. Second, we use an algorithmic version of the (weak) Frieze–Kannan regularity lemma to give a substantially faster deterministic approximation algorithm for counting subgraphs in a graph. Previously, only an exponential dependence for the running time on the error parameter was known, and we improve it to a polynomial dependence. Third, we revisit the problem of finding an algorithmic regularity lemma, giving approximation algorithms for several co-NP-complete problems. We show how to use the weak Frieze–Kannan regularity lemma to approximate the regularity of a pair of vertex subsets. We also show how to quickly find, for each ε′>ε, an ε′-regular partition with k parts if there exists an ε-regular partition with k parts. Finally, we give a simple proof of the permutation regularity lemma which improves the tower-type bound on the number of parts in the previous proofs to a single exponential bound.

No abstract uploaded!

No abstract uploaded!