See by year See by month Jump to month

Erkko Lehtonen (Technische Universität Dresden): Reconstructibility of functions and minors of permutations

Download as iCal file
Wednesday, 8. March 2017, 10:00 - 12:00
Abstract. Reconstruction problems concern whether a mathematical object can be recovered from pieces of partial information about that object. We consider the problem whether a function of several arguments is uniquely determined, up to permutation of arguments, by the collection of its identification minors. We survey some known results, and we focus on the class of functions determined by the order of first occurrence.

In the analysis of the above-mentioned class, we make use of minors of permutations, which may be seen as quotients of permutations. We discuss some properties of minors of permutations. The minor relation constitutes a partial order on the set of finite permutations, and it is particularly well behaving with respect to permutation groups.
Location : Bolyai Intézet, I. emelet, Riesz terem, Aradi Vértanúk tere 1., Szeged

Back

JEvents v3.1.8 Stable   Copyright © 2006-2013