Related papers: Sequential parametrized topological complexity of …
This survey is focused on the results related to topologies on the groups of transformations in ergodic theory, Borel, and Cantor dynamics. Various topological properties (density, connectedness, genericity) of these groups and their…
In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…
We obtain a series of results in the global theory of free boundary minimal surfaces, which in particular provide a rather complete picture for the way different complexity criteria, such as area, topology and Morse index compare, beyond…
The aim of this paper is to apply the framework, which was developed by Sam and Snowden, to study structural properties of graph homologies, in the spirit of Ramos, Miyata and Proudfoot. Our main results concern the magnitude homology of…
In recent work, Rosenbaum and Wagner showed that isomorphism of explicitly listed $p$-groups of order $n$ could be tested in $n^{\frac{1}{2}\log_p n + O(p)}$ time, roughly a square root of the classical bound. The $O(p)$ term is entirely…
For a finite function class we describe the large sample limit of the sequential Rademacher complexity in terms of the viscosity solution of a $G$-heat equation. In the language of Peng's sublinear expectation theory, the same quantity…
We design a probabilistic algorithm for computing endomorphism rings of ordinary elliptic curves defined over finite fields that we prove has a subexponential runtime in the size of the base field, assuming solely the generalized Riemann…
An overview is given of the methods for treating complicated problems without small parameters, when the standard perturbation theory based on the existence of small parameters becomes useless. Such complicated problems are typical of…
Sofic groups generalise both residually finite and amenable groups, and the concept is central to many important results and conjectures in measured group theory. We introduce a topological notion of a sofic boundary attached to a given…
We consider the following problem closely related to graph isomorphism. In a simplified version, the task is to compute the automorphism group of a given set family (or a hypergraph), that is, the group of all automorphisms of the given…
We prove that the topological recursion formalism can be used to compute the WKB expansion of solutions of second order differential operators obtained by quantization of any hyper-elliptic curve. We express this quantum curve in terms of…
Parameterized complexity seeks to use input structure to obtain faster algorithms for NP-hard problems. This has been most successful for graphs of low treewidth: Many problems admit fast algorithms relative to treewidth and many of them…
We classify up to isomorphism the quantum generalized Weyl algebras and determine their automorphism groups in all cases in a uniform way, including those where the parameter q is a root of unity, thereby completing the results obtained by…
We study automorphism groups of fibered surfaces for finite cyclic covering fibrations of an elliptic surface. We estimate the order of a finite subgroup of automorphism groups in terms of the genus of the fiber, the genus of the base…
Let $X$ be a $G$-space. In this paper, we introduce the notion of sectional category with respect to $G$. As a result, we obtain $G$-homotopy invariants: the LS category with respect to $G$, the sequential topological complexity with…
We introduce new methods for understanding the topology of $\Hom$ complexes (spaces of homomorphisms between two graphs), mostly in the context of group actions on graphs and posets. We view $\Hom(T,-)$ and $\Hom(-,G)$ as functors from…
The groups mentioned in the title are certain matrix groups of infinite size over a finite field $\mathbb F_q$. They are built from finite classical groups and at the same time they are similar to reductive $p$-adic Lie groups. In the…
The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum--Weber, 2015) and skew categories of…
Many problems are known to be solvable in subexponential parameterized time when the input graph is planar. The bidimensionality framework of Demaine, Fomin, Hajiaghay, and Thilikos [JACM'05] and the treewidth-pattern-covering approach by…
This paper establishes an upper bound on the number of generalized cospectral mates of simple graphs, where the generalized spectrum consists of the spectrum of a graph and its complement. Moving beyond the classical problem of identifying…