Related papers: Character table sudokus
A character of a group is said to be super-monomial if every primitive character inducing it is linear. It is conjectured by Isaacs that every irreducible character of an odd $M$-group is super-monomial. We show that all non linear…
In this short paper we present an algorithm for finding a solution to a generalized Sudoku.
This paper introduces a surrogate model of gameplay that learns the mapping between different game facets, and applies it to a generative system which designs new content in one of these facets. Focusing on the shooter game genre, the paper…
This work studies gradual typing for row types and row polymorphism. Key ingredients in this work are the dynamic row type, which represents a statically unknown part of a row, and consistency for row types, which allows injecting static…
Gcharacter tables of a finite group G were defined before. These tables can be very useful to obtain certain structural information of a normal subgroup from the character table of G. We analyze certain structural properties of normal…
Amdeberhan recently proposed certain equalities between sums in the character table of symmetric groups. These equalities are between signed column sums in the character table, summing over the rows labeled by partitions in $\Ev$, where…
We present some results on character degree sums in connection with certain characteristics of finite groups such as p-solvability, solvability, supersolvability, and nilpotency. Some of them strengthen known results in the literature.
Computer games are motivating and beneficial in learning different educational skills. Most people use their fingers, hands, and arms when using a computer game. However, for people with motor disabilities this task can be a barrier. We…
We define and study supercharacters of the classical finite unipotent groups of symplectic and orthogonal types (over any finite field of odd characteristic). We show how supercharacters for groups of those types can be obtained by…
We investigate character degree graphs of solvable groups. In particular, we provide general results that can be used to eliminate which degree graphs can occur as solvable groups. Finally, we show a specific family of graphs cannot occur…
We study the relative SU(2,1)-character varieties of the one-holed torus, and the action of the mapping class group on them. We use an explicit description of the character variety of the free group of rank two in SU(2,1) in terms of…
We introduce SudoQ, a quantum version of the classical game Sudoku. Allowing the entries of the grid to be (non-commutative) projections instead of integers, the solution set of SudoQ puzzles can be much larger than in the classical…
In 2015, the author proved combinatorially character formulas expressing sums of the (formal) dimensions of irreducible representations of symplectic groups, refining some works of Nekrasov and Okounkov, Han, King, and Westbury. In this…
When reading a literary piece, readers often make inferences about various characters' roles, personalities, relationships, intents, actions, etc. While humans can readily draw upon their past experiences to build such a character-centric…
There is a growing tradition in the joint field of network studies and drama history that produces interpretations from the character networks of the plays.The potential of such an interpretation is that the diagrams provide a different…
We study additive double character sums over two subsets of a finite field. We show that if there is a suitable rational self-map of small degree of a set $D$, then this set contains a large subset $U$ for which the standard bound on the…
By studying lattices of normal subgroups, especially those of the socle and radical, an expression is obtained for the minimal number of conjugacy classes required to generate a group. This number is shown to be captured by the character…
We consider sequences of degrees of ordinary irreducible $S_n$-characters. We assume that the corresponding Young diagrams have rows and columns bounded by some linear function of $n$ with leading coefficient less than one. We show that any…
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…
Let $N$ be a normal subgroup of a finite group $G$. From a result due to Brauer, it can be derived that the character table of $G$ contains square submatrices which are induced by the $G$-conjugacy classes of elements in $N$ and the…