Related papers: Linked systems of symmetric designs

A synaptic algebra is a generalization of the Jordan algebra of selfadjoint elements of a von Neumann algebra. We study symmetries in synaptic algebras, i.e., elements whose square is the unit element, and we investigate the equivalence…

This paper is concerned with the linkedness of Cartesian products of complete graphs. A graph with at least $2k$ vertices is {\it $k$-linked} if, for every set of $2k$ distinct vertices organised in arbitrary $k$ pairs of vertices, there…

We single out a class of difference families which is widely used in some constructions of Hadamard matrices and which we call Goethals--Seidel (GS) difference families. They consist of four subsets (base blocks) of a finite abelian group…

We classify bosonic $\mathcal{N}=(2,2)$ supersymmetric Wilson loops on arbitrary backgrounds with vector-like R-symmetry. These can be defined on any smooth contour and come in two forms which are universal across all backgrounds. We show…

We revisit the notion of WSPD (i.e., well-separated pairs-decomposition), presenting a new construction of WSPD for any finite metric space, and show that it is asymptotically instance-optimal in size. Next, we describe a new WSPD…

We construct Hadamard matrices of orders 4x251 = 1004 and 4x631 = 2524, and skew-Hadamard matrices of orders 4x213 = 852 and 4x631 = 2524. As far as we know, such matrices have not been constructed previously. The constructions use the…

This paper is about producing a new kind of the pairs which we call it MS-pairs. To produce these pairs, we use an algorithm for dividing a natural number $x$ by two for two arbitrary numbers and consider their related graphs. We present…

Linear codes have diverse applications in secret sharing schemes, secure two-party computation, association schemes, strongly regular graphs, authentication codes and communication. There are a large number of linear codes with few weights…

In this paper we study geometric aspects of codes in the sum-rank metric. We establish the geometric description of generalised weights, and analyse the Delsarte and geometric dual operations. We establish a correspondence between maximum…

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…

2-group symmetries are generalized symmetries that arise when 1-form and 0-form symmetries mix with each other. We uncover the existence of a class of 2-group symmetries in general 4d N=2 theories of Class S that can be constructed by…

A coupled cell network describes interacting (coupled) individual systems (cells). As in networks from real applications, coupled cell networks can represent inhomogeneous networks where different types of cells interact with each other in…

We give the first construction of explicit constant-degree lossless vertex expanders. Specifically, for any $\varepsilon > 0$ and sufficiently large $d$, we give an explicit construction of an infinite family of $d$-regular graphs where…

An important example of a multi-dimensional integrable system is the anti-self-dual Einstein equations. By studying the symmetries of these equations, a recursion operator is found and the associated hierarchy constructed. Owing to the…

This article presents an overview of the theory of integrable systems with symmetries, focusing on toric systems, semitoric systems, and their classifications via decorated polygons. We discuss certain one-parameter families of integrable…

We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…

In this article, three types of joins are introduced for subspaces of a vector space. Decompositions of the Gra{\ss}mannian into joins are discussed. This framework admits a generalization of large set recursion methods for block designs to…

Let $\cal M$ denote the set ${\cal S}_{n, q}$ of $n \times n$ symmetric matrices with entries in ${\rm GF}(q)$ or the set ${\cal H}_{n, q^2}$ of $n \times n$ Hermitian matrices whose elements are in ${\rm GF}(q^2)$. Then $\cal M$ equipped…

Edge and vertex connectivity are fundamental concepts in graph theory. While they have been thoroughly studied in the case of undirected graphs, surprisingly not much has been investigated for directed graphs. In this paper we study…

Barvinok introduced the symmetrized determinant ($\sdet$) as a \emph{non-commutative} analogue of the determinant. Intuitively, given a square matrix over an associative algebra, we can obtain the symmetrized determinant by averaging over…