Related papers: On tight $4$-designs in Hamming association scheme…
The possibilities for new or unusual kinds of topological, locally linear periodic maps of non-prime order on closed, simply connected 4-manifolds with positive definite intersection pairings are explored. On the one hand, certain…
Let $p$ be an odd prime. In this paper we provide a construction which gives four non-Schurian association schemes for every $p\geq 5$ and two for $p=3$. This construction is explained using incidences between points and lines of a biaffine…
We recently obtained the conditions on the couplings of the general two-dimensional massive sigma-model required by (p,q)-supersymmetry. Here we compute the Poisson bracket algebra of the supersymmetry and central Noether charges, and show…
In this paper we obtain the necessary condition for the existence of perfect $k$-colorings (equitable $k$-partitions) in Hamming graphs $H(n,q)$, where $q=2,3,4$ and Doob graphs $D(m,n)$. As an application, we prove the non-existence of…
We first summarize the basic structure of the outer distribution module of a completely regular code. Then, employing a simple lemma concerning eigenvectors in association schemes, we propose to study the tightest case, where the indices of…
Based on recent work of T. Draghici, T.-J. Li and W. Zhang, we further investigate properties of the dimension h_J of the J-anti-invariant cohomology subgroup H_J of a closed almost Hermitian 4-manifold (M, g, J, F) using metric compatible…
We give constructive proofs for the existence of uniquely hamiltonian graphs for various sets of degrees. We give constructions for all sets with minimum 2 (a trivial case added for completeness), all sets with minimum 3 that contain an…
Association schemes are central objects in algebraic combinatorics, with the classical schemes lying at their core. These classical association schemes essentially consist of the Hamming and Johnson schemes, and their $q$-analogs: bilinear…
Unitary $t$-designs are `good' finite subsets of the unitary group $U(d)$ that approximate the whole unitary group $U(d)$ well. Unitary $t$-designs have been applied in randomized benchmarking, tomography, quantum cryptography and many…
We present a construction of the integrand of the correlation function of four stress-tensor multiplets in N=4 SYM at weak coupling. It does not rely on Feynman diagrams and makes use of the recently discovered symmetry of the integrand…
Graphical designs are an extension of spherical designs to functions on graphs. We connect linear codes to graphical designs on cube graphs, and show that the Hamming code in particular is a highly effective graphical design. We show that…
We prove an Assmus-Mattson-type theorem for block codes where the alphabet is the vertex set of a commutative association scheme (say, with $s$ classes). This in particular generalizes the Assmus-Mattson-type theorems for…
We consider $4$-uniform hypergraphs with the maximum number of hyperedges subject to the condition that every set of $5$ vertices spans either $0$ or exactly $2$ hyperedges and give a construction, using quadratic residues, for an infinite…
A covering array $t$-$CA(n,k,g)$, of size $n$, strength $t$, degree $k$, and order $g$, is a $k\times n$ array on $g$ symbols such that every $t\times n$ sub-array contains every $t\times 1$ column on $g$ symbols at least once. Covering…
{Let ${\Cal X}$ be a self-dual P-polynomial association scheme. Then there are at most 12 diagonal matrices $T$ such that $(PT)^3=I$. Moreover, all of the solutions for the classical infinite families of such schemes (including the Hamming…
A weighted Hamming metric is introduced in [4] and it showed that the binary generalized Goppa code is a perfect code in some weighted Hamming metric. In this paper, we study the weight structures which admit the binary Hamming code and the…
We argue that for any single-trace operator in ${\cal N}=4$ SYM theory there is a large twist double-scaling limit in which the Feynman graphs have an iterative structure. Such structure can be recast using a graph-building operator.…
This paper gives a precise structure theorem for the class of graphs which do not contain $W_4$ as an immersion. This strengthens a previous result of Belmonte at al. that gives a rough description of this class. In fact, we prove a…
In the four dimensional free fermionic formulation of the heterotic string, a semi-realistic $SU(4)\times SU(2)_L \times SU(2)_R$ model is proposed with three fermion generations in $(4,2,1)+(\bar 4,1,2)$ representations. The gauge symmetry…
One of the main goals of design theory is to classify, characterize and count various combinatorial objects with some prescribed properties. In most cases, however, one quickly encounters a combinatorial explosion and even if the complete…