English
Related papers

Related papers: Space Efficient Representations of Finite Groups

200 papers

A finite group of order $n$ can be represented by its Cayley table. In the word-RAM model the Cayley table of a group of order $n$ can be stored using $O(n^2)$ words and can be used to answer a multiplication query in constant time. It is…

Data Structures and Algorithms · Computer Science 2023-03-06 Bireswar Das , Anant Kumar , Shivdutt Sharma , Dhara Thakkar

We show that there is a dense set $\ourset\subseteq \mathbb{N}$ of group orders and a constant $c$ such that for every $n\in \ourset$ we can decide in time $O(n^2(\log n)^c)$ whether two $n\times n$ multiplication tables describe isomorphic…

Computational Complexity · Computer Science 2021-04-13 Heiko Dietrich , James B. Wilson

A novel approach to the finite dimensional representation theory of the entire Lorentz group $\operatorname{O}(1,3)$ is presented. It is shown how the entire Lorentz group may be understood as a semi-direct product between its identity…

Mathematical Physics · Physics 2025-04-11 Craig McRae

We study the problem of finding a subgroup of a given order in a finite group, where the group is represented by its Cayley table. We analyze the complexity of the problem in the special case of abelian groups and present an optimal…

Computational Complexity · Computer Science 2026-02-26 K. Lakshmanan

Motivated by expansion in Cayley graphs, we show that there exist infinitely many groups $G$ with a nontrivial irreducible unitary representation whose average over every set of $o(\log\log|G|)$ elements of $G$ has operator norm $1 - o(1)$.…

Combinatorics · Mathematics 2017-05-15 Yufei Zhao

A classic data structure problem is to preprocess a string T of length $n$ so that, given a query $q$, we can quickly find all substrings of T with Hamming distance at most $k$ from the query string. Variants of this problem have seen…

Data Structures and Algorithms · Computer Science 2026-04-03 Jackson Bibbens , Levi Borevitz , Samuel McCauley

We consider preprocessing a set $S$ of $n$ points in convex position in the plane into a data structure supporting queries of the following form: given a point $q$ and a directed line $\ell$ in the plane, report the point of $S$ that is…

Computational Geometry · Computer Science 2017-10-16 Boris Aronov , Prosenjit Bose , Erik D. Demaine , Joachim Gudmundsson , John Iacono , Stefan Langerman , Michiel Smid

Given a partition of an n element set into equivalence classes, we consider time-space tradeoffs for representing it to support the query that asks whether two given elements are in the same equivalence class. This has various applications…

Data Structures and Algorithms · Computer Science 2013-06-19 Moshe Lewenstein , J. Ian Munro , Venkatesh Raman

We propose a new generalisation of Cayley automatic groups, varying the time complexity of computing multiplication, and language complexity of the normal form representatives. We first consider groups which have normal form language in the…

Group Theory · Mathematics 2021-08-18 Dmitry Berdinsky , Murray Elder , Prohrak Kruengthomya

Previous formulations of group theory in ACL2 and Nqthm, based on either "encapsulate" or "defn-sk", have been limited by their failure to provide a path to proof by induction on the order of a group, which is required for most interesting…

Logic in Computer Science · Computer Science 2022-05-27 David M. Russinoff

Optimal control in general, and flatness-based control in particular, of robotic arms necessitate to compute the first and second time derivatives of the joint torques/forces required to achieve a desired motion. In view of the required…

Robotics · Computer Science 2025-06-13 Andreas Mueller

Let G be a Lie group, $g = Lie(G)$ - its Lie algebra, $g*$ - the dual vector space and $\widehat G$ - the set of equivalence classes of unitary irreducible representations of $G$. The orbit method [1] establishes a correspondence between…

Representation Theory · Mathematics 2025-07-08 Dmitry Fuchs , Alexandre Kirillov

We study the class of 3-dimensional nonlinear 2-hessian equations mentioned in the text. We perform preliminary group classification on 2-hessian equation. In fact, we find additional equivalence transformation on the space (x,y,z,u,f),…

Differential Geometry · Mathematics 2019-02-08 Mahdieh Yourdkhany , Mehdi Nadjafikhah , Megerdich Toomanian

By considering appropriate finite covering spaces of closed non-orientable surfaces, we construct linear representations of their mapping class group which have finite index image in certain big arithmetic groups.

Geometric Topology · Mathematics 2014-02-20 Ferit Deniz , Wilhelm Singhof

The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…

Computational Complexity · Computer Science 2020-05-21 Jeffrey Finkelstein

A lattice is a partially-ordered set in which every pair of elements has a unique meet (greatest lower bound) and join (least upper bound). We present new data structures for lattices that are simple, efficient, and nearly optimal in terms…

Data Structures and Algorithms · Computer Science 2020-06-17 J. Ian Munro , Bryce Sandlund , Corwin Sinnamon

We consider space functions $s(n)$ of finitely presented groups $G =< A\mid R> .$ (These functions have a natural geometric analog.) To define $s(n)$ we start with a word $w$ over $A$ of length at most $n$ equal to 1 in $G$ and use…

Group Theory · Mathematics 2011-11-08 Alexander Olshanskii

Several classes of irreducible orthogonal representations of compact Lie groups that are of importance in Differential Geometry have the property that the second osculating spaces of all of their nontrivial orbits coincide with the…

Differential Geometry · Mathematics 2007-05-23 Claudio Gorodski , Gudlaugur Thorbergsson

Carroll's group is presented as a group of transformations in a 5-dimensional space ($\mathcal{C}$) obtained by embedding the Euclidean space into a (4; 1)-de Sitter space. Three of the five dimensions of $\mathcal{C}$ are related to…

High Energy Physics - Theory · Physics 2021-05-20 G. X. A. Petronilo , S. C. Ulhoa , A. E. Santana

We give a proof, using so-called fusion rings and q-deformations of Brauer algebras that the representation ring of an orthogonal or symplectic group can be obtained as a quotient of a ring Gr(O(\infinity)). This is obtained here as a…

Quantum Algebra · Mathematics 2011-02-01 Hans Wenzl
‹ Prev 1 2 3 10 Next ›