Related papers: Minimal complete Shidoku symmetry groups
Identifying symmetries in data sets is generally difficult, but knowledge about them is crucial for efficient data handling. Here we present a method how neural networks can be used to identify symmetries. We make extensive use of the…
The main result in Y.~O.~Hamidoune's paper "Adding Distinct Congruence Classes" ({\em Combin.~Probab.~Comput.}~{\bf 7} (1998) 81-87) is as follows: If $S$ is a generating subset of a cyclic group $G$ such that $0 \not \in S$ and $|S| \geq…
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.
We investigate monodromy groups arising in enumerative geometry, with a particular focus on how these groups are influenced by prescribed symmetries. To study these phenomena effectively, we work in the framework of moduli stacks rather…
The homological scaffold leverages persistent homology to construct a topologically sound summary of a weighted network. However, its crucial dependency on the choice of representative cycles hinders the ability to trace back global…
A Sudoku puzzle often has a regular pattern in the arrangement of initial digits and it is typically made solvable with known solving techniques, called strategies. In this paper, we consider the problem of generating such Sudoku instances.…
Like the LR-tableau, a socle tableau is given as a skew diagram with certain entries. Unlike in the LR-tableau, the entries in the socle tableau are weakly increasing in each row, strictly increasing in each column and satisfy a modified…
The generalised Sudoku problem with $N$ symbols is known to be NP-complete, and hence is equivalent to any other NP-complete problem, even for the standard restricted version where $N$ is a perfect square. In particular, generalised Sudoku…
We determine the combinatorial depth of certain subgroups of simple Suzuki groups Sz(q), among others the depth of their maximal subgroups. We apply these results to determine the ordinary depth of these subgroups.
A class of subgroups is obtained for symmetric groups using signed Brauer diagrams.
Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups preserving the linear, projective and combinatorial…
The scalar difference equation $x_{n+1}=f_{n}(x_{n},x_{n-1},...,x_{n-k})$ may exhibit symmetries in its form that allow for reduction of order through substitution or a change of variables. Such form symmetries can be defined generally…
As an example of the categorical apparatus of pseudo algebras over 2-theories, we show that pseudo algebras over the 2-theory of categories can be viewed as pseudo double categories with folding or as appropriate 2-functors into…
The study of tilings is a major problem in many mathematical instances, which is studied in two main different approaches: when considering the existence (or obstructions to the existence) of a tiling with a given tile and the other…
Using semi-tensor product of matrices, the structures of several kinds of symmetric games are investigated via the linear representation of symmetric group in the structure vector of games as its representation space. First of all, the…
Solution and analysis of mathematical programming problems may be simplified when these problems are symmetric under appropriate linear transformations. In particular, a knowledge of the symmetries may help reduce the problem dimension, cut…
We give a characterization of the sets of objects of the derived category of a block of a finite group algebra (or other symmetric algebra) that occur as the set of images of simple modules under an equivalence of derived categories. We…
How can we predict the difficulty of a Sudoku puzzle? We give an overview of difficulty rating metrics and evaluate them on extensive dataset on human problem solving (more then 1700 Sudoku puzzles, hundreds of solvers). The best results…
We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…
Combinatorial aspects of R-subgroups of finite dimensional Beidleman near-vector spaces over nearfields are studied. A characterization of R-subgroups is used to obtain the smallest possible size of a generating set of a subgroup, which is…