You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Over the past decade, it has become apparent that tropical geometry and non-Archimedean geometry should be studied in tandem; each subject has a great deal to say about the other. This volume is a collection of articles dedicated to one or both of these disciplines. Some of the articles are based, at least in part, on the authors' lectures at the 2011 Bellairs Workshop in Number Theory, held from May 6-13, 2011, at the Bellairs Research Institute, Holetown, Barbados. Lecture topics covered in this volume include polyhedral structures on tropical varieties, the structure theory of non-Archimedean curves (algebraic, analytic, tropical, and formal), uniformisation theory for non-Archimedean curves and abelian varieties, and applications to Diophantine geometry. Additional articles selected for inclusion in this volume represent other facets of current research and illuminate connections between tropical geometry, non-Archimedean geometry, toric geometry, algebraic graph theory, and algorithmic aspects of systems of polynomial equations.
This volume contains the proceedings of the Ring Theory Session in honor of T. Y. Lam's 70th birthday, at the 31st Ohio State-Denison Mathematics Conference, held from May 25-27, 2012, at The Ohio State University, Columbus, Ohio. Included are expository articles and research papers covering topics such as cyclically presented modules, Eggert's conjecture, the Mittag-Leffler conditions, clean rings, McCoy rings, QF rings, projective and injective modules, Baer modules, and Leavitt path algebras. Graduate students and researchers in many areas of algebra will find this volume valuable as the papers point out many directions for future work; in particular, several articles contain explicit lists of open questions.
This is Part 2 of a two-volume set. Since Oscar Zariski organized a meeting in 1954, there has been a major algebraic geometry meeting every decade: Woods Hole (1964), Arcata (1974), Bowdoin (1985), Santa Cruz (1995), and Seattle (2005). The American Mathematical Society has supported these summer institutes for over 50 years. Their proceedings volumes have been extremely influential, summarizing the state of algebraic geometry at the time and pointing to future developments. The most recent Summer Institute in Algebraic Geometry was held July 2015 at the University of Utah in Salt Lake City, sponsored by the AMS with the collaboration of the Clay Mathematics Institute. This volume includes ...
This volume contains the proceedings of the AMS Special Session on Harmonic Analysis of Frames, Wavelets, and Tilings, held April 13-14, 2013, in Boulder, Colorado. Frames were first introduced by Duffin and Schaeffer in 1952 in the context of nonharmonic Fourier series but have enjoyed widespread interest in recent years, particularly as a unifying concept. Indeed, mathematicians with backgrounds as diverse as classical and modern harmonic analysis, Banach space theory, operator algebras, and complex analysis have recently worked in frame theory. Frame theory appears in the context of wavelets, spectra and tilings, sampling theory, and more. The papers in this volume touch on a wide variety...
This book constitutes the proceedings of the 24th RoboCup International Symposium which was held online during June 22 - June 28, 2021. The 19 full papers included in these proceedings were carefully reviewed and selected from 42 submissions; the volume also includes 10 RoboCup Champions Papers. In addition to presenting the proceedings of the RoboCup 2021 Symposium, the book highlights the approaches of champion teams from the competitions. Due to the complex research challenges set by the RoboCup initiative, the RoboCup International Symposium offers a unique perspective for exploring scientific and engineering principles underlying advanced robotic and AI systems.
Annotation This book constitutes the refereed proceedings of the 11th Scandinavian Workshop on Algorithm Theory, SWAT 2008, held in Gothenborg, Sweden, in July 2008. The 36 revised full papers presented together with 2 invited lectures were carefully reviewed and selected from 111 submissions. Papers were solicited for original research on algorithms and data structures in all areas, including but not limited to: approximation algorithms, computational biology, computational geometry, distributed algorithms, external-memory algorithms, graph algorithms, online algorithms, optimization algorithms, parallel algorithms, randomized algorithms, string algorithms and algorithmic game theory.
This book constitutes the refereed proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science, MFCS 2009, held in Novy Smokovec, High Tatras, Slovakia, in August 2009. The 56 revised full papers presented together with 7 invited lectures were carefully reviewed and selected from 148 submissions. All current aspects in theoretical computer science and its mathematical foundations are addressed, including algorithmic game theory, algorithmic tearning theory, algorithms and data structures, automata, grammars and formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, cryptography and security, databases and knowledge-based systems, formal specifications and program development, foundations of computing, logic in computer science, mobile computing, models of computation, networks, parallel and distributed computing, quantum computing, semantics and verification of programs, theoretical issues in artificial intelligence.
This volume contains the proceedings of a conference celebrating the work of Steven Boyer, held from June 2–6, 2018, at Université du Québec à Montréal, Montréal, Québec, Canada. Boyer's contributions to research in low-dimensional geometry and topology, and to the Canadian mathematical community, were recognized during the conference. The articles cover a broad range of topics related, but not limited, to the topology and geometry of 3-manifolds, properties of their fundamental groups and associated representation varieties.
For a long time computer scientists have distinguished between fast and slow algo rithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input. All other algorithms are slow (or bad). The running time of slow algorithms is usually exponential. This book is about bad algorithms. There are several reasons why we are interested in exponential time algorithms. Most of us believe that there are many natural problems which cannot be solved by polynomial time algorithms. The most famous and oldest family of hard problems is the family of NP...