12 research outputs found
Extensions of Normed Algebras
We review and analyse techniques from the literature for extending a normed
algebra, A to a normed algebra, B, so that B has interesting or desirable
properties which A may lack. For example, B might include roots of monic
polynomials over A.
These techniques have been important historically for constructing examples
in the theory of Banach algebras. We construct new examples in this way.
Elsewhere we contribute to the related programme of determining which
properties of an algebra are shared by certain extensions of it.
Similarly, we consider the relations between the topological spaces, M(A) and
M(B), of closed, maximal ideals of A and B respectively. For example, it is
shown that if B is one of the types of 'algebraic extensions' of A constructed
in the thesis and M(B) has trivial first Cech-cohomology group then so has
M(A).
The invertible group of a normed algebra is studied in Chapter 4; it is shown
that if a Banach algebra, A, has dense invertible group then so has every
integral extension of A. The context for this work is also explained: some new
results characterising trivial uniform algebras by means of approximation by
invertible elements are given. We show how these results partially answer a
famous, open problem of Gelfand.
Results in Chapter 4 lead to the conjecture that a uniform algebra is trivial
if the group of exponentials of its elements is dense in the algebra. We
investigate this conjecture in Chapter 5. In the search for a counterexample,
we construct and establish some properties of `logarithmic extensions' of a
regular uniform algebra.Comment: Ph.D. Thesis, University of Nottingham, 2003. 76 pages; plain Te
Reconstruction of functions from minors
The central notion of this thesis is the minor relation on functions of several arguments. A function f: A^nâB is called a minor of another function g: A^mâB if f can be obtained from g by permutation of arguments, identification of arguments, and introduction of inessential arguments. We first provide some general background and context to this work by presenting a brief survey of basic facts and results concerning different aspects of the minor relation, placing some emphasis on the authorâs contributions to the field.
The notions of functions of several arguments and minors give immediately rise to the following reconstruction problem: Is a function f: A^nâB uniquely determined, up to permutation of arguments, by its identification minors, i.e., the minors obtained by identifying a pair of arguments? We review known results â both positive and negative â about the reconstructibility of functions from identification minors, and we outline the main ideas of the proofs, which often amount to formulating and solving reconstruction problems for other kinds of mathematical objects.
We then turn our attention to functions determined by the order of first occurrence, and we are interested in the reconstructibility of such functions. One of the main results of this thesis states that the class of functions determined by the order of first occurrence is weakly reconstructible. Some reconstructible subclasses are identified; in particular, pseudo-Boolean functions determined by the order of first occurrence are reconstructible.
As our main tool, we introduce the notion of minor of permutation. This is a quotient-like construction for permutations that parallels minors of functions and has some similarities to permutation patterns. We develop the theory of minors of permutations, focusing on Galois connections induced by the minor relation and on the interplay between permutation groups and minors of permutations. Our results will then find applications in the analysis of the reconstruction problem of functions determined by the order of first occurrence
Natural Communication
In Natural Communication, the author criticizes the current paradigm of specific goal orientation in the complexity sciences. His model of "natural communication" encapsulates modern theoretical concepts from mathematics and physics, in particular category theory and quantum theory. The author is convinced that only by looking to the past is it possible to establish continuity and coherence in the complexity science
LIPIcs, Volume 244, ESA 2022, Complete Volume
LIPIcs, Volume 244, ESA 2022, Complete Volum
Foundations of Software Science and Computation Structures
This open access book constitutes the proceedings of the 23rd International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2020, which took place in Dublin, Ireland, in April 2020, and was held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020. The 31 regular papers presented in this volume were carefully reviewed and selected from 98 submissions. The papers cover topics such as categorical models and logics; language theory, automata, and games; modal, spatial, and temporal logics; type theory and proof theory; concurrency theory and process calculi; rewriting theory; semantics of programming languages; program analysis, correctness, transformation, and verification; logics of programming; software specification and refinement; models of concurrent, reactive, stochastic, distributed, hybrid, and mobile systems; emerging models of computation; logical aspects of computational complexity; models of software security; and logical foundations of data bases.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS'09)
The Symposium on Theoretical Aspects of Computer Science (STACS) is held alternately in France and in Germany. The conference of February 26-28, 2009, held in Freiburg, is the 26th in this series. Previous meetings took place in Paris (1984), Saarbr¨ucken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992), W¨urzburg (1993), Caen (1994), M¨unchen (1995), Grenoble (1996), L¨ubeck (1997), Paris (1998), Trier (1999), Lille (2000), Dresden (2001), Antibes (2002), Berlin (2003), Montpellier (2004), Stuttgart (2005), Marseille (2006), Aachen (2007), and Bordeaux (2008). ..
Foundations of Software Science and Computation Structures
This open access book constitutes the proceedings of the 23rd International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2020, which took place in Dublin, Ireland, in April 2020, and was held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020. The 31 regular papers presented in this volume were carefully reviewed and selected from 98 submissions. The papers cover topics such as categorical models and logics; language theory, automata, and games; modal, spatial, and temporal logics; type theory and proof theory; concurrency theory and process calculi; rewriting theory; semantics of programming languages; program analysis, correctness, transformation, and verification; logics of programming; software specification and refinement; models of concurrent, reactive, stochastic, distributed, hybrid, and mobile systems; emerging models of computation; logical aspects of computational complexity; models of software security; and logical foundations of data bases.