Related papers: de Bruijn arrays for L-fillings
We define formal vector bundles with marked sections on Hilbert modular schemes and we show how to use them to construct modular sheaves with an integrable meromorphic connection and a filtration which, in degree 0, gives to us a $p$-adic…
If a Lie algebra structures $\gG$ on a vector space is the sum of a family of mutually compatible Lie algebra structures $\gG_i$, we say that $\gG$ is \emph{simply assembled} from $\gG_s$'s. By repeating this procedure several times one…
We study de Rham character sheaves on a commutative connected algebraic group $G$, defined as multiplicative line bundles with integrable connection. We construct a group algebraic space $G^\flat$ representing their moduli problem on…
Using the obstruction theory of Blanc-Dwyer-Goerss, we compute the moduli space of realizations of 2-stage Pi-algebras concentrated in dimensions 1 and n or in dimensions n and n+1. The main technical tools are Postnikov truncation and…
We first describe three algorithms for computing the Lyndon array that have been suggested in the literature, but for which no structured exposition has been given. Two of these algorithms execute in quadratic time in the worst case, the…
We study the structure of arbitrary split Leibniz superalgebras. We show that any of such superalgebras ${\frak L}$ is of the form ${\frak L} = {\mathcal U} + \sum_jI_j$ with ${\mathcal U}$ a subspace of an abelian (graded) subalgebra $H$…
For $n>3$, every $n\times n$ partial Cayley matrix with at most $n-1$ holes can be reconstructed by quadrangle criterion. Moreover, the holes can be filled in given order. Without additional assumptions, this is the best possible result.…
Parity compilation is the challenge of laying out the required constraints for the parity mapping in a local way. We present the first constructive compilation algorithm for the parity architecture using plaquettes for arbitrary…
A $t$-covering array with entries from the alphabet ${\cal Q}=\{0,1,\ldots,q-1\}$ is a $k\times n$ stack, so that for any choice of $t$ (typically non-consecutive) columns, each of the $q^{t}$ possible $t$-letter words over ${\cal Q}$…
Genome assembly tools based on the de Bruijn graph framework rely on a parameter k, which represents a trade-off between several competing effects that are difficult to quantify. There is currently a lack of tools that would automatically…
Configurations are necklaces with prescribed numbers of red and black beads. Among all possible configurations, the regular one plays an important role in many applications. In this paper, several aspects of regular configurations are…
Consider a Leibniz superalgebra $\mathfrak L$ additionally graded by an arbitrary set $I$ (set grading). We show that $\mathfrak L$ decomposes as the sum of well-described graded ideals plus (maybe) a suitable linear subspace. In the case…
A de Bruijn cycle is a cyclic listing of length A, of a collection of A combinatorial objects, so that each object appears exactly once as a set of consecutive elements in the cycle. In this paper, we show the power of de Bruijn's original…
For a Lie algebra L over an algebraically closed field of non-zero characteristic, every finite-dimensional L-module can be decomposed into a direct sum of submodules such that all composition factors of a summand have the same character.…
In this paper we introduce a new class of partially filled arrays that, as Heffter arrays, are related to difference families, graph decompositions and biembeddings. A non-zero sum Heffter array $\mathrm{N}\mathrm{H}(m,n; h,k)$ is an $m…
A classical problem in the literature seeks the minimal number of proper subgroups whose union is a given finite group. A different question, with applications to error-correcting codes and graph colorings, involves covering vector spaces…
We give a simple iterative procedure to compute the classical conformal blocks on the sphere to all order in the modulus.
In this article we describe the construction of logarithmic models in both real and complex cases. A logarithmic model is a germ of closed meromorphic 1-form with simple poles - and the analytic foliation defined by it - produced upon some…
We suggest a new point of view on de Bruijn graphs and their subgraphs based on using circular words rather than linear ones.
We first present a filtration on the ring L of Laurent polynomials such that the direct sum decomposition of its associated graded ring gr L agrees with the direct sum decomposition of gr L, as a module over the complex general linear Lie…