相关论文: Algebraic Structure of the Varikon Box

The article proposes a heuristic approximation approach to the bin packing problem under multiple objectives. In addition to the traditional objective of minimizing the number of bins, the heterogeneousness of the elements in each bin is…

For natural and artificial systems with some symmetry structure, computational understanding and manipulation can be achieved without learning by exploiting the algebraic structure. Here we describe this algebraic coordinatization method…

In this paper I present a conjecture for a recursive algorithm that finds each permutation of combining two sets of objects (AKA the Shuffle Product). This algorithm provides an efficient way to navigate this problem, as each atomic…

The puzzle method was introduced by Choi and Park as an effective method for finding non-singular characteristic maps over wedged simplicial complexes $K(J)$ obtained from a given simplicial complex $K$. We study further the mod 2 case of…

We study the complexity of symmetric assembly puzzles: given a collection of simple polygons, can we translate, rotate, and possibly flip them so that their interior-disjoint union is line symmetric? On the negative side, we show that the…

We present an algebraic characterization of the complexity classes Logspace and NLogspace, using an algebra with a composition law based on unification. This new bridge between unification and complexity classes is inspired from proof…

We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…

We study a quantum-mechanical system of three particles in a one-dimensional box with two-particle harmonic interactions. The symmetry of the system is described by the point group $D_{3d}$. Group theory greatly facilitates the application…

Family Puzzle or Generation Problem demands an explanation of why there are 3 families or generations of quarks and leptons in the Standard Model of particle physics. Here we propose a novel solution -- the multiple of 3 families of 16 Weyl…

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,…

The picture-hanging puzzle, popularized by Demaine et al. (2014), asks for a way to wrap a wire around $n$ nails such that the picture hangs as long as fewer than $k$ nails are removed, but falls as soon as any $k$ are removed. Solutions…

The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…

The group algebra of the permutation group is spanned by a set of elements called projectors. The coordinates of permutations expanded in projectors are matrix elements of irreducible representations. The projectors of the permutation group…

We introduce a pregeometry that provides a metric and dimensionality over a Borel set (Wheeler's "bucket of dust") without assuming probability amplitudes for adjacency. Rather, a non-trivial metric is produced over a Borel set X per a…

Using Klein's approach, geometry can be studied in terms of a space of points and a group of transformations of that space. This allows us to apply algebraic tools in studying geometry of mathematical structures. In this article, we follow…

In the $15$-puzzle game, $15$ labeled square tiles are reconfigured on a $4\times 4$ board through an escort, wherein each (time) step, a single tile neighboring it may slide into it, leaving the space previously occupied by the tile as the…

By using two different invariants for the Rubik's Magic puzzle, one of metric type, the other of topological type, we can dramatically reduce the universe of constructible configurations of the puzzle. Finding the set of actually…

We introduce a family of reconfiguration puzzles arising from ideas in geometry and topology. We present their construction from square-tiled shapes, discuss some of the underlying mathematics and describe how they are naturally associated…

Many finite groups, including all finite non-abelian simple groups, can be symmetrically generated by involutions. In this paper we give an algorithm to symmetrically represent elements of finite groups and to transform symmetrically…

We introduce a Poisson variety compatible with a cluster algebra structure and a compatible toric action on this variety. We study Poisson and topological properties of the union of generic orbits of this toric action. In particular, we…