Author: Publisher:
ISBN:
Category : Mathematics
Languages : en
Pages : 474
Book Description
Matematychni studiï
Author: Groups St Andrews 2001 in Oxford: Volume 1
Author: C. M. CampbellPublisher: Cambridge University Press
ISBN: 9781139437219
Category : Mathematics
Languages : en
Pages : 316
Book Description
This first volume of the two-volume book contains selected papers from the international conference 'Groups St Andrews 2001 in Oxford' which was held at the University of Oxford in August 2001. Five main lecture courses were given at the conference, and articles based on their lectures form a substantial part of the Proceedings. This volume contains the contributions from Marston Conder (Auckland), Persi Diaconis (Stanford) and Marcus Du Sautoy (Cambridge). The series of Proceedings of Groups St Andrews conferences have provided snapshots of the state of research in group theory throughout the past twenty years. As with earlier volumes, these refereed volumes also contain accessible surveys of contemporary research fronts, as well as a diverse collection of short research articles. They form a valuable reference for researchers, especially graduate students, working in group theory.
Iterative Methods for Solving Nonlinear Equations and Systems
Author: Juan R. TorregrosaPublisher: MDPI
ISBN: 3039219405
Category : Mathematics
Languages : en
Pages : 494
Book Description
Solving nonlinear equations in Banach spaces (real or complex nonlinear equations, nonlinear systems, and nonlinear matrix equations, among others), is a non-trivial task that involves many areas of science and technology. Usually the solution is not directly affordable and require an approach using iterative algorithms. This Special Issue focuses mainly on the design, analysis of convergence, and stability of new schemes for solving nonlinear problems and their application to practical problems. Included papers study the following topics: Methods for finding simple or multiple roots either with or without derivatives, iterative methods for approximating different generalized inverses, real or complex dynamics associated to the rational functions resulting from the application of an iterative method on a polynomial. Additionally, the analysis of the convergence has been carried out by means of different sufficient conditions assuring the local, semilocal, or global convergence. This Special issue has allowed us to present the latest research results in the area of iterative processes for solving nonlinear equations as well as systems and matrix equations. In addition to the theoretical papers, several manuscripts on signal processing, nonlinear integral equations, or partial differential equations, reveal the connection between iterative methods and other branches of science and engineering.
Recent Progress in General Topology II
Author: M. HusekPublisher: Elsevier
ISBN: 0444509801
Category : Mathematics
Languages : en
Pages : 652
Book Description
The book presents surveys describing recent developments in most of the primary subfields of General Topology and its applications to Algebra and Analysis during the last decade. It follows freely the previous edition (North Holland, 1992), Open Problems in Topology (North Holland, 1990) and Handbook of Set-Theoretic Topology (North Holland, 1984). The book was prepared in connection with the Prague Topological Symposium, held in 2001. During the last 10 years the focus in General Topology changed and therefore the selection of topics differs slightly from those chosen in 1992. The following areas experienced significant developments: Topological Groups, Function Spaces, Dimension Theory, Hyperspaces, Selections, Geometric Topology (including Infinite-Dimensional Topology and the Geometry of Banach Spaces). Of course, not every important topic could be included in this book. Except surveys, the book contains several historical essays written by such eminent topologists as: R.D. Anderson, W.W. Comfort, M. Henriksen, S. Mardeŝić, J. Nagata, M.E. Rudin, J.M. Smirnov (several reminiscences of L. Vietoris are added). In addition to extensive author and subject indexes, a list of all problems and questions posed in this book are added. List of all authors of surveys: A. Arhangel'skii, J. Baker and K. Kunen, H. Bennett and D. Lutzer, J. Dijkstra and J. van Mill, A. Dow, E. Glasner, G. Godefroy, G. Gruenhage, N. Hindman and D. Strauss, L. Hola and J. Pelant, K. Kawamura, H.-P. Kuenzi, W. Marciszewski, K. Martin and M. Mislove and M. Reed, R. Pol and H. Torunczyk, D. Repovs and P. Semenov, D. Shakhmatov, S. Solecki, M. Tkachenko.
BCC-Algebras
Author: Janus ThomysPublisher: CRC Press
ISBN: 1000804283
Category : Mathematics
Languages : en
Pages : 332
Book Description
The subjects described in this book are BCC-algebras and an even wider class of weak BCC-algebras. The aim of the book is to summarize the achievements to date in the subject and to present them in the form of a logically created theory. Through appropriate grading and a precise description of the steps of the proofs, this theory is easily assimilated, and it should not take too long for the reader to learn about it. We begin with the motivation for their creation, many examples, and basic results used later in the book. Then we deal with the constructions of BCC-algebras and calculate the numbers of their subalgebras. The author describes the so-called solid weak BCC-algebras. They have some properties of BCI-algebras, but this requires completely new, often difficult, proofs. The important subclasses of weak BCC-algebras and the relationships between them are presented with many examples. BCC-Algebras is intended for researchers dealing with abstract algebra and for logicians working on the border between logic and algebra. The book is also of interest to students interested in the theory of (weak) BCC-algebras or simply in abstract algebra. The structure of the book makes it possible to discover topics that require further research, which, depending on the degree of difficulty, may be completed with a thesis or dissertation.
Language and the Rise of the Algorithm
Author: Jeffrey M. BinderPublisher: University of Chicago Press
ISBN: 0226822540
Category : Technology & Engineering
Languages : en
Pages : 328
Book Description
A wide-ranging history of the algorithm. Bringing together the histories of mathematics, computer science, and linguistic thought, Language and the Rise of the Algorithm reveals how recent developments in artificial intelligence are reopening an issue that troubled mathematicians well before the computer age: How do you draw the line between computational rules and the complexities of making systems comprehensible to people? By attending to this question, we come to see that the modern idea of the algorithm is implicated in a long history of attempts to maintain a disciplinary boundary separating technical knowledge from the languages people speak day to day. Here Jeffrey M. Binder offers a compelling tour of four visions of universal computation that addressed this issue in very different ways: G. W. Leibniz’s calculus ratiocinator; a universal algebra scheme Nicolas de Condorcet designed during the French Revolution; George Boole’s nineteenth-century logic system; and the early programming language ALGOL, short for algorithmic language. These episodes show that symbolic computation has repeatedly become entangled in debates about the nature of communication. Machine learning, in its increasing dependence on words, erodes the line between technical and everyday language, revealing the urgent stakes underlying this boundary. The idea of the algorithm is a levee holding back the social complexity of language, and it is about to break. This book is about the flood that inspired its construction.
Ultrafilters and Topologies on Groups
Author: Yevhen ZelenyukPublisher: Walter de Gruyter
ISBN: 3110213222
Category : Mathematics
Languages : en
Pages : 229
Book Description
This book presents the relationship between ultrafilters and topologies on groups. It shows how ultrafilters are used in constructing topologies on groups with extremal properties and how topologies on groups serve in deriving algebraic results about ultrafilters. The contents of the book fall naturally into three parts. The first, comprising Chapters 1 through 5, introduces to topological groups and ultrafilters insofar as the semigroup operation on ultrafilters is not required. Constructions of some important topological groups are given. In particular, that of an extremally disconnected topological group based on a Ramsey ultrafilter. Also one shows that every infinite group admits a nondiscrete zero-dimensional topology in which all translations and the inversion are continuous. In the second part, Chapters 6 through 9, the Stone-Cêch compactification βG of a discrete group G is studied. For this, a special technique based on the concepts of a local left group and a local homomorphism is developed. One proves that if G is a countable torsion free group, then βG contains no nontrivial finite groups. Also the ideal structure of βG is investigated. In particular, one shows that for every infinite Abelian group G, βG contains 22|G| minimal right ideals. In the third part, using the semigroup βG, almost maximal topological and left topological groups are constructed and their ultrafilter semigroups are examined. Projectives in the category of finite semigroups are characterized. Also one shows that every infinite Abelian group with finitely many elements of order 2 is absolutely ω-resolvable, and consequently, can be partitioned into ω subsets such that every coset modulo infinite subgroup meets each subset of the partition. The book concludes with a list of open problems in the field. Some familiarity with set theory, algebra and topology is presupposed. But in general, the book is almost self-contained. It is aimed at graduate students and researchers working in topological algebra and adjacent areas.
Language and Automata Theory and Applications
Author: Adrian-Horia DediuPublisher: Springer
ISBN: 3319155792
Category : Computers
Languages : en
Pages : 753
Book Description
This book constitutes the refereed proceedings of the 9th International Conference on Language and Automata Theory and Applications, LATA 2015, held in Nice, France in March 2015. The 53 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 115 submissions. The papers cover the following topics: algebraic language theory; algorithms for semi-structured data mining, algorithms on automata and words; automata and logic; automata for system analysis and program verification; automata networks, concurrency and Petri nets; automatic structures; cellular automata, codes, combinatorics on words; computational complexity; data and image compression; descriptional complexity; digital libraries and document engineering; foundations of finite state technology; foundations of XML; fuzzy and rough languages; grammatical inference and algorithmic learning; graphs and graph transformation; language varieties and semigroups; parallel and regulated rewriting; parsing; patterns; string and combinatorial issues in computational biology and bioinformatics; string processing algorithms; symbolic dynamics; term rewriting; transducers; trees, tree languages and tree automata; weighted automata.
Algebra in the Stone-Cech Compactification
Author: Neil HindmanPublisher: Walter de Gruyter
ISBN: 3110809222
Category : Mathematics
Languages : en
Pages : 501
Book Description
The aim of the series is to present new and important developments in pure and applied mathematics. Well established in the community over two decades, it offers a large library of mathematics including several important classics. The volumes supply thorough and detailed expositions of the methods and ideas essential to the topics in question. In addition, they convey their relationships to other parts of mathematics. The series is addressed to advanced readers wishing to thoroughly study the topic. Editorial Board Lev Birbrair, Universidade Federal do Ceará, Fortaleza, Brasil Victor P. Maslov, Russian Academy of Sciences, Moscow, Russia Walter D. Neumann, Columbia University, New York, USA Markus J. Pflaum, University of Colorado, Boulder, USA Dierk Schleicher, Jacobs University, Bremen, Germany
Combinatorial Set Theory
Author: Lorenz J. HalbeisenPublisher: Springer
ISBN: 3319602314
Category : Mathematics
Languages : en
Pages : 586
Book Description
This book, now in a thoroughly revised second edition, provides a comprehensive and accessible introduction to modern set theory. Following an overview of basic notions in combinatorics and first-order logic, the author outlines the main topics of classical set theory in the second part, including Ramsey theory and the axiom of choice. The revised edition contains new permutation models and recent results in set theory without the axiom of choice. The third part explains the sophisticated technique of forcing in great detail, now including a separate chapter on Suslin’s problem. The technique is used to show that certain statements are neither provable nor disprovable from the axioms of set theory. In the final part, some topics of classical set theory are revisited and further developed in light of forcing, with new chapters on Sacks Forcing and Shelah’s astonishing construction of a model with finitely many Ramsey ultrafilters. Written for graduate students in axiomatic set theory, Combinatorial Set Theory will appeal to all researchers interested in the foundations of mathematics. With extensive reference lists and historical remarks at the end of each chapter, this book is suitable for self-study.