arXiv subjects
Publications and source records attributed to Eugen J. Ionascu.
In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving binomial coefficients and Fibonacci type sequences.
In this paper we describe a procedure for calculating the number of regular octahedrons that have vertices with coordinates in the set {0,1,...,n}. As a result, we introduce a new sequence in ``The Online Encyclopedia of Integer Sequences" (A178797) and list the first one hundred terms of it. We adapt the method appeared in [11] which was used to find the number of regular tetrahedra with coordinates of their vertices in {0,1,...,n}. The idea of this calculation is based on the theoretical results obtained in [14]. A new fact proved here helps increasing the speed of all the programs used before. The procedure is put together in a series of commands written for Maple.
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 {0,1,...,n}. The idea is based on the theoretical results obtained in [13]. We extend then the sequence A098928 in the Online Encyclopedia of Integer Sequences to the first one hundred terms.
Paul Erdos conjectured that for every n in N, n>1, there exist a, b, c natural numbers, not necessarily distinct, so that 4/n=1/a+1/b+1/c (see \cite{rg}). In this paper we prove an extension of Mordell's theorem and formulate a conjecture which is stronger than Erdos' conjecture.
In this note we describe a procedure of calculating the number all regular tetrahedra that have coordinates in the set {0,1,...,n}. We develop a few results that may help in finding good estimates for this sequence which is twice A103158 in the Online Encyclopedia of Integer Sequences.
Extending previous results on a characterization of all equilateral triangle in space having vertices with integer coordinates ("in $\mathbb Z^3$"), we look at the problem of characterizing all regular polyhedra (Platonic Solids) with the same property. To summarize, we show first that there is no regular icosahedron/ dodecahedron in $\mathbb Z^3$. On the other hand, there is a finite (6 or 12) class of regular tetrahedra in $\mathbb Z^3$, associated naturally to each nontrivial solution $(a,b,c,d)$ of the Diophantine equation $a^2+b^2+c^2=3d^2$ and for every nontrivial integer solution $(m,n,k)$ of the equation $m^2-mn+n^2=k^2$. Every regular tetrahedron in $\mathbb Z^3$ belongs, up to an integer translation and/or rotation, to one of these classes. We then show that each such tetrahedron can be completed to a cube with integer coordinates. The study of regular octahedra is reduced to the cube case via the duality between the two. This work allows one to basically give a description the orthogonal group $O(3,\mathbb Q)$ in terms of the seven integer parameters satisfying the two relations mentioned above.
We are interested in constructing concrete independent events in purely atomic probability spaces with geometric distribution. Among other facts we prove that there are uncountable many sequences of independent events.
We introduce a two-player game in which one and his/her opponent attempt to pack as many ``prisoners'' as possible on the squares of an n-by-n checkerboard; each prisoner has to be ``protected'' by at least as many guards as the number of the other prisoners adjacent. Initially, the board is covered entirely with guards. The players take turns adjusting the board configuration using one of the following rules in each turn: I. Replace one guard with a prisoner of the player's color. II. Replace one prisoner of either color with a guard and replace two other guards with prisoners of the player's color. We analyze winning strategies for small n (n<5) and the maximum number of prisoners in general. We show that this maximum is less than (7n^2+4n)/11 and conjecture it is more likely 3n^2/5+O(n).
In this note we characterize all regular tetrahedra whose vertices in R^3 have integer coordinates. The main result is a consequence of the characterization of all equilateral triangles having integer coordinates contained in previous work. Then we use this characterization to point out some corollaries. The number of such tetrahedra whose vertices are in the finite set {0,1,2,...,n}^3, n in N, is related to the sequence A103158 in the Online Encyclopedia of Integer Sequences.
This paper is a continuation of previous work of the authors. We extend one of the theorems that gave a way to construct equilateral triangles whose vertices have integer coordinates to the general situation. An approximate extrapolation formula for the sequence ET(n) of all equilateral triangles with vertices in $\{0,1,2,...,n\}^3$ (A 102698) is given and the asymptotic behavior of this sequence is analyzed.
We describe a procedure of counting all equilateral triangles in the three dimensional space whose coordinates are allowed only in the set $\{0,1,...,n\}$. This sequence is denoted here by ET(n) and it has the entry A102698 in "The On-Line Encyclopedia of Integer Sequences". The procedure is implemented in Maple and its main idea is based on the results in \cite{eji}. Using this we calculated the values ET(n) for n=1..55 which are included here. Some facts and conjectures about this sequence are stated. The main of them is that $\ds \lim_{n\to \infty} \frac{\ln ET(n)}{\ln n+1}$ exists.
A new method of connecting two wavelet sets with a continuous path of wavelet sets is given. The method is based on a pure set theoretic fact known as the Schroder-Cantor-Bernstein theorem and on a characterization of wavelet sets in terms of one-to-one measurable bijections of [0,1) satisfying some extra conditions.
Simultaneous tiling for several different translational sets has been studied rather extensively, particularly in connection with the Steinhaus problem. The study of orthonormal wavelets in recent years, particularly for arbitrary dilation matrices, has led to the study of multiplicative tilings by the powers of a matrix. In this paper we consider the following simultaneous tiling problem: Given a lattice in $Ł\in \R^d$ and a matrix $A\in\GLd$, does there exist a measurable set $T$ such that both $\{T+α: α\inŁ\}$ and $\{A^nT: n\in\Z\}$ are tilings of $\R^d$? This problem comes directly from the study of wavelets and wavelet sets. Such a $T$ is known to exist if $A$ is expanding. When $A$ is not expanding the problem becomes much more subtle. Speegle \cite{Spe03} exhibited examples in which such a $T$ exists for some $Ł$ and nonexpanding $A$ in $\R^2$. In this paper we give a complete solution to this problem in $\R^2$.
In this paper, we study the function $H(a,b)$, which associates to every pair of positive integers $a$ and $b$ the number of positive integers $c$ such that the triangle of sides $a,b$ and $c$ is Heron, i.e., has integral area. In particular, we prove that $H(p,q)\le 5$ if $p$ and $q$ are primes, and that $H(a,b)=0$ for a random choice of positive integers $a$ and $b$.
We study k-dependence and half domination problems for king's graphs in dimension n (n>1). Various sharp bounds are provided and a few conjectures are formulated in the cases the estimates are not the best possible.
We study the existence of equilateral triangles of given side lengths and with integer coordinates in dimension three. We show that such a triangle exists if and only if their side lengths are of the form $\sqrt{2(m^2-mn+n^2)}$ for some integers $m,n$. We also show a similar characterization for the sides of a regular tetrahedron in $\Z^3$: such a tetrahedron exists if and only if the sides are of the form $k\sqrt{2}$, for some $k\in\N$. The classification of all the equilateral triangles in $\Z^3$ contained in a given plane is studied and the beginning analysis is presented. A more general parametrization is proven under a special assumption. Some related questions are stated in the end.