Related papers: Classification of near-normal sequences
In this work, we establish a categorification of the classical Dold-Kan correspondence in the form of an equivalence between suitably defined $\infty$-categories of simplicial stable $\infty$-categories and connective chain complexes of…
Named entity recognition (NER) is the task to detect and classify the entity spans in the text. When entity spans overlap between each other, this problem is named as nested NER. Span-based methods have been widely used to tackle the nested…
Approximating functions by a linear span of truncated basis sets is a standard procedure for the numerical solution of differential and integral equations. Commonly used concepts of approximation methods are well-posed and convergent, by…
In this paper, we prove that sufficiently regular solutions of any quasilinear PDE can be approximated by solutions of systems of N distinguishable particles, to within 1/ ln(N ). This intruiguing result is related to recent developments in…
We introduce the concept of an infinite cochain sequence and initiate a theory of homological algebra for them. We show how these sequences simplify and improve the construction of infinite coclass families (as introduced by Eick and…
Given two {0,1}-sequences X and Y of lengths m and n, respectively, we write L(X,Y) to denote the length of the longest common subsequence (LCS) of X and Y, and write L(m,n) to denote the expected value of L(X,Y) when X and Y are random…
For any fixed composition $\mu$ of $M+N$ and any fixed $0^M1^N$-sequence $\mathfrak{s}$, we obtain a new presentation of the super Yangian $Y_{M|N}$ associated to the general linear Lie superalgebra $\mathfrak{gl}_{M|N}$.
74 new integer sequences are introduced in number theory, and for each of them is given a characterization, followed by open problems. each one a general question: how many primes each sequence has.
A generalization of numeration system in which the set N of the natural numbers is recognizable by finite automata can be obtained by describing a lexicographically ordered infinite regular language. Here we show that if P belonging to Q[x]…
Recently, it has been claimed that some complex networks are self-similar under a convenient renormalization procedure. We present a general method to study renormalization flows in graphs. We find that the behavior of some variables under…
In this paper, we give the concepts of properly distributed and simply distributed sequences, and prove that they are almost convergent. Basing on these, we review the work of Feng and Li [Feng, B. Q. and Li, J. L., Some estimations of…
We compute the associated prime ideals of the normalization modulo the ring, and establish connections between different types of generalizations (resp. specializations) of the normalization. This has some applications. For example, we…
In this article we present a class of formulas Fn, n in Nat, that need at least 2^n assumptions to be proved in a normal proof in Natural Deduction for purely implicational minimal propositional logic. In purely implicational classical…
We introduce novel extensions of the Standard Model featuring a supersymmetric technicolor sector. First we consider N=4 Super Yang-Mills which breaks to N=1 via the electroweak (EW) interactions and coupling to the MSSM. This is a well…
We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either…
In this note, we precisely elaborate the connection between recognisable series (in the sense of Berstel and Reutenauer) and $q$-regular sequences (in the sense of Allouche and Shallit) via their linear representations. In particular, we…
Nonlinear complexity, as an important measure for assessing the randomness of sequences, is defined as the length of the shortest feedback shift registers that can generate a given sequence. In this paper, the structure of n-periodic binary…
Given an associative multiplication in matrix algebra compatible with the usual one or, in other words, linear deformation of matrix algebra, we construct a solution to the classical Yang-Baxter equation. We also develop a theory of such…
Recurrent neural networks have achieved great success in many NLP tasks. However, they have difficulty in parallelization because of the recurrent structure, so it takes much time to train RNNs. In this paper, we introduce sliced recurrent…
We obtain a complete classification of complex-valued sequences which are both multiplicative and automatic.