We settle a missing case in the proof of one of the main applications of our results in [Frank Lübeck and Gunter Malle, A Murnaghan– Nakayama rule for values of unipotent characters in classical groups, Represent. Theory 20 (2016), 139–161, MR3466537]. In [5] we derived a Murnaghan–Nakayama formula for the values of unipotent characters of finite classical groups. As one application, we showed ...

The Burrows-Wheeler-Transform (BWT) is a reversible string transformation which plays central role in text compression and fundamental many modern bioinformatics applications. BWT permutation of the characters, general better compressible allows to answer several different query types more efficiently than original string. It easy see that not every image, exact characterizations images are kno...

A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.

One degree of freedom which is usually not exploited in developing high-performance textprocessing algorithms is the encoding of the underlying atomic character set. Typically, standard character encodings such as ASCII or Unicode are assumed to be a fixed fact of nature, and indeed for most classical string algorithms the assignment of exactly which symbol maps to which k-length bit pattern ap...

In this paper we introduce the additive analogue of index a polynomial over finite fields. We show that every P ( x ) ∈ F q [ ] can be expressed uniquely in its form such = f L + M where , are p -linearized polynomials deg ⁡ < splits completely and is maximal degree. As applications, study several problems theory fields terms their indices, as value set sizes, bounds on multiplicative character...

The current study focuses on the problem of determining investment attrаctiveness of countries by means of monitoring regional stock markets. The method of using the permutation entropy as a model of investment attractiveness estimation is suggested. We have calculated the permutation entropy for the time series of stock markets of countries for the period from 2005 to 2018. The countries with ...

In this article we study check character systems that is error detecting codes, which arise by appending a check digit an to every word a1a2...an−1 : a1a2...an−1 → a1a2...an−1an with the check formula (...((a1 · δa2) · δ 2a3)...) · δ n−2an−1) · δ n−1an = c, where Q(·) is a quasigroup or a loop, δ is a permutation of Q, c ∈ Q. We consider detection sets for such errors as transpositions (ab → ba...

The natural character π of a finite transitive permutation group G has the form 1G + θ where θ is a character which affords a rational representation of G. We call G a QI-group if this representation is irreducible over Q. Every 2-transitive group is a QI-group, but the latter class of groups is larger. It is shown that every QI-group is 3/2transitive and primitive, and that it is either almost...