You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
In this volume one finds basic techniques from algebra and number theory (e.g. congruences, unique factorization domains, finite fields, quadratic residues, primality tests, continued fractions, etc.) which in recent years have proven to be extremely useful for applications to cryptography and coding theory. Both cryptography and codes have crucial applications in our daily lives, and they are described here, while the complexity problems that arise in implementing the related numerical algorithms are also taken into due account. Cryptography has been developed in great detail, both in its classical and more recent aspects. In particular public key cryptography is extensively discussed, the ...
The main purpose of these lectures is first to briefly survey the fundamental con nection between the representation theory of the symmetric group Sn and the theory of symmetric functions and second to show how combinatorial methods that arise naturally in the theory of symmetric functions lead to efficient algorithms to express various prod ucts of representations of Sn in terms of sums of irreducible representations. That is, there is a basic isometry which maps the center of the group algebra of Sn, Z(Sn), to the space of homogeneous symmetric functions of degree n, An. This basic isometry is known as the Frobenius map, F. The Frobenius map allows us to reduce calculations involving chara...
This book offers readers a primer on the theory and applications of Ordinary Differential Equations. The style used is simple, yet thorough and rigorous. Each chapter ends with a broad set of exercises that range from the routine to the more challenging and thought-provoking. Solutions to selected exercises can be found at the end of the book. The book contains many interesting examples on topics such as electric circuits, the pendulum equation, the logistic equation, the Lotka-Volterra system, the Laplace Transform, etc., which introduce students to a number of interesting aspects of the theory and applications. The work is mainly intended for students of Mathematics, Physics, Engineering, ...
Polynomial Identities and Combinatorial Methods presents a wide range of perspectives on topics ranging from ring theory and combinatorics to invariant theory and associative algebras. It covers recent breakthroughs and strategies impacting research on polynomial identities and identifies new concepts in algebraic combinatorics, invariant and representation theory, and Lie algebras and superalgebras for novel studies in the field. It presents intensive discussions on various methods and techniques relating the theory of polynomial identities to other branches of algebraic study and includes discussions on Hopf algebras and quantum polynomials, free algebras and Scheier varieties.
As a first comprehensive overview on Farey sequences and subsequences, this monograph is intended as a reference for anyone looking for specific material or formulas related to the subject. Duality of subsequences and maps between them are discussed and explicit proofs are shown in detail. From the Content Basic structural and enumerative properties of Farey sequences, Collective decision making, Committee methods in pattern recognition, Farey duality, Farey sequence, Fundamental Farey subsequences, Monotone bijections between Farey subsequences
The book provides an introduction to Differential Geometry of Curves and Surfaces. The theory of curves starts with a discussion of possible definitions of the concept of curve, proving in particular the classification of 1-dimensional manifolds. We then present the classical local theory of parametrized plane and space curves (curves in n-dimensional space are discussed in the complementary material): curvature, torsion, Frenet’s formulas and the fundamental theorem of the local theory of curves. Then, after a self-contained presentation of degree theory for continuous self-maps of the circumference, we study the global theory of plane curves, introducing winding and rotation numbers, and...
The book represents a basic support for a master course in electromagnetism oriented to numerical simulation. The main goal of the book is that the reader knows the boundary-value problems of partial differential equations that should be solved in order to perform computer simulation of electromagnetic processes. Moreover it includes a part devoted to electric circuit theory based on ordinary differential equations. The book is mainly oriented to electric engineering applications, going from the general to the specific, namely, from the full Maxwell’s equations to the particular cases of electrostatics, direct current, magnetostatics and eddy currents models. Apart from standard exercises related to analytical calculus, the book includes some others oriented to real-life applications solved with MaxFEM free simulation software.
In 1988, for the first time, the two international conferences AAECC-6 and ISSAC'88 (International Symposium on Symbolic and Algebraic Computation, see Lecture Notes in Computer Science 358) have taken place as a Joint Conference in Rome, July 4-8, 1988. The topics of the two conferences are in fact widely related to each other and the Joint Conference presented a good occasion for the two research communities to meet and share scientific experiences and results. The proceedings of the AAECC-6 are included in this volume. The main topics are: Applied Algebra, Theory and Application of Error-Correcting Codes, Cryptography, Complexity, Algebra Based Methods and Applications in Symbolic Computing and Computer Algebra, and Algebraic Methods and Applications for Advanced Information Processing. Twelve invited papers on subjects of common interest for the two conferences are divided between this volume and the succeeding Lecture Notes volume devoted to ISSACC'88. The proceedings of the 5th conference are published as Vol. 356 of the Lecture Notes in Computer Science.
This short book, geared towards undergraduate students of computer science and mathematics, is specifically designed for a first course in mathematical logic. A proof of Gödel's completeness theorem and its main consequences is given using Robinson's completeness theorem and Gödel's compactness theorem for propositional logic. The reader will familiarize himself with many basic ideas and artifacts of mathematical logic: a non-ambiguous syntax, logical equivalence and consequence relation, the Davis-Putnam procedure, Tarski semantics, Herbrand models, the axioms of identity, Skolem normal forms, nonstandard models and, interestingly enough, proofs and refutations viewed as graphic objects. The mathematical prerequisites are minimal: the book is accessible to anybody having some familiarity with proofs by induction. Many exercises on the relationship between natural language and formal proofs make the book also interesting to a wide range of students of philosophy and linguistics.
This book is designed as an advanced undergraduate or a first-year graduate course for students from various disciplines like applied mathematics, physics, engineering. It has evolved while teaching courses on partial differential equations during the last decade at the Politecnico of Milan. The main purpose of these courses was twofold: on the one hand, to train the students to appreciate the interplay between theory and modelling in problems arising in the applied sciences and on the other hand to give them a solid background for numerical methods, such as finite differences and finite elements.