The Zeta Function of a Hypergraph

We generalize the Ihara-Selberg zeta function to hypergraphs in a natural way. Hashimoto's factorization results for biregular bipartite graphs apply, leading to exact factorizations. For $(d,r)$-regular hypergraphs, we show that a modified Riemann hypothesis is true if and only if the hypergraph is Ramanujan in the sense of Winnie Li and Patrick Sol\'e. Finally, we give an example to show how the generalized zeta function can be applied to graphs to distinguish non-isomorphic graphs with the same Ihara-Selberg zeta function.Comment: 24 pages, 6 figure

Bus interconnection networks

AbstractIn bus interconnection networks every bus provides a communication medium between a set of processors. These networks are modeled by hypergraphs where vertices represent the processors and edges represent the buses. We survey the results obtained on the construction methods that connect a large number of processors in a bus network with given maximum processor degree Δ, maximum bus size r, and network diameter D. (In hypergraph terminology this problem is known as the (Δ,D, r)-hypergraph problem.)The problem for point-to-point networks (the case r = 2) has been extensively studied in the literature. As a result, several families of networks have been proposed. Some of these point-to-point networks can be used in the construction of bus networks. One approach is to consider the dual of the network. We survey some families of bus networks obtained in this manner. Another approach is to view the point-to-point networks as a special case of the bus networks and to generalize the known constructions to bus networks. We provide a summary of the tools developed in the theory of hypergraphs and directed hypergraphs to handle this approach

Brick assignments and homogeneously almost self-complementary graphs

AbstractA graph is called almost self-complementary if it is isomorphic to the graph obtained from its complement by removing a 1-factor. In this paper, we study a special class of vertex-transitive almost self-complementary graphs called homogeneously almost self-complementary. These graphs occur as factors of symmetric index-2 homogeneous factorizations of the “cocktail party graphs” K2n−nK2. We construct several infinite families of homogeneously almost self-complementary graphs, study their structure, and prove several classification results, including the characterization of all integers n of the form n=pr and n=2p with p prime for which there exists a homogeneously almost self-complementary graph on 2n vertices

Quasi-Independence, Homology and the Unity of Type: A Topological Theory of Characters

In this paper Lewontin’s notion of “quasi-independence” of characters is formalized as the assumption that a region of the phenotype space can be represented by a product space of orthogonal factors. In this picture each character corresponds to a factor of a region of the phenotype space. We consider any region of the phenotype space that has a given factorization as a “type”, i.e. as a set of phenotypes that share the same set of phenotypic characters. Using the notion of local factorizations we develop a theory of character identity based on the continuation of common factors among different regions of the phenotype space. We also consider the topological constraints on evolutionary transitions among regions with different regional factorizations, i.e. for the evolution of new types or body plans. It is shown that direct transition between different “types” is only possible if the transitional forms have all the characters that the ancestral and the derived types have and are thus compatible with the factorization of both types. Transitional forms thus have to go over a “complexity hump” where they have more quasi-independent characters than either the ancestral as well as the derived type. The only logical, but biologically unlikely, alternative is a “hopeful monster” that transforms in a single step from the ancestral type to the derived type. Topological considerations also suggest a new factor that may contribute to the evolutionary stability of “types”. It is shown that if the type is decomposable into factors which are vertex irregular (i.e. have states that are more or less preferred in a random walk), the region of phenotypes representing the type contains islands of strongly preferred states. In other words types have a statistical tendency of retaining evolutionary trajectories within their interior and thus add to the evolutionary persistence of types