Format: Hardback, 263 pages, height x width: 235x155 mm, XV, 263 p.
Series: Operator Theory: Advances and Applications
Pub. Date: 16-Jun-2026
ISBN-13: 9783032216069
This book covers work in the broad area of the scientific interests of Rainer Picards research work marking Rainers 80th birthday. Thus, it contains numerous articles provided by his friends and colleagues from the areas of partial differential equations both time-dependent and time-independent from operator theory including topics such as monotonicity and particular operator theoretic applications to questions arising in partial differential equations or numerics, and from mathematical physics detailing the impact of functional analysis to the most recent models describing physical processes in nature.
Chapter 1. Nonrelativistic Limit of Two-Dimensional Dirac Operators on Lipschitz Domains.
Chapter 2. Gaffneys Inequality and the Closed Range Property in Unbounded Domains.
Chapter 3. Temperature-rate dependent two-temperature theory for piezothermoelastic materials.
Chapter 4. Statistics of the reflected energy from horizontally polarised shear wave propagation in randomly layered media.
Chapter 5. Stability for Magneto-Elastic Systems.
Chapter 6. Continuous Fragmentation Equations in Weighted L1 Spaces.
Chapter 7. Differentiating Accretive Operators, and Linearised Stability and Regularity for Nonlinear Evolution Equations.-
Chapter 8. About critical exponents in semi-linear wave models with dominant mass term.
Chapter 9. Uniqueness and Stability for Time Discretizations of the SST-generalized Navier-Stokes Equations.
Chapter 10. Numerical Treatment of Non-local Integral Operators in the Framework of Evolutionary Equations.
Chapter 11. Spatial Approximation for Evolutionary Equations.
Format: Hardback, 172 pages, height x width: 235x155 mm, XXVIII, 172 p.
Series: Springer Proceedings in Mathematics & Statistics
Pub. Date: 21-Jun-2026
ISBN-13: 9783032221056
This book brings together a collection of research articles by leading experts in group theory, alongside accessible survey papers highlighting recent developments in the field. The contributions provide a broad overview of the diverse themes, methods, and applications that characterize contemporary research in group theory.
The topics covered include combinatorial and geometric group theory, with attention to varieties, braces, twisted conjugacy classes, and sofic groups; the structural analysis of infinite groups, such as existentially closed groups; and the study of finite groups, encompassing p-groups and maximal subgroups, the generation of simple groups, permutation groups, representations of finite groups, and graphs associated with groups.
The work is addressed to researchers in the field.
The derangements subgroup in a finite permutation group and the
Frobenius-Wielandt theorem.- On id-artinian skew braces.- On
non-selfnormalizing subgroups.- Automorphisms and centralizers of subgroups
in -existentially closed groups.- Conditional Non-Soficity of p-adic Deligne
Extensions: on a Theorem of Gohla and Thom.- A classification of infinite
Schreier graphs of the generalized Basilica group.- Anti Boolean Conditions
for Sets of Subgroups.- On verbal subgroups of the group of automorphisms of
regular rooted trees.- On the structure of some finitely generated braces.-
Classifying finite groups G with three Aut(G)-orbits.- The R-property of
flat manifolds: Toward the eigenvalue one property of finite groups.- A lower
bound on the size of maximal abelian subgroups.- On some properties of the
rank graph of a finite group.- On twisted conjugacy classes in finite
groups.- Finite groups with large average order of elements.-
(2,3)-generators for the finite orthogonal groups of even dimension.- On
three generation methods for the simple linear group PSL(3, 7).-
Factorizations of groups and skew braces.- On induced modules over group
rings of soluble groups of finite rank.
Format: Hardback, 340 pages, height x width: 235x155 mm, X, 340 p.
Series: University Texts in the Mathematical Sciences
Pub. Date: 13-Jul-2026
ISBN-13: 9789819588046
This core textbook on functional analysis is intended for senior undergraduates and graduate mathematics students. It is suitable for both classrooms and for self-study. The first in a two-volume series presents all the basic material needed for a solid foundation in the subject. It opens with a concise overview of the historical evolution of the subject and goes on to present foundational material in a clear, succinct manner, integrating original source quotes to enrich the narrative and blending the historical perspectives harmoniously with the flow of the subject. Pedagogically, the short chapters are more conducive for learning, and each chapter concludes with applications (including some unusual ones) to diverse fields and exercises to hone students understanding. The applications can also serve as sources for student seminars. Various formulations of the spectral theorem and their equivalence are discussed. Different approaches to some important results are presented to enrich the toolkit of the students. The style is neither terse nor verbose, requiring occasional paper-pencil work from the reader. The bibliography is rich and includes all the original works of the founding fathers. Thumbnail biographies of the mathematicians involved should pep up the readers.
Chapter 1 Ap´eritif: a Bit of Pre-functional Analysis.
Chapter 2 Norms and Inner Products.
Chapter 3 Completeness and Banach spaces.
Chapter 4 Bounded Linear Maps.
Chapter 5 Hahn-Banach Theorems.
Chapter 6 Hilbert Spaces and Orthogonality.
Chapter 7 Linear Functionals on a Hilbert Space
Chapter 8 Principle of Uniform Boundedness.
Chapter 9 The Polish quartet: open mapping and siblings.
Chapter 10 The Polish Quartet.
Chapter 11 Finite dimensional spaces.-
Chapter 12 Hilbert Space Operators.
Chapter 13 Dual spaces.
Chapter 14 Function spaces 1: Continuous functions.
Chapter 15 Compact operators 1 - Basics.
Chapter 16 Compact operators 2 - Spectral theorem.
Chapter 17 Banach algebras and the spectrum.
Chapter 18 Linear Functionals on C0(X).-
Chapter 19 Spectral theorem for bounded operators.
Chapter 20 Convexity.-
Chapter 21 Weak topologies.
Chapter 22 Extreme points and the Krein-Milman theorem.
Pages: 416
ISBN: 978-981-98-2351-2 (hardcover)
An Introduction to the Analysis of Algorithms is a comprehensive textbook that presents the fundamental methods for designing and analyzing computational algorithms through rigorous mathematical frameworks and practical implementation guidance. The book systematically explores major algorithmic paradigms including greedy algorithms, divide and conquer, dynamic programming, online algorithms, randomized algorithms, and parallel algorithms in linear algebra, providing detailed analysis of correctness and performance for each approach.
The text emphasizes algorithm design techniques and formal analysis using pre/post-conditions and loop invariants, while covering essential computational foundations including automata theory, regular expressions, and complexity analysis. A new chapter on machine learning introduces students to this rapidly growing field, covering both supervised learning methods like regression and classification, and unsupervised techniques such as clustering, providing a bridge between traditional algorithmic thinking and modern data-driven approaches. The book also addresses practical considerations such as algorithm implementation, optimization techniques, and real-world applications across various domains.
Intended for undergraduate and graduate students in computer science and mathematics, the self-contained presentation includes all necessary background material, worked examples, and extensive problem sets, making it suitable as both a classroom textbook and a comprehensive reference for anyone seeking to master algorithmic problem-solving and analysis.
Preface
About the Author
Preliminaries
Greedy Algorithms
Divide and Conquer
Dynamic Programming
Online Algorithms
Randomized Algorithms
Parallel Algorithms in Linear Algebra
Machine Learning
Computational Foundations
Mathematical Foundations
Bibliography
Index
Undergraduate students (Junior/Senior Level), specifically computer science majors taking intermediate to advanced algorithms courses, mathematics students with computational interests, engineering students (software, computer, electrical) requiring algorithmic foundations, data science and information systems students needing algorithmic background. Also suitable for graduate students in computer science needing comprehensive algorithms review, students transitioning from other fields into computational disciplines, and research students requiring rigorous algorithmic foundations for thesis wor