In this paper we present a novel real-time algorithm for simultaneous pose and shape
estimation for articulated objects, such as human beings and animals. The key of our pose …

In this article, we study some classical complexity-theoretic questions regarding Group
Isomorphism (GpI). We focus on p-groups (groups of prime power order) with odd p, which …

Motivated by the desire for better isomorphism tests for finite groups, we present a
polynomial-time algorithm for deciding isomorphism within a class of p-groups that is well …

For every odd prime and every integer, there is a Heisenberg group of order that has
pairwise nonisomorphic quotients of order. Yet, these quotients are virtually …

The isomorphism problem for finite groups of order n (GpI) has long been known to be
solvable in n^\logn+O(1) time, but only recently were polynomial-time algorithms designed …

Cayley's theorem says that every finite group G can be viewed as a subgroup of a symmetric
group S m for some integer m. The minimal faithful permutation degree µ (G) of a finite group …

A tensor consists of data, $ t $, equipped with a multilinear product $\langle t| u_1,\ldots, u_
{\ell}\rangle $, called a tensor contraction. Each vector $ u_a $ comes from a space $ U_a …

For primes p> 2 and e> 3 there are at least pe− 3/e groups of order p2e+ 2 that have equal
multisets of isomorphism types of proper subgroups and proper quotient groups, isomorphic …

In this paper, we show that the constant-dimensional Weisfeiler–Leman algorithm for groups
(Brachter & Schweitzer, LICS 2020) can be fruitfully used to improve parallel complexity …

We introduce three families of characteristic subgroups that refine the traditional verbal
subgroup filters, such as the lower central series, to an arbitrary length. We prove that a …