Related papers: Minimal complete Shidoku symmetry groups

We classify the irreducible projective representations of symmetric and alternating groups of minimal possible and second minimal possible dimensions, and get a lower bound for the third minimal dimension. On the way we obtain some new…

A set of proper subgroups is a covering for a group if its union is the whole group. The minimal number of subgroups needed to cover $G$ is called the covering number of $G$, denoted by $\sigma(G)$. Determining $\sigma(G)$ is an open…

This paper describes a simple method for estimating lower bounds on the number of classes of equivalence for a special kind of integer sequences, called division sequences. The method is based on adding group structure to classes of…

Any permutation in the finite symmetric group can be written as a product of simple transpositions $s_i = (i~i+1)$. For a fixed permutation $\sigma \in \mathfrak{S}_n$ the products of minimal length are called reduced decompositions or…

We study a system of linear equations associated with Sudoku latin squares. The coefficient matrix $M$ of the normal system has various symmetries arising from Sudoku. From this, we find the eigenvalues and eigenvectors of $M$, and compute…

An interesting problem in classical differential geometry is to find methods to prove that two surfaces defined by different charts actually coincide up to position in space. In a previous paper we proposed a method in this direction for…

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 introduce inversions tableaux, a new combinatorial model for Schubert polynomials and Stanley symmetric functions that directly specializes to semi-standard Young tableaux in the Grassmannian case. They are a modification of the balanced…

This paper deals with a generalized Sudoku problem and investigates the unicity of a given solution. We introduce constraint sets, which is a generalization of the rows, columns and blocks of a classical Sudoku puzzle. The unicity property…

In this short paper we present an algorithm for finding a solution to a generalized Sudoku.

We define a solitary game, the Yamanouchi toppling game, on any connected graph of n vertices. The game arises from the well-known chip-firing game when the usual relation of equivalence defined on the set of all configurations is replaced…

We define an action of the symmetric group on the set of domino tableaux, and prove that the number of domino tableaux of a given weight does not depend on the permutation of components of the last. A bijective proof of the well-known…

We introduce a new class of numerical semigroups, which we call the class of {\it acute} semigroups and we prove that they generalize symmetric and pseudo-symmetric numerical semigroups, Arf numerical semigroups and the semigroups generated…

A special type of conjugacy classes in symmetric groups is studied and used to answer a question about odd-degree irreducible characters

We study irreducible restrictions from modules over symmetric groups to subgroups. We get reduction results which substantially restrict the classes of subgroups and modules for which this is possible. Such results are known when the…

This paper is an attempt to compute the decomposition numbers of the blocks of the symmetric group which have "small defect"; that is, blocks of weight smaller than the characteristic. We present various methods for computing such…

Rectangular standard Young tableaux with 2 or 3 rows are in bijection with $U_q(\mathfrak{sl}_2)$-webs and $U_q(\mathfrak{sl}_3)$-webs respectively. When $W$ is a web with a reflection symmetry, the corresponding tableau $T_W$ has a…

In this paper we first study $k \times n$ Youden rectangles of small orders. We have enumerated all Youden rectangles for a range of small parameter values, excluding the almost square cases where $k = n-1$, in a large scale computer…

We define orbifold mapping class groups (with marked points) and study them using their action on certain orbifold analogs of arcs and simple closed curves. Moreover, we establish a Birman exact sequence for suitable subgroups of orbifold…

Let $p$ be any prime. We determine precisely those irreducible characters of symmetric groups which contain at most $p$ distinct linear constituents in their restriction to a Sylow $p$-subgroup, answering a question of Giannelli and…