Related papers: Partitioning the hypercube into smaller hypercubes
The notion of deconfinement in two d=1 models, the Schwinger model and the Heisenberg chain, is re-examined. Both have half-asymptotic excitations (where particles and antiparticles must alternate) and also truly asymptotic particles which…
In this paper we produce a few continuations of our previous work on partitions into fractions. Specifically, we study strictly increasing integer sequences $\{n_j\}$ such that there are partitions for all integers less than the floor of…
We study the existence of plane substructures in drawings of the $d$-dimensional hypercube graph $Q_d$. We construct drawings of $Q_d$ which contain no plane subgraph with more than $2d-2$ edges, no plane path with more than $2d-3$ edges,…
Every choice of an orthonormal frame in the d-dimensional Hilbert space of a system corresponds to one set of all mutually commuting density matrices or, equivalently, a classical statistical state space of the system; the quantum state…
We consider constructions of covering-radius-1 completely regular codes, or, equivalently, equitable 2-partitions (regular 2-partitions, perfect 2-colorings), of halved n-cubes. Keywords: completely regular code, equitable partition,…
A particularly simple description of separability of quantum states arises naturally in the setting of complex algebraic geometry, via the Segre embedding. This is a map describing how to take products of projective Hilbert spaces. In this…
Given a nowheredense closed subset $X$ of a metrizable compact space $\tx$, we characterize the dimension of $X$ in terms of the multiplicity of the canonicals covers of the complementary of $X$, specially in some particular cases, like…
We present an algorithm to compute the number of solutions of the (constrained) number partitioning problem. A concrete implementation of the algorithm on an Ising-type quantum computer is given.
We show how to construct a cubic partial cube from any simplicial arrangement of lines or pseudolines in the projective plane. As a consequence, we find nine new infinite families of cubic partial cubes as well as many sporadic examples.
In tri-partite systems, there are three basic biseparability, $A$-$BC$, $B$-$CA$ and $C$-$AB$ biseparability according to bipartitions of local systems. We begin with three convex sets consisting of these basic biseparable states in the…
This paper presents compact, symmetric, and high-order finite difference methods (FDMs) for the variable Poisson equation on a $d$-dimensional hypercube. Our scheme produces a symmetric linear system: an important property that does not…
Edge-centric distributed computations have appeared as a recent technique to improve the shortcomings of think-like-a-vertex algorithms on large scale-free networks. In order to increase parallelism on this model, edge partitioning -…
We present structures comprised of identical convex polyhedra which are interlocked geometrically. These sets cannot be disassembled by removing individual polyhedra by translations and/or rotations. The shapes that permit interlocking…
For an integer partition $h_1 + \dots + h_n = N$, a 2-realization of this partition is a latin square of order $N$ with disjoint subsquares of orders $h_1,\dots,h_n$. The existence of 2-realizations is a partially solved problem posed by…
We give efficient quantum algorithms to estimate the partition function of (i) the six vertex model on a two-dimensional (2D) square lattice, (ii) the Ising model with magnetic fields on a planar graph, (iii) the Potts model on a quasi 2D…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
Given a set $S$ of $n$ points in $\mathbb{R}^d$, a $k$-set is a subset of $k$ points of $S$ that can be strictly separated by a hyperplane from the remaining $n-k$ points. Similarly, one may consider $k$-facets, which are hyperplanes that…
This article describes sixteen different ways to traverse d-dimensional space recursively in a way that is well-defined for any number of dimensions. Each of these traversals has distinct properties that may be beneficial for certain…
Following the programme set out in Part I of this work, we develop a conceptual higher order differential calculus. The '' local linear algebra '' defined in Part I is generalized by '' higher order local linear algebra ''. The underlying…
Let $d$ be an integer greater than $1$, and let $t$ be fixed such that $\frac{1}{d} < t < \frac{1}{d-1}$. We prove that for any $n_0$ chosen sufficiently large depending upon $t$, the $d$-dimensional cubes of sidelength $n^{-t}$ for $n \geq…