Related papers: Finite matrix multiplication algorithms from infin…
We introduce a practical construction of group-equivariant and permutation-invariant functions of $N$ variables given a finite-dimensional space stable with respect to the group action. The construction applies to any connected linear Lie…
We describe the structure of the irreducible representations of crossed products of unital C*-algebras by actions of finite groups in terms of irreducible representations of the C*-algebras on which the groups act. We then apply this…
The multiplication of matrices is an important arithmetic operation in computational mathematics. In the context of hierarchical matrices, this operation can be realized by the multiplication of structured block-wise low-rank matrices,…
A graphical expansion formula for non-commutative matrix integrals with values in a finite-dimensional real or complex von Neumann algebra is obtained in terms of ribbon graphs and their non-orientable counterpart called Moebius graphs. The…
Finite determinacy for mappings has been classically thoroughly studied in numerous scenarios in the real- and complex-analytic category and in the differentiable case. It means that the map-germ is determined, up to a given equivalence…
We explore the graded and filtered formality properties of finitely generated groups by studying the various Lie algebras over a field of characteristic 0 attached to such groups, including the Malcev Lie algebra, the associated graded Lie…
We construct finitely generated groups with strong fixed point properties. Let $\mathcal{X}_{ac}$ be the class of Hausdorff spaces of finite covering dimension which are mod-$p$ acyclic for at least one prime $p$. We produce the first…
In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This…
We present a new fast search algorithm for <m,m,m> Triple Product Property (TPP) triples as defined by Cohn and Umans in 2003. The new algorithm achieves a speed-up factor of 40 up to 194 in comparison to the best known search algorithm.…
We study the affine quantum Schur algebras corresponding to the affine Hecke algebras of type C with three parameters. Multiplication formulas for semisimple generators are derived for these algebras. We prove that they admit a…
The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…
We introduce a new quasi-isometry invariant for finitely generated groups and show that every group with this property admits a subshift which is effectively closed by patterns and that cannot be realized as the topological factor of any…
In this work, we show how to parameterize a density matrix that has an arbitrary symmetry, knowing the generators of the Lie algebra (if the symmetry group is a connected Lie group) or the generators of its underlying group (in case it is…
We present the derivation of the 6-dimensional Eulerian Lie group of the form SO(3,C). We describe our derivation process, which involves the creation of a finite group by using permutation matrices, and the exponentiation of the adjoint…
Groups of almost upper triangular infinite matrices with entries indexed by integers are studied. It is shown that, when the matrices are over a finite field, these groups admit a nondiscrete totally disconnected, locally compact group…
Given a finitely generated linear group $G$ over $\mathbb{Q}$, we construct a simple group $\Gamma$ that has the same finiteness properties as $G$ and admits $G$ as a quasi-retract. As an application, we construct a simple group of type…
We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…
Preface (A.Vershik) - about these texts (3.); I.Interpolation between inductive and projective limits of finite groups with applicatons to linear groups over finite fields; II.The characters of the groups of almost triangle matrices over…
Finding the Lie-algebraic closure of a handful of matrices has important applications in quantum computing and quantum control. For most realistic cases, the closure cannot be determined analytically, necessitating an explicit numerical…
Many finite groups, including all finite non-abelian simple groups, can be symmetrically generated by involutions. In this paper we give an algorithm to symmetrically represent elements of finite groups and to transform symmetrically…