New automatic properties: subadditivity, convexity, uniformity

Bingham, N. H. and Ostaszewski, Adam ORCID: 0000-0003-2630-8663 (2007) New automatic properties: subadditivity, convexity, uniformity. . London School of Economics and Political Science, London, UK.

Full text not available from this repository.

Abstract

We examine various related instances of automatic properties of functions -- that is, cases where a weaker property necessarily implies a stronger one under suitable side-conditions, e.g. connecting geometric and combinatorial features of their domains. The side-conditions offer a common approach to (mid-point) convex, subadditive and regularly varying functions (the latter by way of the uniform convergence theorem). We examine generic properties of the domain sets in the side-conditions - properties that hold typically, or off a small exceptional set. The genericity aspects develop earlier work of Kestelman and of Borwein and Ditor. The paper includes proofs of three new analytic automaticity theorems announced in Research Report LSE-CDAM-2007-24.

Item Type:	Monograph (Report)
Official URL:	http://www.cdam.lse.ac.uk/Reports/
Additional Information:	© 2007 London school of economics and political science
Divisions:	Mathematics
Subjects:	H Social Sciences > H Social Sciences (General)
Date Deposited:	10 Jul 2008 08:59
Last Modified:	01 Oct 2024 03:22
URI:	http://eprints.lse.ac.uk/id/eprint/6825

Actions (login required)

View Item