Related papers: The Z-cubes: a hypercube variant with small diamet…
We prove a vertex isoperimetric inequality for the $n$-dimensional Hamming ball $\mathcal{B}_n(R)$ of radius $R$. The isoperimetric inequality is sharp up to a constant factor for sets that are comparable to $\mathcal{B}_n(R)$ in size. A…
We describe in details the nxnxn Rubik's Cube, namely a Rubik's Cube with n rotating slices in each face. Then we state and prove the "first law of Cubology", i.e. the solvability criterion, for it
Although Hadamard matrices have been investigated since the nineteenth century, relatively little is known about their higher-dimensional analogues. In this paper, we introduce two constructions of Hadamard hypercubes. The first…
This work arose from efforts to generalise the usual cubical boundary by using different 'weights' for opposite faces, but still to obtain a chain complex, and this method was found to generalise. We describe a variant of the classical…
We consider hypercubes with pairwise disjoint faulty edges. An $n$-dimensional hypercube $Q_n$ is an undirected graph with $2^n$ nodes, each labeled with a distinct binary strings of length $n$. The parity of the vertex is 0 if the number…
An \emph{$n$-cube antichain} is a subset of the unit $n$-cube $[0,1]^n$ that does not contain two elements $\mathbf{x}=(x_1, x_2,\ldots, x_n)$ and $\mathbf{y}=(y_1, y_2,\ldots, y_n)$ satisfying $x_i\le y_i$ for all $i\in \{1,\ldots,n\}$.…
Nanotechnology has already made indelible dents in the fields of communication, computation, electronics, photonics, gas sensors, diagnostic technologies, catalysis, drug delivery systems and imaging. In particular, ZnO nanostructures have…
A Hamilton decomposition of a graph is a partitioning of its edge set into disjoint spanning cycles. The existence of such decompositions is known for all hypercubes of even dimension $2n$. We give a decomposition for the case $n = 2^a3^b$…
We show that if a cubic hypersurface with positive dual defect over the complex number field is not a cone, then either the hypersurface coincides with the secant variety of the singular locus, or the hypersurface contains a linear…
Let $Q_n$ denote the $n$-dimensional hypercube with the vertex set $V_n=\{0,1}^n$. A 0/1-polytope of $Q_n$ is a convex hull of a subset of $V_n$. This paper is concerned with the enumeration of equivalence classes of full-dimensional…
We prove that a subset of the hypercube $(0,1)^d$ with volume sufficiently close to $\frac12$ has (relative) perimeter greater than or equal to $1$. This settles a conjecture by Brezis and Bruckstein. We also prove that, in contrast with…
This paper studies the geodesic diameter of polygonal domains having h holes and n corners. For simple polygons (i.e., h = 0), the geodesic diameter is determined by a pair of corners of a given polygon and can be computed in linear time,…
Models with warped extra dimensions, and their strongly coupled duals, offer a nice solution to the hierarchy problem and a very appealing realisation of flavour. Compatibility with the very stringent electroweak and flavour tests have made…
The two-dimensional Hubbard model is studied for small values of the interaction strength (U of the order of the hopping amplitude t), using a variational ansatz well suited for this regime. The wave function, a refined Gutzwiller ansatz,…
For a given undirected graph $G$, an \emph{ordered} subset $S = {s_1,s_2,...,s_k} \subseteq V$ of vertices is a resolving set for the graph if the vertices of the graph are distinguishable by their vector of distances to the vertices in…
The hypercube \( Q_n \) contains a Hamiltonian path joining \( x \) and \( y \) (where $x$ and $y$ from the opposite partite set) containing \( P \) if and only if the induced subgraph of \( P \) is a linear forest, where none of these…
It is known that the $n$-dimensional hypercube $Q_n,$ for $n$ even, has a decomposition into $k$-cycles for $k=n, 2n,$ $2^l$ with $2 \leq l \leq n.$ In this paper, we prove that $Q_n$ has a decomposition into $2^mn$-cycles for $n \geq 2^m.$…
We prove that the combinatorial optimization problem of determining the hull number of a partial cube is NP-complete. This makes partial cubes the minimal graph class for which NP-completeness of this problem is known and improves some…
We generalized to higher dimensions the notions of optical orthogonal codes. We establish uper bounds on the capacity of general $ n $-dimensional OOCs, and on specific types of ideal codes (codes with zero off-peak autocorrelation). The…
We find the asymptotic behavior of the Steiner k-diameter of the $n$-cube if $k$ is large. Our main contribution is the lower bound, which utilizes the probabilistic method.