Related papers: On the multidimensional permanent and q-ary design…

A mixed Steiner system MS$(t,k,Q)$ is a set (code) $C$ of words of weight $k$ over an alphabet $Q$, where not all coordinates of a word have the same alphabet size, each word of weight $t$, over $Q$, has distance $k-t$ from exactly one…

It is well-known that a quiver Q of type A_n is representation-finite, and that its indecomposable representations are thin (all Jordan-Hoelder multiplicities are 0 or 1). By now, various methods of proof are known. The aim of this note is…

Combinatorial $t$-designs have been an interesting topic in combinatorics for decades. It was recently reported that the image sets of a fixed size of certain special polynomials may constitute a $t$-design. Till now only a small amount of…

For positive integers $n$ and $k$ with $n \geq k$, an $(n,k,1)$-design is a pair $(V, \mathcal{B})$ where $V$ is a set of $n$ points and $\mathcal{B}$ is a collection of $k$-subsets of $V$ called blocks such that each pair of points occur…

Let $\mathcal{H}_i$ be a finite dimensional complex Hilbert space of dimension $d_i$ associated with a finite level quantum system $A_i$ for $i = i, 1,2, ..., k$. A subspace $S \subset \mathcal{H} = \mathcal{H}_{A_{1} A_{2}... A_{k}} =…

Subspace designs are a (large) collection of high-dimensional subspaces $\{H_i\}$ of $\F_q^m$ such that for any low-dimensional subspace $W$, only a small number of subspaces from the collection have non-trivial intersection with $W$; more…

The $d$-dimensional hypercube graph $Q_d$ has as vertices all subsets of $\{1,\ldots,d\}$, and an edge between any two sets that differ in a single element. The Ruskey-Savage conjecture asserts that every matching of $Q_d$, $d\ge 2$, can be…

The Kramer-Mesner method for constructing designs with a prescribed automorphism group $G$ has proven effective many times. In the special case of Steiner designs, the task reduces to solving an exact cover problem, with the advantage that…

Let $\F_q^n$ be a vector space of dimension $n$ over the finite field $\F_q$. A $q$-analog of a Steiner system (briefly, a $q$-Steiner system), denoted $S_q[t,k,n]$, is a set $S$ of $k$-dimensional subspaces of $\F_q^n$ such that each…

By enumerating all sequences of length 20, we study the designability of structures in a two-dimensional Hydrophobic-Polar (HP) lattice model in a wide range of inter-monomer interaction parameters. We find that although the histogram of…

We clarify the mathematical structure underlying unitary $t$-designs. These are sets of unitary matrices, evenly distributed in the sense that the average of any $t$-th order polynomial over the design equals the average over the entire…

A coloring of the $q$-ary $n$-dimensional cube (hypercube) is called perfect if, for every $n$-tuple $x$, the collection of the colors of the neighbors of $x$ depends only on the color of $x$. A Boolean-valued function is called…

A (q,k,t)-design matrix is an m x n matrix whose pattern of zeros/non-zeros satisfies the following design-like condition: each row has at most q non-zeros, each column has at least k non-zeros and the supports of every two columns…

In this paper, we study spherical $T$-designs and their harmonic strength $\text{Hst}(X)$ on the unit circle $S^1$. For any finite set $T\subset\mathbb{N}$, we constructively demonstrate the existence of a finite design $X$ such that…

Let 1_k 0_l denote the (k+l)\times 1 column of k 1's above l 0's. Let q. (1_k 0_l) $ denote the (k+l)xq matrix with q copies of the column 1_k0_l. A 2-design S_{\lambda}(2,3,v) can be defined as a vx(\lambda/3)\binom{v}{2} (0,1)-matrix with…

Global dimensions for fusion categories defined by a pair (G,k), where G is a Lie group and k a positive integer, are expressed in terms of Lie quantum superfactorial functions. The global dimension is defined as the square sum of quantum…

A $2$-$(v,k,\lambda)$ design is additive (or strongly additive) if it is possible to embed it in a suitable abelian group $G$ in such a way that its block set is contained in (or coincides with) the set of all the zero-sum $k$-subsets of…

Motivated by the wide-ranging applications of Hamiltonian decompositions in distributed computing, coded caching, routing, resource allocation, load balancing, and fault tolerance, our work presents a comprehensive design for Hamiltonian…

Let $D$ denote a positive integer and let $Q_D$ denote the graph of the $D$-dimensional hypercube. Let $X$ denote the vertex set of $Q_D$ and let $A \in \MX$ denote the adjacency matrix of $Q_D$. A matrix $B \in \MX$ is called $A$-{\em…

Rectangular designs are classified as regular, Latin regular, semiregular, Latin semiregular and singular designs. Some series of selfdual as well as alpharesolvable designs are obtained using matrix approaches which belong to the above…