Related papers: Neighbour Sum Patterns : Chessboards to Toroidal W…
The present work consists of a numerical study of the dynamics of irrational polygonal billiards. Our contribution reinforces the hypothesis that these systems could be Strongly Mixing, although never demonstrably chaotic, and discuss the…
Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…
For each integer $x$, the $x$-th generalized pentagonal number is denoted by $P_5(x)=(3x^2-x)/2$. Given odd positive integers $a,b,c$ and non-negative integers $r,s$, we employ the theory of ternary quadratic forms to determine when the sum…
This paper presents a novel construction method for symmetric Sudoku-type games based on Lee distance perfect codes and diameter perfect codes. The proposed method utilizes the tiling property of these codes to define the structure of the…
It is well-known that orthogonal polynomials on the real line satisfy a three-term recurrence relation and conversely every system of polynomials satisfying a three-term recurrence relation is orthogonal with respect to some positive Borel…
We prove that the classic falling-block video game Tetris (both survival and board clearing) remains NP-complete even when restricted to 8 columns, or to 4 rows, settling open problems posed over 15 years ago [BDH+04]. Our reduction is from…
We give an explicit construction, based on Hadamard matrices, for an infinite series of floor{sqrt{d}/2}-neighborly centrally symmetric d-dimensional polytopes with 4d vertices. This appears to be the best explicit version yet of a recent…
The newly introduced neighborhood matrix extends the power of adjacency and distance matrices to describe the topology of graphs. The adjacency matrix enumerates which pairs of vertices share an edge and it may be summarized by the degree…
Tur\'an problems in extremal combinatorics ask to find asymptotic bounds on the edge densities of graphs and hypergraphs that avoid specified subgraphs. The theory of flag algebras proposed by Razborov provides powerful methods based on…
We study edge-isoperimetric inequalities in chamber graphs of affine hyperplane arrangements. Our approach is topological: to a set of chambers we associate its thickening in Euclidean space and estimate its edge boundary through the…
New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…
We study the neighborhood polynomial and the complexity of its computation for chordal graphs. The neighborhood polynomial of a graph is the generating function of subsets of its vertices that have a common neighbor. We introduce a…
Generalizing the notion of odd-sum colorings, a $\mathbb{Z}$-labeling of a graph $G$ is called a closed coloring with remainder $k\mod n$ if the closed neighborhood label sum of each vertex is congruent to $k\mod n$. If such colorings…
We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…
Islands are combinatorial objects that can be intuitively defined on a board consisting of a finite number of cells. Based on the neighbor relation of the cells, it is a fundamental property that two islands are either containing or…
Multidimensional model describing the cosmological evolution of n Einstein spaces in the theory with l scalar fields and forms is considered. When electro-magnetic composite p-brane ansatz is adopted, and certain restrictions on the…
Let K be a ring and let A be a subset of K. We say that a map f:A \to K is arithmetic if it satisfies the following conditions: if 1 \in A then f(1)=1, if a,b \in A and a+b \in A then f(a+b)=f(a)+f(b), if a,b \in A and a \cdot b \in A then…
We examine the question how string theory achieves a sum over bulk geometries with fixed asymptotic boundary conditions. We discuss this problem with the help of the tensionless string on $\mathcal{M}_3 \times \mathrm{S}^3 \times…
A classic result by Raynaud and Gruson says that the notion of an (infinite dimensional) vector bundle is Zariski local. This result may be viewed as a particular instance (for n = 0) of the locality of more general notions of…
Let T(m,n) denote the number of ways to tile an m-by-n rectangle with dominos. For any fixed m, the numbers T(m,n) satisfy a linear recurrence relation, and so may be extrapolated to negative values of n; these extrapolated values satisfy…