Pavol Hell and Jaroslav Nesetril
- Published in print:
- 2004
- Published Online:
- September 2007
- ISBN:
- 9780198528173
- eISBN:
- 9780191713644
- Item type:
- book
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/acprof:oso/9780198528173.001.0001
- Subject:
- Mathematics, Combinatorics / Graph Theory / Discrete Mathematics
Graph theory is now an established discipline but the study of graph homomorphisms has only recently begun to gain wide acceptance and interest. This text is devoted entirely to the subject, bringing ...
More
Graph theory is now an established discipline but the study of graph homomorphisms has only recently begun to gain wide acceptance and interest. This text is devoted entirely to the subject, bringing together the highlights of the theory and its many applications. It looks at areas such as graph reconstruction, products, fractional and circular colourings, and constraint satisfaction problems, and has applications in complexity theory, artificial intelligence, telecommunications, and statistical physics. It has a wide focus on algebraic, combinatorial, and algorithmic aspects of graph homomorphisms. A reference list and historical summaries extend the material explicitly discussed. The book contains exercises of varying difficulty. Hints or references are provided for the more difficult exercises.Less
Graph theory is now an established discipline but the study of graph homomorphisms has only recently begun to gain wide acceptance and interest. This text is devoted entirely to the subject, bringing together the highlights of the theory and its many applications. It looks at areas such as graph reconstruction, products, fractional and circular colourings, and constraint satisfaction problems, and has applications in complexity theory, artificial intelligence, telecommunications, and statistical physics. It has a wide focus on algebraic, combinatorial, and algorithmic aspects of graph homomorphisms. A reference list and historical summaries extend the material explicitly discussed. The book contains exercises of varying difficulty. Hints or references are provided for the more difficult exercises.
Geoffrey Grimmett and Colin McDiarmid (eds)
- Published in print:
- 2007
- Published Online:
- September 2007
- ISBN:
- 9780198571278
- eISBN:
- 9780191718885
- Item type:
- book
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/acprof:oso/9780198571278.001.0001
- Subject:
- Mathematics, Probability / Statistics
Professor Dominic Welsh has made significant contributions to the fields of combinatorics and discrete probability, including matroids, complexity, and percolation. He has taught, influenced, and ...
More
Professor Dominic Welsh has made significant contributions to the fields of combinatorics and discrete probability, including matroids, complexity, and percolation. He has taught, influenced, and inspired generations of students and researchers in mathematics. This book summarizes and reviews the consistent themes from his work through a series of articles written by renowned experts. These articles, presented as chapters, contain original research work, set in a broader context by the inclusion of review material.Less
Professor Dominic Welsh has made significant contributions to the fields of combinatorics and discrete probability, including matroids, complexity, and percolation. He has taught, influenced, and inspired generations of students and researchers in mathematics. This book summarizes and reviews the consistent themes from his work through a series of articles written by renowned experts. These articles, presented as chapters, contain original research work, set in a broader context by the inclusion of review material.
Jason Rosenhouse and Jennifer Beineke (eds)
- Published in print:
- 2017
- Published Online:
- May 2018
- ISBN:
- 9780691171920
- eISBN:
- 9781400889136
- Item type:
- book
- Publisher:
- Princeton University Press
- DOI:
- 10.23943/princeton/9780691171920.001.0001
- Subject:
- Mathematics, History of Mathematics
The history of mathematics is filled with major breakthroughs resulting from solutions to recreational problems. Problems of interest to gamblers led to the modern theory of probability, for example, ...
More
The history of mathematics is filled with major breakthroughs resulting from solutions to recreational problems. Problems of interest to gamblers led to the modern theory of probability, for example, and surreal numbers were inspired by the game of Go. Yet even with such groundbreaking findings and a wealth of popular-level books, research in recreational mathematics has often been neglected. This book returns with a brand-new compilation of fascinating problems and solutions in recreational mathematics. It gathers together the top experts in recreational math and presents a compelling look at board games, card games, dice, toys, computer games, and much more. The book is divided into five parts: puzzles and brainteasers, geometry and topology, graph theory, games of chance, and computational complexity. Readers will discover what origami, roulette wheels, and even the game of Trouble can teach about math. Chapters contain new results, and include short expositions on the topic's background, providing a framework for understanding the relationship between serious mathematics and recreational games. Mathematical areas explored include combinatorics, logic, graph theory, linear algebra, geometry, topology, computer science, operations research, probability, game theory, and music theory.Less
The history of mathematics is filled with major breakthroughs resulting from solutions to recreational problems. Problems of interest to gamblers led to the modern theory of probability, for example, and surreal numbers were inspired by the game of Go. Yet even with such groundbreaking findings and a wealth of popular-level books, research in recreational mathematics has often been neglected. This book returns with a brand-new compilation of fascinating problems and solutions in recreational mathematics. It gathers together the top experts in recreational math and presents a compelling look at board games, card games, dice, toys, computer games, and much more. The book is divided into five parts: puzzles and brainteasers, geometry and topology, graph theory, games of chance, and computational complexity. Readers will discover what origami, roulette wheels, and even the game of Trouble can teach about math. Chapters contain new results, and include short expositions on the topic's background, providing a framework for understanding the relationship between serious mathematics and recreational games. Mathematical areas explored include combinatorics, logic, graph theory, linear algebra, geometry, topology, computer science, operations research, probability, game theory, and music theory.
Robin Wilson and John J. Watkins (eds)
- Published in print:
- 2013
- Published Online:
- September 2013
- ISBN:
- 9780199656592
- eISBN:
- 9780191748059
- Item type:
- book
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/acprof:oso/9780199656592.001.0001
- Subject:
- Mathematics, Combinatorics / Graph Theory / Discrete Mathematics, History of Mathematics
The history of mathematics is a well-studied and vibrant area of research, with books and scholarly articles published on various aspects of the subject. Yet, the history of combinatorics seems to ...
More
The history of mathematics is a well-studied and vibrant area of research, with books and scholarly articles published on various aspects of the subject. Yet, the history of combinatorics seems to have been largely overlooked. This book goes some way to redress this and serves two main purposes: it constitutes the first book-length survey of the history of combinatorics, and it assembles, for the first time in a single source, researches on the history of combinatorics that would otherwise be inaccessible to the general reader. Individual chapters have been contributed by sixteen experts. The book opens with an introduction to two thousand years of combinatorics. This is followed by seven chapters on early combinatorics, leading from Indian and Chinese writings on permutations to late-Renaissance publications on the arithmetical triangle. The next seven chapters trace the subsequent story, from Euler’s contributions to such wide-ranging topics as partitions, polyhedra, and latin squares to the 20th-century advances in combinatorial set theory, enumeration, and graph theory. The book concludes with some combinatorial reflections.Less
The history of mathematics is a well-studied and vibrant area of research, with books and scholarly articles published on various aspects of the subject. Yet, the history of combinatorics seems to have been largely overlooked. This book goes some way to redress this and serves two main purposes: it constitutes the first book-length survey of the history of combinatorics, and it assembles, for the first time in a single source, researches on the history of combinatorics that would otherwise be inaccessible to the general reader. Individual chapters have been contributed by sixteen experts. The book opens with an introduction to two thousand years of combinatorics. This is followed by seven chapters on early combinatorics, leading from Indian and Chinese writings on permutations to late-Renaissance publications on the arithmetical triangle. The next seven chapters trace the subsequent story, from Euler’s contributions to such wide-ranging topics as partitions, polyhedra, and latin squares to the 20th-century advances in combinatorial set theory, enumeration, and graph theory. The book concludes with some combinatorial reflections.
Christophe Reutenauer
- Published in print:
- 2018
- Published Online:
- January 2019
- ISBN:
- 9780198827542
- eISBN:
- 9780191866418
- Item type:
- book
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/oso/9780198827542.001.0001
- Subject:
- Mathematics, Pure Mathematics
Christoffel introduced in 1875 a special class of words on a binary alphabet, linked to continued fractions. Some years laterMarkoff published his famous theory, called nowMarkoff theory. It ...
More
Christoffel introduced in 1875 a special class of words on a binary alphabet, linked to continued fractions. Some years laterMarkoff published his famous theory, called nowMarkoff theory. It characterizes certain quadratic forms, and certain real numbers by extremal inequalities. Both classes are constructed by using certain natural numbers, calledMarkoff numbers; they are characterized by a certain diophantine equality. More basically, they are constructed using certain words, essentially the Christoffel words. The link between Christoffelwords and the theory ofMarkoffwas noted by Frobenius.Motivated by this link, the book presents the classical theory of Markoff in its two aspects, based on the theory of Christoffel words. This is done in Part I of the book. Part II gives the more advanced and recent results of the theory of Christoffel words: palindromes (central words), periods, Lyndon words, Stern–Brocot tree, semi-convergents of rational numbers and finite continued fractions, geometric interpretations, conjugation, factors of Christoffel words, finite Sturmian words, free group on two generators, bases, inner automorphisms, Christoffel bases, Nielsen’s criterion, Sturmian morphisms, and positive automorphisms of this free group.Less
Christoffel introduced in 1875 a special class of words on a binary alphabet, linked to continued fractions. Some years laterMarkoff published his famous theory, called nowMarkoff theory. It characterizes certain quadratic forms, and certain real numbers by extremal inequalities. Both classes are constructed by using certain natural numbers, calledMarkoff numbers; they are characterized by a certain diophantine equality. More basically, they are constructed using certain words, essentially the Christoffel words. The link between Christoffelwords and the theory ofMarkoffwas noted by Frobenius.Motivated by this link, the book presents the classical theory of Markoff in its two aspects, based on the theory of Christoffel words. This is done in Part I of the book. Part II gives the more advanced and recent results of the theory of Christoffel words: palindromes (central words), periods, Lyndon words, Stern–Brocot tree, semi-convergents of rational numbers and finite continued fractions, geometric interpretations, conjugation, factors of Christoffel words, finite Sturmian words, free group on two generators, bases, inner automorphisms, Christoffel bases, Nielsen’s criterion, Sturmian morphisms, and positive automorphisms of this free group.
Kanchan Chandra (ed.)
- Published in print:
- 2012
- Published Online:
- January 2013
- ISBN:
- 9780199893157
- eISBN:
- 9780199980079
- Item type:
- book
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/acprof:oso/9780199893157.001.0001
- Subject:
- Political Science, Comparative Politics
The book is motivated by a disjuncture in social science research on ethnicity, politics and economics: Although theories of the formation of ethnic groups are driven by the constructivist assumption ...
More
The book is motivated by a disjuncture in social science research on ethnicity, politics and economics: Although theories of the formation of ethnic groups are driven by the constructivist assumption that ethnic identities can change over time, theories of the effect of ethnicity on economic and political outcomes are driven by the primordialist assumption that these identities are fixed. This book is a first cut at building—and rebuilding—our theories of politics and economics on a fortified constructivist foundation. It proposes a new conceptual framework for thinking about ethnic identity. It uses this framework to synthesize constructivist arguments into a set of testable propositions about how and why ethnic identities change. It translates this framework—and the propositions derived from it—into a new, combinatorial language. And it employs these conceptual, constructivist, and combinatorial tools to theorize about the relationship between ethnicity, politics and economics using a variety of methods. Taking the possibility of change in ethnic identity into account, this book shows, dismantles the theoretical logics linking ethnic diversity to negative outcomes and processes such as democratic destabilization, clientelism, riots and state collapse. Even more importantly, it changes the questions we can ask about the relationship between ethnicity, politics and economicsLess
The book is motivated by a disjuncture in social science research on ethnicity, politics and economics: Although theories of the formation of ethnic groups are driven by the constructivist assumption that ethnic identities can change over time, theories of the effect of ethnicity on economic and political outcomes are driven by the primordialist assumption that these identities are fixed. This book is a first cut at building—and rebuilding—our theories of politics and economics on a fortified constructivist foundation. It proposes a new conceptual framework for thinking about ethnic identity. It uses this framework to synthesize constructivist arguments into a set of testable propositions about how and why ethnic identities change. It translates this framework—and the propositions derived from it—into a new, combinatorial language. And it employs these conceptual, constructivist, and combinatorial tools to theorize about the relationship between ethnicity, politics and economics using a variety of methods. Taking the possibility of change in ethnic identity into account, this book shows, dismantles the theoretical logics linking ethnic diversity to negative outcomes and processes such as democratic destabilization, clientelism, riots and state collapse. Even more importantly, it changes the questions we can ask about the relationship between ethnicity, politics and economics
Răzvan Gheorghe Gurău
- Published in print:
- 2016
- Published Online:
- January 2017
- ISBN:
- 9780198787938
- eISBN:
- 9780191829918
- Item type:
- book
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/acprof:oso/9780198787938.001.0001
- Subject:
- Physics, Theoretical, Computational, and Statistical Physics, Particle Physics / Astrophysics / Cosmology
This book presents a self-contained, ab initio introduction to random tensors. The book is divided into two parts. The first part introduces the general framework and the main results on random ...
More
This book presents a self-contained, ab initio introduction to random tensors. The book is divided into two parts. The first part introduces the general framework and the main results on random tensors. The second part presents in detail specific examples of random tensors models. The book presents both asymptotic results (or perturbative, in the physics literature) and constructive (non perturbative) results in full detail. The book is suitable for readers unfamiliar with the field. The material presented is divided into three broad categories of results. The first category connects random tensors to topological spaces, Euclidean dynamical triangulations and random geometry. The second category consists of perturbative results on random tensors. It contains the 1/N expansion, the enumeration of graphs of fixed degree, the continuum limit, the double scaling limit as well as the study of phase transitions and symmetry breaking in tensor models. The results in the third category are non perturbative: the proof of the universality of Gaussian tensor measures and the construction of quartically perturbed Gaussian measure. These results are obtained using methods from enumerative combinatorics, probability theory and constructive field theory. Random tensors generalize random matrices and provide a framework for the study of random geometries in any dimension relevant for conformal field theory, statistical physics and quantum gravity.Less
This book presents a self-contained, ab initio introduction to random tensors. The book is divided into two parts. The first part introduces the general framework and the main results on random tensors. The second part presents in detail specific examples of random tensors models. The book presents both asymptotic results (or perturbative, in the physics literature) and constructive (non perturbative) results in full detail. The book is suitable for readers unfamiliar with the field. The material presented is divided into three broad categories of results. The first category connects random tensors to topological spaces, Euclidean dynamical triangulations and random geometry. The second category consists of perturbative results on random tensors. It contains the 1/N expansion, the enumeration of graphs of fixed degree, the continuum limit, the double scaling limit as well as the study of phase transitions and symmetry breaking in tensor models. The results in the third category are non perturbative: the proof of the universality of Gaussian tensor measures and the construction of quartically perturbed Gaussian measure. These results are obtained using methods from enumerative combinatorics, probability theory and constructive field theory. Random tensors generalize random matrices and provide a framework for the study of random geometries in any dimension relevant for conformal field theory, statistical physics and quantum gravity.
Kanchan Chandra
- Published in print:
- 2012
- Published Online:
- January 2013
- ISBN:
- 9780199893157
- eISBN:
- 9780199980079
- Item type:
- chapter
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/acprof:oso/9780199893157.003.0001
- Subject:
- Political Science, Comparative Politics
This chapter provides a complete sketch of the key concepts and arguments introduced in this book as well as the stakes attached to each. It introduces the conceptual framework for thinking about ...
More
This chapter provides a complete sketch of the key concepts and arguments introduced in this book as well as the stakes attached to each. It introduces the conceptual framework for thinking about ethnic identity and ethnic identity change proposed in this book. It shows how this framework synthesizes constructivist arguments into a set of testable and logically connected propositions about why and how ethnic identities change; how this framework—and the propositions derived from it—into a new, combinatorial language; and how these conceptual, constructivist, and combinatorial tools are deployed to theorize about the relationship between ethnicity, politics and economics using a variety of methods.Less
This chapter provides a complete sketch of the key concepts and arguments introduced in this book as well as the stakes attached to each. It introduces the conceptual framework for thinking about ethnic identity and ethnic identity change proposed in this book. It shows how this framework synthesizes constructivist arguments into a set of testable and logically connected propositions about why and how ethnic identities change; how this framework—and the propositions derived from it—into a new, combinatorial language; and how these conceptual, constructivist, and combinatorial tools are deployed to theorize about the relationship between ethnicity, politics and economics using a variety of methods.
Roi Wagner, Naomi Aradi, Avinoam Baraness, David Garber, Stela Segev, Shai Simonson, Ilana Wartenberg, Menso Folkerts, Barnabas Hughes, Roi Wagner, and J. Lennart Berggren
Victor J. Katz (ed.)
- Published in print:
- 2016
- Published Online:
- January 2018
- ISBN:
- 9780691156859
- eISBN:
- 9781400883202
- Item type:
- chapter
- Publisher:
- Princeton University Press
- DOI:
- 10.23943/princeton/9780691156859.003.0003
- Subject:
- Mathematics, History of Mathematics
This chapter covers mathematics written in Hebrew between the eleventh and sixteenth centuries in Europe. It starts with the practical and scholarly—as well as earlier and later—Hebrew expositions of ...
More
This chapter covers mathematics written in Hebrew between the eleventh and sixteenth centuries in Europe. It starts with the practical and scholarly—as well as earlier and later—Hebrew expositions of arithmetic, from Ibn Ezra's foundational twelfth-century The Book of Number, to Levi ben Gershon's early-fourteenth-century arithmetic. The chapter then follows with two discussions of combinatorics: Ibn Ezra's calculations of the number of possible conjunctions of a given number of planets from among the seven planets, and Ben Gershon's abstract and general discussion of permutations and combinations. Finally, this chapter discusses two important treatises that summarize geometric knowledge in a semi-practical style as well as measurements in a religious context.Less
This chapter covers mathematics written in Hebrew between the eleventh and sixteenth centuries in Europe. It starts with the practical and scholarly—as well as earlier and later—Hebrew expositions of arithmetic, from Ibn Ezra's foundational twelfth-century The Book of Number, to Levi ben Gershon's early-fourteenth-century arithmetic. The chapter then follows with two discussions of combinatorics: Ibn Ezra's calculations of the number of possible conjunctions of a given number of planets from among the seven planets, and Ben Gershon's abstract and general discussion of permutations and combinations. Finally, this chapter discusses two important treatises that summarize geometric knowledge in a semi-practical style as well as measurements in a religious context.
Roi Wagner
- Published in print:
- 2017
- Published Online:
- January 2018
- ISBN:
- 9780691171715
- eISBN:
- 9781400883783
- Item type:
- chapter
- Publisher:
- Princeton University Press
- DOI:
- 10.23943/princeton/9780691171715.003.0005
- Subject:
- Mathematics, History of Mathematics
This chapter presents two case studies that highlight the problems of mathematical semiosis: how mathematical signs obtain and change their senses. The first case study follows the paradigmatic ...
More
This chapter presents two case studies that highlight the problems of mathematical semiosis: how mathematical signs obtain and change their senses. The first case study follows the paradigmatic mathematical sign, x, as it is used in applications of powers series to combinatorics via generating functions. The second case study concerns gender role stereotypes involving the so-called “stable marriage problem.” Both case studies open up questions of how meaning is transferred within and across mathematical contexts and try to substantiate the book's claims about interpretation, formalization, and constraints over mathematical objects and statements. The chapter also considers gender-neutral mathematical language in the context of sexuality.Less
This chapter presents two case studies that highlight the problems of mathematical semiosis: how mathematical signs obtain and change their senses. The first case study follows the paradigmatic mathematical sign, x, as it is used in applications of powers series to combinatorics via generating functions. The second case study concerns gender role stereotypes involving the so-called “stable marriage problem.” Both case studies open up questions of how meaning is transferred within and across mathematical contexts and try to substantiate the book's claims about interpretation, formalization, and constraints over mathematical objects and statements. The chapter also considers gender-neutral mathematical language in the context of sexuality.
Matt Clay
- Published in print:
- 2017
- Published Online:
- May 2018
- ISBN:
- 9780691158662
- eISBN:
- 9781400885398
- Item type:
- chapter
- Publisher:
- Princeton University Press
- DOI:
- 10.23943/princeton/9780691158662.003.0004
- Subject:
- Mathematics, Geometry / Topology
This chapter studies subgroups of free groups using the combinatorics of graphs and a simple operation called folding. It introduces a topological model for free groups and uses this model to show ...
More
This chapter studies subgroups of free groups using the combinatorics of graphs and a simple operation called folding. It introduces a topological model for free groups and uses this model to show the rank of the free group H and whether every finitely generated nontrivial normal subgroup of a free group has finite index. The edge paths and the fundamental group of a graph are discussed, along with subgroups via graphs. The chapter also considers five applications of folding: the Nielsen–Schreier Subgroup theorem, the membership problem, index, normality, and residual finiteness. A group G is residually finite if for every nontrivial element g of G there is a normal subgroup N of finite index in G so that g is not in N. Exercises and research projects are included.Less
This chapter studies subgroups of free groups using the combinatorics of graphs and a simple operation called folding. It introduces a topological model for free groups and uses this model to show the rank of the free group H and whether every finitely generated nontrivial normal subgroup of a free group has finite index. The edge paths and the fundamental group of a graph are discussed, along with subgroups via graphs. The chapter also considers five applications of folding: the Nielsen–Schreier Subgroup theorem, the membership problem, index, normality, and residual finiteness. A group G is residually finite if for every nontrivial element g of G there is a normal subgroup N of finite index in G so that g is not in N. Exercises and research projects are included.
E. KEITH LLOYD
- Published in print:
- 2013
- Published Online:
- September 2013
- ISBN:
- 9780199656592
- eISBN:
- 9780191748059
- Item type:
- chapter
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/acprof:oso/9780199656592.003.0013
- Subject:
- Mathematics, Combinatorics / Graph Theory / Discrete Mathematics, History of Mathematics
By the end of the 18th century, what is now called ‘enumerative combinatorics’ was emerging as a distinct discipline. The connections between certain combinatorial problems and algebraical expansions ...
More
By the end of the 18th century, what is now called ‘enumerative combinatorics’ was emerging as a distinct discipline. The connections between certain combinatorial problems and algebraical expansions had already been recognized, but were now more extensively exploited. In the 20th century the theory of permutation groups was successfully used to solve many enumeration problems.Less
By the end of the 18th century, what is now called ‘enumerative combinatorics’ was emerging as a distinct discipline. The connections between certain combinatorial problems and algebraical expansions had already been recognized, but were now more extensively exploited. In the 20th century the theory of permutation groups was successfully used to solve many enumeration problems.
PETER J. CAMERON
- Published in print:
- 2013
- Published Online:
- September 2013
- ISBN:
- 9780199656592
- eISBN:
- 9780191748059
- Item type:
- chapter
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/acprof:oso/9780199656592.003.0016
- Subject:
- Mathematics, Combinatorics / Graph Theory / Discrete Mathematics, History of Mathematics
This chapter presents a quick overview of the recent development of combinatorics and its current directions — as a discipline in its own right, as a part of mathematics and, more generally, as a ...
More
This chapter presents a quick overview of the recent development of combinatorics and its current directions — as a discipline in its own right, as a part of mathematics and, more generally, as a part of science and of society.Less
This chapter presents a quick overview of the recent development of combinatorics and its current directions — as a discipline in its own right, as a part of mathematics and, more generally, as a part of science and of society.
DONALD E. KNUTH
- Published in print:
- 2013
- Published Online:
- September 2013
- ISBN:
- 9780199656592
- eISBN:
- 9780191748059
- Item type:
- chapter
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/acprof:oso/9780199656592.003.0001
- Subject:
- Mathematics, Combinatorics / Graph Theory / Discrete Mathematics, History of Mathematics
Early work on the generation of combinatorial patterns began as civilization itself was taking shape. The story is quite fascinating, and we will see that it spans many cultures in many parts of the ...
More
Early work on the generation of combinatorial patterns began as civilization itself was taking shape. The story is quite fascinating, and we will see that it spans many cultures in many parts of the world, with ties to poetry, music, and religion. There is space here to discuss only some of the principal highlights; but perhaps a few glimpses into the past will stimulate us to dig deeper into the roots of the subject, as the world gets ever smaller and as global scholarship continues to advance.Less
Early work on the generation of combinatorial patterns began as civilization itself was taking shape. The story is quite fascinating, and we will see that it spans many cultures in many parts of the world, with ties to poetry, music, and religion. There is space here to discuss only some of the principal highlights; but perhaps a few glimpses into the past will stimulate us to dig deeper into the roots of the subject, as the world gets ever smaller and as global scholarship continues to advance.
Tomas Riad
- Published in print:
- 2013
- Published Online:
- January 2014
- ISBN:
- 9780199543571
- eISBN:
- 9780191747168
- Item type:
- chapter
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/acprof:oso/9780199543571.003.0010
- Subject:
- Linguistics, Phonetics / Phonology, Language Families
A major theme of this book is the lexcial specification of prosodic information, and the consequences that this has for the understanding of word formation and the shape of the lexicon in Swedish. It ...
More
A major theme of this book is the lexcial specification of prosodic information, and the consequences that this has for the understanding of word formation and the shape of the lexicon in Swedish. It also help for the understanding of the stress system as such. Thus, there are four types of morphemes: tonic (i.e. stressed), pretonic, posttonic and unspecified. Given the previously introduced constraints on Culminativity within the minimal prosodic word, this system now predicts that certain combinations of morphemes should be better formed than others, and those predictions are shown to be borne out. Where no stress is in place, a phonological routine will provide stress at the right edge of the word, where however a posttonic morpheme can steer stress to the preceding syllable. This system explains the pattern of how “Germanic” and “foreign” morphemes combine or don’t combine in Swedish, as a purely prosodic phenomenon.Less
A major theme of this book is the lexcial specification of prosodic information, and the consequences that this has for the understanding of word formation and the shape of the lexicon in Swedish. It also help for the understanding of the stress system as such. Thus, there are four types of morphemes: tonic (i.e. stressed), pretonic, posttonic and unspecified. Given the previously introduced constraints on Culminativity within the minimal prosodic word, this system now predicts that certain combinations of morphemes should be better formed than others, and those predictions are shown to be borne out. Where no stress is in place, a phonological routine will provide stress at the right edge of the word, where however a posttonic morpheme can steer stress to the preceding syllable. This system explains the pattern of how “Germanic” and “foreign” morphemes combine or don’t combine in Swedish, as a purely prosodic phenomenon.
Paul Balister, Béla Bollobás, and Bhargav Narayanan
- Published in print:
- 2018
- Published Online:
- December 2018
- ISBN:
- 9780198809456
- eISBN:
- 9780191847073
- Item type:
- chapter
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/oso/9780198809456.003.0002
- Subject:
- Physics, Theoretical, Computational, and Statistical Physics
The chapter “Reconstructing Random Jigsaws” examines the reconstruction problem for a family of discrete structures, asking whether it is possible to uniquely reconstruct a structure in this family ...
More
The chapter “Reconstructing Random Jigsaws” examines the reconstruction problem for a family of discrete structures, asking whether it is possible to uniquely reconstruct a structure in this family from the “deck” of all its substructures of some fixed size. Reconstruction problems involving combinatorics and randomness have a very rich history. The oldest such problem is perhaps the graph reconstruction conjecture of Kelly and Ulam; analogous questions include reconstructing finite sets satisfying symmetry conditions, reconstructing finite abelian groups, and reconstructing finite subsets of the plane. A natural line of enquiry is to ask how the answer to the reconstruction problem changes when it is necessary to reconstruct a typical (as opposed to an arbitrary) structure in a family of discrete structures. This chapter presents a theoretical case study of interest for all the complex architectures of networks: a reconstruction problem connected with DNA sequencing via the shotgun-sequencing technique.Less
The chapter “Reconstructing Random Jigsaws” examines the reconstruction problem for a family of discrete structures, asking whether it is possible to uniquely reconstruct a structure in this family from the “deck” of all its substructures of some fixed size. Reconstruction problems involving combinatorics and randomness have a very rich history. The oldest such problem is perhaps the graph reconstruction conjecture of Kelly and Ulam; analogous questions include reconstructing finite sets satisfying symmetry conditions, reconstructing finite abelian groups, and reconstructing finite subsets of the plane. A natural line of enquiry is to ask how the answer to the reconstruction problem changes when it is necessary to reconstruct a typical (as opposed to an arbitrary) structure in a family of discrete structures. This chapter presents a theoretical case study of interest for all the complex architectures of networks: a reconstruction problem connected with DNA sequencing via the shotgun-sequencing technique.
Alice Guionnet
- Published in print:
- 2017
- Published Online:
- January 2018
- ISBN:
- 9780198797319
- eISBN:
- 9780191838774
- Item type:
- chapter
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/oso/9780198797319.003.0003
- Subject:
- Physics, Theoretical, Computational, and Statistical Physics
Free probability was introduced by D. Voiculescu as a theory of noncommutative random variables (similar to integration theory) equipped with a notion of freeness very similar to independence. In ...
More
Free probability was introduced by D. Voiculescu as a theory of noncommutative random variables (similar to integration theory) equipped with a notion of freeness very similar to independence. In fact, it is possible in this framework to define the natural ‘free’ counterpart of the central limit theorem, Gaussian distribution, Brownian motion, stochastic differential calculus, entropy, etc. It also appears as the natural setup for studying large random matrices as their size goes to infinity and hence is central in the study of random matrices as their size go to infinity. In this chapter the free probability framework is introduced, and it is shown how it naturally shows up in the random matrices asymptotics via the so-called ‘asymptotic freeness’. The connection with combinatorics and the enumeration of planar maps, including loop models, are discussed.Less
Free probability was introduced by D. Voiculescu as a theory of noncommutative random variables (similar to integration theory) equipped with a notion of freeness very similar to independence. In fact, it is possible in this framework to define the natural ‘free’ counterpart of the central limit theorem, Gaussian distribution, Brownian motion, stochastic differential calculus, entropy, etc. It also appears as the natural setup for studying large random matrices as their size goes to infinity and hence is central in the study of random matrices as their size go to infinity. In this chapter the free probability framework is introduced, and it is shown how it naturally shows up in the random matrices asymptotics via the so-called ‘asymptotic freeness’. The connection with combinatorics and the enumeration of planar maps, including loop models, are discussed.
Olivier Darrigol
- Published in print:
- 2018
- Published Online:
- March 2018
- ISBN:
- 9780198816171
- eISBN:
- 9780191853661
- Item type:
- chapter
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/oso/9780198816171.003.0005
- Subject:
- Physics, Atomic, Laser, and Optical Physics, History of Physics
This chapter deals with writings in which Boltzmann expressed the statistical nature of the entropy law and temporarily made the relation between entropy and combinatorial probability a basic ...
More
This chapter deals with writings in which Boltzmann expressed the statistical nature of the entropy law and temporarily made the relation between entropy and combinatorial probability a basic constructive tool of his theory. In 1881, he discovered that this relation derived from what we now call the microcanonical distribution, and he approved Maxwell’s recent foundation of the equilibrium problem on the microcanonical ensemble. Boltzmann also kept working on problems he had tackled in earlier years. He proposed a new solution to the problem of specific heats, and he performed enormous calculations for the viscosity and diffusion coefficients in the hard-ball model. In a lighter genre, he conceived a new way of determining molecular sizes, and he speculated on a gas model in which the molecular forces would be entirely attractive.Less
This chapter deals with writings in which Boltzmann expressed the statistical nature of the entropy law and temporarily made the relation between entropy and combinatorial probability a basic constructive tool of his theory. In 1881, he discovered that this relation derived from what we now call the microcanonical distribution, and he approved Maxwell’s recent foundation of the equilibrium problem on the microcanonical ensemble. Boltzmann also kept working on problems he had tackled in earlier years. He proposed a new solution to the problem of specific heats, and he performed enormous calculations for the viscosity and diffusion coefficients in the hard-ball model. In a lighter genre, he conceived a new way of determining molecular sizes, and he speculated on a gas model in which the molecular forces would be entirely attractive.
David Forman
- Published in print:
- 2018
- Published Online:
- December 2018
- ISBN:
- 9780198829294
- eISBN:
- 9780191867880
- Item type:
- chapter
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/oso/9780198829294.003.0008
- Subject:
- Philosophy, History of Philosophy
The ancient doctrine of the eternal return of the same embodies a thoroughgoing rejection of the hope that the future world will be better than the present. For this reason, it might seem surprising ...
More
The ancient doctrine of the eternal return of the same embodies a thoroughgoing rejection of the hope that the future world will be better than the present. For this reason, it might seem surprising that Leibniz constructs an argument for a version of the doctrine. He concludes in one text that in the far distant future he himself ‘would be living in a city called Hannover located on the Leine river, occupied with the history of Brunswick, and writing letters to the same friends with the same meaning’. However, his argument shows not that the future will be absolutely identical to the present, but rather that any finite description of the present and future worlds would be identical. In this way, the argument leaves room for the promise of a different and better future—even if it is one that could not be recognized by us as such.Less
The ancient doctrine of the eternal return of the same embodies a thoroughgoing rejection of the hope that the future world will be better than the present. For this reason, it might seem surprising that Leibniz constructs an argument for a version of the doctrine. He concludes in one text that in the far distant future he himself ‘would be living in a city called Hannover located on the Leine river, occupied with the history of Brunswick, and writing letters to the same friends with the same meaning’. However, his argument shows not that the future will be absolutely identical to the present, but rather that any finite description of the present and future worlds would be identical. In this way, the argument leaves room for the promise of a different and better future—even if it is one that could not be recognized by us as such.
Robert Cummins
- Published in print:
- 2010
- Published Online:
- May 2015
- ISBN:
- 9780199548033
- eISBN:
- 9780191809835
- Item type:
- chapter
- Publisher:
- Oxford University Press
- DOI:
- 10.1093/acprof:osobl/9780199548033.003.0010
- Subject:
- Philosophy, Philosophy of Mind
This chapter talks about Donald Davidson's article Truth and Meaning, which revolutionized the conception of how truth and meaning are related. In Truth and Meaning, Davidson put forward the bold ...
More
This chapter talks about Donald Davidson's article Truth and Meaning, which revolutionized the conception of how truth and meaning are related. In Truth and Meaning, Davidson put forward the bold conjecture that meanings are satisfaction conditions and that a Tarskian theory of truth for a language is a theory of meaning. Davidson proposed that the finite base of a Tarskian theory, together with familiar combinatorics, would explain how a language with unbounded expressive capacity could be learned with finite means.Less
This chapter talks about Donald Davidson's article Truth and Meaning, which revolutionized the conception of how truth and meaning are related. In Truth and Meaning, Davidson put forward the bold conjecture that meanings are satisfaction conditions and that a Tarskian theory of truth for a language is a theory of meaning. Davidson proposed that the finite base of a Tarskian theory, together with familiar combinatorics, would explain how a language with unbounded expressive capacity could be learned with finite means.
