Related papers: Polyhedral Cones of Magic Cubes and Squares
In this paper we define and construct a new class of algebraic surfaces in three-dimensional Euclidean space generated by a curve and a congruence of circles. We study their properties and visualize them with the program Mathematica.
The theoretical computing of special values assumed by the hypergeometric functions has a high interest not only on its own, but also in sight of the remarkable implications to both pure Mathematics and Mathematical Physics. Accordingly, in…
We present explicit constructions of orthogonal polynomials inside quadratic bodies of revolution, including cones, hyperboloids, and paraboloids. We also construct orthogonal polynomials on the surface of quadratic surfaces of revolution,…
A way to construct and classify the three dimensional polynomially deformed algebras is given and the irreducible representations is presented. for the quadratic algebras 4 different algebras are obtained and for cubic algebras 12 different…
In this article, we present a unified algebraic-combinatorial framework for computing explicit, piecewise rational, and combinatorially indexed parametric formulas for volumes and higher moments of slices and slabs of polyhedral norm balls.…
In this paper, we study the concept of "binary color-coded magic squares" by assigning two distinct colors to the even and odd numbers within a magic square. We investigate the uniqueness of patterns within these squares using three…
A cubic polyhedron is a polyhedral surface whose edges are exactly all the edges of the cubic lattice. Every such polyhedron is a discrete minimal surface, and it appears that many (but not all) of them can be relaxed to smooth minimal…
The basic methods of constructing the sets of mutually unbiased bases in the Hilbert space of an arbitrary finite dimension are discussed and an emerging link between them is outlined. It is shown that these methods employ a wide range of…
We have derived long series expansions for the perimeter generating functions of the radius of gyration of various polygons with a convexity constraint. Using the series we numerically find simple (algebraic) exact solutions for the…
In this note we give a theoretical support by means of quotient polynomial rings for the computation formulas of the dimension of abelian codes.
Explicit algorithms are developed for constructing odd order n pandiagonal latin cubes in 3 and 4 dimensions, and these are used to construct pandiagonal magic cubes and 4 dimensional hypercubes, respectively. It is established that these…
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 survey some aspects of the theory of elliptic surfaces and give some results aimed at determining the Picard number of such a surface. For the surfaces considered, this will be equivalent to determining the Mordell-Weil rank of an…
We present a configuration called a magic permutohedron that shows the placement of the numbers of $\{1, 2, 3, \dots, 24\}$ in the vertices of the permutohedra so that the sum of numbers on each square side is 50 and the sum of the numbers…
We use the results of AG/0406290 to discuss the counting formulas of network flow polytopes and magic squares, i.e. the formula for the corresponding Ehrhart polynomial in terms of residues. We also discuss a description of the big cells…
If the four triangular facets of a tetrahedron can be partitioned into pairs having the same area, then the triangles in each pair must be congruent to one another. A Heron-style formula is then derived for the volume of a tetrahedron…
A version of the Hardy-Littlewood circle method is developed for number fields K/Q and is used to show that non-singular projective cubic hypersurfaces over K always have a K-rational point when they have dimension at least 8.
Geometric Algebra and Calculus are mathematical languages encoding fundamental geometric relations that theories of physics seem to respect. We propose criteria given which statistics of expressions in geometric algebra are computable in…
We give a method to construct deep holes for elliptic curve codes. For long elliptic curve codes, we conjecture that our construction is complete in the sense that it gives all deep holes. Some evidence and heuristics on the completeness…
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…