Related papers: Algebraic Structure of the Varikon Box

In this paper, we study a reversible process (more precisely, a groupoid/group action) resembling the classical 15-puzzle, where the legal moves are to ``move the unique hole inside a translate of a shape $S$''. Such a process can be…

In the picture-hanging puzzle we are to hang a picture so that the string loops around $n$ nails and the removal of any nail results in a fall of the picture. We show that the length of a sequence representing an element in the free group…

This paper is about a small combinatorial trick, which is well known, but has no name. Let G be a permutation group acting on a vector space M. There is a natural way to assign a cosimplicial space to these data. We call the resulting…

The structure of the coincidence symmetry group of an arbitrary $n$-dimensional lattice in the $n$-dimensional Euclidean space is considered by describing a set of generators. Particular attention is given to the coincidence isometry…

A symmetry group for Sudoku is complete if its action partitions the set of Sudoku boards into all possible orbits, and minimal if no group of smaller size would do the same. Previously, for a 4 x 4 Sudoku variation known as Shidoku, the…

We study a modification of Poisson geometry by a closed 3-form. Just as for ordinary Poisson structures, these "twisted" Poisson structures are conveniently described as Dirac structures in suitable Courant algebroids. The additive group of…

We study a construction of the Mathieu group $M_{12}$ using a game reminiscent of Loyd's ``15-puzzle''. The elements of $M_{12}$ are realized as permutations on~12 of the~13 points of the finite projective plane of order~3. There is a…

Given a graph $G$, a configuration space of $G$ can be thought of as the set of all possible configurations of "robots" which can move throughout $G$, subject to some constraints. We introduce a type of configuration space which we call…

We describe a deformation quantization of a modification of Poisson geometry by a closed 3-form. Under suitable conditions it gives rise to a stack of algebras. The basic object used for this aim is a kind of families of Poisson structures…

An important problem in geometric reasoning is to find the configuration of a collection of geometric bodies so as to satisfy a set of given constraints. Recently, it has been suggested that this problem can be solved efficiently by…

This paper is continuation of the study of the 1-box pattern in permutations introduced by the authors in \cite{kitrem4}. We derive a two-variable generating function for the distribution of this pattern on 132-avoiding permutations, and…

To any finite ordered subset and any finite partition of a group a set of tuples of positive integers, named as configurations, is associated that describes the group's behavior. The present paper provides an exposition of this notion and…

This work introduces a new class of symmetric matrix structures, called harmonic structures, which enable the generation of all possible directed transitions $(x_i, x_{i+1})$ over a set of $n$ symbols, without internal repetitions. Unlike…

Imagine an assembly line where a box with a lid and liquid in it enters in some unknown orientation. The box should leave the line with the open lid facing upwards with the liquid still in it. To save costs there are no complex sensors or…

In this paper we present a fast scalable heuristic for bin packing that partitions the given problem into identical sub-problems of constant size and solves these constant size sub-problems by considering only a constant number of bin…

The monodromy group is an invariant for parameterized systems of polynomial equations that encodes structure of the solutions over the parameter space. Since the structure of real solutions over real parameter spaces are of interest in many…

Recent progress in the field of robotic manipulation has generated interest in fully automatic object packing in warehouses. This paper proposes a formulation of the packing problem that is tailored to the automated warehousing domain.…

Using a calculus of variations approach, we determine the shape of a typical plane partition in a large box (i.e., a plane partition chosen at random according to the uniform distribution on all plane partitions whose solid Young diagrams…

A combinatorial block design $D$ is called $3$-pyramidal if there exists a subgroup $G$ of $\mbox{Aut}(D)$ fixing $3$ points and acting regularly on the other points. If this happens, we say that the design is $3$-pyramidal under $G$. In…

An appropriate framework for dealing with hadron structure and hadronic physics in the few-GeV energy range is relativistic quantum mechanics. The Bakamjian-Thomas construction provides a systematic procedure for implementing interactions…