The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Zeta Functions of Finite Graphs and Representations of $p$-Adic Groups
Abstract
§ 0. Introduction § 1. Graphs and multigraphs § 2. Zeta functions of finite graphs § 3. Spectrum of a finite multigraph § 4. Harmonic functions and the Hodge decomposition § 5. Representations of C[Ti, T2]; a proof of (3.14) § 6. Representations of p-adic groups § 7. Special values of Zx(u) § 8. Miscellaneous results § 9. Computations of Zx(u) for well known families of X § 10.Examples: list of graphs for n<6, m<1.§ 11. References § 0. Introduction 0-1.In this paper we shall be concerned with the two different subjects, which have been developed separately.One is a combinatorial problem in algebraic graph theory, and the other is an arithmetic of discrete subgroups of p-adic groups and their representations.Suppose that Xis a finite (multi)graph, which is not a tree.We always assume that X is non-oriented.A closed path C in X is called reduced, if C and C 2 = C.C have no backtracking.Then obviously the set ~r•d(X) of reduced closed paths of length / is finite, and #(~['a(X)) -oo (l-oo) if Xis not homotopic to a circuit, i.e., S 1 • (See § I for
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Harary, F. (1969) · Cited by 10,739
Biggs, N. (1974) · doi:10.1017/cbo9780511608704 · Cited by 2,940
Introduction to the Arithmetic Theory of Automorphic Functions
Tretkoff, M., & Shimura, G. (1972) · Mathematics of Computation · doi:10.2307/2005900 · Cited by 2,010
Selberg, A. (1956) · Journal of the Indian Mathematical Society · doi:10.18311/jims/1956/16985 · Cited by 947
On some Bruhat decomposition and the structure of the Hecke rings of p -adic Chevalley groups
Iwahori, N., & Matsumoto, H. (1965) · Publications Mathématiques de l'IHÉS · doi:10.1007/bf02684396 · Cited by 552
On discrete subgroups of the two by two projective linear group over $\mathfrak{p}$ -adic fields
IHARA, Y. (1966) · Journal of the Mathematical Society of Japan · doi:10.2969/jmsj/01830219 · Cited by 320
Quaternäre quadratische Formen und die Riemannsche Vermutung fÜr die Kongruenzzetafunktion
Eichler, M. (1954) · Archiv der Mathematik · doi:10.1007/bf01898377 · Cited by 128
Groupes algébriques simples sur un corps local
Bruhat, F., & Tits, J. (1967) · Springer eBooks · doi:10.1007/978-3-642-87942-5_3 · Cited by 43
Cited by
Influence maximization in complex networks through optimal percolation
Morone, F., & Makse, H. A. (2015) · Nature · doi:10.1038/nature14604 · Cited by 1,230
Spectral redemption in clustering sparse networks
Krzakala, F., Moore, C., Mossel, E., Neeman, J., Sly, A., Zdeborová, L., & Zhang, P. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1312486110 · Cited by 638
Percolation on complex networks: Theory and application
Li, M., Liu, R.-R., Lü, L., Hu, M.-B., Xu, S., & Zhang, Y.-C. (2021) · Physics Reports · doi:10.1016/j.physrep.2020.12.003 · Cited by 365
Localization and centrality in networks
Martin, T., Zhang, X., & Newman, M. E. J. (2014) · Physical Review E · doi:10.1103/physreve.90.052808 · Cited by 309
Percolation on Sparse Networks
Karrer, B., Newman, M. E. J., & Zdeborová, L. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.208702 · Cited by 303
Metadata
- Authors
- Hashimoto, K.-I.
- Venue
- Advanced Studies in Pure Mathematics
- Publisher
- Mathematical Society of Japan
- Published
- 2018-06-20
- Pages
- 211-280
- ISSN
- 0920-1971 (ISSN-L)
- OpenAlex
- W1523808012
- Cited by
- 255
- References
- 8
- FWCI
- 40.02
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.