Related papers: Equiangular line systems and switching classes con…
In `A survey of two-graphs' \cite{Sei}, J.J. Seidel lays out the connections between simple graphs, two-graphs, equiangular lines and strongly regular graph. It is well known that there is a one-to-one correspondence between regular…
A set of lines through the origin is called equiangular if every pair of lines defines the same angle, and the maximum size of an equiangular set of lines in $\mathbb{R}^n$ was studied extensively for the last 70 years. In this paper, we…
Seidel switching is a classical operation on graphs which plays a central role in the theory of two-graphs, signed graphs, and switching classes. In this paper we focus on those switches which leave a given graph invariant up to…
We introduce a new class of surfaces in Euclidean $3$-space, called surfaces of osculating circles, using the concept of osculating circle of a regular curve. These surfaces contain a uniparametric family of planar lines of curvature. In…
The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a ``transmission`` system. A transmission system is a mathematical representation of a means of transmitting…
Maximum size of equiangular lines in $\mathbb{R}^{19}$ has been known in the range between 72 to 76 since 1973. Acoording to the nonexistence of strongly regular graph $(75,32,10,16)$ \cite{aza15}, Larmen-Rogers-Seidel Theorem \cite{lar77}…
For given $\Delta>0$ and $0<\lambda<3/\sqrt{2}$, we show that the maximum multiplicity that $\lambda$ can appear as the second largest eigenvalue of a connected graph with maximum degree at most $\Delta$ is $O_{\Delta,\lambda}(1)$. This…
An equilevel algebra is a subalgebra of the space of smooth functions $f: M \to {\mathbb R}$ distinguished in this space by finitely many linear conditions of the type $f(x_i) = f(\tilde x_i)$, $x_i \neq \tilde x_i \in M$, or approximated…
We provide a complete classification of possible configurations of mutually pairwise touching infinite cylinders in Euclidian 3D space. It turns out that there is a maximum number of such cylinders possible in 3D independently on the shape…
In this draft paper, we introduce a novel architecture for graph networks which is equivariant to the Euclidean group in $n$-dimensions. The model is designed to work with graph networks in their general form and can be shown to include…
The intention of the paper is to move a step towards a classification of network topologies that exhibit periodic quantum dynamics. We show that the evolution of a quantum system, whose hamiltonian is identical to the adjacency matrix of a…
We give a hierarchy of $k$-point bounds extending the Delsarte-Goethals-Seidel linear programming $2$-point bound and the Bachoc-Vallentin semidefinite programming $3$-point bound for spherical codes. An optimized implementation of this…
We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the…
The main result of this paper is Theorem. For every integer $d\geqslant 2$ the set of biLipschitz classes in $\mathbb{E}^d$ has cardinality continuum.
We consider nonregular graphs having precisely three distinct eigenvalues. The focus is mainly on the case of graphs having two distinct valencies and our results include constructions of new examples, structure theorems, valency…
In this paper, we give a new proof of the Lemmens-Seidel conjecture on the maximum number of equiangular lines with a common angle $\arccos(1/5)$. This conjecture was previously resolved by Cao, Koolen, Lin, and Yu in 2022 through an…
The maximal graph Dirichlet problem asks whether there exists a spacelike graph, in a semi-Euclidean space, with a given boundary and with mean curvature everywhere zero. We prove the existence of solutions to this problem under certain…
Over forty years ago, Goethals and Seidel showed that if the adjacency algebra of a strongly regular graph $X$ contains a Hadamard matrix then $X$ is either of Latin square type or of negative Latin square type. We extend their result to…
We compute the weighted Euler characteristic, equivariant with respect to the action of the symplectic group of degree six over the field of two elements, of the moduli space of principally polarized abelian threefolds together with a level…
We characterise graphs that have three distinct eigenvalues and coherent ranks 8 and 9, linking the former to certain symmetric 2-designs and the latter to specific quasi-symmetric 2-designs. This characterisation leads to the discovery of…