Related papers: Rotation Remainders
Rotor walk is a deterministic analogue of random walk. We study its recurrence and transience properties on Z^d for the initial configuration of all rotors aligned. If n particles in turn perform rotor walks starting from the origin, we…
A "truncation" of Pascal's triangle is a triangular array of numbers that satisfies the usual Pascal recurrence but with a boundary condition that declares some terminal set of numbers along each row of the array to be zero. Presented here…
This work investigates the inverse drift problem in the one-dimensional parabolic equation with the final time data. The authors construct an operator first, whose fixed points are the unknown drift, and then apply it to prove the…
If a string is cyclically shifted it will re-appear after a certain number of shifts, which will be called its order. We solve the problem of how many strings exist with a given order. This problem arises in the context of quantum mechanics…
We count tilings of a rectangle of integer sides m-1 and n-1 by a special set of tiles. The result is obtained fron the study of the kernel of the adjacency matrix of an n x n rectangular graph of Z x Z.
Consider a finite sequence of permutations of the elements 1,...,n, with the property that each element changes its position by at most 1 from any permutation to the next. We call such a sequence a tangle, and we define a move of element i…
A selfadjoined block tridiagonal matrix with positive definite blocks on the off-diagonals is by definition a Jacobi matrix with matrix entries. Transfer matrix techniques are extended in order to develop a rotation number calculation for…
We introduce a class of stochastic integer sequences. In these sequences, every element is a sum of two previous elements, at least one of which is chosen randomly. The interplay between randomness and memory underlying these sequences…
We identify a cyclic property of rotation sequences involving piecewise displacements $\beta$ about arbitrary axes in three dimensions. Specifically, when transformation to the toggling frame is applied successively $m$ times, for…
This paper introduces a class of objects called decision rules that map infinite sequences of alternatives to a decision space. These objects can be used to model situations where a decision maker encounters alternatives in a sequence such…
The geometry of rotations in dimensions 3, 4, and 5 is discussed using the matrix exponential map. Explicit closed formulas for the exponential of an antisymmetric matrix, as well as the logarithm of a rotation, are given for these…
We consider Riordan arrays $\bigl(1/(1-t^{d+1}), ~ tp(t)\bigr)$. These are infinite lower triangular matrices determined by the formal power series $1/(1-t^{d+1})$ and a polynomial $p(t)$ of degree $d$. Columns of such matrix are eventually…
Rectangles are used to approximate objects, or sets of objects, in a plethora of applications, systems and index structures. Many tasks, such as nearest neighbor search and similarity ranking, require to decide if objects in one rectangle A…
This paper investigates the behaviour of rotating binaries. A rotation by $r$ digits to the left of a binary number $B$ exhibits in particular cases the divisibility $l\mid N_1(B)\cdot r+1$, where $l$ is the bit-length of $B$ and $N_1(B)$…
We report a rigorous theory to show the origin of the unexpected periodic behavior seen in the consecutive differences between prime numbers. We also check numerically our findings to ensure that they hold for finite sequences of primes,…
We explore how the asymptotic structure of a random $n$-term weak integer composition of $m$ evolves, as $m$ increases from zero. The primary focus is on establishing thresholds for the appearance and disappearance of substructures. These…
Triangles are everywhere in the virtual world. The surface of nearly every graphical object is saved as a triangular mesh on a computer. Light effects and movements of virtual objects are computed on the basis of triangulations. Besides…
This work is meant to demonstrate new class of prime numbers -- cyclic prime numbers, that can be derived from any prime number at certain numeric systems. Cyclic prime numbers are also related to the cyclic numbers and full reptend prime…
Persistence modules are a central algebraic object arising in topological data analysis. The notion of interleaving provides a natural way to measure distances between persistence modules. We consider various classes of persistence modules,…
We provide a new way to represent numerical semigroups by showing that the position of every Ap\'ery set of a numerical semigroup $S$ in the enumeration of the elements of $S$ is unique, and that $S$ can be re-constructed from this…