Related papers: A user's guide to cloning systems
This paper gives a systematic construction of certain covers of finite semigroups. These covers will be used in future work on the complexity of finite semigroups.
A certain family of orthogonal groups (called "Clifford groups" by G. E. Wall) has arisen in a variety of different contexts in recent years. These groups have a simple definition as the automorphism groups of certain generalized…
We present an approach to design stabilizing controllers for a set of linear systems without restrictions regarding their modeling order. To this end, the systems are treated as abstract objects in the space of the $\nu$-gap metric. Via a…
Let $G$ be a group. The \emph{power graph} of $G$ is a graph with the vertex set $G$, having an edge between two elements whenever one is a power of the other. We characterize nilpotent groups whose power graphs have finite independence…
In this paper, we present a general scheme to construct integrable systems based on realization in the coboundary dynamical Poisson groupoids of Etingof and Varchenko. We also present a factorization method for solving the Hamiltonian…
This document gives a list of finite semigroups that are interesting from the point of view of Krohn-Rhodes complexity theory. The list will be expanded and updates as "time goes by".
We demonstrate that spin chains are experimentally feasible using electrons confined in micro-Penning traps, supplemented with local magnetic field gradients. The resulting Heisenberg-like system is characterized by coupling strengths…
We describe a procedure for creating infinite families of knots, each having the maximum degree of their HOMFLY polynomial strictly less than twice their canonical genus. These families build upon examples first found by Stoimenow.
Learning of continuous exponential family distributions with unbounded support remains an important area of research for both theory and applications in high-dimensional statistics. In recent years, score matching has become a widely used…
We develop an algorithm for recognizing whether a character belongs to $\Sigma^m$. In order to apply it we just need to know that the ambient group is of type $\mathrm{FP}_m$ or of type $\mathrm{F}_2$ and that the word problem is solvable…
We introduce a new method for performing clustering with the aim of fitting clusters with different scatters and weights. It is designed by allowing to handle a proportion $\alpha$ of contaminating data to guarantee the robustness of the…
In this paper we present a new family of discrete sequences having "random like" uniformly decaying auto-correlation properties. The new class of infinite length sequences are higher order chirps constructed using irrational numbers.…
We provide a simplified characterization of entanglement in physical systems which are symmetric under the action of subgroups of the symmetric group acting on the party labels. Sets of entanglements are inherently equal, lying in the same…
We investigate fixed-point properties of automorphisms of groups similar to R. Thompson's group $F$. Revisiting work of Gon\c{c}alves-Kochloukova, we deduce a cohomological criterion to detect infinite fixed-point sets in the…
We introduce the concept of generalized almost plastic structure, and, on a pseudo-Riemannian manifold endowed with two $(1,1)$-tensor fields satisfying some compatibility conditions, we construct a family of generalized almost plastic…
We study asymptotics of random shifted Young diagrams which correspond to a given sequence of reducible projective representations of the symmetric groups. We show limit results (Law of Large Numbers and Central Limit Theorem) for their…
Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoint, few results are known. S{\'e}nizergues and the fifth author (ICALP2018) proved that the isomorphism problem for virtually free groups is…
A special homotopy continuation method, as a combination of the polyhedral homotopy and the linear product homotopy, is proposed for computing all the isolated solutions to a special class of polynomial systems. The root number bound of…
We find an algorithmic procedure that enables to compute and to describe the structure of the isotropy subgroups of the group of complex orthogonal matrices with respect to the action of similarity on complex symmetric matrices. A key step…
A new pair of asymptotic invariants for finitely presented groups, called intrinsic and extrinsic tame filling functions, are introduced. These filling functions are quasi-isometry invariants that strengthen the notions of intrinsic and…