Related papers: Counting all cubes in {0,1,...,n}^3
We present the geometry lying behind counting twin prime polynomials in $\mathbb{F}_q[T]$ in general. We compute cohomology and explicitly count points by means of a twisted Lefschetz trace formula applied to these parametrizing varieties…
In order to count the number of smooth cubic hypersurfaces tangent to a prescribed number of lines and passing through a given number of points, we construct a compactification of their moduli space. We term the latter a…
In this paper, we consider the problem about finding out perfect powers in an alternating sum of consecutive cubes. More precisely, we completely solve the Diophantine equation $(x+1)^3 - (x+2)^3 + \cdots - (x + 2d)^3 + (x + 2d + 1)^3 =…
Let $X_1,X_2,...$ be the digits in the base-$q$ expansion of a random variable $X$ defined on $[0,1)$ where $q\ge2$ is an integer. For $n=1,2,...$, we study the probability distribution $P_n$ of the (scaled) remainder…
The sliding cubes model is a well-established theoretical framework that supports the analysis of reconfiguration algorithms for modular robots consisting of face-connected cubes. The best algorithm currently known for the reconfiguration…
In this paper, we derive certain congruences for the number of $3$-core cubic bipartitions using elementary $q$-series manipulations and dissection formulas.
In this paper we survey Eckardt points on a smooth complex cubic threefold with an approach aimed at computing all Eckardt points of a cubic threefold. In addition, we construct cubic threefolds with no Eckardt points but containing triple…
First, we calculate the Ehrhart polynomial associated to an arbitrary cube with integer coordinates for its vertices. Then, we use this result to derive relationships between the Ehrhart polynomials for regular lattice tetrahedrons and…
We investigate the problem of finding integers $k$ such that appending any number of copies of the base-ten digit $d$ to $k$ yields a composite number. In particular, we prove that there exist infinitely many integers coprime to all digits…
We present a geometric algorithm to compute the geometric kernel of a generic polyhedron. The geometric kernel (or simply kernel) is definedas the set of points from which the whole polyhedron is visible. Whilst the computation of the…
We consider the problem of determining the length of the shortest paths between points on the surfaces of tetrahedra and cubes. Our approach parallels the concept of Alexandrov's star unfolding but focuses on specific polyhedra and uses…
Alon and F\"{u}redi (1993) showed that the number of hyperplanes required to cover $\{0,1\}^n\setminus \{0\}$ without covering $0$ is $n$. We initiate the study of such exact hyperplane covers of the hypercube for other subsets of the…
The notion of $\theta$-congruent numbers generalizes the classical congruent number problem. Recall that a positive integer $n$ is $\theta$-congruent if it is the area of a rational triangle with an angle $\theta$ whose cosine is rational.…
We give a complete description of the set of triples (a,b,c) of real numbers with the following property. There exists a constant K such that a n_3 + b n_2 + c n_1 - K is a lower bound for the matching number of every connected subcubic…
In this paper, we present a novel algorithm and its three variations for solving the Rubik's cube more efficiently. This algorithm can be used to solve the complete $n \times n \times n$ cube in $O(\frac{n^2}{\log n})$ moves. This algorithm…
A \emph{chain} in the unit $n$-cube is a set $C\subset [0,1]^n$ such that for every $\mathbf{x}=(x_1,\ldots,x_n)$ and $\mathbf{y}=(y_1,\ldots,y_n)$ in $C$ we either have $x_i\le y_i$ for all $i\in [n]$, or $x_i\ge y_i$ for all $i\in [n]$.…
From a scalar field defined at the corner of a cube, an isosurface can be extracted using the Marching Cube algorithm. The isosurface separates the cell into two or more partial cells. A similar situation arises when an material interface…
In this paper, we study the problem of computing a minimum-width axis-aligned cubic shell that encloses a given set of $n$ points in a three-dimensional space. A cubic shell is a closed volume between two concentric and face-parallel cubes.…
A Hilbert cube of dimension $d$ is the set of integers \[ H(a_{0}; a_{1}, \ldots, a_{d})=a_{0}+\{0, a_{1}\}+\cdots+\{0, a_{d}\}=\left\{a_{0}+\sum_{i=1}^{d}\varepsilon_{i}a_{i}:\;\varepsilon_{i}\in\{0,1\}\right\}. \] Brown, Erd\H{o}s and…
We give formulas for the number of representations of non negative integers by various quadratic forms. We also give evaluations in the case of sum of two cubes (cubic case) and the quintic case, as well. We introduce a class of generalized…