Related papers: Character table sudokus
Let $U$ be the unitriangular group over a finite field. We consider an interesting class of irreducible complex characters of $U$, so-called characters of depth 2. This is a next natural step after characters of maximal and submaximal…
This book describes some computational methods to deal with modular characters of finite groups. It is the theoretical background of the MOC system of the same authors. This system was, and is still used, to compute the modular character…
The notion of a supercharacter theory was proposed by P. Diaconis and I.M. Isaacs in 2008. A supercharacter theory for a given finite group is a pair of the system of certain complex characters and the partition of group into classes that…
A $GL_d$-pseudocharacter is a function from a group $\Gamma$ to a ring $k$ satisfying polynomial relations which make it "look like" the character of a representation. When $k$ is an algebraically closed field, Taylor proved that…
We extend the Howlett-Isaacs theorem on the solvability of groups of central type taking into account actions by automorphisms. Then we study certain induced characters whose constituents have all the same degree.
A free-form Sudoku puzzle is a square arrangement of m times m cells such that the cells are partitioned into m subsets (called blocks) of equal cardinality. The goal of the puzzle is to place integers 1,...,m in the cells such that the…
In this investigation of character tables of finite groups we study basic sets and associated representation theoretic data for complementary sets of conjugacy classes. For the symmetric groups we find unexpected properties of characters on…
In 2008, Diaconis annd Isaacs introduced the notion of a supercharacter theory of a finite group in which supercharacters replace with irreducible characters and superclasses by conjugacy classes. In this paper, we introduce an algorithm…
We discuss the problem of finding critical sets in graphs, a concept which has appeared in a number of guises in the combinatorics and graph theory literature. The case of the Sudoku graph receives particular attention, because critical…
Sudoku is a popular combinatorial puzzle. A new method of solving Sudoku is presented, which involves formulating a puzzle as a special type of transportation problem. This model allows one to solve puzzles with more than one solution,…
We construct supercharacter theories of finite unipotent groups in the orthogonal, symplectic and unitary types. Our method utilizes group actions in a manner analogous to that of Diaconis and Isaacs in their construction of supercharacters…
Some aspects of programming education are examined in this work. It is emphasised, based on the entertainment value, the most appropriate examples are chosen to demonstrate the different language constructions and data structures. Such an…
Stanley and Odlyzko proposed a method for greedily constructing sets with no 3-term arithmetic progressions. It is conjectured that there is a dichotomy between such sequences: those that have a periodic structure as the sequence satisfies…
Two groups are said to have the same character table if a permutation of the rows and a permutation of the columns of one table produces the other table. The problem of determining when two groups have the same character table is…
Neural networks have long been used to model human intelligence, capturing elements of behavior and cognition, and their neural basis. Recent advancements in deep learning have enabled neural network models to reach and even surpass human…
An amalgam of groups can be viewed as a Sudoku game inside a group. You are given a set of subgroups and their intersections and you need to decide what the largest group containing such a structure can be. In a recent paper (0907.1388v1)…
Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…
Previous work has modeled the compositionality of words by creating character-level models of meaning, reducing problems of sparsity for rare words. However, in many writing systems compositionality has an effect even on the…
We define the notion of a semicharacter of a group G : A function from the group to C*, whose restriction to any abelian subgroup is a homomorphism. We conjecture that for any finite group, the order of the group of semicharacters is…
Decomposing DRAM address mappings into component-level functions is critical for understanding memory behavior and enabling precise RowHammer attacks, yet existing reverse-engineering methods fall short. We introduce novel timing-based…