Let @math be a number field with ring of integers @math . We compute explicitly the local factors of the normal zeta functions of the Heisenberg groups @math that are indexed by rational primes which are unramified in @math . We show that these local zeta functions satisfy functional equations upon the inversion of the prime.
More generally, it is of interest to compute the (normal) subgroup zeta functions of other finitely generated nilpotent groups, and their behavior under base extension. We refer the reader to @cite_6 for a comprehensive list of examples. In his MSc thesis @cite_4 , Bauer has generalized many of our results to the normal zeta functions of the higher Heisenberg groups @math for all @math , where @math is a centrally amalgamated product of @math Heisenberg groups. In other words, if @math is a ring and we view elements of @math as row vectors, and if @math denotes the @math identity matrix, then ) a , b R^m, , c R . The paper @cite_8 arose from the (uncompleted) project to compute the subgroup zeta functions @math .
@cite_4 @cite_6 @cite_8
112671161 1555308356 2033945987
We study representation zeta functions of finitely generated, torsion-free nilpotent groups which are groups of rational points of unipotent group schemes over rings of integers of number fields. Using the Kirillov orbit method and @math -adic integration, we prove rationality and functional equations for almost all local factors of the Euler products of these zeta functions. We further give explicit formulae, in terms of Dedekind zeta functions, for the zeta functions of class- @math -nilpotent groups obtained from three infinite families of group schemes, generalizing the integral Heisenberg group. As an immediate corollary, we obtain precise asymptotics for the representation growth of these groups, and key analytic properties of their zeta functions, such as meromorphic continuation. We express the local factors of these zeta functions in terms of generating functions for finite Weyl groups of type @math . This allows us to establish a formula for the joint distribution of three functions, or statistics'', on such Weyl groups. Finally, we compare our explicit formulae to @math -adic integrals associated to relative invariants of three infinite families of prehomogeneous vector spaces. Let @math be a number field with ring of integers @math . We compute explicitly the local factors of the normal zeta functions of the Heisenberg groups @math that are indexed by rational primes which are unramified in @math . We show that these local zeta functions satisfy functional equations upon the inversion of the prime. We produce explicit formulae for various ideal zeta functions associated to the members of an infinite family of class- @math -nilpotent Lie rings, introduced in [8], in terms of Igusa functions. As corollaries we obtain information about analytic properties of global ideal zeta functions, local functional equations, topological, reduced, and graded ideal zeta functions, as well as representation zeta functions for the unipotent group schemes associated to the Lie rings in question. We introduce a new method to compute explicit formulae for various zeta functions associated to groups and rings. The specific form of these formulae enables us to deduce local functional equations. More precisely, we prove local functional equations for the subring zeta functions associated to rings, the subgroup, conjugacy and representation zeta functions of finitely generated, torsion-free nilpotent (or T -)groups, and the normal zeta functions of T -groups of class 2. In particular we solve the two problems posed in [9, Section 5]. We deduce our theorems from a ‘blueprint result’ on certain p-adic integrals which generalises work of Denef and others on Igusa’s local zeta function. The Malcev correspondence and a Kirillov-type theory developed by Howe are used to ‘linearise’ the problems of counting subgroups and representations in T -groups, respectively. We compute explicitly the normal zeta functions of the Heisenberg groups H(R), where R is a compact discrete valuation ring of characteristic zero. These zeta functions occur as Euler factors of normal zeta functions of Heisenberg groups of the form H(O K ), where O K is the ring of integers of an arbitrary number field K, at the rational primes which are non-split in K. We show that these local zeta functions satisfy functional equations upon inversion of the prime. The pro-isomorphic zeta function ( ^ _ (s) ) of a finitely generated nilpotent group ( ) is a Dirichlet generating function that enumerates finite-index subgroups whose profinite completion is isomorphic to that of ( ). Such zeta functions can be expressed as Euler products of p-adic integrals over the ( Q _p )-points of an algebraic automorphism group associated to ( ). In this way they are closely related to classical zeta functions of algebraic groups over local fields. Abstract We calculate the representation zeta function of the Heisenberg group over the integers of a quadratic number field. In general, the representation zeta function of a finitely generated torsion-free nilpotent group enumerates equivalence classes of representations, called twist-isoclasses. This calculation is based on an explicit description of a representative from each twist-isoclass. Our method of construction involves studying the eigenspace structure of the elements of the image of the representation and then picking a suitable basis for the underlying vector space. We introduce a new method to calculate local normal zeta functions of finitely generated, torsion-free nilpotent groups. It is based on an enumeration of vertices in the Bruhat-Tits building for Sln(Qp). It enables us to give explicit computations for groups of class 2 with small centres and to derive local functional equations. Examples include formulae for non-uniform normal zeta functions. We introduce new methods from p-adic integration into the study of representation zeta functions associated to compact p-adic analytic groups and arithmetic groups. They allow us to establish that the representation zeta functions of generic members of families of p-adic analytic pro-p groups obtained from a global, perfect' Lie lattice satisfy functional equations. In the case of semisimple' compact p-adic analytic groups, we exhibit a link between the relevant p-adic integrals and a natural filtration of the locus of irregular elements in the associated semisimple Lie algebra, defined by centraliser dimension. Based on this algebro-geometric description, we compute explicit formulae for the representation zeta functions of principal congruence subgroups of the groups SL_3(O), where O is a compact discrete valuation ring of characteristic 0, and of the corresponding unitary groups. These formulae, combined with approximative Clifford theory, allow us to determine the abscissae of convergence of representation zeta functions associated to arithmetic subgroups of algebraic groups of type A_2. Assuming a conjecture of Serre on the Congruence Subgroup Problem, we thereby prove a conjecture of Larsen and Lubotzky on lattices in higher-rank semisimple groups for algebraic groups of type A_2 defined over number fields. In this article we prove global rigidity results for hyperbolic actions of higher-rank lattices. Suppose @math is a lattice in semisimple Lie group, all of whose factors have rank @math or higher. Let @math be a smooth @math -action on a compact nilmanifold @math that lifts to an action on the universal cover. If the linear data @math of @math contains a hyperbolic element, then there is a continuous semiconjugacy intertwining the actions of @math and @math , on a finite-index subgroup of @math . If @math is a @math action and contains an Anosov element, then the semiconjugacy is a @math conjugacy. As a corollary, we obtain @math global rigidity for Anosov actions by cocompact lattices in semisimple Lie group with all factors rank @math or higher. We also obtain global rigidity of Anosov actions of @math on @math for @math and probability-preserving Anosov actions of arbitrary higher-rank lattices on nilmanifolds. Let @math be a finitely generated group equipped with a finite symmetric generating set and the associated word length function @math . We study the behavior of the probability of return for random walks driven by symmetric measures @math that are such that @math . For this purpose we develop new relations between the isoperimetric profiles associated with different symmetric probability measures. These techniques allow us to obtain a sharp @math -version of Erschler's inequality concerning the F lner functions of wreath products. Examples and assorted applications are included. This is the first of two papers in which we introduce and study two bivariate zeta functions associated to unipotent group schemes over rings of integers of number fields. These zeta functions encode, respectively, the numbers of isomorphism classes of irreducible complex representations of finite dimensions and the numbers of conjugacy classes of congruence quotients of the associated groups. In this paper, we show that such bivariate zeta functions specialise to (univariate) class number zeta functions. In case of nilpotency class 2, bivariate representation zeta functions also specialise to (univariate) twist representation zeta functions. Moreover, we show that these zeta functions satisfy Euler factorisations and almost all of their Euler factors satisfy rationality and functional equations. In the second part of this work, we compute the above mentioned zeta functions of three infinite families of nilpotent groups of class two and deduce some combinatorial corollaries. Let F2,d denote the free class-2-nilpotent group on d generators. We compute the normal zeta functions ζ � F2,d (s), prove that they satisfy local functional equations and determine their abscissae of convergence and pole orders. Publisher Summary This chapter focuses on zeta functions of finite graphs and representations of p-adic groups. It discusses two different subjects: first is a combinatorial problem in algebraic graph theory, and the other is arithmetic of discrete subgroups of p-adic groups and their representations. The chapter presents the notation and basic definitions in graph theory. It also presents a generalization of the definition of zeta function. Spectrum of a finite multigraph is analyzed in the chapter. Moreover, the chapter also describes harmonic functions and the Hodge decomposition. The chapter also presents the computation of zeta functions Zx(u) for some well known families of graphs. These computations give many examples of graphs that are not Ramanujan graphs. We investigate the minimization of Newton's functional for the problem of the body of minimal resistance with maximal height @math cite butt in the class of convex developable functions defined in a disc. This class is a natural candidate to find a (non-radial) minimizer in accordance with the results of cite lrp2. We prove that the minimizer in this class has a minimal set in the form of a regular polygon with @math sides centered in the disc, and numerical experiments indicate that the natural number @math is a non-decreasing function of @math . The corresponding functions all achieve a lower value of the functional than the optimal radially symmetric function with the same height @math . We show that the Goemans-Linial semidefinite relaxation of the Sparsest Cut problem with general demands has integrality gap @math . This is achieved by exhibiting @math -point metric spaces of negative type whose @math distortion is @math . Our result is based on quantitative bounds on the rate of degeneration of Lipschitz maps from the Heisenberg group to @math when restricted to cosets of the center. We prove the @math -adic duality theorem for the finite star-multiple polylogarithms. That is a generalization of Hoffman's duality theorem for the finite multiple zeta-star values. Let @math denote a set of polynomials with complex coefficients. Let @math denote any set of sample points . For any @math , the discrete polynomial transform of @math (with respect to @math and @math ) is defined as the collection of sums, @math , where @math for some associated weight function @math . These sorts of transforms find important applications in areas such as medical imaging and signal processing. In this paper, we present fast algorithms for computing discrete orthogonal polynomial transforms. For a system of @math orthogonal polynomials of degree at most @math , we give an @math algorithm for computing a discrete polynomial transform at an arbitrary set of points instead of the @math operations required by direct evaluation. Our algorithm depends only on the fact that orthogonal polynomial sets satisfy a three-term recurrence and thus it may be applied to any such set of discretely sampled functions. In particular, sampled orthogonal polynomials generate the vector space of functions on a distance transitive graph. As a direct application of our work, we are able to give a fast algorithm for computing subspace decompositions of this vector space which respect the action of the symmetry group of such a graph. This has direct applications to treating computational bottlenecks in the spectral analysis of data on distance transitive graphs, and we discuss this in some detail. Given a set @math with @math elements and a family @math of subsets, we show how to partition @math into @math such subsets in @math time. We also consider variations of this problem where the subsets may overlap or are weighted, and we solve the decision, counting, summation, and optimization versions of these problems. Our algorithms are based on the principle of inclusion-exclusion and the zeta transform. In effect we get exact algorithms in @math time for several well-studied partition problems including domatic number, chromatic number, maximum @math -cut, bin packing, list coloring, and the chromatic polynomial. We also have applications to Bayesian learning with decision graphs and to model-based data clustering. If only polynomial space is available, our algorithms run in time @math if membership in @math can be decided in polynomial time. We solve chromatic number in @math time and domatic number in @math time. Finally, we present a family of polynomial space approximation algorithms that find a number between @math and @math in time @math . The following problem is considered: given a matrix @math in @math , ( @math rows and @math columns), a vector @math in @math , and @math , compute a vector @math satisfying @math if such exists, such that @math has the fewest number of non-zero entries over all such vectors. It is shown that the problem is NP-hard, but that the well-known greedy heuristic is good in that it computes a solution with at most @math non-zero entries, where @math is the optimum number of nonzero entries at error @math , @math is the matrix obtained by normalizing each column of @math with respect to the @math norm, and @math is its pseudo-inverse.