Lyndon Array Construction during Burrows-Wheeler Inversion

In this paper we present an algorithm to compute the Lyndon array of a string $T$ of length $n$ as a byproduct of the inversion of the Burrows-Wheeler transform of $T$. Our algorithm runs in linear time using only a stack in addition to the data structures used for Burrows-Wheeler inversion. We compare our algorithm with two other linear-time algorithms for Lyndon array construction and show that computing the Burrows-Wheeler transform and then constructing the Lyndon array is competitive compared to the known approaches. We also propose a new balanced parenthesis representation for the Lyndon array that uses $2n+o(n)$ bits of space and supports constant time access. This representation can be built in linear time using $O(n)$ words of space, or in $O(n\log n/\log\log n)$ time using asymptotically the same space as $T$

Efficient indexing of necklaces and irreducible polynomials over finite fields

We study the problem of indexing irreducible polynomials over finite fields, and give the first efficient algorithm for this problem. Specifically, we show the existence of poly(n, log q)-size circuits that compute a bijection between {1, ... , |S|} and the set S of all irreducible, monic, univariate polynomials of degree n over a finite field F_q. This has applications in pseudorandomness, and answers an open question of Alon, Goldreich, H{\aa}stad and Peralta[AGHP]. Our approach uses a connection between irreducible polynomials and necklaces ( equivalence classes of strings under cyclic rotation). Along the way, we give the first efficient algorithm for indexing necklaces of a given length over a given alphabet, which may be of independent interest

2D Necklace Flower Constellations

The 2D Necklace Flower Constellation theory is a new design framework based on the 2D Lattice Flower Constellations that allows to expand the possibilities of design while maintaining the number of satellites in the configuration. The methodology presented is a generalization of the 2D Lattice design, where the concept of necklace is introduced in the formulation. This allows to assess the problem of building a constellation in orbit, or the study of the reconfiguration possibilities in a constellation. Moreover, this work includes three counting theorems that allow to know beforehand the number of possible configurations that the theory can provide. This new formulation is especially suited for design and optimization techniques

Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)

this paper ## Sawada 23 developed an algorithm to generate k-ary bracelets in constant ## amortized time. Proskurowski et al. 17 show that the orbits of the ' Z. Z. Z . composition of b and d can be generated in amortized Oktime, which is CAT if k is fixed. It remains an interesting challenge to develop efficient algorithms for the other composition