English
Related papers

Related papers: Necklaces over a group with identity product

200 papers

Consider a locally compact group $G=Q\ltimes V$ such that $V$ is abelian and the action of $Q$ on the dual abelian group $\hat V$ has a free orbit of full measure. We show that such a group $G$ can be quantized in three equivalent ways: (1)…

Operator Algebras · Mathematics 2025-01-24 Pierre Bieliavsky , Victor Gayral , Sergey Neshveyev , Lars Tuset

We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices $(B_1, \dots, B_m)$ and $(C_1, \dots, C_m)$, whether there exists an…

Data Structures and Algorithms · Computer Science 2019-02-08 Gábor Ivanyos , Youming Qiao

Let $A \leq G$ be a subgroup of a group $G$. An $A$-complement of $G$ is a subgroup $H$ of $G$ such that $G = A H$ and $A \cap H = \{1\}$. The \emph{classifying complements problem} asks for the description and classification of all…

Group Theory · Mathematics 2015-12-01 A. L. Agore , G. Militaru

The Donald--Flanigan problem for a finite group H and coefficient ring k asks for a deformation of the group algebra kH to a separable algebra. It is solved here for dihedral groups and for the classical Weyl groups (whose rational group…

Quantum Algebra · Mathematics 2007-05-23 Murray Gerstenhaber , Anthony Giaquinto , Mary E. Schaps

This thesis develops some general calculational techniques for finding the orders of knots in the topological concordance group C. The techniques currently available in the literature are either too theoretical, applying to only a small…

Geometric Topology · Mathematics 2012-06-05 Julia Collins

Let $G$ be a finite solvable group, given through a refined consistent polycyclic presentation, and $\alpha$ an automorphism of $G$, given through its images of the generators of $G$. In this paper, we discuss algorithms for computing the…

Group Theory · Mathematics 2019-11-11 Alexander Bors

We investigate the fundamental group of Griffiths' space, and the first singular homology group of this space and of the Hawaiian Earring by using (countable) reduced tame words. We prove that two such words represent the same element in…

Group Theory · Mathematics 2011-03-04 Oleg Bogopolski , Andreas Zastrow

We establish certain "non-triviality" results for several filtrations of the smooth and topological knot concordance groups. First, as regards the n-solvable filtration of the topological knot concordance group defined by K. Orr, P.…

Geometric Topology · Mathematics 2008-03-22 Tim D. Cochran , Taehee Kim

In 1997 Cochran-Orr-Teichner introduced a natural filtration, called the n-solvable filtration, of the smooth knot concordance group, C. Its terms {F_n} are indexed by half integers. We show that each associated graded abelian group…

Geometric Topology · Mathematics 2011-03-15 Tim D. Cochran , Shelly Harvey , Constance Leidy

$U(N)^{\otimes r} \otimes O(N)^{\otimes q}$ invariants are constructed by contractions of complex tensors of order $r+q$, also denoted $(r,q)$. These tensors transform under $r$ fundamental representations of the unitary group $U(N)$ and…

High Energy Physics - Theory · Physics 2024-04-26 Remi Cocou Avohou , Joseph Ben Geloun , Reiko Toriumi

We introduce and study diamonds of GL(2,R)-invariant subvarieties of Abelian and quadratic differentials, which allow us to recover information on an invariant subvariety by simultaneously considering two degenerations, and which provide a…

Dynamical Systems · Mathematics 2021-09-16 Paul Apisa , Alex Wright

We give a partial solution a question of Grigorchuk, Nekrashevych, Sushchanskii and \v{S}uni\'k by giving an algorithm to test whether a finite state element of an infinite iterated (permutational) wreath product $\hat G = \mathbb…

Group Theory · Mathematics 2007-05-23 Benjamin Steinberg

The problem of classifying tuples of nilpotent matrices over a field under simultaneous conjugation is considered "hopeless". However, for any given matrix order over a finite field, the number of concerned orbits is always finite. This…

Representation Theory · Mathematics 2021-05-06 Jiuzhao Hua

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

Number Theory · Mathematics 2018-10-30 Clemens Fuchs , Christina Karolus

We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding…

Combinatorics · Mathematics 2021-12-03 James East , Michael Hendriksen , Laurence Park

Le diagrams and Grassmann necklaces both index the collection of positroids in the nonnegative Grassmannian $Gr_{\geq 0}(k,n)$, but they excel at very different tasks: for example, the dimension of a positroid is easily extracted from its…

Combinatorics · Mathematics 2018-03-06 Susama Agarwala , Sian Fryer

For each $n=1,2,\dots$, let $\mathsf{GL}(n,\mathbb{Z})\ltimes \mathbb{Z}^n$ be the affine group over the integers. For every point $x=(x_1,\dots,x_n) \in \mathbb{R}^n$ let $\mathrm{orb}(x)=\{\gamma(x)\in \mathbb{R}^n\mid\gamma\in…

Group Theory · Mathematics 2015-07-29 L. M. Cabrer , D. Mundici

For a finite group $G$, let $N(G)$ denote the set of conjugacy class sizes of $G$. We show that if every finite group $G$ with trivial center such that $N(G)$ equals to $N(Alt_n)$, where $n>1361$ and at least one of numbers $n$ or $n-1$ are…

Group Theory · Mathematics 2016-07-14 Ilya Gorshkov

Let g be a simple simply laced Lie algebra. In this paper two families of varieties associated to the Dynkin graph of g are described: ``tensor product'' and ``multiplicity'' varieties. These varieties are closely related to Nakajima's…

Algebraic Geometry · Mathematics 2007-05-23 Anton Malkin

The normaliser problem takes as input subgroups $G$ and $H$ of the symmetric group $S_n$, and asks one to compute $N_G(H)$. The fastest known algorithm for this problem is simply exponential, whilst more efficient algorithms are known for…

Group Theory · Mathematics 2021-12-02 Mun See Chang , Christopher Jefferson , Colva M. Roney-Dougal