1,863 research outputs found
Primitive decompositions of Johnson graphs
A transitive decomposition of a graph is a partition of the edge set together
with a group of automorphisms which transitively permutes the parts. In this
paper we determine all transitive decompositions of the Johnson graphs such
that the group preserving the partition is arc-transitive and acts primitively
on the parts.Comment: 35 page
Computations in formal symplectic geometry and characteristic classes of moduli spaces
We make explicit computations in the formal symplectic geometry of Kontsevich
and determine the Euler characteristics of the three cases, namely commutative,
Lie and associative ones, up to certain weights.From these, we obtain some
non-triviality results in each case. In particular, we determine the integral
Euler characteristics of the outer automorphism groups Out F_n of free groups
for all n <= 10 and prove the existence of plenty of rational cohomology
classes of odd degrees. We also clarify the relationship of the commutative
graph homology with finite type invariants of homology 3-spheres as well as the
leaf cohomology classes for transversely symplectic foliations. Furthermore we
prove the existence of several new non-trivalent graph homology classes of odd
degrees. Based on these computations, we propose a few conjectures and problems
on the graph homology and the characteristic classes of the moduli spaces of
graphs as well as curves.Comment: 33 pages, final version, to appear in Quantum Topolog
New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra
We use the Terwilliger algebra to provide a new approach to the
Assmus-Mattson theorem. This approach also includes another proof of the
minimum distance bound shown by Martin as well as its dual.Comment: 15 page
Distance-regular graphs
This is a survey of distance-regular graphs. We present an introduction to
distance-regular graphs for the reader who is unfamiliar with the subject, and
then give an overview of some developments in the area of distance-regular
graphs since the monograph 'BCN' [Brouwer, A.E., Cohen, A.M., Neumaier, A.,
Distance-Regular Graphs, Springer-Verlag, Berlin, 1989] was written.Comment: 156 page
Hopf monoids from class functions on unitriangular matrices
We build, from the collection of all groups of unitriangular matrices, Hopf
monoids in Joyal's category of species. Such structure is carried by the
collection of class function spaces on those groups, and also by the collection
of superclass function spaces, in the sense of Diaconis and Isaacs.
Superclasses of unitriangular matrices admit a simple description from which we
deduce a combinatorial model for the Hopf monoid of superclass functions, in
terms of the Hadamard product of the Hopf monoids of linear orders and of set
partitions. This implies a recent result relating the Hopf algebra of
superclass functions on unitriangular matrices to symmetric functions in
noncommuting variables. We determine the algebraic structure of the Hopf
monoid: it is a free monoid in species, with the canonical Hopf structure. As
an application, we derive certain estimates on the number of conjugacy classes
of unitriangular matrices.Comment: Final Version, 32 pages, accepted in "Algebra and Number Theory
Random Surfing Without Teleportation
In the standard Random Surfer Model, the teleportation matrix is necessary to
ensure that the final PageRank vector is well-defined. The introduction of this
matrix, however, results in serious problems and imposes fundamental
limitations to the quality of the ranking vectors. In this work, building on
the recently proposed NCDawareRank framework, we exploit the decomposition of
the underlying space into blocks, and we derive easy to check necessary and
sufficient conditions for random surfing without teleportation.Comment: 13 pages. Published in the Volume: "Algorithms, Probability, Networks
and Games, Springer-Verlag, 2015". (The updated version corrects small
typos/errors
- …