Related papers: Perfect linear complexity profile and Apwenian seq…
Generalized cyclotomic sequences of period pq have several desirable randomness properties if the two primes p and q are chosen properly. In particular,Ding deduced the exact formulas for the autocorrelation and the linear complexity of…
The Pursley-Sarwate criterion of a pair of finite complex-valued sequences measures the collective smallness of the aperiodic autocorrelations and the aperiodic crosscorrelations of the two sequences. It is known that this quantity is…
Recurrence rate, determinism, average line length, and entropy of line lengths are measures of complexity in recurrence quantification analysis, that help to understand the structure, predictability and complexity of dynamical systems. In…
We introduce a model for random chain complexes over a finite field. The randomness in our complex comes from choosing the entries in the matrices that represent the boundary maps uniformly over $\mathbb{F}_q$, conditioned on ensuring that…
Empirical observation of high dimensional phenomena, such as the double descent behaviour, has attracted a lot of interest in understanding classical techniques such as kernel methods, and their implications to explain generalization…
The Ap\'ery numbers may be defined by a cubic three-term recurrence relation, that is, a three-term relation where the coefficients are polynomials in the index of degree $3$. In this work, we first provide a systematic review of Ap\'ery…
Phylogenetically decisive collections of taxon sets have the property that if trees are chosen for each of their elements, as long as these trees are compatible, the resulting supertree is unique. This means that as long as the trees…
This paper is composed of two main results concerning chains of infinite order which are not necessarily continuous. The first one is a decomposition of the transition probability kernel as a countable mixture of unbounded probabilistic…
We introduce and analyze a three-parameter family of self-referential integer sequences $S(x,y,z)$: starting from $a(1)=x$, each term advances by $y$ when the index $k$ has already appeared as a value and by $z$ otherwise. This simple rule…
We establish sufficient conditions for perfect simulation of chains of infinite order on a countable alphabet. The new assumption, localized continuity, is formalized with the help of the notion of context trees, and includes the…
We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…
Learning the topology of higher-order networks from data is a fundamental challenge in many signal processing and machine learning applications. Simplicial complexes provide a principled framework for modeling multi-way interactions, yet…
Diagram-chasing arguments frequently lead to "magical" relations between distant points of diagrams: exactness implications, connecting morphisms, etc.. These long connections are usually composites of short "unmagical" connections, but the…
The fundamental question considered in algorithms on strings is that of indexing, that is, preprocessing a given string for specific queries. By now we have a number of efficient solutions for this problem when the queries ask for an exact…
We investigate the arithmetic nature of P-recursive sequences through the lens of their D-finite generating functions. Building on classical tools from differential algebra, we revisit the integrality criterion for Motzkin-type sequences…
Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…
This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…
The randomness rate of an infinite binary sequence is characterized by the sequence of ratios between the Kolmogorov complexity and the length of the initial segments of the sequence. It is known that there is no uniform effective procedure…
In this paper we give a first study of perfect copositive $n \times n$ matrices. They can be used to find rational certificates for completely positive matrices. We describe similarities and differences to classical perfect, positive…
In this paper we give a new family of complete intersections which have the strong Lefschetz property. The family consists of (Artinian algebras defined by) ideals generated by power sum symmetric polynomials of consecutive degrees and of…