Related papers: Enumeration of Row-Column Designs
We discuss the problem of counting certain LEGO structures, primarily those comprising parallel $w \times 1$ tiles. These can be combined, as a single LEGO structure, by interlocking the tiles. %Alternatively, if the interlocking condition…
Infinite analogues of the Paley graphs are constructed, based on uncountably many infinite but locally finite fields. Weil's estimate for character sums shows that they are all isomorphic to the random or universal graph of Erd\H os,…
The goal of co-clustering is to simultaneously identify a clustering of rows as well as columns of a two dimensional data matrix. A number of co-clustering techniques have been proposed including information-theoretic co-clustering and the…
We study the maximal number of pairwise distinct columns in a $\Delta$-modular integer matrix with $m$ rows. Recent results by Lee et al. provide an asymptotically tight upper bound of $O(m^2)$ for fixed $\Delta$. We complement this and…
Linear complexity is an important parameter for arrays that are used in applications related to information security. In this work we survey constructions of two and three dimensional arrays, and present new results on the multidimensional…
A two-dimensional grid with dots is called a \emph{configuration with distinct differences} if any two lines which connect two dots are distinct either in their length or in their slope. These configurations are known to have many…
We propose efficient algorithms for enumerating the notorious combinatorial structures of maximal planar graphs, called canonical orderings and Schnyder woods, and the related classical graph drawings by de Fraysseix, Pach, and Pollack…
Kitamura and Stoye (2014) develop a nonparametric test for linear inequality constraints, when these are are represented as vertices of a polyhedron instead of its faces. They implement this test for an application to nonparametric tests of…
We use Constraint Satisfaction Methods to construct and enumerate finite $L$-algebras up to isomorphism. These objects were recently introduced by Rump and appear in Garside theory, algebraic logic, and the study of the combinatorial…
We compute all isomorphism classes of simplicial arrangements in the real projective plane with up to 27 lines. It turns out that Gr\"unbaums catalogue is complete up to 27 lines except for four new arrangements with 22, 23, 24, 25 lines,…
We introduce a dimension group for a self-similar map as the ${\rm K}_0$-group of the core of the $C^*$-algebra associated with the self-similar map together with the canonical endomorphism. The key step for the computation is an explicit…
Many automatic sequences, such as the Thue-Morse sequence or the Rudin-Shapiro sequence, have some desirable features of pseudorandomness such as a large linear complexity and a small well-distribution measure. However, they also have some…
The simple permutations in two permutation classes --- the 321-avoiding permutations and the skew-merged permutations --- are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards…
We show that three different kinds of cohomology - Baues-Wirsching cohomology, the (S,O)-cohomology of Dwyer-Kan, and the Andre-Quillen cohomology of a Pi-algebra - are isomorphic, under certain assumptions. This is then used to identify…
We present a novel approach to the representation theory of finite dimensional algebras motivated by the emerging theory of graph limits. We introduce the rank spectrum of a finite dimensional algebra $R$ over a finite field. The elements…
We combine the newly discovered technique, which computes explicit formulas for the image of an algebraic curve under rational transformation, with techniques that enable to compute braid monodromies of such curves. We use this combination…
Orthogonal array, a classical and effective tool for collecting data, has been flourished with its applications in modern computer experiments and engineering statistics. Driven by the wide use of computer experiments with both qualitative…
In this paper, we consider classes of decision tables with 0-1-decisions closed relative to removal of attributes (columns) and changing decisions assigned to rows. For tables from an arbitrary closed class, we study the dependence of the…
In this work, we provide four methods for constructing new maximum sum-rank distance (MSRD) codes. The first method, a variant of cartesian products, allows faster decoding than known MSRD codes of the same parameters. The other three…
An enumeration is given of certain equivalence classes of directed multigraphs having 0 to 5 nodes with each node having 2 incoming and 2 outgoing arcs.