Konstantin Slutsky
Assistant Professorat Iowa State University
Research Interests
Descriptive set theory, ergodic theory, topological dynamics, motion planning.
Publications
List of publications grouped by topics.
Borel Dynamics and Ergodic Theory

L1 full groups of flows preprint.
We introduce the concept of an L1 full group associated with a measurepreserving action of a Polish normed group on a standard probability space. Such groups are shown to carry a natural separable complete metric, and are thus Polish. Our construction generalizes L1 full groups of actions of discrete groups, which have been studied recently by the first author.
We show that under minor assumptions on the actions, topological derived subgroups of L1 full groups are topologically simple and—when the acting group is locally compact and amenable—are whirly amenable and generically twogenerated. L1 full groups of actions of compactly generated locally compact Polish groups are shown to remember the L1 orbit equivalence class of the action.
For measurepreserving actions of the real line (also known as measurepreserving flows), the topological derived subgroup of an L1 full groups is shown to coincide with the kernel of the index map, which implies that L1 full groups of free measurepreserving flows are topologically finitely generated if and only if the flow admits finitely many ergodic components. The latter is in a striking contrast to the case of \( \mathbb{Z} \)actions, where the number of topological generators is controlled by the entropy of the action.
We also study the coarse geometry of the L1 full groups. The L1 norm on the derived subgroup of the L1 full group of an aperiodic action of a locally compact amenable group is proved to be maximal in the sense of Rosendal. For measurepreserving flows, this holds for the L1 norm on all of the L1 full group

Katok's special representation theorem for multidimensional Borel flows Ergod. Th. & Dynam. Sys. (2023), 118.
Katok's special representation theorem states that any free ergodic measurepreserving \(\mathbb{R}^{d}\)flow can be realized as a special flow over a \(\mathbb{Z}^{d}\)action. It provides a multidimensional generalization of the "flow under a function" construction. We prove the analog of Katok's theorem in the framework of Borel dynamics and show that, likewise, all free Borel \(\mathbb{R}^{d}\)flows emerge from \(\mathbb{Z}^{d}\)actions through the special flow construction using biLipschitz cocycles.

Free Borel \( \mathbb{R}^d \)flows are smoothly equivalent if there is a Borel bijection between the phase spaces that maps orbits onto orbits and is a \(C^\infty\)smooth orientation preserving diffeomorphism between orbits. We show that all free nontame Borel \(\mathbb{R}^d\)flows are smoothly equivalent in every dimension \(d \ge 2\). This answers a question of B. Miller and C. Rosendal.

This paper addresses the notion of time change equivalence for Borel \(\mathbb{R}^d\)flows. We show that all free \(\mathbb{R}^d\)flows are time change equivalent up to a compressible set. An appropriate version of this result for nonfree flows is also given.

Any free Borel flow is shown to admit a cross section with only two possible distances between adjacent points. Non smooth flows are proved to be Lebesgue orbit equivalent if and only if they admit the same number of invariant ergodic probability measures.

Lebesgue orbit equivalence of multidimensional Borel flows Ergod. Th. & Dynam. Sys. 37 (2017), no. 6, 1966–1996.
The main result of the paper is classification of free multidimensional Borel flows up to Lebesgue Orbit Equivalence, by which we understand an orbit equivalence that preserves the Lebesgue measure on each orbit. Two non smooth Euclidean flows are shown to be Lebesgue Orbit Equivalence if and only if they admit the same number of invariant ergodic probability measures.
Topological Groups

We construct Graev ultrametrics on free products of groups with twosided invariant ultrametrics and HNN extensions of such groups. We also introduce a notion of a free product of general Polish groups and prove, in particular, that two Polish groups \( G \) and \( H \) can be embedded into a Polish group \( T \) in such a way that the subgroup of \( T \) generated by \( G \) and \( H \) is isomorphic to the free product \( G*H \).

Graev metrics on free products and HNN extensions Trans. Amer. Math. Soc. 366 (2014), no. 12, 6353–6395.
We give a construction of twosided invariant metrics on free products (possibly with amalgamation) of groups with twosided invariant metrics and, under certain conditions, on HNN extensions of such groups. Our approach is similar to the Graev's construction of metrics on free groups over pointed metric spaces.

Automatic continuity for homomorphisms into free products J. Symbolic Logic 78 (2013), no. 4, 1288–1306.
A homomorphism from a completely metrizable topological group into a free product of groups whose image is not contained in a factor of the free product is shown to be continuous with respect to the discrete topology on the range. In particular, any completely metrizable group topology on a free product is discrete.

Nongenericity phenomenon in some ordered Fraïssé classes J. Symbolic Logic 77 (2012), no. 3, 987–1010.
We show that every twodimensional class of topological similarity, and hence every diagonal conjugacy class of pairs, is meager in the group of order preserving bijections of the rationals and in the group of automorphisms of the randomly ordered rational Urysohn space.
Autonomous Systems

MinimumViolation Planning for Autonomous Systems: Theoretical and Practical Considerations 2021 American Control Conference (ACC), 2021, pp. 48664872.
This paper considers the problem of computing an optimal trajectory for an autonomous system that is subject to a set of potentially conflicting rules. First, we introduce the concept of prioritized safety specifications, where each rule is expressed as a temporal logic formula with its associated weight and priority. The optimality is defined based on the violation of such prioritized safety specifications. We then introduce a class of temporal logic formulas called siFLTLGX and develop an efficient, incremental samplingbased approach to solve this minimumviolation planning problem with guarantees on asymptotic optimality. We illustrate the application of the proposed approach in autonomous vehicles, showing that siFLTLGX formulas are sufficiently expressive to describe many traffic rules. Finally, we discuss practical considerations and present simulation results for a vehicle overtaking scenario.

Hierarchical Multiobjective Shortest Path Problems In: LaValle S.M., Lin M., Ojala T., Shell D., Yu J. (eds) Algorithmic Foundations of Robotics XIV. WAFR 2020. Springer Proceedings in Advanced Robotics, vol 17.
We consider the shortest path problem on graphs with weights taking values in Cartesian products of cost monoids. Such cost structures appear in multiobjective planning including, for instance, the minimumviolation planning framework. It is known that these products often do not satisfy the conditions of a cost monoid. Classical dynamic programming graph search algorithms may therefore fail to find an optimal solution. We isolate the concept of a regular cost monoid and propose an iterative search algorithm that finds an optimal path in graphs weighted by products of such costs. Our algorithm allows this class of multiobjective planning problems to be solved in polynomial time.

Liability, Ethics, and CultureAware Behavior Specification using Rulebooks 2019 International Conference on Robotics and Automation (ICRA), 8536–8542.
The behavior of selfdriving cars must be compatible with an enormous set of conflicting and ambiguous objectives, from law, from ethics, from the local culture, and so on. This paper describes a new way to conveniently define the desired behavior for autonomous agents, which we use on the selfdriving cars developed at nuTonomy. We define a "rulebook" as a preordered set of "rules", each akin to a violation metric on the possible outcomes ("realizations"). The rules are partially ordered by priority. The semantics of a rulebook imposes a preorder on the set of realizations. We study the compositional properties of the rulebooks, and we derive which operations we can allow on the rulebooks to preserve previouslyintroduced constraints. While we demonstrate the application of these techniques in the selfdriving domain, the methods are domainindependent.
Miscellaneous

Riemann Rearrangement Theorem for some types of convergence J. Math. Anal. Appl. 373 (2011), no. 2, 605–613.
We reexamine the Riemann Rearrangement Theorem for different types of convergence and classify possible sum ranges for statistically convergent series and for series that converge along the 2nfilter.
Unpublished Notes

Given a set of positive reals we provide a necessary and sufficient condition for a free Borel flow to admit a cross section with all distances between adjacent points coming from this set.
Lecture Notes

This lecture notes form an eight week introductory course to topological groups of Cantor systems. Some of the topics covered by the notes include: Verhsik maps and Bratteli diagrams, flip conjugacy, commutator subgroup, amenability of full groups.

These are the notes from a semester long course taught at UIC in the Fall of 2015. They cover compressible and hyperfinite relations, including Nadkarni's characterization of compressibility, classfification of hyperfinite relations by Dougherty, Jackson, and Kechris, and some examples of groups that give rise to hyperfinite relations only, after Jackson, Kechris, and Louveau.