Related papers: Constructing orientable sequences
We use rewriting systems to spell out cup-products in the (twisted) cohomology groups of a product of surface groups. This allows us to detect a non-trivial obstruction bounding from below the effective topological complexity of an…
In the context of Higman embeddings of recursive groups into finitely presented groups we suggest an algorithm which uses Higman operations to explicitly constructs the specific recursively enumerable sets of integer sequences arising…
Modelling compositionality has been a longstanding area of research in the field of vector space semantics. The categorical approach to compositionality maps grammar onto vector spaces in a principled way, but comes under fire for requiring…
We study a simple generalization of the rotation (or circular shift) of the binary sequences. In particular, we show each orbit of this generalized rotation has a certain statistical symmetry. This generalized rotation naturally arises when…
Software frequently converts data from one representation to another and vice versa. Naively specifying both conversion directions separately is error prone and introduces conceptual duplication. Instead, bidirectional programming…
A de Bruijn array code is a set of $r \times s$ binary doubly-periodic arrays such that each binary $n \times m$ matrix is contained exactly once as a window in one of the arrays. Such a set of arrays can be viewed as a two-dimensional…
In a recent paper published in Nature, Y.I. Sobolev et al. introduced the concept of trajectoids: convex, rigid objects, which roll without slip or spin on a flat plane along a prescribed periodic, unbounded planar path. A geometric…
We construct renormalised models of regularity structures by using a recursive formulation for the structure group and for the renormalisation group. This construction covers all the examples of singular SPDEs which have been treated so far…
Persistent homology is a tool that can be employed to summarize the shape of data by quantifying homological features. When the data is an object in $\mathbb{R}^d$, the (augmented) persistent homology transform ((A)PHT) is a family of…
We define an algorithm that parses multidimensional arrays sequentially into mainly unrepeated but nested multidimensional sub-arrays of increasing size, and show that the resulting sub-block pointer encoder compresses almost every…
This paper proposes a new mathematical framework that can be applied to biological problems such as analysis of the structures of proteins and protein complexes. In particular, it gives a new method for encoding the three-dimensional…
We recast homogeneous linear recurrence sequences with fixed coefficients in terms of partial Bell polynomials, and use their properties to obtain various combinatorial identities and multifold convolution formulas. Our approach relies on a…
In reasoning about sequential events it is natural to pose probabilistic queries such as "when will event A occur next" or "what is the probability of A occurring before B", with applications in areas such as user modeling, medicine, and…
The paper established sufficient conditions of predictability with degeneracy for the spectrum at $M$-periodically located isolated points on the unit circle. It is also shown that $m$-periodic subsequences of these sequences are also…
We implement the geometric method proposed in ([9], [3], [16]) to analytically predict the sequence of bifurcations leading to a change of stability and/or the appearance of new periodic orbits in the secular 3D planetary three body…
In this work, we will explore some polygons that individually are capable of filling the plane in an aperiodic way. These polygons were recently discovered by some researchers and constitute a great discovery for Mathematics. We will…
Persistent homology provides information about the lifetime of homology classes along a filtration of cell complexes. Persistence barcode is a graphical representation of such information. A filtration might be determined by time in a set…
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…
We tackle the problem of multi-class relational sequence learning using relevant patterns discovered from a set of labelled sequences. To deal with this problem, firstly each relational sequence is mapped into a feature vector using the…
As countless examples show, it can be fruitful to study a sequence of complicated objects all at once via the formalism of generating functions. We apply this point of view to the homology and combinatorics of orbit configuration spaces:…