Title	What makes primary decomposition minimal
Creator	Miller, Ezra
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2018-08-06T12:31
Description	The usual definition of minimal primary decomposition in commutative algebra grants a little too much leeway. Making minimality work for real multiparameter persistence modules -- that is, multigraded modules over rings of polynomials with real exponents -- requires tighter control over what algebraists call socles and computational topologists call deaths. Functorial definitions yield finiteness statements for primary decompositions of reasonable persistence modules. In contrast, for irreducible decompositions finiteness is impossible with continuous parameters; but nonetheless minimality can be characterized by density with respect to certain topologies arising in the context of partially ordered vector spaces.
Extent	55.0
Subject	Mathematics; Algebraic topology; Statistics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Duke University
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2019-03-24
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0377389
URI	http://hdl.handle.net/2429/69147
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos