相关论文: Multimagic Squares
A random jigsaw puzzle is constructed by arranging $n^2$ square pieces into an $n \times n$ grid and assigning to each edge of a piece one of $q$ available colours uniformly at random, with the restriction that touching edges receive the…
We consider the sum of squares function in the ring $\mathbb{Z}_{n}$. We determine formulae in a number of cases when $n$ is a power of a prime.
In the present paper we prove that for any fixed $1<c<7/6$ there exist infinitely many consecutive square-free numbers of the form $[n^c], [n^c]+1$ and we also establish an asymptotic formula in given interval.
This paper contains detailed proofs of our results on the moduli space and the structure of noncommutative 3-spheres. We develop the notion of central quadratic form for quadratic algebras, and a general theory which creates a bridge…
We prove that at least $\Omega(n^{0.51})$ hyperplanes are needed to slice all edges of the $n$-dimensional hypercube. We provide a couple of applications: lower bounds on the computational complexity of parity, and a lower bound on the…
In this paper we give several methods to construct curves over finite fields with many points and illustrate this with examples of the results.
We re-examine previous constructions of infinite binary words containing few distinct squares with the goal of finding the "simplest", in a certain sense. We exhibit several new constructions. Rather than using tedious case-based arguments…
We present a method to construct non-singular cubic surfaces over $\bbQ$ with a Galois invariant pair of Steiner trihedra. We start with cubic surfaces in a form generalizing that of A. Cayley and G. Salmon. For these, we develop an…
We study triples {a,b,c} of distinct nonzero rational numbers such that a+1,b+1,c+1,ab+1,ac+1,bc+1 and abc+1 are all perfect squares. We prove that there exist infinitely many such triples. In contrast, we show that no triple of positive…
Let $\Gamma$ be a group of order $n^2$ and $SMS_{\Gamma}(n)=(a_{i,j})_{n\times n}$ be an $n\times n$ array whose entries are all distinct elements of $\Gamma$. If there exists an element $\mu\in\Gamma$ such that for every row $i$, there…
We derive an integral formula for the linking number of two submanifolds of the n-sphere S^n, of the product S^n x R^m, and of other manifolds which appear as "nice" hypersurfaces in Euclidean space. The formulas are geometrically…
We construct a spherically symmetric noncommutative space in three dimensions by foliating the space with concentric fuzzy spheres. We show how to construct a gauge theory in this space and in particular we derive the noncommutative version…
This paper introduces a new variant of hypercubes, which we call Z-cubes. The n-dimensional Z-cube $H_n$ is obtained from two copies of the (n-1)-dimensional Z-cube $H_{n-1}$ by adding a special perfect matching between the vertices of…
In this paper, it is proved that every sufficiently large even integer can be represented as the sum of two squares of primes, two cubes of primes, two biquadrates of primes and 16 powers of 2. Furthermore, there are at least 5.313% odd…
Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…
We suggest a short proof of O.Benoist and O.Wittenberg theorem (arXiv:1907.10859) which states that for each real non-singular cubic hypersurface $X$ of dimension $\ge 2$ the real lines on $X$ generate the whole group $H_1(X(\Bbb R);\Bbb…
The main purpose of this paper is to give fundamental properties of real lightlike hypersurfaces of paraquaternionic manifolds and to prove the non-existence of real lightlike hypersurfaces in paraquaternionic space forms under some…
A complete set of N+1 mutually unbiased bases (MUBs) forms a convex polytope in the N^2-1 dimensional space of NxN Hermitian matrices of unit trace. As a geometrical object such a polytope exists for all values of N, while it is unknown…
Given a set of n unit squares in the plane, the goal is to rank them in space in such a way that only few squares see each other vertically. We prove that ranking the squares according to the lexicographic order of their centers results 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…