Related papers: Constructing orientable sequences
Linear recurrent sequences are those whose elements are defined as linear combinations of preceding elements, and finding recurrence relations is a fundamental problem in computer algebra. In this paper, we focus on sequences whose elements…
By varying a parameter of a one-dimensional piecewise smooth map, stable periodic orbits are observed. In this paper, complete analytic characterization of these stable periodic orbits is obtained. An interesting relationship between the…
Motivated by theoretical analyses of spatially localized structures with arbitrarily long periodic plateaus, we provide a framework of assumptions that simplifies their analysis and leads to a topological criterion for when localized…
We characterize the topological configurations of points and lines that may arise when placing n points on a circle and drawing the n perpendicular bisectors of the sides of the corresponding convex cyclic n-gon. We also provide exact and…
This paper is concerned with linear parameter-dependent systems and considers the notion uniform ensemble reachability. The focus of this work is on constructive methods to compute suitable parameter-independent open-loop inputs for such…
In this paper we consider in detail the composition of an irreducible polynomial with X^2 and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an…
We generalize the notion of a de Bruijn sequence to a "multi de Bruijn sequence": a cyclic or linear sequence that contains every k-mer over an alphabet of size q exactly m times. For example, over the binary alphabet {0,1}, the cyclic…
Nonstationary and nonlinear signals are ubiquitous in real life. Their decomposition and analysis is an important topic of research in signal processing. Recently a new technique, called Iterative Filtering, has been developed with the goal…
A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…
With the recent success of pre-trained models in NLP, a significant focus was put on interpreting their representations. One of the most prominent approaches is structural probing (Hewitt and Manning, 2019), where a linear projection of…
Recurrence plots exhibit line structures which represent typical behaviour of the investigated system. The local slope of these line structures is connected with a specific transformation of the time scales of different segments of the…
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 paper describes an alternative method of generating fixed points of certain substitution systems. This method centres on taking infinite words consisting of one repeated letter per word. These infinite words are then interlaced to form…
This work deals with the construction of networks of topological defects in models described by a single complex scalar field. We take advantage of the deformation procedure recently used to describe kinklike defects in order to build…
This note presents a method to study center families of periodic orbits of complex holomorphic differential equations near singularities, based on some iteration properties of fixed point indices. As an application of this method, we will…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
Local protein structure analysis is informative to protein structure analysis and has been used successfully in protein structure prediction and others. Proteins have recurring structural features, such as helix caps and beta turns, which…
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…
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…
In this paper decomposition of periodic orbits in bifurcation diagrams are derived in unidimensional dynamics system $x_{n+1}=f(x_{n};r)$, being $f$ an unimodal function. We proof a theorem which states the necessary and sufficient…