Nicholas A. Loehr
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Nicholas A. Loehr has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Gregory S. Warrington
Gregory S. Warrington is a professor in the Department of Mathematics and Statistics at the University of Vermont in Burlington, Vermont, USA
9 shared publications - Aditya Khanna
Department of Mathematics, Virginia Tech, Blacksburg, USA
4 shared publications - Li Li
Department of Mathematics and Statistics, Oakland University, Rochester, USA
4 shared publications - Drew Armstrong
University of Miami
3 shared publications - Jeffrey B. Remmel
Department of Mathematics University of California San Diego La Jolla 92093-0112 CA USA
3 shared publications - Kyungyong Lee
Department of Mathematics, University of Alabama, Tuscaloosa, USA
3 shared publications
Latest Publications
- Open Access
- 2 February 2026
- Published by California Digital Library (CDL) in Combinatorial Theory
- Vol. 5 (4)
Skeletal generalizations of chip-firing games, parking functions, and Dyck paths
For 0 ⩽ k ⩽ n-1, we introduce a family of k-skeletal paths which are counted by the nth Catalan number for each k, and specialize to Dyck paths when k = n-1. We similarly introduce k-skeletal parking functions which are equinumerous with spanning trees on the complete graph with n + 1 vertices for each k, and specialize to classical parking functions for k = n-1. The preceding constructions are generalized to paths lying in a trapezoid with base c > 0 and southeastern diagonal of slope 1/m; c and m need not be integers. We give bijections among these families when k varies with m and c fixed. Our constructions are motivated by chip firing and have connections to combinatorial representation theory and tropical geometry.
- 2 February 2026
- Published by California Digital Library (CDL) in Combinatorial Theory
- Vol. 5 (4)
Open AccessSkeletal generalizations of chip-firing games, parking functions, and Dyck paths
For 0 ⩽ k ⩽ n-1, we introduce a family of k-skeletal paths which are counted by the nth Catalan number for each k, and specialize to Dyck paths when k = n-1. We similarly introduce k-skeletal parking functions which are equinumerous with spanning trees on the complete graph with n + 1 vertices for each k, and specialize to classical parking functions for k = n-1. The preceding constructions are generalized to paths lying in a trapezoid with base c > 0 and southeastern diagonal of slope 1/m; c and m need not be integers. We give bijections among these families when k varies with m and c fixed. Our constructions are motivated by chip firing and have connections to combinatorial representation theory and tropical geometry.
- Open Access
- 9 January 2026
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 33 (1) , P1.12
A Local Framework for Proving Combinatorial Matrix Inversion Theorems
Combinatorial transition matrices arise frequently in the theory of symmetric functions and their generalizations. The entries of such matrices often count signed, weighted combinatorial structures such as semistandard tableaux, rim-hook tableaux, or brick tabloids. Bijective proofs that two such matrices are inverses of each other may be difficult to find. This paper presents a general framework for proving such inversion results in the case where the combinatorial objects are built up recursively by successively adding some incremental structure such as a single horizontal strip or rim-hook. In this setting, we show that a sequence of matrix inversion results $A_nB_n=I$ can be reduced to a certain "local" identity involving the incremental structures. Here, $A_n$ and $B_n$ are matrices that might be non-square, and the columns of $A_n$ and the rows of $B_n$ are indexed by compositions of $n$. We illustrate the general theory with four classical applications involving the Kostka matrices, the character tables of the symmetric group, incidence matrices for composition posets, and matrices counting brick tabloids. We obtain a new, canonical bijective proof of an inversion result for rectangular Kostka matrices, which complements the proof for the square case due to Eğecioğlu and Remmel. We also give a new bijective proof of the orthogonality result for the irreducible $S_n$-characters that is shorter than the original version due to White.- 9 January 2026
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 33 (1) , P1.12
Open AccessA Local Framework for Proving Combinatorial Matrix Inversion Theorems
Combinatorial transition matrices arise frequently in the theory of symmetric functions and their generalizations. The entries of such matrices often count signed, weighted combinatorial structures such as semistandard tableaux, rim-hook tableaux, or brick tabloids. Bijective proofs that two such matrices are inverses of each other may be difficult to find. This paper presents a general framework for proving such inversion results in the case where the combinatorial objects are built up recursively by successively adding some incremental structure such as a single horizontal strip or rim-hook. In this setting, we show that a sequence of matrix inversion results $A_nB_n=I$ can be reduced to a certain "local" identity involving the incremental structures. Here, $A_n$ and $B_n$ are matrices that might be non-square, and the columns of $A_n$ and the rows of $B_n$ are indexed by compositions of $n$. We illustrate the general theory with four classical applications involving the Kostka matrices, the character tables of the symmetric group, incidence matrices for composition posets, and matrices counting brick tabloids. We obtain a new, canonical bijective proof of an inversion result for rectangular Kostka matrices, which complements the proof for the square case due to Eğecioğlu and Remmel. We also give a new bijective proof of the orthogonality result for the irreducible $S_n$-characters that is shorter than the original version due to White. - Open Access
- 1 September 2025
- Published by MathDoc/Centre Mersenne in Algebraic Combinatorics
- Vol. 8 (4) , 1085-1117
Transition matrices and Pieri-type rules for polysymmetric functions
Asvin G and Andrew O’Desky recently introduced the graded algebra of polysymmetric functions as a generalization of the algebra of symmetric functions. This article develops combinatorial formulas for some multiplication rules and transition matrix entries for that are analogous to well-known classical formulas for . In more detail, we consider pure tensor bases , , and for that arise as tensor products of the classical Schur basis, power-sum basis, and monomial basis for . We find expansions in these bases of the non-pure bases , , , and studied by Asvin G and O’Desky. The answers involve tableau-like structures generalizing semistandard tableaux, rim-hook tableaux, and the brick tabloids of Eğecioğlu and Remmel. These objects arise by iteration of new Pieri-type rules that give expansions of products such as , , etc.- 1 September 2025
- Published by MathDoc/Centre Mersenne in Algebraic Combinatorics
- Vol. 8 (4) , 1085-1117
Open AccessTransition matrices and Pieri-type rules for polysymmetric functions
Asvin G and Andrew O’Desky recently introduced the graded algebra of polysymmetric functions as a generalization of the algebra of symmetric functions. This article develops combinatorial formulas for some multiplication rules and transition matrix entries for that are analogous to well-known classical formulas for . In more detail, we consider pure tensor bases , , and for that arise as tensor products of the classical Schur basis, power-sum basis, and monomial basis for . We find expansions in these bases of the non-pure bases , , , and studied by Asvin G and O’Desky. The answers involve tableau-like structures generalizing semistandard tableaux, rim-hook tableaux, and the brick tabloids of Eğecioğlu and Remmel. These objects arise by iteration of new Pieri-type rules that give expansions of products such as , , etc. - Open Access
A local framework for proving combinatorial matrix inversion theorems
Combinatorial transition matrices arise frequently in the theory of symmetric functions and their generalizations. The entries of such matrices often count signed, weighted combinatorial structures such as semistandard tableaux, rim-hook tableaux, or brick tabloids. Bijective proofs that two such matrices are inverses of each other may be difficult to find. This paper presents a general framework for proving such inversion results in the case where the combinatorial objects are built up recursively by successively adding some incremental structure such as a single horizontal strip or rim-hook. In this setting, we show that a sequence of matrix inversion results $A_nB_n=I$ can be reduced to a certain ``local'' identity involving the incremental structures. Here, $A_n$ and $B_n$ are matrices that might be non-square, and the columns of $A_n$ and the rows of $B_n$ indexed by compositions of $n$. We illustrate the general theory with four classical applications involving the Kostka matrices, the character tables of the symmetric group, incidence matrices for composition posets, and matrices counting brick tabloids. We obtain a new, canonical bijective proof of an inversion result for rectangular Kostka matrices, which complements the proof for the square case due to Eğecioğlu and Remmel. We also give a new bijective proof of the orthogonality result for the irreducible $S_n$-characters that is shorter than the original version due to White.Open AccessA local framework for proving combinatorial matrix inversion theorems
Combinatorial transition matrices arise frequently in the theory of symmetric functions and their generalizations. The entries of such matrices often count signed, weighted combinatorial structures such as semistandard tableaux, rim-hook tableaux, or brick tabloids. Bijective proofs that two such matrices are inverses of each other may be difficult to find. This paper presents a general framework for proving such inversion results in the case where the combinatorial objects are built up recursively by successively adding some incremental structure such as a single horizontal strip or rim-hook. In this setting, we show that a sequence of matrix inversion results $A_nB_n=I$ can be reduced to a certain ``local'' identity involving the incremental structures. Here, $A_n$ and $B_n$ are matrices that might be non-square, and the columns of $A_n$ and the rows of $B_n$ indexed by compositions of $n$. We illustrate the general theory with four classical applications involving the Kostka matrices, the character tables of the symmetric group, incidence matrices for composition posets, and matrices counting brick tabloids. We obtain a new, canonical bijective proof of an inversion result for rectangular Kostka matrices, which complements the proof for the square case due to Eğecioğlu and Remmel. We also give a new bijective proof of the orthogonality result for the irreducible $S_n$-characters that is shorter than the original version due to White. - Open Access
Transition matrices and Pieri-type rules for polysymmetric functions
Asvin G and Andrew O'Desky recently introduced the graded algebra P$Λ$ of polysymmetric functions as a generalization of the algebra $Λ$ of symmetric functions. This article develops combinatorial formulas for some multiplication rules and transition matrix entries for P$Λ$ that are analogous to well-known classical formulas for $Λ$. In more detail, we consider pure tensor bases $\{s^{\otimes}_τ\}$, $\{p^{\otimes}_τ\}$, and $\{m^{\otimes}_τ\}$ for P$Λ$ that arise as tensor products of the classical Schur basis, power-sum basis, and monomial basis for $Λ$. We find expansions in these bases of the non-pure bases $\{P_δ\}$, $\{H_δ\}$, $\{E^+_δ\}$, and $\{E_δ\}$ studied by Asvin G and O'Desky. The answers involve tableau-like structures generalizing semistandard tableaux, rim-hook tableaux, and the brick tabloids of Eğecioğlu and Remmel. These objects arise by iteration of new Pieri-type rules that give expansions of products such as $s^{\otimes}_σH_δ$, $p^{\otimes}_σE_δ$, etc.Open AccessTransition matrices and Pieri-type rules for polysymmetric functions
Asvin G and Andrew O'Desky recently introduced the graded algebra P$Λ$ of polysymmetric functions as a generalization of the algebra $Λ$ of symmetric functions. This article develops combinatorial formulas for some multiplication rules and transition matrix entries for P$Λ$ that are analogous to well-known classical formulas for $Λ$. In more detail, we consider pure tensor bases $\{s^{\otimes}_τ\}$, $\{p^{\otimes}_τ\}$, and $\{m^{\otimes}_τ\}$ for P$Λ$ that arise as tensor products of the classical Schur basis, power-sum basis, and monomial basis for $Λ$. We find expansions in these bases of the non-pure bases $\{P_δ\}$, $\{H_δ\}$, $\{E^+_δ\}$, and $\{E_δ\}$ studied by Asvin G and O'Desky. The answers involve tableau-like structures generalizing semistandard tableaux, rim-hook tableaux, and the brick tabloids of Eğecioğlu and Remmel. These objects arise by iteration of new Pieri-type rules that give expansions of products such as $s^{\otimes}_σH_δ$, $p^{\otimes}_σE_δ$, etc. - Open Access
Skeletal generalizations of Dyck paths, parking functions, and chip-firing games
For $0\leq k\leq n-1$, we introduce a family of $k$-skeletal paths which are counted by the $n$-th Catalan number for each $k$, and specialize to Dyck paths when $k=n-1$. We similarly introduce $k$-skeletal parking functions which are equinumerous with the spanning trees on $n+1$ vertices for each $k$, and specialize to classical parking functions for $k=n-1$. The preceding constructions are generalized to paths lying in a trapezoid with base $c > 0$ and southeastern diagonal of slope $1/m$; $c$ and $m$ need not be integers. We give bijections among these families when $k$ varies with $m$ and $c$ fixed. Our constructions are motivated by chip firing and have connections to combinatorial representation theory and tropical geometry.Open AccessSkeletal generalizations of Dyck paths, parking functions, and chip-firing games
For $0\leq k\leq n-1$, we introduce a family of $k$-skeletal paths which are counted by the $n$-th Catalan number for each $k$, and specialize to Dyck paths when $k=n-1$. We similarly introduce $k$-skeletal parking functions which are equinumerous with the spanning trees on $n+1$ vertices for each $k$, and specialize to classical parking functions for $k=n-1$. The preceding constructions are generalized to paths lying in a trapezoid with base $c > 0$ and southeastern diagonal of slope $1/m$; $c$ and $m$ need not be integers. We give bijections among these families when $k$ varies with $m$ and $c$ fixed. Our constructions are motivated by chip firing and have connections to combinatorial representation theory and tropical geometry. - 30 April 2024
- Published by Taylor & Francis
- p. 134-172
Comparing Concrete Linear Algebra to Abstract Linear Algebra | 6 | v2
In introductory linear algebra, we learn to execute computations involving concrete objects such as column vectors and matrices. In more advanced linear algebra, we study abstract vector spaces and linear transformations. Concrete concepts defined for matrices (such as matrix multiplication, matrix transpose, diagonalizability, idempotence) have abstract counterparts for linear transformations (such as composition of maps, dual maps, existence of a basis of eigenvectors, and being a projection). This chapter gives a thorough account of the relations between the concrete world of column vectors and matrices on the one hand, and the abstract world of vector spaces and linear maps on the other hand. We build a dictionary linking these two worlds, explaining the precise connection between each abstract concept and its concrete manifestation. In particular, we carefully describe how taking coordinates relative to an ordered basis yields a vector space isomorphism between an abstract vector space https://www.w3.org/1998/Math/MathML"> V https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_12.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> and a concrete space https://www.w3.org/1998/Math/MathML"> F n https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_13.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> of column vectors. Similarly, computing the matrix of a linear map relative to an ordered basis gives an algebra isomorphism between an algebra of linear operators and an algebra of matrices. We also discuss how congruence, orthogonal similarity, and unitary similarity of matrices are related to bilinear maps, real inner product spaces, and complex inner product spaces.
- 30 April 2024
- Published by Taylor & Francis
- p. 134-172
Comparing Concrete Linear Algebra to Abstract Linear Algebra | 6 | v2
In introductory linear algebra, we learn to execute computations involving concrete objects such as column vectors and matrices. In more advanced linear algebra, we study abstract vector spaces and linear transformations. Concrete concepts defined for matrices (such as matrix multiplication, matrix transpose, diagonalizability, idempotence) have abstract counterparts for linear transformations (such as composition of maps, dual maps, existence of a basis of eigenvectors, and being a projection). This chapter gives a thorough account of the relations between the concrete world of column vectors and matrices on the one hand, and the abstract world of vector spaces and linear maps on the other hand. We build a dictionary linking these two worlds, explaining the precise connection between each abstract concept and its concrete manifestation. In particular, we carefully describe how taking coordinates relative to an ordered basis yields a vector space isomorphism between an abstract vector space https://www.w3.org/1998/Math/MathML"> V https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_12.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> and a concrete space https://www.w3.org/1998/Math/MathML"> F n https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_13.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> of column vectors. Similarly, computing the matrix of a linear map relative to an ordered basis gives an algebra isomorphism between an algebra of linear operators and an algebra of matrices. We also discuss how congruence, orthogonal similarity, and unitary similarity of matrices are related to bilinear maps, real inner product spaces, and complex inner product spaces.
- 30 April 2024
- Published by Taylor & Francis
- p. 341-366
Dual Vector Spaces
A fruitful idea in mathematics is the interplay between geometric spaces and structure-preserving functions defined on these spaces. This chapter studies the fundamental case of a finite-dimensional vector space https://www.w3.org/1998/Math/MathML"> V https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_19.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> and the dual space https://www.w3.org/1998/Math/MathML"> V * https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_20.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> of linear functions from https://www.w3.org/1998/Math/MathML"> V https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_21.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> to the field of scalars. We show how the concepts of zero sets and annihilators lead to inclusion-reversing bijections between the subspaces of https://www.w3.org/1998/Math/MathML"> V https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_22.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> and the subspaces of https://www.w3.org/1998/Math/MathML"> V * https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_23.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> . Once this correspondence is understood, we explore how the choice of an inner product on https://www.w3.org/1998/Math/MathML"> V https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_24.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> sets up an isomorphism between https://www.w3.org/1998/Math/MathML"> V https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_25.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> and https://www.w3.org/1998/Math/MathML"> V * https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_26.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> . We also study the double dual https://www.w3.org/1998/Math/MathML"> V * * https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_27.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> and its relation to https://www.w3.org/1998/Math/MathML"> V https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_28.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> , along with dual maps and adjoint operators. The chapter concludes with a discussion of bilinear pairings and real and complex inner product spaces. We briefly comment on how the ideas in this chapter extend to Banach spaces and affine algebraic geometry.
- 30 April 2024
- Published by Taylor & Francis
- p. 341-366
Dual Vector Spaces
A fruitful idea in mathematics is the interplay between geometric spaces and structure-preserving functions defined on these spaces. This chapter studies the fundamental case of a finite-dimensional vector space https://www.w3.org/1998/Math/MathML"> V https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_19.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> and the dual space https://www.w3.org/1998/Math/MathML"> V * https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_20.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> of linear functions from https://www.w3.org/1998/Math/MathML"> V https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_21.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> to the field of scalars. We show how the concepts of zero sets and annihilators lead to inclusion-reversing bijections between the subspaces of https://www.w3.org/1998/Math/MathML"> V https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_22.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> and the subspaces of https://www.w3.org/1998/Math/MathML"> V * https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_23.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> . Once this correspondence is understood, we explore how the choice of an inner product on https://www.w3.org/1998/Math/MathML"> V https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_24.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> sets up an isomorphism between https://www.w3.org/1998/Math/MathML"> V https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_25.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> and https://www.w3.org/1998/Math/MathML"> V * https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_26.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> . We also study the double dual https://www.w3.org/1998/Math/MathML"> V * * https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_27.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> and its relation to https://www.w3.org/1998/Math/MathML"> V https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_28.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> , along with dual maps and adjoint operators. The chapter concludes with a discussion of bilinear pairings and real and complex inner product spaces. We briefly comment on how the ideas in this chapter extend to Banach spaces and affine algebraic geometry.
- 30 April 2024
- Published by Taylor & Francis
- p. 252-278
Iterative Algorithms in Numerical Linear Algebra
This chapter studies methods for solving linear systems and computing eigenvalues that employ an iterative process to generate successive approximations converging to the true solution. Iterative algorithms for solving https://www.w3.org/1998/Math/MathML"> A x = b https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_16.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> include Richardson’s method, the Jacobi method, and the Gauss–Seidel method. After developing some background on vector norms and matrix norms, we establish some theoretical results ensuring the convergence of these algorithms for certain classes of matrices. The chapter ends with an analysis of the power method for iteratively computing the largest eigenvalue of a matrix. Techniques for finding other eigenvalues (the shifted power method, inverse power method, and deflation) are also discussed.
- 30 April 2024
- Published by Taylor & Francis
- p. 252-278
Iterative Algorithms in Numerical Linear Algebra
This chapter studies methods for solving linear systems and computing eigenvalues that employ an iterative process to generate successive approximations converging to the true solution. Iterative algorithms for solving https://www.w3.org/1998/Math/MathML"> A x = b https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003484561/28ab8c2b-3eb6-4181-a683-0c1f00c09afd/content/mathabs_16.tif" xmlns:xlink="https://www.w3.org/1999/xlink"/> include Richardson’s method, the Jacobi method, and the Gauss–Seidel method. After developing some background on vector norms and matrix norms, we establish some theoretical results ensuring the convergence of these algorithms for certain classes of matrices. The chapter ends with an analysis of the power method for iteratively computing the largest eigenvalue of a matrix. Techniques for finding other eigenvalues (the shifted power method, inverse power method, and deflation) are also discussed.
- 30 April 2024
- Published by Taylor & Francis
- p. 3-22
Overview of Algebraic Systems
This chapter contains a condensed reference for the abstract algebra background needed in some parts of the book. It reviews the definitions of groups, commutative groups, rings, integral domains, fields, vector spaces, algebras, and homomorphisms of these structures. Also covered are the constructions of subgroups, product groups, quotient groups, and their analogues for other algebraic systems. Finally, the chapter recalls some fundamental definitions and results from elementary linear algebra involving linear independence, spanning sets, bases, and dimension. Most of the later chapters in this book require only a small subset of the material covered here, such as the definitions of a field, vector space, linear map, subspace, linearly independent list, and ordered basis.
- 30 April 2024
- Published by Taylor & Francis
- p. 3-22
Overview of Algebraic Systems
This chapter contains a condensed reference for the abstract algebra background needed in some parts of the book. It reviews the definitions of groups, commutative groups, rings, integral domains, fields, vector spaces, algebras, and homomorphisms of these structures. Also covered are the constructions of subgroups, product groups, quotient groups, and their analogues for other algebraic systems. Finally, the chapter recalls some fundamental definitions and results from elementary linear algebra involving linear independence, spanning sets, bases, and dimension. Most of the later chapters in this book require only a small subset of the material covered here, such as the definitions of a field, vector space, linear map, subspace, linearly independent list, and ordered basis.