Related papers: Arithmetic crosscorrelation of pseudorandom binary…
A graph is periodic if it can be obtained by joining identical pieces in a cyclic fashion. It is shown that the limit crossing number of a periodic graph is computable. This answers a question of Benny Pinontoan and Bruce Richter (2004).
The Hochschild and (cotriple) cyclic homologies of crossed modules of (not-necessarily-unital) associative algebras are investigated. Wodzicki's excision theorem is extended for inclusion crossed modules in the category of crossed modules…
The degree sequence of the algebraic numbers in an algebraic linear recurrence sequence is shown to be virtually periodic. This is proved using the Skolem-Mahler-Lech theorem. It has applications to the degree sequence and the minimal…
We consider the problem of developing automated techniques for solving recurrence relations to aid the expected-runtime analysis of programs. Several classical textbook algorithms have quite efficient expected-runtime complexity, whereas…
We present three classes of symmetric broadband composite pulse sequences. The composite phases are given by analytic formulas (rational fractions of $\pi$) valid for any number of constituent pulses. The transition probability is expressed…
A drawing of a graph in the plane is {\it pseudolinear} if the edges of the drawing can be extended to doubly-infinite curves that form an arrangement of pseudolines, that is, any pair of edges crosses precisely once. A special case are…
The method of recurrence plots is extended to the cross recurrence plots (CRP), which among others enables the study of synchronization or time differences in two time series. This is emphasized in a distorted main diagonal in the cross…
Three measures of pseudorandomness of finite binary sequences were introduced by Mauduit and S\'ark\"ozy in 1997 and have been studied extensively since then: the normality measure, the well-distribution measure, and the correlation measure…
We examine some properties of pseudo-multiplications, which are a special kind of associative binary relations defined on $\bar{\mathbb{R}}_+ \times \bar{\mathbb{R}}_+$.
A celebrated theorem of Pippenger states that any almost regular hypergraph with small codegrees has an almost perfect matching. We show that one can find such an almost perfect matching which is `pseudorandom', meaning that, for instance,…
For a random graph subject to a topological constraint, the microcanonical ensemble requires the constraint to be met by every realisation of the graph (`hard constraint'), while the canonical ensemble requires the constraint to be met only…
The real-valued Jaccard and coincidence indices, in addition to their conceptual and computational simplicity, have been verified to be able to provide promising results in tasks such as template matching, tending to yield peaks that are…
We extend previous work on anti-recurrence sequences of Kimberling and Moses, Zaslavsky, and Bosma et al. Kimberling and Moses have formulated several questions on these sequences, which can be combined into the meta-conjecture that…
Random graphs have proven to be one of the most important and fruitful concepts in modern Combinatorics and Theoretical Computer Science. Besides being a fascinating study subject for their own sake, they serve as essential instruments in…
We show that quantum oracles provide an advantage over classical oracles for answering classical counterfactual questions in causal models, or equivalently, for identifying unknown causal parameters such as distributions over functional…
The study of correlated time-series is ubiquitous in statistical analysis, and the matrix decomposition of the cross-correlations between time series is a universal tool to extract the principal patterns of behavior in a wide range of…
A classical field theory is proposed for the electric current and the electromagnetic field interpolating between microscopic and macroscopic domains. It represents a generalization of the density functional for the dynamics of the current…
In this paper, we establish some nontrivial and effective upper bounds for the least common multiple of consecutive terms of a finite arithmetic progression. Precisely, we prove that for any two coprime positive integers $a$ and $b$, with…
A 1-period is a complex number given by the integral of a univariate algebraic function, where all data involved -- the integrand and the domain of integration -- are defined over algebraic numbers. We give an algorithm that, given a finite…
Coordination sequences of periodic and quasiperiodic graphs are analysed. These count the number of points that can be reached from a given point of the graph by a number of steps along its bonds, thus generalising the familiar coordination…