Related papers: Regular sequences and synchronized sequences in ab…
We revisit and generalize the geometric procedure of regularizing a sequence of real numbers with respect to a so-called regularizing function. This approach was studied by S. Mandelbrojt and becomes useful and necessary when working with…
When regularity lemmas were first developed in the 1970s, they were described as results that promise a partition of any graph into a ``small'' number of parts, such that the graph looks ``similar'' to a random graph on its edge subsets…
In this paper, a new method is presented to compute the 2-adic complexity of pseudo-random sequences. With this method, the 2-adic complexities of all the known sequences with ideal 2-level autocorrelation are uniformly determined. Results…
Traditionally, the automatic recognition of human activities is performed with supervised learning algorithms on limited sets of specific activities. This work proposes to recognize recurrent activity patterns, called routines, instead of…
An automatic sequence is a letter-to-letter coding of a fixed point of a uniform morphism. More generally, we have morphic sequences, which are letter-to-letter codings of fixed points of arbitrary morphisms. There are many examples where…
A family of formal power series, such that its coefficients satisfy a recursion formula, is characterized in terms of the summability, in the sense of J. P. Ramis, of its elements along certain well chosen directions. We describe a set of…
Sequences with {\em perfect linear complexity profile} were defined more than thirty years ago in the study of measures of randomness for binary sequences. More recently {\em apwenian sequences}, first with values $\pm 1$, then with values…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
Kernel segmentation aims at partitioning a data sequence into several non-overlapping segments that may have nonlinear and complex structures. In general, it is formulated as a discrete optimization problem with combinatorial constraints. A…
Deep sequence recognition (DSR) models receive increasing attention due to their superior application to various applications. Most DSR models use merely the target sequences as supervision without considering other related sequences,…
Formal control synthesis approaches over stochastic systems have received significant attention in the past few years, in view of their ability to provide provably correct controllers for complex logical specifications in an automated…
Nowadays, the notion of semi-regular sequences, originally proposed by Fr\"oberg, becomes very important not only in Mathematics, but also in Information Science, in particular Cryptology. For example, it is highly expected that randomly…
This paper systematically develops a notion of regular sequences in the context of $R$-linear triangulated categories for a graded-commutative ring $R$. The notion has equivalent characterizations involving Koszul objects and local…
It is decidable if a set of numbers, whose representation in a base b is a regular language, is ultimately periodic. This was established by Honkala in 1986. We give here a structural description of minimal automata that accept an…
Let $R$ be a ring and $S$ a multiplicative subset of $R$. An $R$-module $P$ is called uniformly $S$-projective provided that the induced sequence $0\rightarrow \mathrm{Hom}_R(P,A)\rightarrow \mathrm{Hom}_R(P,B)\rightarrow…
Surgical procedures are often not "standardised" (i.e., defined in a unique and unambiguous way), but rather exist as implicit knowledge in the minds of the surgeon and the surgical team. This reliance extends to pre-surgery planning and…
We obtain sufficient criteria for simplicity of systems, that is, rings $R$ that are equipped with a family of additive subgroups $R_s$, for $s \in S$, where $S$ is a semigroup, satisfying $R = \sum_{s \in S} R_s$ and $R_s R_t \subseteq…
Many kinds of data are naturally amenable to being treated as sequences. An example is text data, where a text may be seen as a sequence of words. Another example is clickstream data, where a data instance is a sequence of clicks made by a…
Sequence diagrams are a popular technique for describing interactions between software entities. However, because the OMG group's UML standard is not based on a rigorous mathematical structure, it is impossible to deduce a single…
More than 10 years ago, Dipper, James and Murphy developped the theory of Specht modules for Hecke algebras of type $B\_n$. More recently, using Lusztig's a-function, Geck and Rouquier showed how to obtain parametrisations of the…