相关论文: Bordered magic squares: elements for a comprehensi…

Trying to be effective (no matter who exactly and in what field) a person face the problem which inevitably destroys all our attempts to easily get to a desired goal. The problem is the existence of some insuperable barriers for our mind,…

A quantum algorithm for general combinatorial search that uses the underlying structure of the search space to increase the probability of finding a solution is presented. This algorithm shows how coherent quantum systems can be matched to…

We find the numbers of $3 \times 3$ magic, semimagic, and magilatin squares, as functions either of the magic sum or of an upper bound on the entries in the square. Our results on magic and semimagic squares differ from previous ones in…

A general method is given for revising degrees of belief and arriving at consistent decisions about a system of logically constrained issues. In contrast to other works about belief revision, here the constraints are assumed to be fixed.…

Border bases arise as a canonical generalization of Gr\"obner bases. We provide a polyhedral characterization of all order ideals (and hence border bases) that are supported by a zero-dimensional ideal: order ideals that support a border…

In this article we consider combinatorial maps approach to graphs on surfaces, and how between them can be establish terminological uniformity in favor of combinatorial maps in way rotations are set as base structural elements and all other…

The component-by-component construction is the standard method of finding good lattice rules or polynomial lattice rules for numerical integration. Several authors have reported that in numerical experiments the generating vector sometimes…

Arithmetic combinatorics is often concerned with the problem of bounding the behaviour of arbitrary finite sets in a group or ring with respect to arithmetic operations such as addition or multiplication. Similarly, combinatorial geometry…

Automatic chess problem or puzzle composition typically involves generating and testing various different positions, sometimes using particular piece sets. Once a position has been generated, it is then usually tested for positional…

This paper explores a full generalization of the classical corner-vector method for constructing weighted spherical designs, which we call the {\it generalized corner-vector method}. First we establish a uniform upper bound for the degree…

This article presents a new development of magic squares with a simple set up.

This paper presents a quantum search approach to combinatorial constraint satisfaction problems, demonstrated through the generation of magic squares. We reformulate magic square construction as a quantum search problem in which a…

A magic SET square is a 3 by 3 table of SET cards such that each row, column, diagonal, and anti-diagonal is a set. We allow the following transformations of the square: shuffling features, shuffling values within the features, rotations…

This paper gives a generic form of the diamond lemma, which includes support for additive and topological structures of the base set, and which does not require any further structure (e.g. an associative multiplication operation) to be…

At its core, abstraction is the process of generalizing from specific instances to broader concepts or models, with the primary objective of reducing complexity while preserving properties essential to the intended purpose. It is…

We consider apictorial edge-matching puzzles, in which the goal is to arrange a collection of puzzle pieces with colored edges so that the colors match along the edges of adjacent pieces. We devise an algebraic representation for this…

This paper tackles the challenging problem of constrained hexahedral meshing. An algorithm is introduced to build combinatorial hexahedral meshes whose boundary facets exactly match a given quadrangulation of the topological sphere. This…

We consider combinatorial maps with fixed combinatorial knot numbered with augmenting numeration called normalized knot. We show that knot's normalization doesn't affect combinatorial map what concerns its generality. Knot's normalization…

Let $(\Gamma,+)$ be an Abelian group of order $n^2$ and MS$_{\Gamma}(n)$ be an $n\times n$ array whose entries are all elements of $\Gamma$. Then MS$_{\Gamma}(n)$ is a $\Gamma$-magic square if all row, column, main and backward main…

A square trisection is a problem of assembling three identical squares from a larger square, using a minimal number of pieces. This paper presents an historical overview of the square trisection problem starting with its origins in the…