中文
相关论文

相关论文: Rewriting the check of 8-rewritability for $A_5$

200 篇论文

An involution is a permutation that is its own inverse. Given a permutation $\sigma$ of $[n],$ let $\mathbf{N}_{n}(\sigma)$ denote the number of ways to write $\sigma$ as a product of two involutions of $[n].$ If we endow the symmetric…

组合数学 · 数学 2015-08-19 Charles Burnette , Eric Schmutz

A (finite or countably infinite) set G of generators of an abstract C*-algebra A is called hyperrigid if for every faithful representation of A on a Hilbert space $A\subseteq \mathcal B(H)$ and every sequence of unital completely positive…

算子代数 · 数学 2009-05-28 William Arveson

Given a second-countable, Hausdorff, \'etale, amenable groupoid G with compact unit space, we show that an element a in C*(G) is invertible if and only if \lambda_x(a) is invertible for every x in the unit space of G, where \lambda_x refers…

算子代数 · 数学 2013-02-08 Ruy Exel

The spectrum of a group is the set of its element orders. A finite group $G$ is said to be recognizable by spectrum if every finite group that has the same spectrum as $G$ is isomorphic to $G$. We prove that the simple alternating groups…

群论 · 数学 2013-02-21 I. B. Gorshkov

Let us consider the group $G = < x,y \mid x^m = y^n>$ with $m$ and $n$ nonzero integers. In this paper, we study the variety of epresentations $R(G)$ and the character variety $X(G)$ in $SL(2,\C)$ of the group $G$,obtaining by elementary…

代数几何 · 数学 2009-09-29 Jorge Martin-Morales , Antonio M. Oller-Marcen

In this text, we consider random permutations which can be written as free words in several independent random permutations: firstly, we fix a non trivial word $w$ in letters $g_1,g_1^{-1},..., g_k,g_k^{-1}$, secondly, for all $n$, we…

概率论 · 数学 2010-11-08 Florent Benaych-Georges

Let $n \geq 6$ be an integer. We prove that the number of number fields with Galois group $A_n$ and absolute discriminant at most $X$ is asymptotically at least $X^{1/8 + O(1/n)}$. For $n \geq 8$ this improves upon the previously best known…

数论 · 数学 2021-12-03 Aaron Landesman , Robert J. Lemke Oliver , Frank Thorne

Let $G$ be a multiplicative subsemigroup of the general linear group $\Gl(\mathbb{R}^d)$ which consists of matrices with positive entries such that every column and every row contains a strictly positive element. Given a $G$--valued random…

概率论 · 数学 2011-11-09 Mariusz Mirek

Let $a$ be a non-invertible transformation of a finite set and let $G$ be a group of permutations on that same set. Then $\genset{G, a}\setminus G$ is a subsemigroup, consisting of all non-invertible transformations, in the semigroup…

群论 · 数学 2009-11-04 Joao Araujo , J. D. Mitchell , Csaba Schneider

Let $q$ be a power of a prime $p$, $G$ be a finite abelian group, where $p$ does not divide $|G|$,and let $n$ be a positive integer. In this paper we find a formula for the number of irreducible representations of $G$ of a given dimension…

群论 · 数学 2025-04-18 Thomas Breuer , Prashun Kumar , Geetha Venkataraman

The automorphism group of a code is the group of permutations that map a code to itself. Berman codes are a class of binary linear codes characterized by two integer parameters $n\geq 2$ and $m\geq 1$, and this class includes the…

信息论 · 计算机科学 2026-05-27 Harshvardhan Pandey , Prasad Krishnan

Let $X_n = \{1,2,\dots,n\}$ be a finite set $(n\geq 2)$ and $T_n$ the full transformation semigroup on $X_n$. For a positive integer $l\leq n-1$, we define $$T_n(l) = \{\alpha\in T_n \colon \forall x,y\in X_n,\, |x-y| = l \;\Rightarrow\;…

群论 · 数学 2024-06-04 Worachead Sommanee

The minimal faithful permutation degree $\mu(G)$ of a finite group $G$ is the least integer $n$ such that $G$ is isomorphic to a subgroup of the symmetric group $S_n$. If $G$ has a normal subgroup $N$ such that $\mu(G/N) > \mu(G)$, then $G$…

群论 · 数学 2026-05-26 E. A. O'Brien , Sunil Kumar Prajapati , Ayush Udeep

For $\sigma \in S_n$, let $D(\sigma) = \{i : \sigma_{i} > \sigma_{i+1}\}$ denote the descent set of $\sigma$. The length of the permutation is the number of inversions, denoted by $inv(\sigma) = \big | \{(i,j) : i<j, \sigma_i > \sigma_j\}…

组合数学 · 数学 2007-05-23 Mike Zabrocki

Let $G$ be a finite group. Denote by $\textrm{Irr}(G)$ the set of all irreducible complex characters of $G.$ Let $\textrm{cd}(G)=\{\chi(1)\;|\;\chi\in \textrm{Irr}(G)\}$ be the set of all irreducible complex character degrees of $G$…

群论 · 数学 2011-02-23 Hung P. Tong-Viet

An infra-red fixed point of ${\mathcal N}=1$ super-Yang-Mills theory is believed to be dual to a solution of five-dimensional gauged ${\mathcal N}=8$ supergravity. We test this conjecture at next to leading order in the large $N$ expansion…

高能物理 - 理论 · 物理学 2009-11-07 Paul Mansfield , David Nolland

We study several combinatorial properties of finite groups that are related to the notions of sequenceability, R-sequenceability, and harmonious sequences. In particular, we show that in every abelian group $G$ with a unique involution…

群论 · 数学 2024-08-30 Mohammad Javaheri , Lydia de Wolf

Fix $\varepsilon > 0$. We say that a finite group $G$ is $\varepsilon$-quasirandom if every nontrivial irreducible complex representation of $G$ has degree at least $|G|^\varepsilon$. In this paper, we give a structure theorem for large…

群论 · 数学 2025-10-02 Marco Barbieri , Luca Sabatini

Let G be a finite group. An element x in G is a real element if x is conjugate to its inverse in G. For x in G, the conjugacy class x^G is said to be a real conjugacy class if every element of x^G is real. We show that if 4 divides no real…

群论 · 数学 2013-06-28 Hung P. Tong-Viet

Suppose $G$ is a simple group. For any nontrivial elements $g$ and $h$, $g$ can be written as a finite product of conjugates of $h$ or the inverse of $h$. G is called uniformly simple if the length of such an expression is uniformly…

群论 · 数学 2011-07-27 Hiroki Kodama