Thomas Luo

Annotated Source List

Adams, D. (May 2013). Galois Theory and the Hilbert Irreducibility Theorem. (Master’s
thesis). Retrieved from San Jose State University.
Summary: Thesis
This thesis goes extremely in depth about the Hilbert Irreducibility Theorem, which states that
irreducible polynomials in the rationals stay irreducible under certain ring changes, and
builds up all background knowledge necessary in its understanding and ultimate proof. It
begins by quickly reviewing basic concepts in number theory and group theory, as well
as a little bit of linear algebra. It also introduces splitting fields and some basic Galois
Theory in the background. It then moves into Galois Theory and its Fundamental
Theorem. It then moves into more advanced topics. It first covers solvability, with
solvable groups and roots of unity. Galois’ Theorem, which pertains to the solvability of
splitting fields of polynomials over a field, is then covered in great detail, along with
cyclotomic polynomials and field extensions. The thesis paper then transitions into
symmetric groups and functions with Galois group isomorphic to a symmetric group. It
then takes an aside into complex analysis. It covers many advanced topics, such as
complex integration, holomorphic functions, and meromorphic functions. After a sizable
eighty pages of this buildup, it finally gets into the direct lemmas that will be used in the
proof of the Hilbert Irreducibility Theorem, and after another twenty pages, it finally
proceeds to the theorem and its proof.
Application to Research
This thesis paper is perhaps the most clear example of an in depth mathematical paper on a topic
relevant to my project; it’s about as perfect as it gets for an example.

Apostol, Tom M. (1976), Introduction to analytic number theory, Undergraduate Texts in

Mathematics, New York-Heidelberg: Springer-Verlag, ISBN 978-0-387-90163-3, MR
0434929, Zbl 0335.10001
Summary: Book
Apostol’s book, as the title suggests, serves as an introductory course in analytic number theory.
It begins with proving simple facts, such as the fact that every positive integer above one
has a unique prime factorization. It then gets progressively more advanced, covering
Möbius inversion, quadratic reciprocity, and primitive roots. In the chapter on Dirichlet
Series and Euler Products, it begins to touch a little bit on complex analysis when
discussing the convergence of a Dirichlet series. It eventually covers the well-known
Riemann zeta function, as well as general L-functions. Almost as an addendum, extra
chapters on the Prime Number Theorem and the Ramanujan’s research on the growth of
the partition function bring the book to a close.
Application to Research:
This book served as a introductory book for my number theory studies, as it covers many topics
in detail. This was one of the first number theory books I read, and it became the basis for
a lot of my current knowledge.

Chariker, Logan. “The Inverse Galois Problem, Hilbertian Fields, and Hilbert's
Irreducibility Theorem.” University of Chicago Department of Mathematics,
University of Chicago,
 www.math.uchicago.edu/~may/VIGRE/VIGRE2007/REUPapers/FINALFULL/Cha
riker
Summary: Paper
This paper discusses the Hilbert Irreducibility Theorem and its use in work on the Inverse Galois
Problem. The problem asks whether or not every finite group can be represented as the
Galois group of a field extension of the rational numbers. The problem is currently
unsolved, and has been extensively worked on by many mathematicians, including David
Hilbert, whose Irreducibility Theorem has proven essential in partial results. The paper
assumes an advanced knowledge of Galois Theory from the reader. It begins by working
up to a lemma that allows us to find extensions of other fields with the same Galois
group, going through two intermediary proofs along the way. It continues through various
advanced theorems applying the previous lemma, slowly building motivation for a
mathematical construct called the Hilbertian property. It then defines the Hilbertian
property, relates it with Hilbert’s Irreducibility Theorem, and proves some properties of
Hilbertian fields (fields that have that Hilbertian property).. In a short conclusion, the
paper brings all of the machinery introduced in the paper together to prove a small
portion of the Inverse Galois Problem.
Application to Research:
This paper is an example of a paper on an unsolved problem; it is a great example of what I may
have to write if I am ultimately unable to solve my research question.

Clark, P. (2018). DIRICHLET’S THEOREM ON PRIMES IN ARITHMETIC PROGRESSIONS.

[online] Web.math.pmf.unizg.hr. Available at:
https://web.math.pmf.unizg.hr/nastava/studnatj/Dirichlet_theorem.pdf.
Summary: Article
The article aims to prove Dirichlet’s Theorem on Primes in Arithmetic Progressions. The
theorem states that given two relatively prime integers a and n, the arithmetic sequence n,
n + a, n + 2a, … contains infinitely many primes. It slowly builds up from the
foundations of logarithms of complex numbers and introduces Dirichlet characters and
the Dirichlet L-series. It explores various properties of these characters and this particular
series, eventually proving a simple yet advanced statement that simply states the L-series
evaluated at 1 with any non-principal character is nonzero. From this last statement, the
desired theorem quickly follows. In his article, Clark explores many different topics,
including analytic number theory, calculus, and complex analysis.
Application to Research
The research question that I am focusing on is an extension of Dirichlet’s Theorem, examining
the asymptotic growth of the number of primes as the sequence progresses. This article
helped me gain a better understanding on Dirichlet’s Theorem, its derivation, and the
main concepts behind it.

Conrad, Keith. “Galois Groups of Cubics and Quartics (Not in Characteristic 2).”
University of Connecticut Department of Mathematics, University of Connecticut,
www.math.uconn.edu/~kconrad/blurbs/galoistheory/cubicquartic.pdf.
Summary: Paper
This paper derives an algorithm by which the Galois groups of certain irreducible polynomials of
degree 3 or 4 over certain fields can be determined. It first begins by stating, without
 proof, two theorems that the reader is assumed to be familiar with. It then immediately
jumps into the derivation. It gives motivation for the steps to come by showing a few
irreducible cubics and their discriminants and Galois groups, providing the reader with
examples of the polynomials in question. Before moving on the quartics, it manages to
exactly determine the splitting field of the cubic in an elegant form. A lot more
machinery is required for quartics, as there are significantly more identities the Galois
group can take on. It works through similar steps as with cubics; however, each step is
necessarily much more complex. To aid with the derivation, Conrad provides many
subfield and subgroup lattice diagrams, allowing the reader to visualize the relationships
between the many fields and groups introduced in the derivation. It concludes by solving
the problem posed in the beginning, and with a few extension questions for the reader.
Application to Research:
This paper shows some of the computation behind the seemingly magical relationships between
polynomials and Galois groups. Most importantly, it explains why each operation is used
along the way; this will allow me to more naturally work through any Galois theory
necessary in my research project.

Devore, Jay L. Probability and Statistics for Engineering and the Sciences. Brooks/Cole,
2012.
Summary: Reference
This textbook overviews probability and statistics. It starts out covering basic definitions in
statistics, then covers probability and combinatorics. The next few chapters deal with
random variables and probability distributions, then it delves into confidence intervals
and tests of hypotheses. It covers linear, nonlinear, and multiple regressions, and finally
concludes with procedures and practices used in modern statistical work.
Application to Research
This textbook was assigned as a background reading and reference by my mentor, Professor
Nagaraj Neerchal at University of Maryland, Baltimore County. It has provided me with
definitions of various important statistical terms as well as practice with conducting
statistical tests and calculations.

Fowler, Jim. Personal interview. July 23, 2018.

Summary: Interview
Professor Jim Fowler is a math professor at The Ohio State University. We met over the summer
during the Ross Mathematics Program. The interview began with a small lesson in
advanced number theory. He quickly overviewed ring, field, and group theory, and then
transitioned into Galois theory. Within Galois theory, he outlined a proof of the classical
Abel-Ruffini theorem, which states that there is no analogue to the quadratic formula for
polynomials of degree 5 or higher. He then gave me a variety of research topics,
including quaternions/octonions and prime distributions on arithmetic sequences. The
interview lasted two hours.
Application to Research
My current research question was inspired from a question that Professor Fowler posed
regarding primes in arithmetic sequences. His teaching has widened the scope of my
knowledge, allowing me to apply more strategies to my research.
Ireland, Kenneth, and Michael Ira Rosen. A Classical Introduction to Modern Number
Theory. Springer, 1990.
Summary: Book
This well known book is a more advanced number theory reference. It discusses some ring and
group theory, proving some of the rings to be Unique Factorization Domains in the
beginning. It then goes into modular arithmetic, discussing classical results like the
Chinese Remainder Theorem and the cyclicity of Zp. The next topic is delves into is
quadratic reciprocity. It spends two chapters for two different proofs of the theorem, and
then discusses its application in finite fields in the next. It continues in this fashion,
delving deeper and deeper into more and more recent developments in number theory,
ultimately culminating in complex analysis, Pell’s equations, and Galois theory.
Application to Research:
This book is really useful for transitioning from basic number theory to more advanced topics, as
each chapter builds upon the preceding. This book, along with the book by Apostol, were
the two books that really got me into number theory and was how I learned of many of
the more advanced topics that are being researched right now.

Hobby, Charles. “The Frattini Subgroup of a p-Group.” Pacific Journal of Mathematics,

vol. 10, no. 1, 1960, pp. 209–212., doi:10.2140/pjm.1960.10.209.
Summary: Paper
The Frattini subgroup of a group is defined as the group that consists of all elements that are
shared between all maximal subgroups of the original group. A p-group is a group with a
power of a prime as its order (i.e., the number of elements in the group). This paper
extends two theorems of Burnside regarding derived groups of p-groups to analogues that
relate to Frattini subgroups of p-groups. Naturally, the paper begins with the two
Burnside theorems. Both simply state that a certain type of group cannot be the derived
group of a p-group. In its proof of the analogous theorems for Frattini subgroups, the
paper cites two lemmas of Blackburn and Gaschuetz, and proves two others. Following
the four lemmas, it concludes with the proof of the desired theorems. For the first
theorem, it uses mathematical induction, building off the base case outlined in the fourth
lemma, and proving the theorem for larger and larger groups through induction. For the
second theorem, the proof simply cites the second and fourth lemmas, and does a little bit
of algebraic manipulation, from which the theorem is quickly proven. The paper
concludes with a final statement about a cyclic normal subgroup of a Frattini subgroup,
which remains cyclic after group division.
Application to Research:
The paper is a good reference regarding group theory, the basis of Galois Theory. It also shows
the interconnectedness between different mathematical constructs, and how
generalizations can be made between them.

Kuh, Devin. Constructible regular n-gons. Senior Project Archive, pages 1–36, 2013.

Summary: Thesis
This paper discussed the constructability of regular n-gons and the Gauss-Wantzel Theorem
(referred to as Gauss’ theorem in the paper). It begins by going over some basic
constructions using compass and straightedge, giving the reader an adequate background.
 It includes basic exercises like angle bisection and perpendicular bisectors. It then
examines the regular pentagon and heptadecagon, both of which were already known to
be constructible. It goes over a construction of each, and also proves that the figure
constructed as a “regular 17-gon” is, indeed, as regular 17-gon. The paper continues into
background on the various machinery that will be used in proving the theorem, including
field theory, field extensions, and constructible numbers. It finally proves the Gauss-
Wantzel Theorem. However, although the Gauss-Wantzel Theorem proves exactly when
regular n-gons are constructible, it does not include how to construct them. It continues
with constructing these regular n-gons, going into the mathematical theory behind them.
It finally ends by proving an extension of the Gauss-Wantzel Theorem.
Application to Research
This paper has a lot of information in it; all of the background it presents allows it to be readable
even by those who just have an elementary understanding of Galois Theory and the more
complex tools used in the proof. It is also cleanly presented, with many detailed diagrams
demonstrating the steps used. It’s really well written, and the information is well-
presented, so I hope to model some of my work off this paper.

Lenstra, Hendrik. “The Chebotarev Density Theorem.” Universiteit Leiden, Universiteit Leiden,
websites.math.leidenuniv.nl/algebra/Lenstra-Chebotarev.pdf.
Summary: Article
This article introduces the Chebotarev Density Theorem. It begins with an example of a
polynomial being reduced modulo certain primes. It investigates the number of times
certain factorization patterns occur when taking the polynomial modulo p, and mentions a
curious asymptotic pattern in the density of these factorization patterns. Lenstra then goes
into the Frobenius element and symbol as defined in Galois theory. He then states a fact
about the factorization patterns from the beginning of the article in the language of Galois
theory. He finally concludes by stating and discussing the Chebotarev Density Theorem,
which explains the patterns in factorization patterns mentioned earlier.
Application to Research
Dirichlet’s Theorem on Arithmetic Progressions is actually a special numerical case of the
Chebotarev Density Theorem; hence the understanding and motivation behind the
theorem that this article offers is very useful.

Macauley, Professor, director. Visual Group Theory, Lecture 6.6: The Fundamental Theorem of
Galois Theory. YouTube, YouTube, 25 Apr. 2016,
www.youtube.com/watch?v=8qkfW35AqrQ.
Summary: Video
This video begins by stating the Fundamental Theorem of Galois Theory. The theorem relates
subgroup lattices of Galois groups and subfield lattices of polynomials and proves that
the set of automorphisms that fix a field is a group under composition. It then illustrates
the statement of the theorem through an example. The video then moves on to defining
“solvability” by radicals, then finally finishes by proving the Abel-Ruffini theorem that
there is not a quintic formula using the concepts introduced before.
Application to Research
This video helped me further investigate what Professor Fowler briefly went over during our
interview. The video fills in all of the details that Professor Fowler was unable to cover in
 our interview, allowing me to continuing to study group theory as suggested by Professor
Fowler.

Milne, J. Algebraic Number Theory. Web, 2017.

Summary: Book
This book provides an introduction to the field of algebraic number theory. It progresses through
many of the classical topics in algebraic number theory: ring theory, group theory, field
theory, Dedekind domains, and the like. It also discusses many classic results, including
unique factorization domains, Fermat’s Last Theorem, and Newton’s Lemma.
Application to Research
This book gave me the necessary background in algebraic number theory, a field closely related
to the work I am doing. It also showed me that algebraic number theory is extremely
powerful, allowing us to prove many extremely advanced theorems like Fermat’s Last
Theorem.

Murty, M. Ram, et al. “Modular Forms and the Chebotarev Density Theorem.” American
Journal of Mathematics, vol. 110, no. 2, 1988, p. 253., doi:10.2307/2374502.
Summary: Academic Journal
The paper primarily studies the eigenfunction of modular forms and their relation to prime
numbers. A modular form is a function that takes in a complex number and outputs a real
number. It must satisfy certain defined properties so that the function is “analytic”, and
must finally satisfy a functional equation (an equation that does not explicitly define the
function, but defines a certain property of the function, e.g. f(x + y) = f(x) + f(y)). They
are extensively studied because of their close ties to number theoretical concepts. The
paper then applies the Chebotarev Density Theorem in order to derive the final statement
of the paper.
Application to Research
This paper allowed me to see the Chebotarev Density Theorem being used in an actual research
problem. Because the theorem, like my research question, generalizes the Dirichlet
Theorem on Arithmetic Progressions, being able to see the theorem be used may give me
ideas on how to proceed with my research question.

Oggier, Frederique. “Permutation Groups.” Permutation Groups, Nanyang Technological

University, www1.spms.ntu.edu.sg/~frederique/lecture7ws.pdf.
Summary: Presentation
This presentation provides a basic summary of permutation groups. It begins by discussing
permutations. It redefines the classical schoolhouse view of a permutation as a
rearrangement of objects into a bijection between a set onto itself. It then formalizes the
group structure of the permutation, with its group operation being composition, and
presents a formal notation for expressing permutations mathematically. It then goes into
isomorphisms with other known groups. For example, the permutation group of order 3 is
isomorphic to the dihedral group of order 3. It goes into some linear algebra, trying to
find a permutation group that is not isomorphic to another common type of group
examined before. It continues in this fashion, defining various matrices and their
determinants and redefining permutation operations as matrices. It concludes by defining
parities of permutations and finally examining the permutation group of order 4. It shows
 that it is not isomorphic to the dihedral group of order 6; thus there is a permutation
group that is not dihedral or cyclic.
Application to Research
The presentation provides a really good explanation of what permutation groups are as well as
the structure underlying them. Permutation groups are a fairly commonly used structure
in group theory, which is intimately connected to Galois Theory, so this presentation
gave me crucial background knowledge that I didn’t otherwise have yet.

Oggier, Frederique. “Cayley’s Theorem and Puzzles.” Cayley’s Theorem, Nanyang

Technological University, www1.spms.ntu.edu.sg/~frederique/lecture8ws.pdf.
Summary: Presentation
This presentation provides a basic summary of Cayley’s Theorem, an important theorem in
group theory. It begins by discussing Cayley tables. It restates the classical definition of
Cayley’s Theorem in simpler to understand terms based on Cayley tables. It then guides
the reader or listener through a proof of Cayley’s Theorem. At this point, Cayley’s
Theorem seems to the reader like a simple theorem; however, its uses are unclear. To
address this, the presentation then goes into a theoretical problem or two, before tackling
some interesting puzzles. The first one is the 15 puzzle. The 15 puzzle is a slide puzzle in
which a 4x4 grid of tiles is presented, with the tile missing from the bottom right corner.
The other 15 tiles are then labelled 1, 2, 3, and so on to 15. The aim of the game is to
return to this position from any other position; in particular, from the position in which 15
and 14 are swapped. The presentation applies Cayley’s Theorem to prove that this
particular case is impossible. It then goes into peg solitaire and even cryptography. It
mentions our modern RSA encryption scheme and how its underlying number theoretic
mechanisms relate to Cayley’s Theorem.
Application to Research
This presentation provides great information into this important theorem, and gives many
practical examples in which it can be applied. In particular, with its relatedness to modern
encryption, it provides an avenue for further examination outside my current project.

Serre, Jean-Pierre. Abelian l-Adic Representations and Elliptic Curves. AK Peters, 1998.
Summary: Book
The book reproduces a set of lectures given at McGill University in Montreal. It deals with l-adic
representations and their relationships with other mathematical constructs like modular
forms. It begins by defining an l-adic representation, then applies them on number fields.
As part of that, it provides an alternative way of thinking about Chebotarev’s density
theorem and its proof. It then discusses more specific types of l-adic representations, and
finally concludes with L-functions that are attached to rational representations.
Application to Research
This book provides an alternative viewpoint of Chebotarev’s density theorem. Having another
perspective on the theorem may provide another outlook into my research question, since
it is closely related to the theorem.

Stevenhagen, P., and H. W. Lenstra. “Chebotarëv and His Density Theorem.” The Mathematical
Intelligencer, vol. 18, no. 2, 1996, pp. 26–37., doi:10.1007/bf03027290.
Summary: Academic Journal
It begins with a quick biography of Chebotarev’s life, following his upbringing from a Russian
family turned upside-down by the 1917 revolution through his upper class education to
his work in the summer of 1922 that resulted in his namesake density theorem. It then
delves deep into a few of the problems that Chebotarev investigated. The first involved
the minors of the Vandermonde determinant of a nontrivial prime root of unity. Another
involved the ratio of areas of lunes, a geometric figure formed by arcs. It then goes into
Dirichlet’s Theorem on Arithmetic Progressions and finally Chebotarev’s density
theorem.
Application to Research
This paper discusses Chebotarev and his theorem in great detail, providing a lot of motivation
behind each step of the proof. This provides a shell of a proof that could potentially work
on my research problem.

Stewart, Ian. Galois Theory. Chapman & Hall /CRC, 2015.

Summary: Book
This classical text in Galois Theory is perhaps the most well-known and well-loved Galois
Theory text. It begins with a section on the history of Galois Theory and the life of
Evariste Galois. Stewart then transitions into Galois Theory applied to complex numbers
in order to help the reader better conceptualize the abstract topics presented, before going
into the true general nature of Galois Theory.
Application to Research
Stewart’s classic text was one of the best references for me in my research to understand the
underpinnings of Galois Theory; many of my insights originally stemmed from an idea
found in the text.

Sury, B. “Frobenius and His Density Theorem for Primes.” Resonance Journal for Science
Education, Dec. 2003.
Summary: Academic Journal
The paper begins by motivating the theorem with a problem that appeared on the International
Mathematical Olympiad: “If p is a prime number, show that there is another prime
number q such that n^p - p is not a multiple of q for any natural number n.” It then slowly
builds up facts about primes and polynomials, eventually reaching the Frobenius density
theorem, a statement about the Galois groups of polynomials and the density of primes
that, when taken modulo each prime, decomposes the polynomials in certain ways. It
concludes by very quickly solving the problem posed at the beginning.
Application to Research
The Frobenius prime density theorem is a precursor to Chebotarev’s density theorem. Dirichlet’s
Theorem on Arithmetic Progression also implies a special case of the Frobenius prime
density theorem. Because of its close relation to my research question, the motivation that
this paper provided may prove invaluable.

Sutherland, Andrew. “Dirichlet Characters and Primes in Arithmetic Progressions.” MIT

Course 18.785 Number Theory I. Cambridge, MA, Massachusetts Institute of
Technology.
Summary: Lecture
This lecture deals with Dirichlet’s Theorem on Arithmetic Progressions. It begins by motivating
its proof of the theorem by examining a related proof of the simple fact that there are
infinitely many primes. However, the related proof can be used in the proof of Dirichlet’s
Theorem because it, in conjunction with a few facts proven by Mertens, can fairly
precisely describe how quickly the Euler product found in the earlier proof approaches
the desired value of infinity. The lecture then introduces Dirichlet characters and the
Dirichlet L-function, and then continues through a long series of computations until
finally arriving at the desired theorem.
Application to Research
This lecture introduced me to Dirichlet’s Theorem on Arithmetic Sequences and its classical
proof. Considering that my research problem is a generalization and extension of
Dirichlet’s Theorem, this lecture proved extremely useful when I was starting my
investigation.

Terr, David. "Chebotarev Density Theorem." From MathWorld--A Wolfram Web Resource,
created by Eric W. Weisstein.
http://mathworld.wolfram.com/ChebotarevDensityTheorem.html
Summary: Reference
This article states the Chebotarev density theorem and provides a brief explanation of what it is
and why it is true. It then provides an example of the theorem in use. It concludes by
discussing when the Chebotarev density theorem is used, as well as how it is used and
other reading material related to the theorem.
Application to Research
This reference article provided me with the raw statement of the Chebotarev density theorem
before I began to read other mathematicians’ work involving the theorem and its proof.
This allowed me to investigate the theorem and look for a proof without knowledge of
the “classical method,” in case I find a different method of proof. It also redirected me to
other sources related to the theorem.

Wang-Erickson, Carl. “Cyclotomic Fields.” Imperial College of London, Imperial College

of London, 2008,
wwwf.imperial.ac.uk/~cwangeri/pdfs/cyclotomic_fields_part_iii.pdf.
Summary:
This expository talk discusses the powerful applications of arguably the most fundamental
concept required in doing work in Galois Theory: cyclotomic fields. It begins by listing
some basic properties of cyclotomic fields, such as the fact that the Galois group of the
field extension including the nth root of unity is isomorphic to the unit group modulo n.
This elegant fact is then used to prove a few facts about ramified primes and the
Kronecker-Weber Theorem. It then goes into a surprising application of cyclotomic
fields: a proof of part of Fermat’s Last Theorem. Fermat’s Last Theorem is widely
notorious for its difficulty (and famous for a somewhat cheeky margin note in its original
publication); its proof evaded mathematicians for 358 years before being proven by
Andrew Wiles in 1994. Nonetheless, this fundamental tool in Galois theory provides a
somewhat elegant proof to Fermat’s Last Theorem in the case where n is an odd prime.
Although many details are left up to the reader to fill in, the proof is fleshed out enough
 for readers familiar with algebraic number theory to follow. It finally delves deep into
Galois Theory in some of the finer, more complex details of Fermat’s Last Theorem.
Application to Research:
This talk (in pdf form) provides a fascinating outlook into the power of Galois theory; I have
been using it to describe primes, which is natural; however, the fact that it can be used to
prove part of Fermat’s Last Theorem is incredible, and gives me another avenue of attack
in this project.

Wildberger, NJ, director. Galois Theory I | Math History | NJ Wildberger. YouTube, YouTube,
11 May 2014, www.youtube.com/watch?v=cxNq-hQwvn0.
Summary: Video
The video begins by motivating Galois theory with a simple questions: How do you solve
polynomial equations exactly? After discussing some basic definitions, it then explores
quartics. The video provides a method for factoring quartics that relies on solving a cubic
equation. It then goes into Lagrange’s insight in seeing that the jump from cubics to
quartics partially depended on the symmetry between the roots of the equations. It also
mentions his approach using resolvants that suggested that there was no quintic formula.
It ends with the Abel-Ruffini Theorem and its setup for Evariste Galois’s developments
in mathematics.
Application to Research
This video provided extremely detailed background on Galois theory, presented visually and
aurally. Further examination of Lagrange’s development of his resolvants approach may
provide another route into my research question.

Zucker, I J. “Some Properties of Dirichlet L-Series.” Journal of Physics A: Mathematical and

General, vol. 9, no. 8, Aug. 1976, iopscience.iop.org/article/10.1088/0305-
4470/9/8/006/meta.
Summary: Academic Journal
As its title suggests, this paper investigates the Dirichlet L-series. It first investigates its
relationship with the well-known Riemann Zeta function, discussing common properties
between them and their analytic continuations. It then dives into its application to lattice
sums, and after a series of algebraic manipulations, expresses computationally difficult
two-dimensional lattice sums as products of computationally simpler summations.
Application to Research
The Dirichlet L-series played an integral role in the proof of Dirichlet’s Theorem on Arithmetic
Progressions, so I needed to know how the Dirichlet L-series behaved. This article
provided exactly that, as well as a different application of the L-series. In its discussion
about the Riemann zeta function, it may also prove useful in research on the ubiquitous
Riemann Hypothesis.