A computable formula for evaluating the mean square sum of $L$-functions
For Dirichlet characters $\chi$ mod $k$ where $k\geq 3$, we here give a computable formula for evaluating the mean square sums $\sum\limits_{\substack{\chi \text{ mod }k\\\chi(-1)=(-1)^r}}|L(r,\chi)|^2$ for any positive integer $r\geq 3$. We also give an inductive formula for computing the sum $\sum...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | Thomas, Neha Elizabeth Namboothiri, K Vishnu |
description | For Dirichlet characters $\chi$ mod $k$ where $k\geq 3$, we here give a
computable formula for evaluating the mean square sums
$\sum\limits_{\substack{\chi \text{ mod }k\\\chi(-1)=(-1)^r}}|L(r,\chi)|^2$ for
any positive integer $r\geq 3$. We also give an inductive formula for computing
the sum $\sum\limits_{\substack{1\leq m\leq k \\ (m,
k)=1}}\frac{1}{\left(\sin\left(\frac{\pi m}{k}\right)\right)^{2n}}$ where $n$
is a positive integer in terms of Bernoulli numbers and binomial coefficients. |
doi_str_mv | 10.48550/arxiv.2307.01889 |
format | Article |
fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2307_01889</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2307_01889</sourcerecordid><originalsourceid>FETCH-LOGICAL-a679-c0e589ec88f810f14e6df2e68a500e1071800b9f64f82c19bfa0f359278e39db3</originalsourceid><addsrcrecordid>eNotzz1PwzAQgGEvDKjwA5jw0DXhHOfjPFYVUKRILN2jS3rXRoqT4sQV_HvUwvRur_Qo9WQgzbEo4IXCd39JMwtVCgbR3avdRneTP8eF2oG1TMHHga7VfKEh0tKPR72cWHumUc9fkQLrOXo9iV7X60Ti2C39NM4P6k5omPnxvyu1f3vdb3dJ_fn-sd3UCZWVSzrgAh13iIIGxORcHiTjEqkAYAOVQYDWSZkLZp1xrRCILVxWIVt3aO1KPf9tb5TmHHpP4ae5kpobyf4CUslGFQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A computable formula for evaluating the mean square sum of $L$-functions</title><source>arXiv.org</source><creator>Thomas, Neha Elizabeth ; Namboothiri, K Vishnu</creator><creatorcontrib>Thomas, Neha Elizabeth ; Namboothiri, K Vishnu</creatorcontrib><description>For Dirichlet characters $\chi$ mod $k$ where $k\geq 3$, we here give a
computable formula for evaluating the mean square sums
$\sum\limits_{\substack{\chi \text{ mod }k\\\chi(-1)=(-1)^r}}|L(r,\chi)|^2$ for
any positive integer $r\geq 3$. We also give an inductive formula for computing
the sum $\sum\limits_{\substack{1\leq m\leq k \\ (m,
k)=1}}\frac{1}{\left(\sin\left(\frac{\pi m}{k}\right)\right)^{2n}}$ where $n$
is a positive integer in terms of Bernoulli numbers and binomial coefficients.</description><identifier>DOI: 10.48550/arxiv.2307.01889</identifier><language>eng</language><subject>Mathematics - Number Theory</subject><creationdate>2023-07</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2307.01889$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2307.01889$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Thomas, Neha Elizabeth</creatorcontrib><creatorcontrib>Namboothiri, K Vishnu</creatorcontrib><title>A computable formula for evaluating the mean square sum of $L$-functions</title><description>For Dirichlet characters $\chi$ mod $k$ where $k\geq 3$, we here give a
computable formula for evaluating the mean square sums
$\sum\limits_{\substack{\chi \text{ mod }k\\\chi(-1)=(-1)^r}}|L(r,\chi)|^2$ for
any positive integer $r\geq 3$. We also give an inductive formula for computing
the sum $\sum\limits_{\substack{1\leq m\leq k \\ (m,
k)=1}}\frac{1}{\left(\sin\left(\frac{\pi m}{k}\right)\right)^{2n}}$ where $n$
is a positive integer in terms of Bernoulli numbers and binomial coefficients.</description><subject>Mathematics - Number Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzz1PwzAQgGEvDKjwA5jw0DXhHOfjPFYVUKRILN2jS3rXRoqT4sQV_HvUwvRur_Qo9WQgzbEo4IXCd39JMwtVCgbR3avdRneTP8eF2oG1TMHHga7VfKEh0tKPR72cWHumUc9fkQLrOXo9iV7X60Ti2C39NM4P6k5omPnxvyu1f3vdb3dJ_fn-sd3UCZWVSzrgAh13iIIGxORcHiTjEqkAYAOVQYDWSZkLZp1xrRCILVxWIVt3aO1KPf9tb5TmHHpP4ae5kpobyf4CUslGFQ</recordid><startdate>20230704</startdate><enddate>20230704</enddate><creator>Thomas, Neha Elizabeth</creator><creator>Namboothiri, K Vishnu</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20230704</creationdate><title>A computable formula for evaluating the mean square sum of $L$-functions</title><author>Thomas, Neha Elizabeth ; Namboothiri, K Vishnu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a679-c0e589ec88f810f14e6df2e68a500e1071800b9f64f82c19bfa0f359278e39db3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Mathematics - Number Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Thomas, Neha Elizabeth</creatorcontrib><creatorcontrib>Namboothiri, K Vishnu</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Thomas, Neha Elizabeth</au><au>Namboothiri, K Vishnu</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A computable formula for evaluating the mean square sum of $L$-functions</atitle><date>2023-07-04</date><risdate>2023</risdate><abstract>For Dirichlet characters $\chi$ mod $k$ where $k\geq 3$, we here give a
computable formula for evaluating the mean square sums
$\sum\limits_{\substack{\chi \text{ mod }k\\\chi(-1)=(-1)^r}}|L(r,\chi)|^2$ for
any positive integer $r\geq 3$. We also give an inductive formula for computing
the sum $\sum\limits_{\substack{1\leq m\leq k \\ (m,
k)=1}}\frac{1}{\left(\sin\left(\frac{\pi m}{k}\right)\right)^{2n}}$ where $n$
is a positive integer in terms of Bernoulli numbers and binomial coefficients.</abstract><doi>10.48550/arxiv.2307.01889</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | DOI: 10.48550/arxiv.2307.01889 |
ispartof | |
issn | |
language | eng |
recordid | cdi_arxiv_primary_2307_01889 |
source | arXiv.org |
subjects | Mathematics - Number Theory |
title | A computable formula for evaluating the mean square sum of $L$-functions |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T05%3A32%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20computable%20formula%20for%20evaluating%20the%20mean%20square%20sum%20of%20$L$-functions&rft.au=Thomas,%20Neha%20Elizabeth&rft.date=2023-07-04&rft_id=info:doi/10.48550/arxiv.2307.01889&rft_dat=%3Carxiv_GOX%3E2307_01889%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |