中文
相关论文

相关论文: Computation of Centralizers in Braid groups and Ga…

200 篇论文

The theory of nilpotent orbits of simple Lie algebras has seen tremendous developments over the past decades. In this context an important role is played by the component group of the stabilizer of a nilpotent element. In this work, the aim…

表示论 · 数学 2024-07-17 Emanuele Di Bella , Willem A. De Graaf

The purpose of this paper is to investigate the finite group which appears in the study of the Type II $\mathbf{Z}_4$-codes. To be precise, it is characterized in terms of generators and relations, and we determine the structure of the…

表示论 · 数学 2017-06-08 Masashi Kosuda , Manabu Oura

Let $G$ be one of the Artin groups of finite type ${\mathbf B}_n={\mathbf C}_n$, and affine type $\tilde{\mathbf A}_{n-1}$ and $\tilde{\mathbf C}_{n-1}$. In this paper, we show that if $\alpha$ and $\beta$ are elements of $G$ such that…

几何拓扑 · 数学 2014-01-28 Eon-Kyung Lee , Sang-Jin Lee

Let $G$ be a classical group defined over a finite field. We consider the following fundamental problems concerning conjugacy in $G$: 1. List a representative for each conjugacy class of $G$. 2. Given $x \in G$, describe the centralizer of…

群论 · 数学 2024-11-22 Giovanni De Franceschi , Martin W. Liebeck , E. A. O'Brien

Machine learning and pattern recognition techniques have been successfully applied to algorithmic problems in free groups. In this paper, we seek to extend these techniques to finitely presented non-free groups, with a particular emphasis…

群论 · 数学 2018-02-22 Jonathan Gryak , Robert M. Haralick , Delaram Kahrobaei

We give a new presentation of the braid group $B$ of the complex reflection group $G(e,e,r)$ which is positive and homogeneous, and for which the generators map to reflections in the corresponding complex reflection group. We show that this…

群论 · 数学 2007-05-23 David Bessis , Ruth Corran

We investigate the complexity of computing the Zariski closure of a finitely generated group of matrices. The Zariski closure was previously shown to be computable by Derksen, Jeandel, and Koiran, but the termination argument for their…

计算复杂性 · 计算机科学 2025-03-05 Klara Nosan , Amaury Pouly , Sylvain Schmitz , Mahsa Shirmohammadi , James Worrell

We provide a complete description of the presentations of the interval groups related to quasi-Coxeter elements in finite Coxeter groups. In the simply laced cases, we show that each interval group is the quotient of the Artin group…

群论 · 数学 2022-11-28 Barbara Baumeister , Derek F. Holt , Georges Neaime , Sarah Rees

We derive a recurrence relation for the number of simple vertex-labelled bipartite graphs with given degrees of the vertices and use this result to obtain a new method for computing the growth function of the Artin monoid of type $A_{n-1}$…

群论 · 数学 2012-10-08 Volker Gebhardt

We give a geometric proof that minimal length elements in a (twisted) conjugacy class of a finite Coxeter group $W$ have remarkable properties with respect to conjugation, taking powers in the associated Braid group and taking centralizer…

表示论 · 数学 2019-12-19 Xuhua He , Sian Nie

M. Picantin introduced the notion of Garside groups of spindle type, generalizing the 3-strand braid group. We show that, for linear Garside groups of spindle type, a normal form and a solution to the conjugacy problem are logspace…

群论 · 数学 2013-10-29 Murray Elder , Arkadius Kalka

Given a structure made up of n sites connected by b bars, the problem of recognizing which subsets of sites form rigid units is not a trivial one, because of the non-local character of rigidity in central-force systems. Even though this is…

计算物理 · 物理学 2016-09-08 Cristian F. Moukarzel

Let $D_n$ denote the $n$-punctured disk in the complex plane, where the punctures are on the real axis. An $n$-braid $\alpha$ is said to be \emph{reducible} if there exists an essential curve system $\C$ in $D_n$, called a \emph{reduction…

几何拓扑 · 数学 2008-07-14 Eon-Kyung Lee , Sang-Jin Lee

In the recently emerging field of nonabelian group-based cryptography, a prominently used one-way function is the Conjugacy Search Problem (CSP), and two important classes of platform groups are polycyclic and matrix groups. In this paper,…

密码学与安全 · 计算机科学 2023-10-10 Simran Tinani , Carlo Matteotti , Joachim Rosenthal

This paper aims to develop a grafting method to address Majid's conjecture, which enables the construction of a larger target quantum group by grafting two given smaller ones. This method is significant for advancing the understanding of…

量子代数 · 数学 2026-02-09 Hongmei Hu , Naihong Hu

In this work, we develop a graphical calculus for multi-qudit computations with generalized Clifford algebras, building off the algebraic framework developed in our prior work. We build our graphical calculus out of a fixed set of graphical…

量子物理 · 物理学 2025-11-19 Robert Lin

Several key agreement protocols are based on the following "Generalized Conjugacy Search Problem": Find, given elements b_1,...,b_n and xb_1x^{-1},...,xb_nx^{-1} in a nonabelian group G, the conjugator x. In the case of subgroups of the…

群论 · 数学 2010-11-02 D. Garber , S. Kaplan , M. Teicher , B. Tsaban , U. Vishne

We compare two crossed homomorphisms on a braid group, one defined diagrammatically and the other defined algebraically. We show that these crossed homomorphisms are essentially the same, and compute them in detail for simple braids, namely…

几何拓扑 · 数学 2025-11-26 Yusuke Kuno , Yoshiro Yaguchi

In this paper, we show that for every abelian subgroup $H$ of a Garside group, some conjugate $g^{-1}Hg$ consists of ultra summit elements and the centralizer of $H$ is a finite index subgroup of the normalizer of $H$. Combining with the…

几何拓扑 · 数学 2008-07-23 Eon-Kyung Lee , Sang Jin Lee

In this article, we introduce the notion of cycling operations of arbitrary order in Garside groups, which is a full generalization of the cycling and decycling operations. Theoretically, this notion together with other related concepts…

几何拓扑 · 数学 2007-05-23 Hao Zheng