Representation of binary systems by families of binary relations

It is proved that an arbitrary binary multiplicative system can be represented by a family of binary relations, using the so called generalized multiplication of relations. Transformations of such representations and existence of a ‘universal’ representation are studied.     

Prefix and suffix transreversals on binary and ternary strings

The problem of sorting by a genome rearrangement event asks for the minimum number of that event required to sort the elements of a given permutation. In this paper, we study a variant of the rearrangement event called prefix and suffix transreversal. A transreversal is an operation which reverses the first block before exchanging two adjacent blocks in a permutation. A prefix (suffix) transreversal always reverses and moves a prefix (suffix) of the permutation to another location. Interestingly, we will apply transreversal not on permutations but on strings over an alphabet of fixed size. We determine the minimum number of prefix and suffix transreversals required to sort the binary and ternary strings, with polynomial time algorithms for these sorting problems.     

Representation of large numbers by binary quadratic forms

Sufficient conditions of representability of a given integer by a fixed binary quadratic form are presented. It is shown that almost all integers satisfy these conditions. Bibliography: 2 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 226, 1996, pp. 60–64.     

Representation of numbers by irreducible binary cubic forms

An estimate is obtained of the number of representations of numbers by an irreducible binary cubic form.Translated from Matematicheskie Zametki, Vol. 10, No. 1, pp. 69–71, July, 1971.     

Representation of generalized groups by families of binary relations

Binary systems defined by families of binary relations satisfying special properties are studied. The existence of so called near-groups or quasiassociative loops is established.     

The lexicographically smallest universal cycle for binary strings with minimum specified weight

H. Fredricksen, I.J. Kessler and J. Maiorana discovered a simple but elegant construction of a universal cycle for binary strings of length n: Concatenate the aperiodic prefixes of length n binary necklaces in lexicographic order. We generalize their construction to binary strings of length n whose weights are in the range $c,c+1,\dots ,n$ by simply omitting the necklaces with weight less than c. We also provide an efficient algorithm that generates the universal cycles in constant amortized time per bit using $O(n)$ space. Our universal cycles have the property of being the lexicographically smallest universal cycle for the set of binary strings of length n with weight ≥c.     

Representation sets for integral binary quadratic forms over the rationals

Let f be an integral binary form of discriminant d which represents n integrally. Two rational representations (r, s) and (r′, s′), with denominators prime to n, of n by f are called semiequivalent with respect to f if there is a rational automorph of f with determinant 1 and denominator m which takes (r, s) into (r′, s′) where (m, n) = 1 and m contains no factors p of d such that $\text{d}\text{p}{}^2$ is a discriminant. The number of such equivalence classes for a given f and n is sometimes finite. This number is obtained for forms with negative discriminants which have one class in each primitive genus.     

Periods in strings

In this paper we explore the notion of periods of a string. A period can be thought of as a shift that causes the string to match over itself. We obtain two sets of necessary and sufficient conditions for a set of integers to be the set of periods of some string (what we call the correlation of the string). We show that the number of distinct correlations of length n is independent of the alphabet size and is of order n^logn. By using generating function methods we enumerate the strings having a given correlation, and investigate certain related questions.     

Representation of numbers as the sum of ternary cubic and binary quadratic forms

In this note we generalize Linnik's result on the representation of numbers as the sum of two squares and three cubes to the case of a binary quadratic and a ternary cubic form under certain restrictions.Translated from Matematicheskie Zametki, Vol. 12, No. 5, pp. 549–553, November, 1972.The author is grateful to Yu. V. Linnik for valuable observations on the paper.     

A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity

In this paper, a combinatorial conjecture about binary strings is proposed. Under the assumption that the proposed conjecture is correct, two classes of Boolean functions with optimal algebraic immunity can be obtained. The functions in first class are bent, and then it can be concluded that the algebraic immunity of bent functions can take all possible values except one. The functions in the second class are balanced, and they have optimal algebraic degree and the best nonlinearity up to now.     

Finding approximate patterns in strings

Let p (the pattern) be a string and t ≥ 0 an integer. The problem of locating in any string a substring whose edit distance from p is at most a given constant t is considered. An algorithm is presented to construct a deterministic finite-state automaton that solves the problem.     

Counting strings in Dyck paths

This paper deals with the enumeration of Dyck paths according to the statistic “number of occurrences of τ”, for an arbitrary string τ. In this direction, the statistic “number of occurrences of τ at height j” is considered. It is shown that the corresponding generating function can be evaluated with the aid of Chebyshev polynomials of the second kind. This is applied to every string of length 4. Further results are obtained for the statistic “number of occurrences of τ at even (or odd) height”.     

Character sets of strings

Given a string S over a finite alphabet Σ, the character set (also called the fingerprint) of a substring S^′ of S is the subset CΣ of the symbols occurring in S^′. The study of the character sets of all the substrings of a given string (or a given collection of strings) appears in several domains such as rule induction for natural language processing or comparative genomics. Several computational problems concerning the character sets of a string arise from these applications, especially:

(1) Output all the maximal locations of substrings having a given character set.

(2) Output for each character set C occurring in a given string (or a given collection of strings) all the maximal locations of C.

Denoting by n the total length of the considered string or collection of strings, we solve the first problem in Θ(n) time using Θ(n) space. We present two algorithms solving the second problem. The first one runs in Θ(n²) time using Θ(n) space. The second algorithm has Θ(n|Σ|log|Σ|) time and Θ(n) space complexity and is an adaptation of an algorithm by Amir et al. [A. Amir, A. Apostolico, G.M. Landau, G. Satta, Efficient text fingerprinting via Parikh mapping, J. Discrete Algorithms 26 (2003) 1–13].     

Faster subsequence recognition in compressed strings

Computation on compressed strings is one of the key approaches to processing massive data sets. We consider local subsequence recognition problems on strings compressed by straight-line programs (SLP), which is closely related to Lempel–Ziv compression. For an SLP-compressed text of length , and an uncompressed pattern of length n, Cégielski et al. gave an algorithm for local subsequence recognition running in time . We improve the running time to . Our algorithm can also be used to compute the longest common subsequence between a compressed text and an uncompressed pattern in time ; the same problem with a compressed pattern is known to be NP-hard. Bibliography: 22 titles. Published in Zapiski Nauchnykh Seminarov POMI, Vol. 358, 2008, pp. 282–300.     

Deviations from uniformity in random strings

Summary We show that almost all binary strings of length n contain all blocks of size (1-)log₂ n a close to uniform number of times. From this, we derive tight bounds on the discrepancy of random infinite strings. Our results are obtained through explicit generating function expressions and contour integration estimates.Research of the three authors was supported by the French-Austrian scientific cooperation programme     

Periodicity and repetitions in parameterized strings

One of the most beautiful and useful notions in the Mathematical Theory of Strings is that of a Period, i.e., an initial piece of a given string that can generate that string by repeating itself at regular intervals. Periods have an elegant mathematical structure and a wealth of applications [F. Mignosi and A. Restivo, Periodicity, Algebraic Combinatorics on Words, in: M. Lothaire (Ed.), Cambridge University Press, Cambridge, pp. 237–274, 2002]. At the hearth of their theory, there are two Periodicity Lemmas: one due to Lyndon and Schutzenberger [The equation a^M=b^Nc^P in a free group, Michigan Math. J. 9 (1962) 289–298], referred to as the Weak Version, and the other due to Fine and Wilf [Uniqueness theorems for periodic functions, Proc. Amer. Math. Soc. 16 (1965) 109–114]. In this paper, we investigate the notion of periodicity and the closely related one of repetition in connection with parameterized strings as introduced by Baker [Parameterized pattern matching: algorithms and applications, J. Comput. System Sci. 52(1) (1996) 28–42; Parameterized duplication in strings: algorithms and an application to software maintenance, SIAM J. Comput. 26(5) (1997) 1343–1362]. In such strings, the notion of pairwise match or “equivalence” of symbols is more relaxed than the usual one, in that it rests on some mapping, rather than identity, of symbols. It seems natural to try and extend notions of periods and periodicities to encompass parameterized strings. However, we know of no previous attempt in this direction. Our preliminary investigation yields results as follows. For periodicity, we get (a) a generalization of the Weak Version of the Periodicity Lemma for parameterized strings, showing that it is essential that the two mappings inducing the periodicity must commute; (b) a proof that an analogous of the Lemma by Fine and Wilf [Uniqueness theorems for periodic functions, Proc. Amer. Math. Soc. 16 (1965) 109–114] cannot hold for parameterized strings, even if the mappings inducing the periodicity “commute”, in a sense to be specified below; (c) a proof that parameterized strings over an alphabet of at least three letters may have a set of periods which differ from those of any binary string of the same length—whereby the parameterized analog of a classic result by Guibas and Odlyzko [String overlaps, pattern matching, and nontransitive games, J. Combin. Theory Ser. A 30 (1981) 183–208] cannot hold. We also derive necessary and sufficient conditions characterizing parameterized repetitions, which are patterns of length at least twice that of the period, and show how the notion of root differs from the standard case, and highlight some of the implications on extending algorithmic criteria previously adopted for string searching, detection of repetitions and the likes. Finally, as a corollary of our main results, we also show that binary parameterized strings behave much in the same way as non-parameterized ones with respect to periodicity and repetitions, while there is a substantial difference for strings over alphabets of at least three symbols.     

Eigenvalue ratios of vibrating strings

Summary New results for the eigenvalue ratios of vibrating strings are presented partially in connection with previous results concerning Schr?dinger operators.