✦ LIBER ✦

Spectra of Hypergraphs and Applications

✍ Scribed by Keqin Feng; Wen-Ch'ing Winnie Li

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 751 KB
Volume: 60
Category: Article
ISSN: 0022-314X
DOI: 10.1006/jnth.1996.0109

No coin nor oath required. For personal study only.

✦ Synopsis

To a regular hypergraph we attach an operator, called its adjacency matrix, and study the second largest eigenvalue as well as the overall distribution of the spectrum of this operator. Our definition and results extend naturally what is known for graphs, including the analogous threshold bound 2 -k&1 for k-regular graphs. As an application of our results, we obtain asymptotic behavior, as N tends to infinity, of the dimension of the space generated by classical cusp forms of weight 2 level N and trivial character which are eigenfunctions of a fixed Hecke operator T p with integral eigenvalues.

📜 SIMILAR VOLUMES

Spectra of Regular Graphs and Hypergraph

Spectra of Regular Graphs and Hypergraphs and Orthogonal Polynomials

✍ Wen-Ch'ing Winnie Li; Patrick Solé 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 339 KB

Exact Transversal Hypergraphs and Applic

Exact Transversal Hypergraphs and Application to Boolean μ-Functions

✍ Thomas Eiter 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 353 KB

Call an hypergraph, that is a family of subsets (edges) from a finite vertex set, an exact transversal hypergraph iff each of its minimal transversals, i.e., minimal vertex subsets that intersect each edge, meets each edge in a singleton. We show that such hypergraphs are recognizable in polynomial

A central limit theorem with application

A central limit theorem with applications to random hypergraphs

✍ Peter de Jong 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 691 KB

Define for each subset I C (1,. . . , n} the c+-algebra 9, = m{X, : i E I} with X , , . . . , X , independent random variables. In this paper we consider 9,measurable random variables W, subject to the centering condition E(W, I 9,) = 0 a s .

Cohomomorphisms of graphs and hypergraph

Cohomomorphisms of graphs and hypergraphs

✍ Pavol Hell; Jaroslav Nešetřil 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 547 KB

In addition to a widely studied notion of homomorphisms of graphs and hypergraphs, [2, 5 , 6, 7, 9, 13, 141, we introduce the dual notion of cohomomorphisms. We shall concentrate on only a few aapects of these mappings, mostly with regard to intended applications, [lo, 111. Our basic motivation is t

Cutsets and partitions of hypergraphs

✍ E. L. Lawler 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 510 KB

Scrambling permutations and entropy of h

Scrambling permutations and entropy of hypergraphs

✍ Zoltán Füredi 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 385 KB

The following result is proved by using entropy of hypergraphs. If r , , . . . , r,, are permutations of the n element set P such that for every triple x , y , z E P, one can find a ri such that ~~( x ) is between r i ( y ) and r i ( z ) , then n < exp(d/2). We also study k-scrambling permutations.