61,631 research outputs found
Self-Complementary Arc-Transitive Graphs and Their Imposters
This thesis explores two infinite families of self-complementary arc-transitive graphs: the familiar Paley graphs and the newly discovered Peisert graphs. After studying both families, we examine a result of Peisert which proves the Paley and Peisert graphs are the only self-complementary arc transitive graphs other than one exceptional graph. Then we consider other families of graphs which share many properties with the Paley and Peisert graphs. In particular, we construct an infinite family of self-complementary strongly regular graphs from affine planes. We also investigate the pseudo-Paley graphs of Weng, Qiu, Wang, and Xiang. Finally, we prove a lower bound on the number of maximal cliques of certain pseudo-Paley graphs, thereby distinguishing them from Paley graphs of the same order
A short note on a short remark of Graham and Lov\'{a}sz
Let D be the distance matrix of a connected graph G and let nn(G), np(G) be
the number of strictly negative and positive eigenvalues of D respectively. It
was remarked in [1] that it is not known whether there is a graph for which
np(G) > nn (G). In this note we show that there exists an infinite number of
graphs satisfying the stated inequality, namely the conference graphs of order>
9. A large representative of this class being the Paley graphs.The result is
obtained by derving the eigenvalues of the distance matrix of a
strongly-regular graph.Comment: 5 pages, 3 figure
On the Pauli graphs of N-qudits
A comprehensive graph theoretical and finite geometrical study of the
commutation relations between the generalized Pauli operators of N-qudits is
performed in which vertices/points correspond to the operators and edges/lines
join commuting pairs of them. As per two-qubits, all basic properties and
partitionings of the corresponding Pauli graph are embodied in the geometry of
the generalized quadrangle of order two. Here, one identifies the operators
with the points of the quadrangle and groups of maximally commuting subsets of
the operators with the lines of the quadrangle. The three basic partitionings
are (a) a pencil of lines and a cube, (b) a Mermin's array and a bipartite-part
and (c) a maximum independent set and the Petersen graph. These factorizations
stem naturally from the existence of three distinct geometric hyperplanes of
the quadrangle, namely a set of points collinear with a given point, a grid and
an ovoid, which answer to three distinguished subsets of the Pauli graph,
namely a set of six operators commuting with a given one, a Mermin's square,
and set of five mutually non-commuting operators, respectively. The generalized
Pauli graph for multiple qubits is found to follow from symplectic polar spaces
of order two, where maximal totally isotropic subspaces stand for maximal
subsets of mutually commuting operators. The substructure of the (strongly
regular) N-qubit Pauli graph is shown to be pseudo-geometric, i. e., isomorphic
to a graph of a partial geometry. Finally, the (not strongly regular) Pauli
graph of a two-qutrit system is introduced; here it turns out more convenient
to deal with its dual in order to see all the parallels with the two-qubit case
and its surmised relation with the generalized quadrangle Q(4, 3), the dual
ofW(3).Comment: 17 pages. Expanded section on two-qutrits, Quantum Information and
Computation (2007) accept\'
Twin bent functions, strongly regular Cayley graphs, and Hurwitz-Radon theory
The real monomial representations of Clifford algebras give rise to two
sequences of bent functions. For each of these sequences, the corresponding
Cayley graphs are strongly regular graphs, and the corresponding sequences of
strongly regular graph parameters coincide. Even so, the corresponding graphs
in the two sequences are not isomorphic, except in the first 3 cases. The proof
of this non-isomorphism is a simple consequence of a theorem of Radon.Comment: 13 pages. Addressed one reviewer's questions in the Discussion
section, including more references. Resubmitted to JACODES Math, with updated
affiliation (I am now an Honorary Fellow of the University of Melbourne
On the digraph of a unitary matrix
Given a matrix M of size n, a digraph D on n vertices is said to be the
digraph of M, when M_{ij} is different from 0 if and only if (v_{i},v_{j}) is
an arc of D. We give a necessary condition, called strong quadrangularity, for
a digraph to be the digraph of a unitary matrix. With the use of such a
condition, we show that a line digraph, LD, is the digraph of a unitary matrix
if and only if D is Eulerian. It follows that, if D is strongly connected and
LD is the digraph of a unitary matrix then LD is Hamiltonian. We conclude with
some elementary observations. Among the motivations of this paper are coined
quantum random walks, and, more generally, discrete quantum evolution on
digraphs.Comment: 6 page
Nonexistence of Certain Skew-symmetric Amorphous Association Schemes
An association scheme is amorphous if it has as many fusion schemes as
possible. Symmetric amorphous schemes were classified by A. V. Ivanov [A. V.
Ivanov, Amorphous cellular rings II, in Investigations in algebraic theory of
combinatorial objects, pages 39--49. VNIISI, Moscow, Institute for System
Studies, 1985] and commutative amorphous schemes were classified by T. Ito, A.
Munemasa and M. Yamada [T. Ito, A. Munemasa and M. Yamada, Amorphous
association schemes over the Galois rings of characteristic 4, European J.
Combin., 12(1991), 513--526]. A scheme is called skew-symmetric if the diagonal
relation is the only symmetric relation. We prove the nonexistence of
skew-symmetric amorphous schemes with at least 4 classes. We also prove that
non-symmetric amorphous schemes are commutative.Comment: 10 page
- …