Related papers: Rank reduction of string C-group representations
We explore the embedding of Spin groups of arbitrary dimension and signature into simple superalgebras in the case of extended supersymmetry. The R-symmetry, which generically is not compact, can be chosen compact for all the cases that are…
In this paper we examine embeddings of alternating groups and symmetric groups into almost simple groups of exceptional type. In particular, we prove that unless the alternating or symmetric group has degree 6 or 7, there is no maximal…
If \A is a complex hyperplane arrangement, with complement X, we show that the Chen ranks of G=\pi_1(X) are equal to the graded Betti numbers of the linear strand in a minimal, free resolution of the cohomology ring A=H^*(X,\k), viewed as a…
We show that the cuspidal component of the stable trace formula of a special odd orthogonal group over a number field, satisfies a weak form of beyond endoscopic decomposition. We also study the $r$-stable trace formula, when $r$ is the…
This article deals with the study of cactus groups from a combinatorial point of view. These groups have been gaining prominence lately in various domains of mathematics, amongst which are their relations with well-known groups such as…
We establish simple combinatorial descriptions of the radical and irreducible representations specifically for the descent algebra of a Coxeter group of type $D$ over any field.
Let $d, n \in \mathbb{Z}^+$ such that $1\leq d \leq n$. A $d$-code $\mathcal{C} \subset \mathbb{F}_q^{n \times n}$ is a subset of order $n$ square matrices with the property that for all pairs of distinct elements in $\mathcal{C}$, the rank…
We investigate the group contraction method for various space-time groups, including SO(3)->E_2, SO(3,1)->G_3, SO(5-h,h)->P(3,1) (h=1 or 2), and its consequences for representations of these groups. Following strictly quantum mechanical…
Several recent problems in the representation theory of finite groups require determining whether certain characters of almost simple groups belong to the principal block. Since the values of these characters are not yet known, we employ…
We offer a criterion for showing that the automorphism group of an ultrahomogeneous structure is topologically 2-generated and even has a cyclically dense conjugacy class. We then show how finite topological rank of the automorphism group…
It has been conjectured that in a braid group, or more generally in a Garside group, applying any sequence of monotone equivalences and word reversings can increase the length of a word by at most a linear factor depending on the group…
We investigate group coding for arbitrary finite groups acting linearly on a vector space. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using…
The generalized word length pattern of an orthogonal array allows a ranking of orthogonal arrays in terms of the generalized minimum aberration criterion (Xu and Wu [Ann. Statist. 29 (2001) 1066-1077]). We provide a statistical…
Hierarchical taxonomies are common in many contexts, and they are a very natural structure humans use to organise information. In machine learning, the family of methods that use the 'extra' information is called hierarchical…
We prove that a group is presented by finite convergent length-reducing rewriting systems where each rule has left-hand side of length 3 if and only if the group is plain. Our proof goes via a new result concerning properties of embedded…
The exceptional complex reflection groups of rank 2 are partitioned into three families. We construct explicit matrix models for the Hecke algebras associated to the maximal groups in the tetrahedral and octahedral family, and use them to…
Let $X$ be a nonempty real variety that is invariant under the action of a reflection group $G$. We conjecture that if $X$ is defined in terms of the first $k$ basic invariants of $G$ (ordered by degree), then $X$ meets a $k$-dimensional…
For a block B of a finite group G there are well-known orthogonality relations for the generalized decomposition numbers. We refine these relations by expressing the generalized decomposition numbers with respect to an integral basis of a…
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…
Simple method to improve traditional approaches to name taxa of higher ranks has been proposed. Instead of base name + postfixes (which vary between codes of nomenclature and sometimes not standardized at all), use numerical prefixes, where…