A recently proposed stochastic model to describe the citation process in the presence of obsolescence is used to answer the question: If a paper has not been cited by a certain time after its publication, what is the probability that it will ever be cited? A proof of the theorem is appended. (Author/LRW)

Discusses the concept of the hyperbolic or skew distribution as a universal statistical law in information science and socioeconomic studies. Topics include Zipf's law; Stankov's universal law; non-Gaussian distributions; and why most bibliometric and scientometric laws reveal characters of non-Gaussian distribution. (Author/LRW)

In this paper, using the Lambert series and other known results, the authors consider the computation of a class of series involving the powers of generalized Fibonacci and Lucas numbers, and obtain their approximate values.

If the point of suspension of a multiple pendulum is suitably oscillated then the pendulum can remain in motion in an upside-down position. Since such pendulums can model flexible materials, this inverted motion is sometimes referred to as an 'Indian rope trick'. Despite the complexity of the governing differential equations, this rope trick can…

The telescoping sum constitutes a powerful technique for summing series. In this note, this technique is illustrated by a series of problems starting off with some simple ones in arithmetic, then some in trigonometry, famous families of numbers, Apery-like formulas, and finally ending with a class of problems that are solved by computer.

The mean and variance of the number of turning points in random permutations of two kinds of distinct elements are evaluated. These results are applied to a Wald-Wolfowitz run test.

Based on the dominated convergence theorem and parametric differentiation, two different evaluations of the Laplace integral are displayed. This article presents two different proofs of (1) which may be of interest since they are based on principles within the realm of real analysis. The first method applies the dominated convergence theorem to…

In theory, there are many methods for the representation of signals. In practice, however, Fourier analysis involving the resolution of signals into sinusoidal components is used widely. There are several methods for Fourier analysis available for representation of signals. If the signal is periodic, then the Fourier series is used to represent…

In this note 4 x 4 most-perfect pandiagonal magic squares are considered in which rows, columns and the two main, along with the broken, diagonals add up to the same sum. It is shown that the Moore-Penrose inverse of these squares has the same magic property.

This note provides a self-contained introduction to conics as loci of points equidistant from circles, lines and points, including a study of the loci of points equidistant from two circles, separated, intersecting or touching. (Contains 1 table and 8 figures.)

The well-known Frobenius rank inequality established by Frobenius in 1911 states that the rank of the product ABC of three matrices satisfies the inequality rank(ABC) [greater than or equal]rank(AB) + rank(BC) - rank(B) A new necessary and sufficient condition for equality to hold is presented and then some interesting consequences and…

Nature is full of different crystals and many of them have shapes of regular geometric objects. Those in which the fractal structure of a geometric object can be recognized are especially unusual. In this paper a generalization of one of these shapes is described: a formation, based on an n-dimensional simplex. The construction of an n-dimensional…

The note considers M-bonacci numbers, which are a generalization of Fibonacci numbers. Two new summation formulas for M-bonacci numbers are given. The formulas are generalizations of the two summation formulas for Fibonacci numbers. (Contains 2 tables.)

This paper introduces a class of matrices, the rows and columns of which add up to identical constants (generally speaking, different for rows and columns). Some properties of these matrices, which will be called "magic rectangles" are discussed.

An algorithm is presented to solve multiple assignment problems in which a cost is incurred only when an assignment is made at a given cell. The proposed method recursively searches for single/group absolute points to identify cells that must be loaded in any optimal solution. Unlike other methods, the first solution is the optimal solution. The…