Related papers: The ranks of alternating string C-groups

Let $G$ be a finite group and $\mathrm{Irr}(G)$ the set of all irreducible complex characters of $G$. Define the codegree of $\chi \in \mathrm{Irr}(G)$ as $\mathrm{cod}(\chi):=\frac{|G:\mathrm{ker}(\chi) |}{\chi(1)}$ and denote by…

We introduce a concept of the bounded rank (with respect to a positive constant) for unital C*-algebras as a modification of the usual real rank and present a series of conditions insuring that bounded and real ranks coincide. These…

It is known that any $m$-gonal form of rank $n \ge 5$ is almost regular. On the other words, any $m$-gonal form of rank $n \ge 5$ represents every sufficiently large integer which is locally represented. In this article, we study the…

A conjugacy class $C$ of a finite group $G$ is a sign conjugacy class if every irreducible character of $G$ takes value 0, 1 or -1 on $C$. In this paper we classify the sign conjugacy classes of alternating groups.

We present new algorithms to classify all string C-group representations of a given group $G$. We use these algorithms to classify all string C-group representations of the sporadic groups of Suzuki and Rudvalis.

A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ if and only if $(x,y)\in E$ for each $x\neq y$. The set of word-representable graphs generalizes several…

We classify all of the groups with twelve or fewer subgroups. This paper is the proof of the entries in a submission to the Online Encyclopedia of Integer Sequences.

We obtain a description of the irreducible representation algebra of the alternating group of degree four over the ring of 2-adic integers.

In this paper we explore the structure and properties of C-groups. We define a C-group as a group $G$ with $rk(G) < rk(Z(G))$ (where $rk(G)$ is the minimal cardinal of a generating set for a group $G$). Using GAP (a group theory program)…

Let $A_n$ denote the alternating group of degree $n$ with $n\geq 3$. The alternating group graph $AG_n$, extended alternating group graph $EAG_n$ and complete alternating group graph $CAG_n$ are the Cayley graphs $\mathrm{Cay}(A_n,T_1)$,…

An avoidance pattern where the letters within an occurrence of which are required to be adjacent is referred to as a subword. In this paper, we enumerate members of the set NC_n of non-crossing partitions of length n according to the number…

We classify up to signature all the ways the alternating group $A_n$ can act on a compact Riemann surfaces when the quotient genus is greater than $0$. In particular, we prove that for $A_n$ with $n>6$ every potential signature for the…

Building on recent work of Robertson and Steger, we associate a C*-algebra to a combinatorial object which may be thought of as a higher rank graph. This C*-algebra is shown to be isomorphic to that of the associated path groupoid.…

We give examples of finite string $C$-groups (the automorphism groups of abstract regular polytopes) that have irreducible characters of real Schur index $2$. This answers a problem of Monson concerning these groups.

In this paper we compute asymptotics for the coefficients of an infinite class of overpartition rank generating functions. Using these results, we show that $ \overline{N}(a,c,n), $ the number of overpartitions of $ n $ with rank congruent…

Given a closed ideal $I$ in a C*-algebra $A$, we develop techniques to bound the real rank of $A$ in terms of the real ranks of $I$ and $A/I$. Building on work of Brown, Lin and Zhang, we obtain complete solutions if $I$ belongs to any of…

Sequence representations supporting queries $access$, $select$ and $rank$ are at the core of many data structures. There is a considerable gap between the various upper bounds and the few lower bounds known for such representations, and how…

We describe an linear representation for Abel-Grassmann groups. As a consequence, we obtain or improve many previous results. In particular, enumeration of Abel-Grassmann groups up to isomorphism is obtained for orders <512.

In this paper, we provide algorithms to rank and unrank certain degree-restricted classes of Cayley trees (spanning trees of the n-vertex complete graph). Specifically, we consider classes of trees that have a given set of leaves or a fixed…

We classify rank two globally generated vector bundles on P^n, n > 2, with c_1 \leq 5. The classification is complete but for one case (n = 3, c_1 = 5, c_2 = 12)