Title	On the relational complexity of a finite permutation group
Creator	Gill, Nick
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2019-08-26T15:31
Description	Motivated by questions in model theory, Greg Cherlin introduced the idea of â relational complexityâ , a statistic connected to finite permutation groups. He also stated a conjecture classifying those permutation groups with minimal relational complexity. We report on recent progress towards a proof of this conjecture. We also make some remarks about permutation groups with large relational complexity, and we explain how this statistic relates to others in the literature, notably base-size.
Extent	51.0 minutes
Subject	Mathematics; Group theory and generalizations; Geometry; Algebraic structures
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Univ of South Wales
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2020-02-23
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0388677
URI	http://hdl.handle.net/2429/73581
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Researcher
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos