Related papers: Character table sudokus
We show how the character tables of the groups $E_6(q)_{\text{ad}}$ and ${^2\!E}_6(q)_{\text{ad}}$ can be constructed, where $q$ is a power of~$2$. (Partial results are also obtained for any $q$ not divisible by~$3$.) This is based on…
Character-level language models obviate the need for separately trained tokenizers, but efficiency suffers from longer sequence lengths. Learning to combine character representations into tokens has made training these models more…
We decompose the twisted Foulkes characters $\phi^{(2^n)}_\nu$, or equivalently the plethysm $s_\nu \circ s_{(2)}$, in the cases where $\nu$ has either two rows or two columns, or is a hook partition.
Tables on the Web contain a vast amount of knowledge in a structured form. To tap into this valuable resource, we address the problem of table retrieval: answering an information need with a ranked list of tables. We investigate this…
In this Part II, we apply the general theory developed in Part I to a detailed analysis of the Constraint Satisfaction Problem (CSP). We show how specific types of resolution rules can be defined. In particular, we introduce the general…
What does it mean today to study a problem from a computational point of view? We focus on parameterized complexity and on Column 16 "Graph Restrictions and Their Effect" of D. S. Johnson's Ongoing guide, where several puzzles were proposed…
The character formulas of Sally and Shalika are an early triumph in $p$-adic harmonic analysis, but, to date, the calculations underlying the formulas have not been available. In this paper, which should be viewed as a precursor of the…
We introduce a new class of totally balanced cooperative TU games, namely p -additive games. It is inspired by the class of inventory games that arises from inventory situations with temporary discounts (Toledo, 2002) and contains the class…
Partial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means of semicubes, and Djokovi\'{c}'s and Winkler's relations play an important role in the theory of partial cubes. These structures are employed in the…
Septoku is a Sudoku variant invented by Bruce Oberg, played on a hexagonal grid of 37 cells. We show that up to rotations, reflections, and symbol permutations, there are only six valid Septoku boards. In order to have a unique solution, we…
Words can be represented by composing the representations of subword units such as word segments, characters, and/or character n-grams. While such representations are effective and may capture the morphological regularities of words, they…
This paper is concerned with the popular Sudoku problem. We proposed a warm restart strategy for solving Sudoku puzzles, based on the sparse optimization technique. Furthermore, we defined a new difficulty level for Sudoku puzzles. The…
Many real world problems naturally appear as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two techniques: some direct propagation of constraints between…
Pattern-Based Constraint Satisfaction and Logic Puzzles develops a pure logic, pattern-based perspective of solving the finite Constraint Satisfaction Problem (CSP), with emphasis on finding the "simplest" solution. Different ways of…
A vocabulary is a list of words designating subsets from a grand set X. We model a vocabulary as a partition of X and study the aggregation of individual vocabularies into a collective one. We characterize aggregation rules when X is…
Despite their proficiency in various language tasks, Large Language Models (LLMs) struggle with combinatorial problems like Satisfiability, Traveling Salesman Problem, or even basic arithmetic. We address this gap through a novel trial &…
Let $G$ be a finite group of Lie type. In order to determine the character table of $G$, Lusztig developed the theory of character sheaves. In this framework, one has to find the transformation between two bases for the space of class…
Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of generically rigid structures. We define a new family called {\bf graded sparse graphs}, arising from generically…
A classical theorem of Paley asserts the existence of an infinite family of quadratic characters whose character sums become exceptionally large. In this paper, we establish an analogous result for characters of any fixed even order.…
We develop the rudiments of a finite-dimensional representation theory of groups over idempotent semifields by considering linear actions on tropical linear spaces. This can be considered a tropical representation theory, a characteristic…