Related papers: Using alternating de Bruijn sequences to construct…
A binary modified de Bruijn sequence is an infinite and periodic binary sequence derived by removing a zero from the longest run of zeros in a binary de Bruijn sequence. The minimal polynomial of the modified sequence is its unique…
The discrepancy of a binary string is the maximum (absolute) difference between the number of ones and the number of zeroes over all possible substrings of the given binary string. In this note we determine the minimal discrepancy that a…
Analogously to de Bruijn sequences, orientable sequences have application in automatic position-location applications and, until recently, studies of these sequences focused on the binary case. In recent work by Alhakim et al., a range of…
Let $\widetilde{\alpha}$ be a length-$L$ cyclic sequence of characters from a size-$K$ alphabet $\mathcal{A}$ such that the number of occurrences of any length-$m$ string on $\mathcal{A}$ as a substring of $\widetilde{\alpha}$ is $\lfloor L…
We construct continuous families of pairwise isospectral metrics on various Riemannian manifolds (e.g., Lie groups, projective spaces and products of these with tori) which arise as quotients of other manifolds. This is done by developing a…
The notion of a Frobenius coring is introduced, and it is shown that any such coring produces a tower of Frobenius corings and Frobenius extensions. This establishes a one-to-one correspondence between Frobenius corings and extensions.
We show here how, using Euler's integration method and an associated function bounding the error in function of time, one can generate structures closely surrounding the invariant tori of dynamical systems. Such structures are constructed…
A family of algebraic surfaces with many nondegenerate real singularities is introduced with the help of a construction, which has been used in previous works for the generation of substitution tilings.
Using discretized orthogonal systems (curvature line systems) with periodicity, created using Darboux transformations and their permutability, we have discrete and semi-discrete k-dimensional isothermic tori which are full in n-dimensional…
An algebraic structure with two constants and one ternary operation, which is not completely commutative, is put forward to accommodate ternary Boolean algebras. When the ternary operation is interpreted as Church's conditioned disjunction,…
A set A is a Sidon set in an additive group G if every element of G can be written at most one way as sum of two elements of A. A particular case of two-dimensional Sidon sets are the sonar sequences, which are two-dimensional…
The well known prefer-one, prefer-opposite, and prefer-same binary de Bruijn sequences are all constructed using simple preference rules. We apply the technique of preference functions of span one to define q-ary sequences that generalize…
Although algebraic structures are frequently analyzed using unary and binary operations, they can also be effectively defined and unified through ternary operations. In this context, we introduce structures that contain two constants and a…
We introduce several classes of pseudorandom sequences which represent a natural extension of classical methods in random number generation. The sequences are obtained from constructions on labeled binary trees, generalizing the well-known…
In this paper, algorithms are developed for computing the Stirling transform and the inverse Stirling transform; specifically, we investigate a class of sequences satisfying a two-term recurrence. We derive a general identity which…
A projective rectangle is like a projective plane that has different lengths in two directions. We develop the basic theory of projective rectangles including incidence properties, projective subplanes, configuration counts, a partial…
We give an introduction to constructive category theory by answering two guiding computational questions. The first question is: how do we compute the set of all natural transformations between two finitely presented functors like…
The method of alternating projections involves orthogonally projecting an element of a Hilbert space onto a collection of closed subspaces. It is known that the resulting sequence always converges in norm if the projections are taken…
We construct a new family of toric manifolds generating the unitary bordism ring. Each manifold in the family is the complex projectivisation of the sum of a line bundle and a trivial bundle over a complex projective space. We also…
We introduce a general recursive method to construct continuum random trees (CRTs) from independent copies of a random string of beads, that is, any random interval equipped with a random discrete probability measure, and from related…