Related papers: de Bruijn arrays for L-fillings

In this paper, we study moduli spaces of low dimensional complex Lie superalgebras. We discover a similar pattern for the structure of these moduli spaces as we observed for ordinary Lie algebras, namely, that there is a stratification of…

In this paper, we study pattern matching in the set F_{n,k} of fillings of the k x n rectangle with the integers 1,...,kn such that the elements in any column increase from bottom to top. Let P be a column strict tableau of shape 2^k. We…

This paper introduces a method for constructing pure algebroids, dull algebroids, and Lie algebroids. The construction relies on what we deffned as n-systems on vector bundles, and we provide explicit computations for all resulting…

In this paper, we consider the versal deformations of three dimensional Lie algebras. We classify Lie algebras and study their deformations by using linear algebra techniques to study the cohomology. We will focus on how the deformations…

Two types of higher order Lie $\ell$-ple systems are introduced in this paper. They are defined by brackets with $\ell > 3$ arguments satisfying certain conditions, and generalize the well known Lie triple systems. One of the…

In the present note we show that for any positive integer k an arbitrary Boolean circulant matrix can be implemented via modulo 2 rectifier circuit of depth 2k-1 and complexity O(n^{1+1/k}), and also via circuit of depth 2k and complexity…

A bilinear quadrature numerically evaluates a continuous bilinear map, such as the $L^2$ inner product, on continuous $f$ and $g$ belonging to known finite-dimensional function spaces. Such maps arise in Galerkin methods for differential…

We present two approaches that can be used to compute modular forms on noncongruence subgroups. The first approach uses Hejhal's method for which we improve the arbitrary precision solving techniques so that the algorithm becomes about up…

We show that each cluster seed in the augmentation variety is inhabited by an embedded exact Lagrangian filling. This resolves the matter of surjectivity of the map from Lagrangian fillings to cluster seeds. The main new technique to…

The first aim of this paper is to construct new generating functions for the generalized {\lambda}-Stirling type numbers of the second kind, generalized array type polynomials and generalized Eulerian type polynomials and numbers, attached…

In this article, we present two methods to construct 2-uninorms on bounded lattices by using additive generators, which are further used for inducing uninorms, nullnorms, uni-nullnorms and null-uninorms, respectively. We also provide some…

We study the decomposition of real numbers into sums of L\"uroth sets, which are defined by numbers whose L\"uroth expansions have prescribed digit constraints. We establish several results on the congruence modulo 1 of sums of L\"uroth…

Let $\pi: X \to S$ be a family of smooth projective curves, and let $L$ and $M$ be a pair of line bundles on $X$. We show that Deligne's line bundle $\langle{L,M}\rangle$ can be obtained from the $\mathcal{K}_2$-gerbe $G_{L,M}$ constructed…

We give some new methods, based on Lipschitz extension theorems, for bounding filling invariants of subsets of nonpositively curved spaces. We apply our methods to find sharp bounds on higher-order Dehn functions of Sol_{2n+1}, horospheres…

We describe a linear-time algorithm that finds a planar drawing of every graph of a simple line or pseudoline arrangement within a grid of area O(n^{7/6}). No known input causes our algorithm to use area \Omega(n^{1+\epsilon}) for any…

We give an algorithm for constructing the algebraic hull of a given matrix Lie algebra in characteristic zero. It is based on an algorithm for finding integral linear dependencies of the roots of a polynomial, that is probably of…

We develop an explicit algebriac de Rham theory for relative completion of $\mathrm{SL}_2(\mathbb{Z})$. This allows the construction of iterated integrals involving modular forms of the second kind, generalizing iterated integrals of…

Kautz and de Bruijn graphs have a high degree of connectivity which makes them ideal candidates for massively parallel computer network topologies. In order to realize a practical computer architecture based on these graphs, it is useful to…

We introduce and investigate binary $(k,k)$-designs -- combinatorial structures which are related to binary orthogonal arrays. We derive general linear programming bound and propose as a consequence a universal bound on the minimum possible…

Polymetric walls are walls built from bricks in more than one size. Architects and builders want to built polymetric walls that satisfy certain structural and aesthetical constraints. In a recent paper by de Jong, Vinduska, Hans and Post…