Related papers: Mosaics of Combinatorial Designs
We define a triangle design as a partition of the set of lines of a projective space into triangles, where a triangle consists of three pairwise intersecting lines with no common point. A triangle design is balanced if all points are…
We investigate point arrangements $v_i\in\mathbb R^d,i\in \{1,...,n \}$ with certain prescribed symmetries. The arrangement space of $v$ is the column span of the matrix in which the $v_i$ are the rows. We characterize properties of $v$ in…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
We present a framework for characterizing injectivity of classes of maps (on cosets of a linear subspace) by injectivity of classes of matrices. Using our formalism, we characterize injectivity of several classes of maps, including…
An incidence of a graph G is a pair (v, e) where v is a vertex of G and e is an edge of G incident with v. Two incidences (v, e) and (w, f) of G are adjacent whenever (i) v = w, or (ii) e = f , or (iii) vw = e or f. An incidence p-colouring…
We survey recent (and not so recent) results concerning arrangements of lines, points and other geometric objects and the applications these results have in theoretical computer science and combinatorics. The three main types of problems we…
We define a convex-polynomial to be one that is a convex combination of the monomials $\{1, z, z^2, \ldots\}$. This paper explores the intimate connection between peaking convex-polynomials, interpolating convex-polynomials, invariant…
The study of knot mosaics is based upon representing knot diagrams using a set of tiles on a square grid. This branch of knot theory has many unanswered questions, especially regarding the efficiency with which we draw knots as mosaics.…
Structured matrices with symbolic sizes appear frequently in the literature, especially in the description of algorithms for linear algebra. Recent work has treated these symbolic structured matrices themselves as computational objects,…
We investigate monodromy groups arising in enumerative geometry, with a particular focus on how these groups are influenced by prescribed symmetries. To study these phenomena effectively, we work in the framework of moduli stacks rather…
An effective way to design structured coherent wave interference patterns that builds on the theory of coherent lattices, is presented. The technique combines prime number factorization in the complex plane with moir\'e theory to provide a…
We try to embed a t-design in a finite commutative group in such a way that the sum of the k points of a block is zero. We can compute the number of blocks of the boolean 2-design having all the non zero vectors of $(Z_2)^n$ as the set of…
Graphical designs are subsets of vertices of a graph that perfectly average a selected set of eigenvectors of the Graph Laplacian. We show that in highly-structured graphs, graphical designs can coincide with highly structured and…
We provide a method to construct $t$-designs from weighing matrices and association schemes. One instance of our method can produce a $3$-design from any (symmetric or skew-symmetric) conference matrix, thereby providing a partial answer to…
We consider experiments for comparing treatments using units that are ordered linearly over time or space within blocks. In addition to the block effect, we assume that a trend effect influences the response. The latter is modeled as a…
A residual design ${\cal{D}}_B$ with respect to a block $B$ of a given design $\cal{D}$ is defined to be linearly embeddable over $GF(p)$ if the $p$-ranks of the incidence matrices of ${\cal{D}}_B$ and $\cal{D}$ differ by one. A sufficient…
The article studies power complexes and generalized power complexes, and investigates the algebraic structure of their automorphism groups. The combinatorial incidence structures involved are cube-like, in the sense that they have many…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…
Complex projective t-designs, particularly SICs and full sets of MUBs, play an important role in quantum information. We introduce a generalization which we call conical t-designs. They include arbitrary rank symmetric informationally…