Publications of T. Jech

Size: px
Start display at page:

Download "Publications of T. Jech"

Transcription

1 Publications of T. Jech 1. (with B. Balcar), Modeli teorii mnoжestv obrazovannye soverxennym otnoxeniem, (Models of set theory given by perfect relations), Časopis pro pěstování matematiky 90 (1965), , MR 35, # On ordering of cardinalities, Bulletin de l Académie Polonaise des Sciences 14 (1966), , MR 34, # (with A. Sochor), On θ-model of the set theory, Bulletin de l Académie Polonaise des Sciences 14 (1966), , MR 34, # (with A. Sochor), Applications of the θ-model, Bulletin de l Académie Polonaise des Sciences 14 (1966), , MR 37, # Interdependence of weakened forms of the axiom of choice, Commentationes Mathematicae Universitatis Carolinae 7 (1966), , MR 34, # On cardinals and their successors, Bulletin de l Académie Polonaise des Sciences 14 (1966), , MR 37, # Non-provability of Souslin s hypothesis, Commentationes Mathematicae Universitatis Carolinae 8 (1967), , MR 35, # Eine Bemerkung zum Auswahlaxiom, Časopis pro pěstování matematiky 93 (1968), 30 31, MR 38, # ω 1 can be measurable, Israel Journal of Mathematics 6 (1968), , MR 39, # Isomorphism types of trees, Notices Amer. Math. Society 17 (1970), On models for set theory without AC, Axiomatic Set Theory, Proceedings of Symposia in Pure Mathematics XIII, Part I (D. Scott, ed.), American Mathematical Society, Providence, RI, 1971, pp , MR 43, # Trees, Journal of Symbolic Logic 36 (1971), 1 14, MR 44, # The closed unbounded filter over P κ (λ), Notices Amer. Math. Society 18 (1971), Lectures in set theory with particular emphasis on the method of forcing, Lecture Notes in Mathematics vol. 217, Springer-Verlag, Berlin, 1971, MR 48, # (with W. Powell), Standard models of set theory with predication, Bulletin Amer. Math. Society 77 (1971), , MR 43, # Two remarks on elementary embeddings of the universe, Pacific J. Math. 39 (1971), , MR 46, # Some species of trees, Notices Amer. Math. Society 19 (1972), A A propos d algèbres de Boole rigides et minimales, C.R. Acad. Sc. Paris 274 (1972), , MR 44, # Automorphisms of ω 1 -trees, Transactions Amer. Math. Society 173 (1972), 57 70, MR 50, # Some combinatorial problems concerning uncountable cardinals, Annals Math. Logic 5 (1973), , MR 48, # The Axiom of Choice, Studies in Logic and the Foundations of Mathematics vol. 75, North-Holland Publ. Co., Amsterdam, 1973, MR 53, #139.

2 22. (with U. Felgner), Variants of the axiom of choice in set theory with atoms, Fundamenta Mathematicae 79 (1973), 79 85, MR 47, # Properties of the gimel function and a classification of singular cardinals, Fundamenta Mathematicae 81 (1973), 57 64, MR 52, # Teoria mnoжestv i metod forsinga, Russian translation of [14], Mir, Moscow, 1973, MR 49, # On a problem of Rubin and Rubin, Notices Amer. Math. Society 21 (1974), A A descending sequence of models of HOD sets, Notices Amer. Math. Society 21 (1974), A Simple complete Boolean algebras, Israel Journal of Mathematics 18 (1974), 1 10, MR 51, # Forcing with trees and ordinal definability, Annals Math. Logic 7 (1974), , MR 51, # (editor), Axiomatic Set Theory, Proc. Symp. of Pure Math. vol. XIII, Part II, Amer. Mathematical Society, Providence, RI, Almost disjoint families of stationary sets, Notices Amer. Math. Society 22 (1975), A (with L. Harrington), On Σ 1 well-orderings of the universe, Journal of Symbolic Logic 41 (1976), , MR 53, # An infinite game played with stationary sets, Notices Amer. Math. Society 23 (1976), A A note on countably generated complete Boolean algebras, Proceedings Amer. Math. Society 56 (1976), , MR 53, # (with K. Prikry), On ideals of sets and the power set operation, Bulletin Amer. Math. Society 82 (1976), , MR 58, # A Boolean algebraic game, Notices Amer. Math. Society 24 (1977), A Precipitous ideals, Logic Colloquium 76, (R. Gandy and M. Hyland, eds.), North-Holland Publ. Co., Amsterdam, 1977, pp , MR 58, # About the axiom of choice, Handbook of Mathematical Logic, (J. Barwise, ed.), North-Holland Publ. Co., Amsterdam, 1977, pp , MR 58, # (with K. Hrbacek), Introduction to Set Theory, M. Dekker, Inc., New York, 1978, MR 58, # (with F. Galvin and M. Magidor), An ideal game, Journal of Symbolic Logic 43 (1978), , MR 58, # Set Theory, Academic Press, New York, 1978, (Review: Bulletin Amer. Math. Society vol. 3 (1980), ) MR 80a: Set Theory, Chinese edition of [40], Beijing. 42. A game theoretic property of Boolean algebras, Logic Colloquium 77, (A. Macintyre et al., eds.), North-Holland Publ. Co., Amsterdam, 1978, pp , MR 80c: (with K. Prikry), Ideals over uncountable sets: Application of almost disjoint functions and generic ultrapowers, Memoirs Amer. Math. Society vol. 18, no. 214, American Mathematical Society, Providence, RI, 1979, MR 80f:03059.

3 44. (with K. Prikry), On projections of finitely additive measures, Proceedings Amer. Math. Society 74 (1979), , MR 80f: (with M. Magidor, W. Mitchell and K. Prikry), Precipitous ideals, Journal of Symbolic Logic 45 (1980), 1 8, MR 81h: On a problem of L. Nachbin, Proceedings Amer. Math. Society 79 (1980), , MR 81d: On the number of generators of an ideal, Notre Dame J. Formal Logic 22 (1981), , MR 83i: A maximal definable σ-ideal over ω 1, Israel Journal of Mathematics 39 (1981), , MR 84a: The brave new world of determinacy, Review of Descriptive Set Theory by Y. N. Moschovakis, Bulletin Amer. Math. Society 5 (1981), On hereditarily countable sets, Jour. Symbolic Logic 47 (1982), 43 47, MR 83e: A note on countable Boolean algebras, Algebra Universalis 14 (1982), , MR 83a: The ranking of incomplete tournaments: a mathematician s guide to popular sports, American Math. Monthly 90 (1983), , MR 85i: (with W. Mitchell), Some examples of precipitous ideals, Annals of Pure and Applied Logic 24 (1983), , MR 85k: Some properties of κ-complete ideals defined in terms of infinite games, Annals of Pure and Applied Logic 26 (1984), 31 45, MR 85h: More game-theoretic properties of Boolean algebras, Annals of Pure and Applied Logic 26 (1984), 11 29, MR 85j: (with Karel Prikry), Cofinality of the partial ordering of functions from ω 1 into ω under eventual domination, Math. Proc. Cambridge Phil. Soc. 95 (1984), 25 32, MR 85b: Stationary subsets of inaccessible cardinals, Axiomatic Set Theory, Contemporary Mathematics, vol. 31 (J. Baumgartner, ed.), American Mathematical Society, Providence, RI, 1984, pp , MR 86c: (with Karel Hrbacek), Introduction to Set Theory, 2nd edition, Marcel Dekker Inc., New York, 1984, MR 85m: Introduction to Set Theory, Chinese edition of [58], Beijing. 60. Abstract theory of abelian operator algebras: an application of forcing, Transactions Amer. Math. Society 289 (1985), , MR 87f: (with H. Woodin), Saturation of the closed unbounded filter on the set of regular cardinals, Transactions Amer. Math. Society 292 (1985), , MR 87d: A theorem on P κ (λ), J. Math. Soc. Japan 38 (1986), , MR 87f: (with Andreas Blass), On the Egoroff property of pointwise convergent sequences of functions, Proceedings Amer. Math. Society 98 (1986), , MR 87i: Multiple Forcing, Cambridge Tracts in Mathematics, Cambridge University Press, Cambridge, 1986, (Review: Bulletin Amer. Math. Society vol. 20 (1989), ) MR 89h:03001.

4 65. A hierarchy of filters on regular uncountable cardinals, Journal of Symbolic Logic 52 (1987), , MR 88e: First order theory of complete Stonean algebras (Boolean-valued real and complex numbers), Canad. Math. Bulletin 30 (1987), , MR 89h: A quantitative theory of preferences: some results on transition functions, Social Choice and Welfare 6 (1989), , MR 91e: Distributive laws, Chapter 8, Handbook of Boolean Algebra, (J. D. Monk, ed.), NorthHolland Publ. Co., Amsterdam, 1989, pp , MR 90k: Boolean-valued models, Chapter 27, Handbook of Boolean Algebra, (J. D. Monk, ed.), North-Holland Publ. Co., Amsterdam, 1989, pp , MR 90k: (with Qi Feng), Local clubs, reflection, and preserving stationary sets, Proceedings London Math. Society 58 (1989), , MR 90a: Positive Σ operations on ordinals and normal filters on greatly Mahlo cardinals, Journal of Symbolic Logic 54 (1989), , MR 90a: A remark on a principle of Brézis and Browder, Applied Math. Letters 2 (1989), (with S. Shelah), A note on canonical functions, Israel Journal of Mathematics 68 (1989), , MR 90m: Boolean-linear spaces, Advances in Mathematics 81 (1990), , MR 91d: (with S. Shelah), Full reflection of stationary sets below ℵ ω, Journal of Symbolic Logic 55 (1990), , MR 91i: Local topology and a spectral theorem, Operator Theory: Advances and Applications 48 (1990), , MR 93m: On the cofinality of countable products of cardinal numbers, A tribute to Paul Erdős, (A. Baker, B. Bollobás and A. Hajnal, eds.), Cambridge University Press, 1990, pp , MR 92m: (with Marcia Groszek), Generalized iteration of forcing, Transactions Amer. Math. Society 324 (1991), 1 26, MR 91f: The infinite, Jahrbuch 1990 der Kurt-Gödel-Gesellschaft, Wien, 1991, pp , MR 93h: (with S. Shelah), On a conjecture of Tarski on products of cardinals, Proceedings Amer. Math. Society 112 (1991), , MR 91j: (with S. Shelah), A partition theorem for pairs of finite sets, Journal Amer. Math. Society 4 (1991), , MR 93a: The logarithmic distribution of leading digits and finitely additive measures, Discrete Mathematics 108 (1992), 53 57, MR 93i: Singular cardinal problem: Shelah s theorem on 2 ℵ ω, Bulletin of the London Math. Society 24 (1992), , MR 93a: (with S. Shelah), Full reflection of stationary sets at regular cardinals, American Journal of Mathematics 115 (1993), , MR 94m: A variation on a theorem of Galvin and Hajnal, Bulletin of the London Math. Society 25 (1993), , MR 94h:03089.

5 86. On Gödel s Second Incompleteness Theorem, Proceedings Amer. Math. Society 121 (1994), , MR 94g: (with J. Witzany), Full reflection at a measurable cardinal, J. Symbolic Logic 59 (1994), , MR 96c: OTTER experiments in a system of combinatory logic, J. Automated Reasoning 14 (1995), , MR 96c: Singular cardinals and the pcf theory, Bulletin of Symbolic Logic 1 (1995), , MR 97d: (with S. Shelah), Possible pcf algebras, J. Symbolic Logic 61 (1996), , MR 97g: (with S. Shelah), A complete Boolean algebra that has no proper atomless complete subalgebra, Journal of Algebra 182 (1996), , MR 97j: (with S. Shelah), On countably closed complete Boolean algebras, Journal of Symbolic Logic 61 (1996), , MR 98h: (with R. Dougherty), Left-distributive embedding algebras, Electronic Research Announcements of the American Math. Society 3 (1997), 28-37, MR 98b: Large ordinals, Advances in Mathematics 125 (1997), , MR 98g: (with R. Dougherty), Finite left-distributive algebras and embedding algebras, Advances in Mathematics 130 (1997), , MR 99f: (with B. Balcar and J. Zapletal), Semi-Cohen Boolean algebras, Annals of Pure and Applied Logic 87 (1997), , MR 99a: Set Theory, 2nd edition, Springer-Verlag, Heidelberg, 1997, MR 99b: (with B. Balcar and W. Glowczynski), The sequential topology on complete Boolean algebras, Fundamenta Mathematicae 155 (1998), 59 78, MR 99b: (with Q. Feng), Projective stationary sets and a strong reflection principle, Journal of the London Math. Society 58 (1998), , MR 2000b: (with Karel Hrbacek), Introduction to Set Theory, 3rd edition, Marcel Dekker Inc., New York, 1999, MR 01c: Some results on combinators in the system TRC, Journal of Symbolic Logic 64 (1999), , MR 03a: The infinite, translation of [79] into Korean, Historia Math 12 (1999), (with S. Shelah), On reflection of stationary sets in P κ λ, Transactions of the American Math. Society 352 (2000), , MR 00j: (with S. Shelah), Simple complete Boolean algebras, Proceedings of the American Math. Society 129 (2001), , MR 01e: Set Theory, URL= The Stanford Encyclopedia of Philosophy, (Summer 2002 Edition, E. Zalta, ed.) Set Theory, The Third Millennium Edition, Springer-VerLag, Heidelberg, 2002, MR 2004g: (with B. Balcar and T. Pazák), Complete ccc Boolean algebras, the order sequential topology, and a problem of von Neumann, Bulletin of the London Math. Society 37 (2005), El infinito, translation of [79] into Spanish, La Gaceta de la RSME 8 (2005),

6 109. (with B. Balcar), Weak distributivity, a problem of von Neumann and the mystery of measurability, Bulletin Symb. Logic 12 (2006), Set Theory, Chinese edition of [106], Beijing, (with Q. Feng and J. Zapletal), On the structure of stationary sets, Science in China, Ser. A 50 (2007), The Axiom of Choice, Reprint of [21], Dover Publications, New York, (with B. Balcar), Contributions to the theory of weakly distributive complete Boolean algebras, Andrzej Mostowski and Foundational Studies, (A. Ehrenfeucht, V. W. Marek and M. Srebrny, eds.), IOS Press, Amsterdam, 2008, pp Algebraic characterizations of measure algebras, Proceedings of the American Mathematical Society 136 (2008), WHAT IS... Forcing?, Notices of the American Mathematical Society 55 (2008), Stationary sets, Handbook of Set Theory, (M. Foreman, A. Kanamori and M. Magidor, eds.), Springer, 2010, pp Translation of [100] into Farsi Measures on Boolean algebras, Fundamenta Math. 239 (2017), Convergence and submeasures in Boolean algebras, to appear.

A Course in Model Theory

A Course in Model Theory A Course in Model Theory Author address: Rami Grossberg 1 DEPARTMENT OF MATHEMATICAL SCIENCES, CARNEGIE MELLON UNI- VERSITY, PITTSBURGH, PA 15213 E-mail address: rami@cmu.edu 1 This preliminary draft is

More information

A Course in Model Theory I:

A Course in Model Theory I: A Course in Model Theory I: Introduction 1 Rami Grossberg DEPARTMENT OFMATHEMATICAL SCIENCES, CARNEGIE MELLON UNI- VERSITY, PITTSBURGH, PA15213 1 This preliminary draft is dated from August 15, 2017. The

More information

A Course in Model Theory

A Course in Model Theory A Course in Model Theory Author address: Rami Grossberg 1 DEPARTMENT OF MATHEMATICAL SCIENCES, CARNEGIE MELLON UNI- VERSITY, PITTSBURGH, PA 15213 E-mail address: rami@cmu.edu 1 This preliminary draft is

More information

November 20, 2005 PERFECT COMPACTA AND BASIS PROBLEMS IN TOPOLOGY

November 20, 2005 PERFECT COMPACTA AND BASIS PROBLEMS IN TOPOLOGY November 20, 2005 PERFECT COMPACTA AND BASIS PROBLEMS IN TOPOLOGY GARY GRUENHAGE AND JUSTIN TATCH MOORE An interesting example of a compact Hausdorff space that is often presented in beginning courses

More information

CLASSIFICATION OF RESEARCH. July 21, I would like to explain the major themes of my research program, which has pursed several lines of inquiry.

CLASSIFICATION OF RESEARCH. July 21, I would like to explain the major themes of my research program, which has pursed several lines of inquiry. CLASSIFICATION OF RESEARCH JOEL DAVID HAMKINS Abstract. This is a summary account by topic of the research publications of J. D. Hamkins. July 21, 2014 I would like to explain the major themes of my research

More information

Topology and its Applications

Topology and its Applications Topology and its Applications 157 (2010) 1541 1547 Contents lists available at ScienceDirect Topology and its Applications www.elsevier.com/locate/topol On a core concept of Arhangel skiĭ Franklin D. Tall

More information

Bibliography. S. Gill Williamson

Bibliography. S. Gill Williamson Bibliography S. Gill Williamson 1. S. G. Williamson, A Combinatorial Property of Finite Sequences with Applications to Tensor Algebra, J. Combinatorial Theory, 1 (1966), pp. 401-410. 2. S. G. Williamson,

More information

On the isomorphism problem of Coxeter groups and related topics

On the isomorphism problem of Coxeter groups and related topics On the isomorphism problem of Coxeter groups and related topics Koji Nuida 1 Graduate School of Mathematical Sciences, University of Tokyo E-mail: nuida@ms.u-tokyo.ac.jp At the conference the author gives

More information

Classes of permutations avoiding 231 or 321

Classes of permutations avoiding 231 or 321 Classes of permutations avoiding 231 or 321 Nik Ruškuc nik.ruskuc@st-andrews.ac.uk School of Mathematics and Statistics, University of St Andrews Dresden, 25 November 2015 Aim Introduce the area of pattern

More information

Finite homomorphism-homogeneous permutations via edge colourings of chains

Finite homomorphism-homogeneous permutations via edge colourings of chains Finite homomorphism-homogeneous permutations via edge colourings of chains Igor Dolinka dockie@dmi.uns.ac.rs Department of Mathematics and Informatics, University of Novi Sad First of all there is Blue.

More information

1 의 7 페이지 SCIENCE CITATION INDEX - MATHEMATICS, APPLIED - JOURNAL LIST Total journals: 79 1. ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE Quarterly ISSN: 0098-3500 ASSOC COMPUTING MACHINERY, 2 PENN PLAZA,

More information

Publications of Lixin Mao

Publications of Lixin Mao Publications of Lixin Mao 1. Lixin Mao, On homological dimensions in some functor categories. Mathematical Notes 2017, to appear. 2. Lixin Mao, Another Gorenstein analogue of flat modules. Communications

More information

INFLUENCE OF ENTRIES IN CRITICAL SETS OF ROOM SQUARES

INFLUENCE OF ENTRIES IN CRITICAL SETS OF ROOM SQUARES INFLUENCE OF ENTRIES IN CRITICAL SETS OF ROOM SQUARES Ghulam Chaudhry and Jennifer Seberry School of IT and Computer Science, The University of Wollongong, Wollongong, NSW 2522, AUSTRALIA We establish

More information

On the isomorphism problem for Coxeter groups and related topics

On the isomorphism problem for Coxeter groups and related topics On the isomorphism problem for Coxeter groups and related topics Koji Nuida (AIST, Japan) Groups and Geometries @Bangalore, Dec. 18 & 20, 2012 Koji Nuida (AIST, Japan) On the isomorphism problem for Coxeter

More information

Examples of highly transitive permutation groups

Examples of highly transitive permutation groups Sonderdrucke aus der Albert-Ludwigs-Universität Freiburg OTTO H. KEGEL Examples of highly transitive permutation groups Originalbeitrag erschienen in: Rendiconti del Seminario Matematico della Università

More information

On first and second countable spaces and the axiom of choice

On first and second countable spaces and the axiom of choice Topology and its Applications 143 (2004) 93 103 www.elsevier.com/locate/topol On first and second countable spaces and the axiom of choice Gonçalo Gutierres 1 Departamento de Matemática da Universidade

More information

Primitive permutation groups with finite stabilizers

Primitive permutation groups with finite stabilizers Primitive permutation groups with finite stabilizers Simon M. Smith City Tech, CUNY and The University of Western Australia Groups St Andrews 2013, St Andrews Primitive permutation groups A transitive

More information

Homogeneous permutations

Homogeneous permutations Homogeneous permutations Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road, London E1 4NS, U.K. p.j.cameron@qmul.ac.uk Submitted: May 10, 2002; Accepted: 18

More information

PD-SETS FOR CODES RELATED TO FLAG-TRANSITIVE SYMMETRIC DESIGNS. Communicated by Behruz Tayfeh Rezaie. 1. Introduction

PD-SETS FOR CODES RELATED TO FLAG-TRANSITIVE SYMMETRIC DESIGNS. Communicated by Behruz Tayfeh Rezaie. 1. Introduction Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 7 No. 1 (2018), pp. 37-50. c 2018 University of Isfahan www.combinatorics.ir www.ui.ac.ir PD-SETS FOR CODES RELATED

More information

Daniel T. Soukup. Curriculum Vitae. Employment. Education. Academic awards. Teaching awards

Daniel T. Soukup. Curriculum Vitae. Employment. Education. Academic awards. Teaching awards Daniel T. Soukup Curriculum Vitae KGRC, University of Vienna Währinger Strasse 25, Wien 1090 +43 665 65115723 daniel.soukup@univie.ac.at www.logic.univie.ac.at/ soukupd73/ Employment 2016 2019 Postdoctoral

More information

Say My Name. An Objection to Ante Rem Structuralism. Tim Räz. July 29, 2014

Say My Name. An Objection to Ante Rem Structuralism. Tim Räz. July 29, 2014 Say My Name. An Objection to Ante Rem Structuralism Tim Räz July 29, 2014 Abstract In this paper I raise an objection to ante rem structuralism, proposed by Stewart Shapiro: I show that it is in conflict

More information

BIBLIOGRAPHY. [1] N.Argac and N.J.Groenewald, Weakly and strongly regular near-rings, Algebra Colloquim 12 (1) (2005),

BIBLIOGRAPHY. [1] N.Argac and N.J.Groenewald, Weakly and strongly regular near-rings, Algebra Colloquim 12 (1) (2005), [1] N.Argac and N.J.Groenewald, Weakly and strongly regular near-rings, Algebra Colloquim 12 (1) (2005), 121-130. [2] W.F.Barnes, On the Γ- rings of Nobusawa, Pacific J. Math. 18 (1996), 411-422. [3] G.F.Birkenmeier,

More information

Göttlers Proof of the Collatz Conjecture

Göttlers Proof of the Collatz Conjecture Göttlers Proof of the Collatz Conjecture Henry Göttler, Chantal Göttler, Heinrich Göttler, Thorsten Göttler, Pei-jung Wu goettlercollatzproof@gmail.com March 8, 2018 Abstract Over 80 years ago, the German

More information

appointment professor of logic and philosophy of science, university of california, irvine, 2017-

appointment professor of logic and philosophy of science, university of california, irvine, 2017- jb manchak logic and philosophy of science university of california, irvine education ph.d. philosophy, university of california, irvine, 2009 b.s. physics, brigham young university, 2004 b.a. philosophy,

More information

How to Gamble Against All Odds

How to Gamble Against All Odds How to Gamble Against All Odds Gilad Bavly 1 Ron Peretz 2 1 Bar-Ilan University 2 London School of Economics Heidelberg, June 2015 How to Gamble Against All Odds 1 Preface starting with an algorithmic

More information

UNIVERSALITY IN SUBSTITUTION-CLOSED PERMUTATION CLASSES. with Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Mickaël Maazoun

UNIVERSALITY IN SUBSTITUTION-CLOSED PERMUTATION CLASSES. with Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Mickaël Maazoun UNIVERSALITY IN SUBSTITUTION-CLOSED PERMUTATION CLASSES ADELINE PIERROT with Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Mickaël Maazoun The aim of this work is to study the asymptotic

More information

Evacuation and a Geometric Construction for Fibonacci Tableaux

Evacuation and a Geometric Construction for Fibonacci Tableaux Evacuation and a Geometric Construction for Fibonacci Tableaux Kendra Killpatrick Pepperdine University 24255 Pacific Coast Highway Malibu, CA 90263-4321 Kendra.Killpatrick@pepperdine.edu August 25, 2004

More information

Awareness and Understanding in Computer Programs A Review of Shadows of the Mind by Roger Penrose

Awareness and Understanding in Computer Programs A Review of Shadows of the Mind by Roger Penrose Awareness and Understanding in Computer Programs A Review of Shadows of the Mind by Roger Penrose John McCarthy Computer Science Department Stanford University Stanford, CA 94305. jmc@sail.stanford.edu

More information

Finite and Infinite Sets

Finite and Infinite Sets Finite and Infinite Sets MATH 464/506, Real Analysis J. Robert Buchanan Department of Mathematics Summer 2007 Basic Definitions Definition The empty set has 0 elements. If n N, a set S is said to have

More information

ON COMMUTATION PROPERTIES OF THE COMPOSITION RELATION OF CONVERGENT AND DIVERGENT PERMUTATIONS (PART I)

ON COMMUTATION PROPERTIES OF THE COMPOSITION RELATION OF CONVERGENT AND DIVERGENT PERMUTATIONS (PART I) t m Mathematical Publications DOI: 10.2478/tmmp-2014-0002 Tatra Mt. Math. Publ. 58 (2014), 13 22 ON COMMUTATION PROPERTIES OF THE COMPOSITION RELATION OF CONVERGENT AND DIVERGENT PERMUTATIONS (PART I)

More information

Reflection group counting and q-counting

Reflection group counting and q-counting Reflection group counting and q-counting Vic Reiner Univ. of Minnesota reiner@math.umn.edu Summer School on Algebraic and Enumerative Combinatorics S. Miguel de Seide, Portugal July 2-13, 2012 Outline

More information

An improvement to the Gilbert-Varshamov bound for permutation codes

An improvement to the Gilbert-Varshamov bound for permutation codes An improvement to the Gilbert-Varshamov bound for permutation codes Yiting Yang Department of Mathematics Tongji University Joint work with Fei Gao and Gennian Ge May 11, 2013 Outline Outline 1 Introduction

More information

RESTRICTED PERMUTATIONS AND POLYGONS. Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, Haifa, Israel

RESTRICTED PERMUTATIONS AND POLYGONS. Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, Haifa, Israel RESTRICTED PERMUTATIONS AND POLYGONS Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, 905 Haifa, Israel {gferro,toufik}@mathhaifaacil abstract Several authors have examined

More information

Eric Duchêne (Univ. Claude Bernard Lyon 1) Michel Rigo (University of Liège)

Eric Duchêne (Univ. Claude Bernard Lyon 1) Michel Rigo (University of Liège) INVARIANT GAMES Eric Duchêne (Univ. Claude Bernard Lyon 1) Michel Rigo (University of Liège) http://www.discmath.ulg.ac.be/ Words 2009, Univ. of Salerno, 14th September 2009 COMBINATORIAL GAME THEORY FOR

More information

From a Ball Game to Incompleteness

From a Ball Game to Incompleteness From a Ball Game to Incompleteness Arindama Singh We present a ball game that can be continued as long as we wish. It looks as though the game would never end. But by applying a result on trees, we show

More information

QUOTIENT AND PSEUDO-OPEN IMAGES OF SEPARABLE METRIC SPACES

QUOTIENT AND PSEUDO-OPEN IMAGES OF SEPARABLE METRIC SPACES proceedings of the american mathematical society Volume 33, Number 2, June 1972 QUOTIENT AND PSEUDO-OPEN IMAGES OF SEPARABLE METRIC SPACES PAUL L. STRONG Abstract. Ernest A. Michael has given a characterization

More information

A Fractal which violates the Axiom of Determinacy

A Fractal which violates the Axiom of Determinacy BRICS RS-94-4 S. Riis: A Fractal which violates the Axiom of Determinacy BRICS Basic Research in Computer Science A Fractal which violates the Axiom of Determinacy Søren Riis BRICS Report Series RS-94-4

More information

18 Completeness and Compactness of First-Order Tableaux

18 Completeness and Compactness of First-Order Tableaux CS 486: Applied Logic Lecture 18, March 27, 2003 18 Completeness and Compactness of First-Order Tableaux 18.1 Completeness Proving the completeness of a first-order calculus gives us Gödel s famous completeness

More information

DVA325 Formal Languages, Automata and Models of Computation (FABER)

DVA325 Formal Languages, Automata and Models of Computation (FABER) DVA325 Formal Languages, Automata and Models of Computation (FABER) Lecture 1 - Introduction School of Innovation, Design and Engineering Mälardalen University 11 November 2014 Abu Naser Masud FABER November

More information

Michael O. Rabin. Thomas J. Watson Sr. Professor of Computer Science Harvard University

Michael O. Rabin. Thomas J. Watson Sr. Professor of Computer Science Harvard University Michael O. Rabin Thomas J. Watson Sr. Professor of Computer Science Harvard University 1953 M.Sc., Mathematics, Hebrew University 1957 Ph.D., Mathematics, Princeton University 1956-58 H. B. Fine Instructor,

More information

77IEE I UNCLASSIFIED W A ROSENKRANTZ 11 JUN 95 RFOSR-TR F/G 17/2 ML

77IEE I UNCLASSIFIED W A ROSENKRANTZ 11 JUN 95 RFOSR-TR F/G 17/2 ML RD-R159 462 NATHENSTICAL PROBLEMS IN STABILITY CONTROL AND 1/1 RELIABILITY OF RANDOM ACCE.. (U) MASSACHUSETTS UNIV AMHERST DEPT OF MATHEMATICS AND STATISTICS.. I UNCLASSIFIED W A ROSENKRANTZ 11 JUN 95

More information

Robert D. MacPherson BIBLIOGRAPHY

Robert D. MacPherson BIBLIOGRAPHY Robert D. MacPherson BIBLIOGRAPHY [1] Fourier Analysis of Uniform Random Number Generators, with R. R. Coveyou, J. Assoc. Comp. Mach. 14 (1967), 100 119. [2] Singularities of Vector Bundle Maps, Proceedings

More information

A. Mostowski Centenary Warsaw, October Andrzej Mostowski November 1, August 22, 1975

A. Mostowski Centenary Warsaw, October Andrzej Mostowski November 1, August 22, 1975 Andrzej Mostowski November 1, 1913 - August 22, 1975 1 2 The Legacy of Andrzej Mostowski Johann A. Makowsky Faculty of Computer Science, Technion - Israel Institute of Technology, Haifa, Israel janos@cs.technion.ac.il

More information

Biembeddings of Latin squares and Hamiltonian decompositions

Biembeddings of Latin squares and Hamiltonian decompositions Biembeddings of Latin squares and Hamiltonian decompositions M. J. Grannell, T. S. Griggs Department of Pure Mathematics The Open University Walton Hall Milton Keynes MK7 6AA UNITED KINGDOM M. Knor Department

More information

Programming Methodology

Programming Methodology Texts and Monographs in Computer Science Editor David Gries Advisory Board F. L. Bauer K. S. Fu J. J. Horning R. Reddy D. C. Tsichritzis W. M. Waite Programming Methodology A Collection of Articles by

More information

LIST OF PUBLICATIONS. Benedict H. Gross

LIST OF PUBLICATIONS. Benedict H. Gross LIST OF PUBLICATIONS Benedict H. Gross 1. Intersection Triangles of Steiner Systems, Math. Z. 139 (1974), 87-104. 2. Arithmetic on Elliptic Curves with Complex Multiplication, Thesis, Harvard University,

More information

CURRICULUM VITAE Dana P. Williams

CURRICULUM VITAE Dana P. Williams CURRICULUM VITAE Dana P. Williams Professional Preparation Cornell University Mathematics A.B. 1974 University of California at Berkeley Mathematics M.A. 1977 University of California at Berkeley Mathematics

More information

THREE LECTURES ON SQUARE-TILED SURFACES (PRELIMINARY VERSION) Contents

THREE LECTURES ON SQUARE-TILED SURFACES (PRELIMINARY VERSION) Contents THREE LECTURES ON SQUARE-TILED SURFACES (PRELIMINARY VERSION) CARLOS MATHEUS Abstract. This text corresponds to a minicourse delivered on June 11, 12 & 13, 2018 during the summer school Teichmüller dynamics,

More information

Cardinality of Accumulation Points of Infinite Sets

Cardinality of Accumulation Points of Infinite Sets International Mathematical Forum, Vol. 11, 2016, no. 11, 539-546 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2016.6224 Cardinality of Accumulation Points of Infinite Sets A. Kalapodi CTI

More information

On the Power of Interactive Computing

On the Power of Interactive Computing On the Power of Interactive Computing Jan van Leeuwen 1 and Jiří Wiedermann 2 1 Department of Computer Science, Utrecht University, Padualaan 14, 3584 CH Utrecht, the Netherlands. 2 Institute of Computer

More information

The Relationship between Permutation Groups and Permutation Polytopes

The Relationship between Permutation Groups and Permutation Polytopes The Relationship between Permutation Groups and Permutation Polytopes Shatha A. Salman University of Technology Applied Sciences department Baghdad-Iraq Batool A. Hameed University of Technology Applied

More information

November 28, Western Washington University. Ramanujan s Congruences. Bryan Clark, Lesley Lowery, Nhan Nguyen. Introduction. History.

November 28, Western Washington University. Ramanujan s Congruences. Bryan Clark, Lesley Lowery, Nhan Nguyen. Introduction. History. Western Washington University November 28, 2012 Srinivasa Ramanujan Srinivasa Ramanujan (22 December 1887-26 April 1920) Srinivasa Ramanujan Considered to have no formal training in pure mathematics Srinivasa

More information

Zhanjiang , People s Republic of China

Zhanjiang , People s Republic of China Math. Comp. 78(2009), no. 267, 1853 1866. COVERS OF THE INTEGERS WITH ODD MODULI AND THEIR APPLICATIONS TO THE FORMS x m 2 n AND x 2 F 3n /2 Ke-Jian Wu 1 and Zhi-Wei Sun 2, 1 Department of Mathematics,

More information

Pattern Avoidance in Unimodal and V-unimodal Permutations

Pattern Avoidance in Unimodal and V-unimodal Permutations Pattern Avoidance in Unimodal and V-unimodal Permutations Dido Salazar-Torres May 16, 2009 Abstract A characterization of unimodal, [321]-avoiding permutations and an enumeration shall be given.there is

More information

Perfect Octagon Quadrangle Systems with an upper C 4 -system and a large spectrum

Perfect Octagon Quadrangle Systems with an upper C 4 -system and a large spectrum Computer Science Journal of Moldova, vol.18, no.3(54), 2010 Perfect Octagon Quadrangle Systems with an upper C 4 -system and a large spectrum Luigia Berardi, Mario Gionfriddo, Rosaria Rota To the memory

More information

Enumeration of Two Particular Sets of Minimal Permutations

Enumeration of Two Particular Sets of Minimal Permutations 3 47 6 3 Journal of Integer Sequences, Vol. 8 (05), Article 5.0. Enumeration of Two Particular Sets of Minimal Permutations Stefano Bilotta, Elisabetta Grazzini, and Elisa Pergola Dipartimento di Matematica

More information

MATHEMATICS 152, FALL 2004 METHODS OF DISCRETE MATHEMATICS Outline #10 (Sets and Probability)

MATHEMATICS 152, FALL 2004 METHODS OF DISCRETE MATHEMATICS Outline #10 (Sets and Probability) MATHEMATICS 152, FALL 2004 METHODS OF DISCRETE MATHEMATICS Outline #10 (Sets and Probability) Last modified: November 10, 2004 This follows very closely Apostol, Chapter 13, the course pack. Attachments

More information

The E-series, Happel-Seidel symmetry, and Orlov s theorem

The E-series, Happel-Seidel symmetry, and Orlov s theorem The E-series, Happel-Seidel symmetry, and Orlov s theorem Helmut Lenzing Paderborn ICRA 2012, Bielefeld, August 15, 2012 H. Lenzing () E-series, HS symmetry, Orlov s theorem ICRA 2012 1 / 1 Happy Birthday!

More information

Graduate Texts in Mathematics. Editorial Board. F. W. Gehring P. R. Halmos Managing Editor. c. C. Moore

Graduate Texts in Mathematics. Editorial Board. F. W. Gehring P. R. Halmos Managing Editor. c. C. Moore Graduate Texts in Mathematics 49 Editorial Board F. W. Gehring P. R. Halmos Managing Editor c. C. Moore K. W. Gruenberg A.J. Weir Linear Geometry 2nd Edition Springer Science+Business Media, LLC K. W.

More information

A MOVING-KNIFE SOLUTION TO THE FOUR-PERSON ENVY-FREE CAKE-DIVISION PROBLEM

A MOVING-KNIFE SOLUTION TO THE FOUR-PERSON ENVY-FREE CAKE-DIVISION PROBLEM PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 2, February 1997, Pages 547 554 S 0002-9939(97)03614-9 A MOVING-KNIFE SOLUTION TO THE FOUR-PERSON ENVY-FREE CAKE-DIVISION PROBLEM STEVEN

More information

BAND SURGERY ON KNOTS AND LINKS, III

BAND SURGERY ON KNOTS AND LINKS, III BAND SURGERY ON KNOTS AND LINKS, III TAIZO KANENOBU Abstract. We give two criteria of links concerning a band surgery: The first one is a condition on the determinants of links which are related by a band

More information

Chapter 1. The alternating groups. 1.1 Introduction. 1.2 Permutations

Chapter 1. The alternating groups. 1.1 Introduction. 1.2 Permutations Chapter 1 The alternating groups 1.1 Introduction The most familiar of the finite (non-abelian) simple groups are the alternating groups A n, which are subgroups of index 2 in the symmetric groups S n.

More information

On uniquely k-determined permutations

On uniquely k-determined permutations On uniquely k-determined permutations Sergey Avgustinovich and Sergey Kitaev 16th March 2007 Abstract Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce

More information

On game semantics of the affine and intuitionistic logics (Extended abstract)

On game semantics of the affine and intuitionistic logics (Extended abstract) On game semantics of the affine and intuitionistic logics (Extended abstract) Ilya Mezhirov 1 and Nikolay Vereshchagin 2 1 The German Research Center for Artificial Intelligence, TU Kaiserslautern, ilya.mezhirov@dfki.uni-kl.de

More information

The Perfect Binary One-Error-Correcting Codes of Length 15: Part I Classification

The Perfect Binary One-Error-Correcting Codes of Length 15: Part I Classification 1 The Perfect Binary One-Error-Correcting Codes of Length 15: Part I Classification Patric R. J. Östergård, Olli Pottonen Abstract arxiv:0806.2513v3 [cs.it] 30 Dec 2009 A complete classification of the

More information

The covering congruences of Paul Erdős. Carl Pomerance Dartmouth College

The covering congruences of Paul Erdős. Carl Pomerance Dartmouth College The covering congruences of Paul Erdős Carl Pomerance Dartmouth College Conjecture (Erdős, 1950): For each number B, one can cover Z with finitely many congruences to distinct moduli all > B. Erdős (1995):

More information

Sensor Robot Planning in Incomplete Environment

Sensor Robot Planning in Incomplete Environment Journal of Software Engineering and Applications, 2011, 4, 156-160 doi:10.4236/jsea.2011.43017 Published Online March 2011 (http://www.scirp.org/journal/jsea) Shan Zhong 1, Zhihua Yin 2, Xudong Yin 1,

More information

Arto Salomaa. A Pioneer of Science. Turku. from. Arto Salomaa, A Pioneer of Science 1 / 52

Arto Salomaa. A Pioneer of Science. Turku. from. Arto Salomaa, A Pioneer of Science 1 / 52 Arto Salomaa A Pioneer of Science from Turku Arto Salomaa, A Pioneer of Science 1 / 52 Arto Arto Salomaa, A Pioneer of Science 2 / 52 Turku Cathedral Arto Salomaa, A Pioneer of Science 3 / 52 Arto & Turku

More information

Dynamic Programming in Real Life: A Two-Person Dice Game

Dynamic Programming in Real Life: A Two-Person Dice Game Mathematical Methods in Operations Research 2005 Special issue in honor of Arie Hordijk Dynamic Programming in Real Life: A Two-Person Dice Game Henk Tijms 1, Jan van der Wal 2 1 Department of Econometrics,

More information

Statistical Signal Processing

Statistical Signal Processing Statistical Signal Processing Debasis Kundu 1 Signal processing may broadly be considered to involve the recovery of information from physical observations. The received signals is usually disturbed by

More information

Reflections on the N + k Queens Problem

Reflections on the N + k Queens Problem Integre Technical Publishing Co., Inc. College Mathematics Journal 40:3 March 12, 2009 2:02 p.m. chatham.tex page 204 Reflections on the N + k Queens Problem R. Douglas Chatham R. Douglas Chatham (d.chatham@moreheadstate.edu)

More information

An Analytical Study in Connectivity of Neighborhoods for Single Round Robin Tournaments

An Analytical Study in Connectivity of Neighborhoods for Single Round Robin Tournaments http://dx.doi.org/10.187/ics.01.001 Creative Commons License Computing Society 1th INFORMS Computing Society Conference Richmond, Virginia, January 11 1, 01 pp. 188 199 This work is licensed under a Creative

More information

Project Report - The Locker Puzzle

Project Report - The Locker Puzzle Project Report - The Locker Puzzle Yan Wang Adviser: Josephine Yu November 14th, 2015 We consider the following game [7]: Problem 0.1. (The Locker Puzzle, or The 100 Prisoners Problem) We have b boxes

More information

RIGIDITY OF COXETER GROUPS AND ARTIN GROUPS

RIGIDITY OF COXETER GROUPS AND ARTIN GROUPS RIGIDITY OF COXETER GROUPS AND ARTIN GROUPS NOEL BRADY 1, JONATHAN P. MCCAMMOND 2, BERNHARD MÜHLHERR, AND WALTER D. NEUMANN 3 Abstract. A Coxeter group is rigid if it cannot be defined by two nonisomorphic

More information

How Much Memory is Needed to Win in Partial-Observation Games

How Much Memory is Needed to Win in Partial-Observation Games How Much Memory is Needed to Win in Partial-Observation Games Laurent Doyen LSV, ENS Cachan & CNRS & Krishnendu Chatterjee IST Austria GAMES 11 How Much Memory is Needed to Win in Partial-Observation Games

More information

A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP

A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A31 A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP Shinji Tanimoto Department of Mathematics, Kochi Joshi University

More information

Perfect Domination for Bishops, Kings and Rooks Graphs On Square Chessboard

Perfect Domination for Bishops, Kings and Rooks Graphs On Square Chessboard Annals of Pure and Applied Mathematics Vol. 1x, No. x, 201x, xx-xx ISSN: 2279-087X (P), 2279-0888(online) Published on 6 August 2018 www.researchmathsci.org DOI: http://dx.doi.org/10.22457/apam.v18n1a8

More information

Bibliography Alien Newell

Bibliography Alien Newell Bibliography Alien Newell Ernst, G. W. & Newell, A. (1967a) GPS and generality. Pittsburgh: Carnegie Institute of Technology Ernst, G. W. & Newell, A. (1967b) Some issues of representation in a general

More information

CSE 20 DISCRETE MATH. Fall

CSE 20 DISCRETE MATH. Fall CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Define and compute the cardinality of a set. Use functions to compare the sizes of sets. Classify sets

More information

Minimal generating sets of Weierstrass semigroups of certain m-tuples on the norm-trace function field

Minimal generating sets of Weierstrass semigroups of certain m-tuples on the norm-trace function field Minimal generating sets of Weierstrass semigroups of certain m-tuples on the norm-trace function field Gretchen L. Matthews and Justin D. Peachey Abstract. The norm-trace function field is a generalization

More information

Teacher s Notes. Problem of the Month: Courtney s Collection

Teacher s Notes. Problem of the Month: Courtney s Collection Teacher s Notes Problem of the Month: Courtney s Collection Overview: In the Problem of the Month, Courtney s Collection, students use number theory, number operations, organized lists and counting methods

More information

Uniqueness of Steiner Laws on Cubic Curves

Uniqueness of Steiner Laws on Cubic Curves Uniqueness of Steiner Laws on Cubic Curves R. Padmanabhan Department of Mathematics University of Manitoba Winnipeg, Manitoba R3T 2N2 Canada E-mail: padman@cc.umanitoba.ca W. McCune Mathematics and Computer

More information

Say My Name: An Objection to Ante Rem Structuralism

Say My Name: An Objection to Ante Rem Structuralism Erschienen in: Philosophia Mathematica ; 23 (2015), 1. - S. 116-125 https://dx.doi.org/10.1093/philmat/nku034 Say My Name: An Objection to Ante Rem Structuralism Tim Räz FB Philosophie, Universität Konstanz,

More information

Lecture Notes in Computer Science 2500 Edited by G. Goos, J. Hartmanis, and J. van Leeuwen

Lecture Notes in Computer Science 2500 Edited by G. Goos, J. Hartmanis, and J. van Leeuwen Lecture Notes in Computer Science 2500 Edited by G. Goos, J. Hartmanis, and J. van Leeuwen 3 Berlin Heidelberg New York Barcelona Hong Kong London Milan Paris Tokyo Erich Grädel Wolfgang Thomas Thomas

More information

Analysis on the Properties of a Permutation Group

Analysis on the Properties of a Permutation Group International Journal of Theoretical and Applied Mathematics 2017; 3(1): 19-24 http://www.sciencepublishinggroup.com/j/ijtam doi: 10.11648/j.ijtam.20170301.13 Analysis on the Properties of a Permutation

More information

Modeling Billiards Games

Modeling Billiards Games Modeling Billiards Games Christopher Archibald and Yoav hoham tanford University {cja, shoham}@stanford.edu ABTRACT Two-player games of billiards, of the sort seen in recent Computer Olympiads held by

More information

EXPLAINING THE SHAPE OF RSK

EXPLAINING THE SHAPE OF RSK EXPLAINING THE SHAPE OF RSK SIMON RUBINSTEIN-SALZEDO 1. Introduction There is an algorithm, due to Robinson, Schensted, and Knuth (henceforth RSK), that gives a bijection between permutations σ S n and

More information

Lecture 2.3: Symmetric and alternating groups

Lecture 2.3: Symmetric and alternating groups Lecture 2.3: Symmetric and alternating groups Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson)

More information

18.204: CHIP FIRING GAMES

18.204: CHIP FIRING GAMES 18.204: CHIP FIRING GAMES ANNE KELLEY Abstract. Chip firing is a one-player game where piles start with an initial number of chips and any pile with at least two chips can send one chip to the piles on

More information

Cyclic, f-cyclic, and Bicyclic Decompositions of the Complete Graph into the 4-Cycle with a Pendant Edge.

Cyclic, f-cyclic, and Bicyclic Decompositions of the Complete Graph into the 4-Cycle with a Pendant Edge. East Tennessee State University Digital Commons @ East Tennessee State University Electronic Theses and Dissertations 5-2009 Cyclic, f-cyclic, and Bicyclic Decompositions of the Complete Graph into the

More information

Title? Alan Turing and the Theoretical Foundation of the Information Age

Title? Alan Turing and the Theoretical Foundation of the Information Age BOOK REVIEW Title? Alan Turing and the Theoretical Foundation of the Information Age Chris Bernhardt, Turing s Vision: the Birth of Computer Science. Cambridge, MA: MIT Press 2016. xvii + 189 pp. $26.95

More information

International Journal of Mathematical Archive-5(6), 2014, Available online through ISSN

International Journal of Mathematical Archive-5(6), 2014, Available online through  ISSN International Journal of Mathematical Archive-5(6), 2014, 119-124 Available online through www.ijma.info ISSN 2229 5046 CLOSURE OPERATORS ON COMPLETE ALMOST DISTRIBUTIVE LATTICES-I G. C. Rao Department

More information

Square Involutions. Filippo Disanto Dipartimento di Scienze Matematiche e Informatiche Università di Siena Pian dei Mantellini Siena, Italy

Square Involutions. Filippo Disanto Dipartimento di Scienze Matematiche e Informatiche Università di Siena Pian dei Mantellini Siena, Italy 3 47 6 3 Journal of Integer Sequences, Vol. 4 (0), Article.3.5 Square Involutions Filippo Disanto Dipartimento di Scienze Matematiche e Informatiche Università di Siena Pian dei Mantellini 44 5300 Siena,

More information

Introduction (concepts and definitions)

Introduction (concepts and definitions) Objectives: Introduction (digital system design concepts and definitions). Advantages and drawbacks of digital techniques compared with analog. Digital Abstraction. Synchronous and Asynchronous Systems.

More information

Logic and Artificial Intelligence Lecture 18

Logic and Artificial Intelligence Lecture 18 Logic and Artificial Intelligence Lecture 18 Eric Pacuit Currently Visiting the Center for Formal Epistemology, CMU Center for Logic and Philosophy of Science Tilburg University ai.stanford.edu/ epacuit

More information

From Wireless Network Coding to Matroids. Rico Zenklusen

From Wireless Network Coding to Matroids. Rico Zenklusen From Wireless Network Coding to Matroids Rico Zenklusen A sketch of my research areas/interests Computer Science Combinatorial Optimization Matroids & submodular funct. Rounding algorithms Applications

More information

Unique Sequences Containing No k-term Arithmetic Progressions

Unique Sequences Containing No k-term Arithmetic Progressions Unique Sequences Containing No k-term Arithmetic Progressions Tanbir Ahmed Department of Computer Science and Software Engineering Concordia University, Montréal, Canada ta ahmed@cs.concordia.ca Janusz

More information

Introduction to Game Theory

Introduction to Game Theory Introduction to Game Theory (From a CS Point of View) Olivier Serre Serre@irif.fr IRIF (CNRS & Université Paris Diderot Paris 7) 14th of September 2017 Master Parisien de Recherche en Informatique Who

More information

Online Computation and Competitive Analysis

Online Computation and Competitive Analysis Online Computation and Competitive Analysis Allan Borodin University of Toronto Ran El-Yaniv Technion - Israel Institute of Technology I CAMBRIDGE UNIVERSITY PRESS Contents Preface page xiii 1 Introduction

More information

132-avoiding Two-stack Sortable Permutations, Fibonacci Numbers, and Pell Numbers

132-avoiding Two-stack Sortable Permutations, Fibonacci Numbers, and Pell Numbers 132-avoiding Two-stack Sortable Permutations, Fibonacci Numbers, and Pell Numbers arxiv:math/0205206v1 [math.co] 19 May 2002 Eric S. Egge Department of Mathematics Gettysburg College Gettysburg, PA 17325

More information