Abstract. We use the representation theory of the quasisplit form G of SU(3) over a p-adic field to investigate whether certain quotients of the Bruhat-Tits tree associated to this form are Ramanujan bigraphs. We show that a quotient of the tree associated with G (which is a biregular bigraph) is Ramanujan if and only if G satisfies a Ramanujan type conjecture. This result is analogous to the seminal case of P GL 2 (Q p ) considered by Lubotzky, Phillips, and Sarnak. As a consequence, the classification of the automorphic spectrum of the unitary group in three variables by Rogawski implies the existence of certain infinite families of Ramanujan bigraphs.

In this paper we give a combinatorial interpretation for the coefficient ofFor λ inside the square our combinatorial interpretation provides an upper bound for the coefficients. In general, we are able to combinatorially compute these coefficients for all λ when n > (2p − 2) 2 . We use this combinatorial interpretation to give characterizations for multiplicity free Kronecker products. We have also obtained some formulas for special cases.

Abstract. We construct explicitly an infinite family of Ramanujan graphs which are bipartite and biregular. Our construction starts with the Bruhat-Tits building of an inner form of SU 3 (Qp). To make the graphs finite, we take successive quotients by infinitely many discrete co-compact subgroups of decreasing size.

An almost partition identity is an identity for partition numbers that is true asymptotically 100% of the time and fails infinitely often. We prove a kind of almost partition identity, namely that the number of parts in all self-conjugate partitions of n is almost always equal to the number of partitions of n in which no odd part is repeated and there is exactly one even part (possibly repeated). Not only does the identity fail infinitely often, but also, the error grows without bound. In addition, we prove several identities involving the number of parts in restricted partitions. We show that the difference in the number of parts in all self-conjugate partitions of n and the number of parts in all partitions of n into distinct odd parts equals the number of partitions of n in which no odd part is repeated, the smallest part is odd, and there is exactly one even part (possibly repeated). We provide both analytic and combinatorial proofs of this identity.partitions | identities | asymptotics

No abstract