Related papers: A Closed Form for the Pulsar Sequence
Abstract Self-similar, fractal nature of turbulence is discussed in the context of two dimensional turbulence, by considering the fractal structure of the wave-number domain using spirals. In loose analogy with phyllotaxis in plants, each…
The Gauss Circle Problem concerns finding asymptotics for the number of lattice point lying inside a circle in terms of the radius of the circle. The heuristic that the number of points is very nearly the area of the circle is surprisingly…
We study the combinatorial and structural properties of the circle map sequences. We introduce an embedding procedure which gives a map from the hull(closure of the set of translates) to the sequence of embedding operations through which we…
A Latin square is an $n$ by $n$ grid filled with $n$ symbols so that each symbol appears exactly once in each row and each column. A transversal in a Latin square is a collection of cells which do not share any row, column, or symbol. This…
In this note, we will consider two classical volume problems related to elliptic integrals. The first problem has a neat formula by means of elliptic integrals. We remade it with details. In the second problem, we found a messy formula. On…
We demonstrate how radio pulsars can be used as random number generators. Specifically, we focus on publicly verifiable randomness (PVR), in which the same sequence of trusted and verifiable random numbers is obtained by multiple parties.…
We study a family of tessellations of the Euclidean plane which are obtained by local developments of algebraic equations satisfied by the Pauli matrices.
Let $ \prod_{i=1}^d (X-\alpha_i Y) \in{\mathbb C}[X,Y]$ be a binary form and let $\epsilon_1,\dots,\epsilon_d$ be nonzero complex numbers. We consider the family of binary forms $ \prod_{i=1}^d (X-\alpha_i \epsilon_i^aY)$, $a\in {\mathbb…
We study Smarandache sequences of numbers, and related problems, via a Computer Algebra System. Solutions are discovered, and some conjectures presented.
In this paper I describe numerical calculations of the motion of particles in a disk about a solar-mass object perturbed by a planet on a circular orbit with mass greater than 0.001 of the stellar mass. A simple algorithm for simulating…
We examine pairs of closed plane curves that have the same closing property as two conic sections in Poncelet's porism. We show how the vertex curve can be computed for a given envelope and vice versa. Our formulas are universal in the…
In this paper, we develop the notion of a Morse sequence, which provides an alternative approach to discrete Morse theory, and which is both simple and effective. A Morse sequence on a finite simplicial complex is a sequence composed solely…
Pulsar Timing Arrays are a prime tool to study unexplored astrophysical regimes with gravitational waves. Here we show that the detection of gravitational radiation from individually resolvable super-massive black hole binary systems can…
Linear recurrent sequences are those whose elements are defined as linear combinations of preceding elements, and finding recurrence relations is a fundamental problem in computer algebra. In this paper, we focus on sequences whose elements…
A chain is an ordering of the integers 1 to n such that adjacent pairs have sums of a particular form, such as squares, cubes, triangular numbers, pentagonal numbers, or Fibonacci numbers. For example 4 1 2 3 5 form a Fibonacci chain while…
We suggest the possibility of including millisecond pulsars inside the core of globular clusters in pulsar timing array experiments. Since they are very close to each other, their gravitational wave induced timing residuals are expected to…
The direct application of the definition of sorting in lattices is impractical because it leads to an algorithm with exponential complexity. In this paper we present for distributive lattices a recursive formulation to compute the sort of a…
In this article, we study the palindromic length sequences of the ruler sequence and of the period-doubling sequence. We give a precise formula of the palindromic length sequence of the first one and find a lower bound of the limit superior…
A cryptarithm (or alphametic) is a mathematical puzzle in which numbers are represented with words in such a way that identical letters stand for equal digits and distinct letters for unequal digits. An alphametic puzzle is usually given in…
We use a variation of the Circle Method, along with the Saddle Point Method, to obtain an asymptotic formula for the number of partitions of a number n into integers which are sums of two squares. Unlike previous work on partitions into…