Related papers: Character table sudokus
Causal language modeling using the Transformer architecture has yielded remarkable capabilities in Large Language Models (LLMs) over the last few years. However, the extent to which fundamental search and reasoning capabilities emerged…
We compute the number of points over finite fields of the character stack associated to a compact surface group and a reductive group with connected centre. We find that the answer is a Polynomial On Residue Classes (PORC). The key…
The object of this short note is to prove a theorem and present a conjecture for the number of even entries in the character table of the symmetric group.
Ludics is peculiar in the panorama of game semantics: we first have the definition of interaction-composition and then we have semantical types, as a set of strategies which "behave well" and react in the same way to a set of tests. The…
We propose a new task for assessing machines' skills of understanding fictional characters in narrative stories. The task, TVShowGuess, builds on the scripts of TV series and takes the form of guessing the anonymous main characters based on…
In the classic "Concrete Math", by Graham, Patashnik and Knuth, it is stated that "The numbers in Pascal's triangle satisfy, practically speaking, infinitely many identities, so it is not too surprising that we can find some surprising…
Diaconis and Isaacs have defined the supercharacter theories of a finite group to be certain approximations to the ordinary character theory of the group. We make explicit the connection between supercharacter theories and Schur rings, and…
In view of applications to conformal field theory or to other branches of theoretical physics and mathematics, new examples of character tables for Drinfeld doubles of finite groups (modular data) are made available on a website.
We derive several identities that feature irreducible characters of the general linear, the symplectic, the orthogonal, and the special orthogonal groups. All the identities feature characters that are indexed by shapes that are "nearly"…
The Jordan-H\"older Theorem is a general term given to a collection of theorems about maximal chains in suitably nice lattices. For example, the well-known Jordan-H\"older type theorem for chief series of finite groups has been rather…
Icosoku is a challenging and interesting puzzle that exhibits highly symmetrical and combinatorial nature. In this paper, we pose the questions derived from the puzzle, but with more difficulty and generality. In addition, we also present a…
We solve the problem of characterizing the existence of a polynomial matrix of fixed degree when its eigenstructure (or part of it) and some of its rows (columns) are prescribed. More specifically, we present a solution to the row (column)…
Any finite group can be encoded as the automorphism group of an unlabeled simple graph. Recently Hartke, Kolb, Nishikawa, and Stolee (2010) demonstrated a construction that allows any ordered pair of finite groups to be represented as the…
Typology is a subfield of linguistics that focuses on the study and classification of languages based on their structural features. Unlike genealogical classification, which examines the historical relationships between languages, typology…
The notion of the supercharacter theory was introduced by P.Diaconis and I.M.Isaaks in 2008. In this paper we review the main statements of the general theory, we observe the construction of supercharacter theory for algebra groups and the…
We prove that a knowledge of the character degrees of a finite group G and of their multiplicities determines whether G has a Sylow p-subgroup as a direct factor. An analogous result based on a knowledge of the conjugacy class sizes was…
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
The theory of supercharacters, which generalizes classical character theory, was recently introduced by P. Diaconis and I.M. Isaacs, building upon earlier work of C. Andre. We study supercharacter theories on $(Z/nZ)^d$ induced by the…
By generalizing Frobenius' polynomial method to good partition algebra, we will develop new character theories for a finite group $G$. A uniform defining equations are derived for these kinds of character theories. The new character…
We introduce and study a new class of differential fields in positive characteristic. We call them separably differentially closed fields and demonstrate that they are the differential analogue of separably closed fields. We prove several…