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.
The current paper leaves open a number of challenges. One of them is the computation of the rational functions @math for general @math ; in the special case @math , this has been achieved in @cite_5 . Another one is the computation of the local factors of the @math enumerating subgroups of finite index in @math . This has not even been fully achieved for quadratic number rings @math .
@cite_5
1532101635
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 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 an arbitrary polynomial of degree @math with @math non-zero integer coefficients of absolute value less than @math . In this paper, we answer the open question whether the real roots of @math can be computed with a number of arithmetic operations over the rational numbers that is polynomial in the input size of the sparse representation of @math . More precisely, we give a deterministic, complete, and certified algorithm that determines isolating intervals for all real roots of @math with @math many exact arithmetic operations over the rational numbers. When using approximate but certified arithmetic, the bit complexity of our algorithm is bounded by @math , where @math means that we ignore logarithmic. Hence, for sufficiently sparse polynomials (i.e. @math for a positive constant @math ), the bit complexity is @math . We also prove that the latter bound is optimal up to logarithmic factors. Given a directed graph @math and a list @math of terminal pairs, the Directed Steiner Network problem asks for a minimum-cost subgraph of @math that contains a directed @math path for every @math . The special case Directed Steiner Tree (when we ask for paths from a root @math to terminals @math ) is known to be fixed-parameter tractable parameterized by the number of terminals, while the special case Strongly Connected Steiner Subgraph (when we ask for a path from every @math to every other @math ) is known to be W[1]-hard. We systematically explore the complexity landscape of directed Steiner problems to fully understand which other special cases are FPT or W[1]-hard. Formally, if @math is a class of directed graphs, then we look at the special case of Directed Steiner Network where the list @math of requests form a directed graph that is a member of @math . Our main result is a complete characterization of the classes @math resulting in fixed-parameter tractable special cases: we show that if every pattern in @math has the combinatorial property of being "transitively equivalent to a bounded-length caterpillar with a bounded number of extra edges," then the problem is FPT, and it is W[1]-hard for every recursively enumerable @math not having this property. This complete dichotomy unifies and generalizes the known results showing that Directed Steiner Tree is FPT [Dreyfus and Wagner, Networks 1971], @math -Root Steiner Tree is FPT for constant @math [Such 'y, WG 2016], Strongly Connected Steiner Subgraph is W[1]-hard [, SIAM J. Discrete Math. 2011], and Directed Steiner Network is solvable in polynomial-time for constant number of terminals [Feldman and Ruhl, SIAM J. Comput. 2006], and moreover reveals a large continent of tractable cases that were not known before.