Related papers: A New Method in the Problem of Three Cubes
We completely solve the problem of enumerating combinatorially inequivalent $d$-dimensional polytopes with $d+3$ vertices. A first solution of this problem, by Lloyd, was published in 1970. But the obtained counting formula was not correct,…
In this article, we solve the relative isoperimetric problem in $[0,1]^3$ for orthogonal polyhedra. Up to isometries of the cube or sets of measure $0$, the minimizers are of the form $[0,\epsilon]^3$, $[0,\epsilon]^2 \times [0,1]$, or…
We proposed a purely 3-D geometrical solution to Mathematics Magazine Problem 2065. Let $\mathcal{Q}$ be a cube centered at the origin of $\mathbb{R}^3$. Choose a unit vector $(a,b,c)$ uniformly at random on the surface of the unit sphere…
A well-known open problem is to show that the cubic form $x^3+y^3+2z^3$ represents all integers. An obvious variant of this problem is whether every integer can be {\em primitively} represented by $x^3+y^3+2z^3$. In other words, given an…
We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by the fact that nonnegative separable and nonnegative quadratic…
We demonstrate a practical and efficient method for generating toric Calabi-Yau quiver theories, applicable to both D3 and M2 brane world-volume physics. A new analytic method is presented at low order parametres and an algorithm for the…
We study several related problems on polynomials with integer coefficients. This includes the integer Chebyshev problem, and the Schur problems on means of algebraic numbers. We also discuss interesting applications to approximation by…
We show that almost every positive integer can be expressed as a sum of four squares of integers represented as the sums of three positive cubes.
The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…
This paper presents new formulary solutions for quantic polynomial equations in general forms, where we present five solutions for any fifth degree polynomial equation with real coefficients, and thereby having the possibility to calculate…
We consider a puzzle such that a set of colored cubes is given as an instance. Each cube has unit length on each edge and its surface is colored so that what we call the Surface Color Condition is satisfied. Given a palette of six colors,…
In this paper we describe a procedure of calculating the number cubes that have coordinates in the set {0,1,...,n}. We adapt the code that appeared in [11] developed to calculate the number of regular tetrahedra with coordinates in the set…
We will give an explicit upper bound for the number of solutions to cubic inequality |F(x, y)| \leq h, where F(x, y) is a cubic binary form with integer coefficients and positive discriminant D. Our upper bound is independent of h, provided…
A perfect cuboid (PC) is a rectangular parallelepiped with rational sides $a,b,c$ whose face diagonals $d_{ab}$, $d_{bc}$, $d_{ac}$ and space (body) diagonal $d_s$ are rationals. The existence or otherwise of PC is a problem known since at…
Let $X\subseteq\{0,1\}^n$ be a set of binary strings of length $n$. The daisy cube $Q_n(X)$ is the subgraph of the hypercube $Q_n$ induced by the union of the intervals $I(x,0^n)$ for $x\in X$. As a subclass of partial cubes, it generalizes…
To give a parametrization of the Diophantine equation $A^{3}+B^{3}=C^{3}+D^{3}$ in terms of integral binary quadratic forms in a constructive way.
We derive tight expressions for the maximum number of $k$-faces, $0\le k\le d-1$, of the Minkowski sum, $P_1+P_2+P_3$, of three $d$-dimensional convex polytopes $P_1$, $P_2$ and $P_3$, as a function of the number of vertices of the…
A new one-parameter family of iterative method for solving nonlinear equations is constructed and studied. Two variants, both with cubic convergence, are developed, one for finding simple zeros and other for multiple zeros of known…
We prove that the equation $(x-2r)^3 + (x-r)^3 + x^3 + (x+r)^3 + (x+2r)^3= y^p$ only has solutions which satisfy $xy=0$ for $1\leq r\leq 10^6$ and $p\geq 5$ prime.
This paper presents a new approach to determine the number of solutions of three variable Frobenius related problems and to find their solutions by using order reducing methods. Here, the order of a Frobenius related problem means the…