Related papers: Character table sudokus
Language tasks involving character-level manipulations (e.g., spelling corrections, arithmetic operations, word games) are challenging for models operating on subword units. To address this, we develop a causal intervention framework to…
Based on Lyndon words, a new Sudoku-like puzzle is presented and some relative theoretical questions are proposed.
We prove that, in a finite group, if every rational irreducible character has odd degree, then all rational elements are 2-elements, as it was originally conjectured by Tiep and Tong-Viet.
We estimate mixed character sums of polynomial values over elements of a finite field $\mathbb F_{q^r}$ with sparse representations in a fixed ordered basis over the subfield $\mathbb F_q$. First we use a combination of the…
Not all real-world data are labeled, and when labels are not available, it is often costly to obtain them. Moreover, as many algorithms suffer from the curse of dimensionality, reducing the features in the data to a smaller set is often of…
We consider the proportion of zero entries in the character table of a sequence of reductive groups over a finite field. We prove an asymptotic lower bound when the reductive group is fixed and the size of the finite field increases.…
Applying the embedding of $A_{n-1}$ in $B_n$, $C_n$ and $D_n$ we construct a new supercharacter theory for the Sylow subgroups in orthogonal and symplectic groups over a finite field. The constructed supercharacter appears to be a little…
Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…
In the high rank limit, the fraction of non-zero character table entries of finite simple groups of Lie type goes to zero.
Caricature is an artistic drawing created to abstract or exaggerate facial features of a person. Rendering visually pleasing caricatures is a difficult task that requires professional skills, and thus it is of great interest to design a…
We study the reverse mathematics of the principle stating that, for every property of finite character, every set has a maximal subset satisfying the property. In the context of set theory, this variant of Tukey's lemma is equivalent to the…
This paper is a continuation of [GLT], which develops a level theory and establishes strong character bounds for finite simple groups of linear and unitary type in the case that the centralizer of the element has small order compared to…
Let N be a minimal normal nonabelian subgroup of a finite group G. We will show that there exists a nontrivial irreducible character of N of degree at least 5 which is extendible to G. This result will be used to settle two open questions…
Let G be a finite group and N be a non-trivial normal subgroup of G, such that the average character degree of irreducible characters in Irr(G|N) is less than or equal to 16=5. Then we prove that N is solvable. Also, we prove the…
We define a fragment of monadic infinitary second-order logic corresponding to an abstract separation property. We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation…
This is a preliminary version of the first chapter of a book project on the character theory of finite groups of Lie type. It provides the foundations from the general theory of reductive algebraic groups over a finite field.
In this paper, we first show that the irreducible characters of a quotient table algebra modulo a normal closed subset can be viewed as the irreducible characters of the table algebra itself. Furthermore, we define the character products…
Let $U$ be a Sylow $p$-subgroup in a classical group over a finite field of characteristic $p$. The coadjoint orbits of the group $U$ play the key role in the description of irreducible complex characters of $U$. Almost all important…
By exploiting relationships between the values taken by ordinary characters of symmetric groups we prove two theorems in the modular representation theory of the symmetric group. 1. The decomposition matrices of symmetric groups in odd…
Robinson showed that the character degrees are determined by knowing, for all $n$, the number of ways that the identity can be expressed as a product of $n$ commutators. Earlier, Strunkov showed that the existence of characters of…