CONWAY S COSMOLOGICAL THEOREM
|
|
- Noel Marcus Harrell
- 6 years ago
- Views:
Transcription
1 CONWAY S COSMOLOGICAL THEOREM R.A. LITHERLAND. Introduction In [C], Conway introduced an operator on strings (finite sequences) of positive integers, the audioactive (or look and say ) operator. Usually, the integers involved are single digit numbers, and a string consisting of four ones and a single three, for instance, is written as ; in general, the terms of the sequence are referred to as digits regardless of their size. To apply the operator to the above string, describe it in words as four ones, one three and then translate this to the digit string 4. More formally, suppose a string S is written as d e de den n, where de represents e consecutive digits d. Whenever this is done, it is understood that the grouping is maximal; that is, d i d i+ for i < n. Then the result of applying the operator to S is the daughter sequence α(s) = e d e d e n d n. Applying the operator repeatedly produces the descendants of S, α n (S) for n = 0,,.... A string that is equal to α n (S) for some string S and integer n is called an n-day-old string. Some strings of the form S = LR (with L and R non-empty) have the property that the descendants of L and R do not interfere with one another, in the sense that α n (S) = α n (L)α n (R) for all n. In this case, we say that S splits, and write S = L.R. A string that does not split is called an atom, or element, and every string splits uniquely into atoms, and is also called a compound. Conway proved that there is a finite set of common elements that is stable, in the sense that if S is a common element, all the elements appearing in α(s) are common, and that has the remarkable property that any sufficiently old descendant of an arbitrary string (other than and ) involves all the common elements. Astoundingly, there are precisely 9 of these elements, and (less astoundingly) Conway gave them the names Hydrogen, Helium,..., Uranium. He also found two infinite families of elements that are persistent, in the sense that each such element S appears in α n (S) for some n > 0 (in fact for n = ), and so keeps reappearing. These he called the isotopes of Neptunium and Plutonium, collectively known as the transuranic elements. His Cosmological Theorem asserts that there is some integer N such that any N-day-old string splits into common and transuranic elements. One proof of this was found by Conway and Richard Parker, and another by Mike Guy that showed that one could take N = 4. Both proofs were lost. Subsequently, Ekhad and Zeilberger [EZ] gave a proof consisting of a Maple program written by Zeilberger and executed by Ekhad, together with a short explanation of what the program does and why its output constitutes a proof. This, however, only shows that one may take N = 9. This paper discusses two proofs, both computer assisted, that indeed one may take N = 4. The C source code for the programs involved and some related programs, together with documentation, can be found at Date: April, 00. Last revised: April 4, 006. Zeilberger is a human being and Ekhad is his computer.
2 The first proof is a minor adaptation of Ekhad and Zeilberger s. Almost all the work is done by the program proof; the algorithm used, and why its execution constitutes a proof, are explained in the accompanying documentation, and this proof will not be discussed further here. The second proof is similar in spirit (I think) to Conway and Parker s. That consisted, according to Conway, of a very subtle and complicated argument, which (almost) reduced the problem to tracking a few hundred cases, which were then handled on dozens of sheets of paper (now lost). The rest of this paper gives a complicated argument reducing the problem to tracking a finite number of cases. It is clearly not subtle enough, because the number is 60. These cases are then checked by the program proof. That the number 4 cannot be improved was also shown by Guy, who found atoms of longevity 4, given on page 86 of [C]. Dropping the first two digits gives shorter elements of longevity 4, the isotopes of Thuselum, as illustrated in the documentation for my program evolve. I assume familiarity with Conway s paper; in particular, all the named theorems referred to are found there. Our notation differs in the use of α(s) rather than S for the daughter of S; subscripts on strings are just indices here. As in [C], a chunk of a string is a substring of consecutive digits. By a run of a string we mean a maximal chunk of identical digits, and by a block we mean a chunk made up of runs. A {, }-chunk or {, }-block is one containing only the digits and. The longevity of a string S [EZ] is the minimum n for which α n (S) is composed of common and transuranic elements.. Four-day-old strings Recall that a string is parsed by inserting commas to indicate its derivation from a parent string. Conway gave restrictions on the strings or parsed strings that can be chunks of - and -day-old strings; we give further restrictions for - and 4-day-old strings. Lemma.. () A -day-old string has no chunks of the form x,yx,. () A -day-old string has no chunks of the form,xy, with x >, or x. () A -day old string has no chunks of the form,, or. (4) A 4-day-old string has no chunks of the form, or. Proof. Parts () and () are Conway s One-Day and Two-Day Theorems. In part (), the first string must arise from a block, contradicting part (). By part (), the second can only be parsed as,,,, which arises from a chunk, again contrary to (). In part (4), the first string is parsed as,, by (), and so comes from a chunk xxx. One parsing contradicts (), the other (). By () and (), the other two must be parsed as,,,x, and,,,x, for some x or. These arise from xx and xx. By (), x =, and we get a contradiction to () or (). We say that a string looks 4 days old if it has a parsing satisfying the conditions of Lemma.. A chunk of a 4-day-old string need not look 4 days old. However, if S looks 4 days old, so does any block of S, as well as α(s).
3 Lemma.. The only maximal {, }-chunks of a 4-day-old string are,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,, and. Proof. Let S be any {, }-chunk of a 4-day-old string. Suppose length(s) >, and let S be the maximal chunk of S that starts and ends with commas in the parsing of S. Then S is non-empty and describes a {, }-block P of a -day-old string that contains no runs of length. We claim that P contains at most one. For two consecutive s would be a run, and non-consecutive s would give a chunk or, both of which are impossible in -day-old strings. Hence P is one of the following eleven strings: P =, P =, P =, P 4 =, P 5 =, P 6 =, P 7 =, P 8 =, P 9 =, P 0 = or P =. Therefore S is equal to α(p i ) for some i, or is obtained from it by prefixing or appending a single or, or both. Only one of or may be prefixed (the one different from the first digit of P i ), giving a maximum of six possible S for each i. Also, P 4, P 5 and P 8,..., P cannot follow a or, since it would have to be a and would give a chunk or. Further, P and P 7,...,P cannot be followed by a run of length three, since the resulting chunk would not parse. Finally, P 6 cannot be both preceded by a and followed by a run of three. This means there are at most 9 such S, and one checks that all of them, plus the 7 strings of length at most, are listed above apart from, and. The three exceptions cannot be maximal {, }-chunks, because they cannot appear at the start of a 4-day old string by part () of Lemma., nor after a by part (4), nor after x > by parts () and (). Lemma.. Let S be an atom appearing in a 4-day-old string. A maximal nonempty {, }-block of S not at the start of S is one of the following strings:,,,,,,,,,,,,, or. Proof. Such a block B appears in a chunk B] or Bx (x, ) of S, and the non-empty strings listed in Lemma. but not here would cause a splitting.b] or.bx. Let S {,} be the set of strings in Lemma. and S {,} the set of those in Lemma.. Then any atom appearing in a 4-day-old string can be written in the form (.) M = CA n B n A n B A, where: (.) C S {,} ; (.) B i S {,} for i < n; (.4) A i =, or for < i n; and (.5) A =,,, or x for some x >. (Here n = and M = CA is allowed.) We shall show that any such atom has longevity at most 0. It will be more convenient to work with strings satisfying
4 (.6) A i =, or for i n in place of (.4) and (.5). We call a string mature if it looks 4 days old and has the form (.) subject to (.), (.) and (.6). Lemma.4. If every mature string has longevity at most 0, then so does every atom appearing in a 4-day-old string. Proof. Let M be such an atom, written as in (.) subject to (.) (.5). Then M is mature unless A = or A = x >. Suppose that A =, and that M appears in α 4 (S). If M is not the last atom in this string, the next atom is. If it is, α 4 (S) ends M, so in either case M is a block of a 4-day old string, and is therefore mature. Since it splits as M., it has the same longevity as M. Finally, suppose A = x with x >. Since any occurence of x in a -day old string is neither preceded nor followed by x, in a -day-old string it is preceded by, and in a 4-day-old string by. Hence M ends x and it follows from the proof of the Ending Theorem that the last atom of α k (M) is either Np or Pu for k 8. Let M be the string obtained from M by replacing x by. Now M does not end x, since the parsings,,,x and,,x, are both impossible. Hence M is mature. Now α k (M ) is obtained from α k (M) by replacing the final x by, and since α 0 (M ) is composed of common atoms, all atoms of α 0 (M) apart from the last are common. The substrings in our decomposition of a mature string do not, of course, evolve independently. To keep track of their interactions with their neighbors, we regard each one as a state of a machine, as explained in the next section.. Machines and pipelines For our purposes, a machine M consists of a set S of states, an input alphabet I, an output alphabet O (all non-empty), and a program π: S I O S. The output function ω: S I O and the transition function τ : S I S are defined by composing π with the appropriate projections. If s is a string on I and S S, we write S s t T to indicate that M, receiving input s in state S, outputs the string t and ends in state T. (When s is a single letter, so is t, and this means that π(s, s) = (t, T). The machine in question will be clear from the context.) In the machines we actually use, the output ω(s, x) is independent of x, so we sometimes write S s t to mean that M, receiving input s in state S, outputs t (one letter longer than s), and ends in an unknown state. We also use the notation S s for infinite t sequences s and t on I and O, which we call input and output streams. Finally, parts of s that do not affect the outcome will be suppressed. Given machines M = (S, I, O, π ) and M = (S, I, O, π ) with O = I, we can form the machine M = M M, called a pipeline, by connecting the output of M to the input of M. We have M = (S, I, O, π), where S = S S, I = I, and O = O. The program for M should be intuitively clear; formally we have π(s, S, x) = (π (S, ω (S, x)), τ (S, x)). Clearly, we have a category whose arrows are machines; the order in which we write a pipeline corresponds to the functions on the left convention, and is also the natural one for our application of the idea. We now define three specific machines. The states, inputs, and outputs will all be digit strings. In fact, the inputs and 4
5 outputs will be either the empty string or a single digit, so we can write the IO-streams without commas. By a simple string we mean a string on {,, } in which all runs have length at most. The machine A. Here S = {,, }, I = {, } and O = {,, }. The program is given by State Input Output State y, y x y x x x The machine B. Here S is the set of all non-empty simple strings that neither start nor end with a, I = {,, } and O = {, }. For S S, either α(s) S or α(s) = T with T S. The program is given by State Input Output State S, α(s) S x α(s)x S, α(s) = T x Tx The machine C. Here S is the set of all (possibly empty) simple strings that do not end with a, I = {,, } and O = {}. The program is given by State Input State S x α(s)x Consider the machine M = CA n B n A n B A for some n, where each A i or B i is a copy of A or B. If M = CA n B n A n B A is a mature string, then M has (C, A n, B n, A n,..., B, A ) as a state, and if it is started from this state with input stream, the product of the strings in the state after k inputs have been consumed will be α k (M). We say that M is run properly if the initial state corresponds to a mature string and the input is. We consider these machines in the next section. Now suppose M = M n M for some n, where each M i is a copy of A, B or C. Let M = (S, I, O, π). (I is one of {, } and {,, }, and O is one of {}, {, } and {,, }). We define a machine M = (Ŝ, I, O, π) with the same inputs and outputs as M as follows. Ŝ is the set of all non-empty simple strings whose first digit is not in O and whose last digit is in I. For S Ŝ, either α(s) Ŝ or α(s) = yt with y O and T Ŝ. The program is given by State Input Output State S, α(s) Ŝ x α(s)x S, α(s) = yt, y O x y Tx Every state (S n,...,s ) of M determines a state S n S of M. If M and M are started from corresponding states and given the same input, they will produce the same output, and at each stage their states will correspond. We call M the flattening of M. We now prove two lemmas about the machines A and B. In following the evolution of these machines from specific states, we will always know an initial chunk of the state, and usually the whole state, so we do not use Conway s [ and ] notation. Our convention is that, for instance, denotes a complete state, while denotes a state starting. We continue the convention that explicit exponents are 5
6 maximal, so that if a state is written x, it is implied that x and the state does not start xx. Lemma.. The output of A (for any initial state and input) does not contain, or. Proof. The possibilities for two consecutive steps are: ; ; ; ; ;. Lemma.. Let L = or, and let R be a string of the form x, or x or. Set ω() = and ω() =. Suppose that at some stage B has state LR. Then the subsequent output is ω(l), and at all later stages B has state LR, where R has one of the same three forms as R. Proof. Clearly the first output is ω(l) and the next state is LR where R = α(r), α(r) or α(r). If R = x, then α(r) =, and R has the same form. If R =, then α(r) = or, and R could have a different form only if α(r) were equal to, which is impossible. Finally, if R = x or then both α(r) and R have the form ( or ). The result follows. When a state S satisfying the hypotheses of this lemma arises, we indicate this by writing S as L.R. 4. Properly-run machines Throughout this section, M = CA n B n A n B A and we assume that M has an initial state corresponding to a mature string and input. For i n, we let s i be the input stream of A i, and t i its output stream. Then s i is a stream on {, }, t i is a stream on {,, }, and s =. Lemma 4.. () If appears in s i, it is followed by,, or. () If appears in s i, it is followed by. () If appears in s i, it is followed by. Proof. If i =, this is trivially true, so suppose i >. Then s i is also the output of the flattening N i of B i A i B A with input. The state transitions below are for the machine N i. () From the proof of the Starting Theorem, the state S of N i just before appears must be, or. (It cannot be just.) Suppose first S =. Because S looks 4 days old, it must have the form x or. Hence we have ( or ), so in this case is followed by. Now suppose S =. Then we have or ( or ), so in this case is followed by. Finally, suppose that S =. One possibility is, 6
7 and in this case is followed by, by the Starting Theorem. Otherwise we have and in this case is followed by. ( ) () From the proof of the Starting Theorem, the state of N i just before appears must be x, and the next step is x. That this is followed by the output 4 is part of the proof of part (). () From the proof of the Starting Theorem, the state of N i just before appears must be x, or x, and the result follows. Lemma 4.. () If appears in t i, it is followed by,, or. () If appears in t i, it is followed by. () If 4 appears in t i, it is followed by. (4) If appears in t i, it is followed by,, or. (5) If appears in t i, it is followed by. (6) If 4 appears in t i, it is followed by. Proof. In cases () () (resp. (4) (6)), the state of A i just before the given sequence appears in its output stream must be (resp. ), and the part of the input stream s i about to be read must start, or. In each case the possibilities for the continuation of s i are given by the previous lemma, and we just need to compute the corresponding outputs. The following computations show the output starting with the given sequence. () ; ;. (). (4) ; ;. (5). (,6) ;. 7
8 Recall that the initial state of A i (resp. B i ) is the string A i (resp. B i ) from the decomposition (.) of our mature string M. Lemma 4.. If B i is, or, then t i does not start with. If B i is or, t i does not start with. Proof. We need to show that in the first three cases, A i is not, and in the others it is not. This is so because M looks 4 days old. In Lemmas , we determine the possible output streams s i+ of B i for the allowable initial states B i S {,}. In each case, the proof consists of listing the evolutions of the state for all possible inputs until it becomes periodic. That we have considered all possible inputs t i to B i can be seen from Lemmas 4.,. and 4.. In most cases, that the output becomes periodic follows from Lemma., or from a case already dealt with. We shall therefore not give these justifications explicitly. Lemma 4.4. If B i is one of the eight strings in the left column below, the output stream s i+ of B i is as indicated. Proof. We have B i s i+,,, 5. ; or. ;. ; or or ; or. ;. Let s be a stream on {, } and t a finite or infinite sequence on {,, }. In Lemmas , the notation t s means that, for the given value of B i, if t i starts with t, then s i+ = s. Lemma 4.5. If B i =, we have 6 and. Proof. We have 5 and. Lemma 4.6. If B i =, we have or, and 4. 8
9 Proof. The first two cases are given by and the third by. and., or.. Lemma 4.7. If B i =, we have or ; or ; and 4. Proof. We have. ;. ; ; 4. ; Lemma 4.8. If B i =, we have 7, 4, a a+ for 0 a, and. Proof. First, Second, noting that, and. 6 a a Lemma 4.9. If B i =, we have, 7, 4,, a a+ for a,, and. 7, 4,,, and (). Proof. The first case comes from.. Otherwise, the evolution starts along some path in the following diagram. (On the vertical arrows, inputs are on the left and outputs on the right.).. 9 ()
10 Considering the possible continuations from the occurences of the state completes the proof. Lemma 4.0. If B i =, we have, and a a+ () for 0 a ; a a+ 7 and a a+ 4 for a = 0 or ; a b a+ b+ for 0 a and b ; 4 and a a+ for 0 a ; a a+ for 0 a ; and a a+ for a = 0 or ; Proof. The first case is given by.. Noting that, the second is clear, and all the rest come from an evolution starting a for 0 a a. Lemma 4.. For i < n and any B i S {,}, s i+ is one of the following streams. a () for 0 a ; a for 0 a ; a for a ; a for 0 a 7; a b for 0 a and b =,, 4, 5 or 7; a for a =,, 4 or 5; a for a =,, 4 or 7; a 4 for 0 a ; a for a = or. Proof. This is just a matter of checking that all the values of s i+ from Lemmas appear in the above list. In fact, not all the above streams can occur. Lemma 4.. For i < n and any B i S {,}, s i+ is not equal to a 5 for 0 a, 4, or. Proof. From Lemmas , these streams could only arise as s i+ if B i and an initial portion t of t i were as follows. s i+ B i t 5 a 5, a a 4 0
11 In all but one case, t i contains or, which implies that s i contains ; but this is impossible by the previous lemma. In the remaining case, t =, which implies that s i starts with, which is also impossible. We let S {,} be the set of streams appearing in Lemma 4. but not in Lemma 4.. Theorem. Every mature string has longevity at most 0. From Lemma.4, this implies Guy s version of the Cosmological Theorem. Corollary. Every digit string has longevity at most 4. Proof of Theorem. Let the state of M after k inputs (all ) have been consumed be ( C (k), A (k) n, B (k) n, A(k) n,..., B(k), ) A(k), so that α k (M) = C (k) A (k) n B (k) n A(k) n B(k) A(k). Let N i be the flattening of B i A i for i < n, and of CA n for i = n. Give N n N the initial state corresonding to M and input, and let its state after k inputs be ( (k) N n,..., N (k) ), so that also α k (M) = N n (k) N (k). N i has input s i for i n and output s i+ for i < n. Let i < n. Since s i+ S {,}, s i+ = u i v i, where length(u i ) = 0 and v i =,, or. If v i =, α 0 (M) splits as N n (0) N (0) i+.n(0) i N (0). Streams ending in () only arise in Lemmas 4.9 and 4.0, and it follows that if v i = or then B (0) i = or and t i contains only after its first 0 terms. This implies that A (0) i = and s i contains only after its first 0 terms, and it follows that α 0 (M) splits as N (0) n N (0) i+ ( or )..N(0) i N(0). Now suppose that v i =. Examining the proofs of Lemmas , we see that this can arise in three ways. First, we may have B (0) i = R with R as in Lemma.. In this case, α 0 (M) splits as N n (0) N (0) i+.ra(0) i N (0) i N(0). Second, we may have B (0) i = and t i containing only after its first 0 terms. This implies that A (0) i = and s i contains only after its first 0 terms, and it follows that α 0 (M) splits as N n (0) N (0) i+..n(0) i N(0). Finally, we may have B i = and t i =. This implies that A i = and s i =, and it follows that α 0 (M) splits as N n (0) N (0) i+.n(0) i N(0). In all cases, we may write N (0) i = L i R i, where L i =, or if v i =, or, respectively, and L i = or if v i =, and α 0 (M) splits as N (0) n N (0) i+ L i.r i N (0) i N(0).
12 Setting L 0 =, we have the splitting N n (0) L n.r n L n..r L 0 of α 0 (M), so it suffices to show that all the factors in this splitting have longevity at most 0. There are only finitely many possibilities for these factors and they may be obtained as follows. For j = or, let X j be the set of triples (S, s, L), where S = (S, S ) S j {,} {,, }, S S looks 4 days old, s S {,}, and, writing s = uv with length(u) = 0, L =, or if v =, or, respectively, and L = or if v =. Let Y X consist of those triples with L. For (S, s, L) X, let N(S, s) be the state of CA, starting from S, after the first L n = N(S, s)l for some (S, s, L). Similarly,for (S, s, L) X, let S be the state of BA, starting from S, after the first 0 inputs have been taken from s. If the first atom of S is,, or, let R(S, s) be the remainder of S, and otherwise let R(S, s) = S. Then, for i < n, R i L i = R(S, s)l for some (S, s, L). For (S, s, L) X, N(S, s) and R(S, s) are both defined, and N(S, s)l = T.R(S, s)l for some string T, so it is enough to show that N(S, s)l has longevity at most 0 for all (S, s, L) X. If s ends in, the longevity of N(S, s) is at most that of N(S, s), since for any common atom ending, replacing the final by gives a common atom. Hence we need only consider (S, s, L) Y. Unfortunately, there are still many cases. Of the 7 strings in S {,}, 9 cannot be followed by in a string that looks 4 days old, and 8 others not by, so there are 84 choices for S. Since there are 40 streams in S {,}, we have Y = = 60. The corresponding strings N(S, s)l are computed, and 0 inputs have been taken from s. Then N (0) n their longevities checked, by the program proof referred to earlier, completing the proof. References [C] J.H. Conway, The weird and wonderful chemistry of audioactive decay, in: Open Problems in Communication and Computation, T.M. Cover and B. Gopinath, eds., Springer, 987, pp [EZ] Shalosh B. Ekhad and Doron Zeilberger, Proof of Conway s Lost Cosmological Theorem, Electron. Res. Announc. Amer. Math. Soc. (997), 78 8; available at Department of Mathematics, Louisiana State University, Baton Rouge, LA address: lither@math.lsu.edu
Equidivisible consecutive integers
& Equidivisible consecutive integers Ivo Düntsch Department of Computer Science Brock University St Catherines, Ontario, L2S 3A1, Canada duentsch@cosc.brocku.ca Roger B. Eggleton Department of Mathematics
More informationThe Impossibility of Certain Types of Carmichael Numbers
The Impossibility of Certain Types of Carmichael Numbers Thomas Wright Abstract This paper proves that if a Carmichael number is composed of primes p i, then the LCM of the p i 1 s can never be of the
More informationTheoretical Computer Science. Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms
Theoretical Computer Science 428 (2012) 92 97 Contents lists available at SciVerse ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Note Completing a combinatorial
More informationOEIS A I. SCOPE
OEIS A161460 Richard J. Mathar Leiden Observatory, P.O. Box 9513, 2300 RA Leiden, The Netherlands (Dated: August 7, 2009) An overview to the entries of the sequence A161460 of the Online Encyclopedia of
More informationTree sets. Reinhard Diestel
1 Tree sets Reinhard Diestel Abstract We study an abstract notion of tree structure which generalizes treedecompositions of graphs and matroids. Unlike tree-decompositions, which are too closely linked
More informationIntroduction to Turing Machines. Reading: Chapters 8 & 9
Introduction to Turing Machines Reading: Chapters 8 & 9 1 Turing Machines (TM) Generalize the class of CFLs: Recursively Enumerable Languages Recursive Languages Context-Free Languages Regular Languages
More informationMathematics 114L Spring 2018 D.A. Martin. Mathematical Logic
Mathematics 114L Spring 2018 D.A. Martin Mathematical Logic 1 First-Order Languages. Symbols. All first-order languages we consider will have the following symbols: (i) variables v 1, v 2, v 3,... ; (ii)
More informationJohns Hopkins Math Tournament Proof Round: Automata
Johns Hopkins Math Tournament 2018 Proof Round: Automata February 9, 2019 Problem Points Score 1 10 2 5 3 10 4 20 5 20 6 15 7 20 Total 100 Instructions The exam is worth 100 points; each part s point value
More informationAhlswede Khachatrian Theorems: Weighted, Infinite, and Hamming
Ahlswede Khachatrian Theorems: Weighted, Infinite, and Hamming Yuval Filmus April 4, 2017 Abstract The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of
More informationFIBONACCI NUMBERS AND DECIMATION OF BINARY SEQUENCES
FIBONACCI NUMBERS AND DECIMATION OF BINARY SEQUENCES Jovan Dj. Golić Security Innovation, Telecom Italia Via Reiss Romoli 274, 10148 Turin, Italy (Submitted August 2004-Final Revision April 200) ABSTRACT
More informationarxiv: v3 [cs.dm] 18 Oct 2017
Decycling a Graph by the Removal of a Matching: Characterizations for Special Classes arxiv:1707.02473v3 [cs.dm] 18 Oct 2017 Fábio Protti and Uéverton dos Santos Souza Institute of Computing - Universidade
More informationMATH 326: RINGS AND MODULES STEFAN GILLE
MATH 326: RINGS AND MODULES STEFAN GILLE 1 2 STEFAN GILLE 1. Rings We recall first the definition of a group. 1.1. Definition. Let G be a non empty set. The set G is called a group if there is a map called
More informationEnumeration Schemes for Words Avoiding Permutations
Enumeration Schemes for Words Avoiding Permutations Lara Pudwell November 27, 2007 Abstract The enumeration of permutation classes has been accomplished with a variety of techniques. One wide-reaching
More informationChapter 6. Properties of Regular Languages
Chapter 6 Properties of Regular Languages Regular Sets and Languages Claim(1). The family of languages accepted by FSAs consists of precisely the regular sets over a given alphabet. Every regular set is
More informationMultivalued functions in digital topology
Note di Matematica ISSN 1123-2536, e-issn 1590-0932 Note Mat. 37 (2017) no. 2, 61 76. doi:10.1285/i15900932v37n2p61 Multivalued functions in digital topology Laurence Boxer Department of Computer and Information
More informationTheory of Computation
Thomas Zeugmann Hokkaido University Laboratory for Algorithmics http://www-alg.ist.hokudai.ac.jp/ thomas/toc/ Lecture 14: Applications of PCP Goal of this Lecture Our goal is to present some typical undecidability
More information(Refer Slide Time: 0:21)
Theory of Computation Prof. Somenath Biswas Department of Computer Science and Engineering Indian Institute of Technology Kanpur Lecture 7 A generalisation of pumping lemma, Non-deterministic finite automata
More informationCS 530: Theory of Computation Based on Sipser (second edition): Notes on regular languages(version 1.1)
CS 530: Theory of Computation Based on Sipser (second edition): Notes on regular languages(version 1.1) Definition 1 (Alphabet) A alphabet is a finite set of objects called symbols. Definition 2 (String)
More informationToppling Conjectures
Games of No Chance 4 MSRI Publications Volume 63, 2015 Toppling Conjectures ALEX FINK, RICHARD NOWAKOWSKI, AARON SIEGEL AND DAVID WOLFE Positions of the game of TOPPLING DOMINOES exhibit many familiar
More informationThe Hurewicz Theorem
The Hurewicz Theorem April 5, 011 1 Introduction The fundamental group and homology groups both give extremely useful information, particularly about path-connected spaces. Both can be considered as functors,
More informationCOS597D: Information Theory in Computer Science October 19, Lecture 10
COS597D: Information Theory in Computer Science October 9, 20 Lecture 0 Lecturer: Mark Braverman Scribe: Andrej Risteski Kolmogorov Complexity In the previous lectures, we became acquainted with the concept
More informationA necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees Yoshimi Egawa Department of Mathematical Information Science, Tokyo University of
More informationCHAPTER 5. Interactive Turing Machines
CHAPTER 5 Interactive Turing Machines The interactive Turing machine, which was introduced by Van Leeuwen and Wiedermann[28, 30], is an extension of the classical Turing machine model. It attempts to model
More informationAutomata Theory and Formal Grammars: Lecture 1
Automata Theory and Formal Grammars: Lecture 1 Sets, Languages, Logic Automata Theory and Formal Grammars: Lecture 1 p.1/72 Sets, Languages, Logic Today Course Overview Administrivia Sets Theory (Review?)
More informationOn improving matchings in trees, via bounded-length augmentations 1
On improving matchings in trees, via bounded-length augmentations 1 Julien Bensmail a, Valentin Garnero a, Nicolas Nisse a a Université Côte d Azur, CNRS, Inria, I3S, France Abstract Due to a classical
More informationEntropy and Ergodic Theory Lecture 3: The meaning of entropy in information theory
Entropy and Ergodic Theory Lecture 3: The meaning of entropy in information theory 1 The intuitive meaning of entropy Modern information theory was born in Shannon s 1948 paper A Mathematical Theory of
More informationCOMBINATORIAL GAMES AND SURREAL NUMBERS
COMBINATORIAL GAMES AND SURREAL NUMBERS MICHAEL CRONIN Abstract. We begin by introducing the fundamental concepts behind combinatorial game theory, followed by developing operations and properties of games.
More informationarxiv: v1 [cs.dm] 12 Jun 2016
A Simple Extension of Dirac s Theorem on Hamiltonicity Yasemin Büyükçolak a,, Didem Gözüpek b, Sibel Özkana, Mordechai Shalom c,d,1 a Department of Mathematics, Gebze Technical University, Kocaeli, Turkey
More informationTheory of Computation
Theory of Computation (Feodor F. Dragan) Department of Computer Science Kent State University Spring, 2018 Theory of Computation, Feodor F. Dragan, Kent State University 1 Before we go into details, what
More informationAvoiding Approximate Squares
Avoiding Approximate Squares Narad Rampersad School of Computer Science University of Waterloo 13 June 2007 (Joint work with Dalia Krieger, Pascal Ochem, and Jeffrey Shallit) Narad Rampersad (University
More informationStandard forms for writing numbers
Standard forms for writing numbers In order to relate the abstract mathematical descriptions of familiar number systems to the everyday descriptions of numbers by decimal expansions and similar means,
More informationTHE CANTOR GAME: WINNING STRATEGIES AND DETERMINACY. by arxiv: v1 [math.ca] 29 Jan 2017 MAGNUS D. LADUE
THE CANTOR GAME: WINNING STRATEGIES AND DETERMINACY by arxiv:170109087v1 [mathca] 9 Jan 017 MAGNUS D LADUE 0 Abstract In [1] Grossman Turett define the Cantor game In [] Matt Baker proves several results
More information2. The Concept of Convergence: Ultrafilters and Nets
2. The Concept of Convergence: Ultrafilters and Nets NOTE: AS OF 2008, SOME OF THIS STUFF IS A BIT OUT- DATED AND HAS A FEW TYPOS. I WILL REVISE THIS MATE- RIAL SOMETIME. In this lecture we discuss two
More informationInserting plus signs and adding
Inserting plus signs and adding Steve Butler Ron Graham Richard Stong Abstract. For a fixed base b, we consider the following operation called insert and add on a natural number: Write the number as a
More informationEnumeration and symmetry of edit metric spaces. Jessie Katherine Campbell. A dissertation submitted to the graduate faculty
Enumeration and symmetry of edit metric spaces by Jessie Katherine Campbell A dissertation submitted to the graduate faculty in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY
More informationCOMPLETION OF PARTIAL LATIN SQUARES
COMPLETION OF PARTIAL LATIN SQUARES Benjamin Andrew Burton Honours Thesis Department of Mathematics The University of Queensland Supervisor: Dr Diane Donovan Submitted in 1996 Author s archive version
More informationIntroduction to Metalogic
Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)
More information3 The language of proof
3 The language of proof After working through this section, you should be able to: (a) understand what is asserted by various types of mathematical statements, in particular implications and equivalences;
More informationOn Aperiodic Subtraction Games with Bounded Nim Sequence
On Aperiodic Subtraction Games with Bounded Nim Sequence Nathan Fox arxiv:1407.2823v1 [math.co] 10 Jul 2014 Abstract Subtraction games are a class of impartial combinatorial games whose positions correspond
More informationCS243, Logic and Computation Nondeterministic finite automata
CS243, Prof. Alvarez NONDETERMINISTIC FINITE AUTOMATA (NFA) Prof. Sergio A. Alvarez http://www.cs.bc.edu/ alvarez/ Maloney Hall, room 569 alvarez@cs.bc.edu Computer Science Department voice: (67) 552-4333
More informationInformation Theory and Statistics Lecture 2: Source coding
Information Theory and Statistics Lecture 2: Source coding Łukasz Dębowski ldebowsk@ipipan.waw.pl Ph. D. Programme 2013/2014 Injections and codes Definition (injection) Function f is called an injection
More informationCS500 Homework #2 Solutions
CS500 Homework #2 Solutions 1. Consider the two languages Show that L 1 is context-free but L 2 is not. L 1 = {a i b j c k d l i = j k = l} L 2 = {a i b j c k d l i = k j = l} Answer. L 1 is the concatenation
More informationContext-free grammars and languages
Context-free grammars and languages The next class of languages we will study in the course is the class of context-free languages. They are defined by the notion of a context-free grammar, or a CFG for
More informationNotes on the Dual Ramsey Theorem
Notes on the Dual Ramsey Theorem Reed Solomon July 29, 2010 1 Partitions and infinite variable words The goal of these notes is to give a proof of the Dual Ramsey Theorem. This theorem was first proved
More information32 Divisibility Theory in Integral Domains
3 Divisibility Theory in Integral Domains As we have already mentioned, the ring of integers is the prototype of integral domains. There is a divisibility relation on * : an integer b is said to be divisible
More information1. Induction on Strings
CS/ECE 374: Algorithms & Models of Computation Version: 1.0 Fall 2017 This is a core dump of potential questions for Midterm 1. This should give you a good idea of the types of questions that we will ask
More information1 More finite deterministic automata
CS 125 Section #6 Finite automata October 18, 2016 1 More finite deterministic automata Exercise. Consider the following game with two players: Repeatedly flip a coin. On heads, player 1 gets a point.
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More informationA misère-play -operator
A misère-play -operator Matthieu Dufour Silvia Heubach Urban Larsson arxiv:1608.06996v1 [math.co] 25 Aug 2016 July 31, 2018 Abstract We study the -operator (Larsson et al, 2011) of impartial vector subtraction
More informationThe Chromatic Number of Ordered Graphs With Constrained Conflict Graphs
The Chromatic Number of Ordered Graphs With Constrained Conflict Graphs Maria Axenovich and Jonathan Rollin and Torsten Ueckerdt September 3, 016 Abstract An ordered graph G is a graph whose vertex set
More informationNon-context-Free Languages. CS215, Lecture 5 c
Non-context-Free Languages CS215, Lecture 5 c 2007 1 The Pumping Lemma Theorem. (Pumping Lemma) Let be context-free. There exists a positive integer divided into five pieces, Proof for for each, and..
More informationReverse mathematics and marriage problems with unique solutions
Reverse mathematics and marriage problems with unique solutions Jeffry L. Hirst and Noah A. Hughes January 28, 2014 Abstract We analyze the logical strength of theorems on marriage problems with unique
More informationA CHARACTERIZATION OF PARTIALLY ORDERED SETS WITH LINEAR DISCREPANCY EQUAL TO 2
A CHARACTERIZATION OF PARTIALLY ORDERED SETS WITH LINEAR DISCREPANCY EQUAL TO 2 DAVID M. HOWARD, MITCHEL T. KELLER, AND STEPHEN J. YOUNG Abstract. The linear discrepancy of a poset P is the least k such
More informationCpSc 421 Homework 1 Solutions
CpSc 421 Homework 1 Solutions 1. (15 points) Let Σ = {a, b, c}. Figure 7 depicts two finite state machines that read Let L a and L b denote the languages recognized by DFA (a) and DFA (b) respectively.
More informationKreisel s Conjecture with minimality principle
Kreisel s Conjecture with minimality principle Pavel Hrubeš November 9, 2008 Abstract We prove that Kreisel s Conjecture is true, if Peano arithmetic is axiomatised using minimality principle and axioms
More informationOn the Impossibility of Certain Ranking Functions
On the Impossibility of Certain Ranking Functions Jin-Yi Cai Abstract Suppose all the individuals in a field are linearly ordered. Groups of individuals form teams. Is there a perfect ranking function
More informationTHE RADIO NUMBERS OF ALL GRAPHS OF ORDER n AND DIAMETER n 2
LE MATEMATICHE Vol LXVIII (2013) Fasc II, pp 167 190 doi: 104418/201368213 THE RADIO NUMBERS OF ALL GRAPHS OF ORDER n AND DIAMETER n 2 K F BENSON - M PORTER - M TOMOVA A radio labeling of a simple connected
More informationMath 4606, Summer 2004: Inductive sets, N, the Peano Axioms, Recursive Sequences Page 1 of 10
Math 4606, Summer 2004: Inductive sets, N, the Peano Axioms, Recursive Sequences Page 1 of 10 Inductive sets (used to define the natural numbers as a subset of R) (1) Definition: A set S R is an inductive
More informationON A PROBLEM OF PILLAI AND ITS GENERALIZATIONS
ON A PROBLEM OF PILLAI AND ITS GENERALIZATIONS L. HAJDU 1 AND N. SARADHA Abstract. We study some generalizations of a problem of Pillai. We investigate the existence of an integer M such that for m M,
More informationLecture 1: September 25, A quick reminder about random variables and convexity
Information and Coding Theory Autumn 207 Lecturer: Madhur Tulsiani Lecture : September 25, 207 Administrivia This course will cover some basic concepts in information and coding theory, and their applications
More informationON UNIVERSAL SUMS OF POLYGONAL NUMBERS
Sci. China Math. 58(2015), no. 7, 1367 1396. ON UNIVERSAL SUMS OF POLYGONAL NUMBERS Zhi-Wei SUN Department of Mathematics, Nanjing University Nanjing 210093, People s Republic of China zwsun@nju.edu.cn
More informationFermat s Last Theorem for Regular Primes
Fermat s Last Theorem for Regular Primes S. M.-C. 22 September 2015 Abstract Fermat famously claimed in the margin of a book that a certain family of Diophantine equations have no solutions in integers.
More informationConcerning Kurosaki s Squarefree Word
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 16 (2013), Article 13.9.4 Concerning Kurosaki s Squarefree Word Serina Camungol and Narad Rampersad Department of Mathematics and Statistics University
More informationThe Turing Machine. CSE 211 (Theory of Computation) The Turing Machine continued. Turing Machines
The Turing Machine Turing Machines Professor Department of Computer Science and Engineering Bangladesh University of Engineering and Technology Dhaka-1000, Bangladesh The Turing machine is essentially
More informationA version of for which ZFC can not predict a single bit Robert M. Solovay May 16, Introduction In [2], Chaitin introd
CDMTCS Research Report Series A Version of for which ZFC can not Predict a Single Bit Robert M. Solovay University of California at Berkeley CDMTCS-104 May 1999 Centre for Discrete Mathematics and Theoretical
More informationWord-hyperbolic groups have real-time word problem
Word-hyperbolic groups have real-time word problem Derek F. Holt 1 Introduction Let G = X be a finitely generated group, let A = X X 1, and let A be the set of all words in A. For u, v A, we denote the
More informationThe number of solutions of linear equations in roots of unity
ACTA ARITHMETICA LXXXIX.1 (1999) The number of solutions of linear equations in roots of unity by Jan-Hendrik Evertse (Leiden) 1. Introduction. We deal with equations (1.1) a 1 ζ 1 +... + a n ζ n = 1 in
More informationCSE 591 Foundations of Algorithms Homework 4 Sample Solution Outlines. Problem 1
CSE 591 Foundations of Algorithms Homework 4 Sample Solution Outlines Problem 1 (a) Consider the situation in the figure, every edge has the same weight and V = n = 2k + 2. Easy to check, every simple
More informationEasy Shortcut Definitions
This version Mon Dec 12 2016 Easy Shortcut Definitions If you read and understand only this section, you ll understand P and NP. A language L is in the class P if there is some constant k and some machine
More informationOPTION-CLOSED GAMES RICHARD J. NOWAKOWSKI AND PAUL OTTAWAY
Volume 6, Number 1, Pages 142 153 ISSN 1715-0868 OPTION-CLOSED GAMES RICHARD J. NOWAKOWSKI AND PAUL OTTAWAY Abstract. We consider the class of combinatorial games with the property that each player s move
More informationNotes on ordinals and cardinals
Notes on ordinals and cardinals Reed Solomon 1 Background Terminology We will use the following notation for the common number systems: N = {0, 1, 2,...} = the natural numbers Z = {..., 2, 1, 0, 1, 2,...}
More informationSection Summary. Relations and Functions Properties of Relations. Combining Relations
Chapter 9 Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations Closures of Relations (not currently included
More informationCOMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University
COMP 182 Algorithmic Thinking Proofs Luay Nakhleh Computer Science Rice University 1 Reading Material Chapter 1, Section 3, 6, 7, 8 Propositional Equivalences The compound propositions p and q are called
More informationComputability Crib Sheet
Computer Science and Engineering, UCSD Winter 10 CSE 200: Computability and Complexity Instructor: Mihir Bellare Computability Crib Sheet January 3, 2010 Computability Crib Sheet This is a quick reference
More informationSample Project: Simulation of Turing Machines by Machines with only Two Tape Symbols
Sample Project: Simulation of Turing Machines by Machines with only Two Tape Symbols The purpose of this document is to illustrate what a completed project should look like. I have chosen a problem that
More informationOdd perfect polynomials over F 2
Journal de Théorie des Nombres de Bordeaux 19 (2007), 165 174 Odd perfect polynomials over F 2 par Luis H. GALLARDO et Olivier RAHAVANDRAINY Résumé. Un polynôme A F 2 [x] est dit parfait s il est égal
More informationAn Algebraic View of the Relation between Largest Common Subtrees and Smallest Common Supertrees
An Algebraic View of the Relation between Largest Common Subtrees and Smallest Common Supertrees Francesc Rosselló 1, Gabriel Valiente 2 1 Department of Mathematics and Computer Science, Research Institute
More informationA NEW SET THEORY FOR ANALYSIS
Article A NEW SET THEORY FOR ANALYSIS Juan Pablo Ramírez 0000-0002-4912-2952 Abstract: We present the real number system as a generalization of the natural numbers. First, we prove the co-finite topology,
More informationThe 123 Theorem and its extensions
The 123 Theorem and its extensions Noga Alon and Raphael Yuster Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract It is shown
More informationNowhere 0 mod p dominating sets in multigraphs
Nowhere 0 mod p dominating sets in multigraphs Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel. e-mail: raphy@research.haifa.ac.il Abstract Let G be a graph with
More informationCSCI3390-Assignment 2 Solutions
CSCI3390-Assignment 2 Solutions due February 3, 2016 1 TMs for Deciding Languages Write the specification of a Turing machine recognizing one of the following three languages. Do one of these problems.
More informationINVARIANT IDEALS OF ABELIAN GROUP ALGEBRAS UNDER THE MULTIPLICATIVE ACTION OF A FIELD, II
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 INVARIANT IDEALS OF ABELIAN GROUP ALGEBRAS UNDER THE MULTIPLICATIVE ACTION OF A FIELD, II J. M.
More informationFinding Consensus Strings With Small Length Difference Between Input and Solution Strings
Finding Consensus Strings With Small Length Difference Between Input and Solution Strings Markus L. Schmid Trier University, Fachbereich IV Abteilung Informatikwissenschaften, D-54286 Trier, Germany, MSchmid@uni-trier.de
More informationAvoiding Large Squares in Infinite Binary Words
Avoiding Large Squares in Infinite Binary Words arxiv:math/0306081v1 [math.co] 4 Jun 2003 Narad Rampersad, Jeffrey Shallit, and Ming-wei Wang School of Computer Science University of Waterloo Waterloo,
More informationAn Algebraic Characterization of the Halting Probability
CDMTCS Research Report Series An Algebraic Characterization of the Halting Probability Gregory Chaitin IBM T. J. Watson Research Center, USA CDMTCS-305 April 2007 Centre for Discrete Mathematics and Theoretical
More informationDefinition: A binary relation R from a set A to a set B is a subset R A B. Example:
Chapter 9 1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R A B. Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B.
More informationPLAYING END-NIM WITH A MULLER TWIST
#G5 INTEGERS 17 (2017) PLAYING END-NIM WITH A MULLER TWIST David G. C. Horrocks School of Mathematical and Computational Sciences, University of Prince Edward Island, Charlottetown, PE, Canada dhorrocks@upei.ca
More informationFALL 07 CSE 213: HW4
FALL 07 CSE 213: HW4 1) R 1 is not a partial ordered relation, since it is not antisymmetric. Having (1,3) and (3,1) in the relation; does not imply that 1=3 because 1 3. R 2 is a partial order because
More informationOn avoidability of formulas with reversal
arxiv:1703.10522v1 [math.co] 30 Mar 2017 On avoidability of formulas with reversal James Currie, Lucas Mol, and Narad ampersad Abstract While a characterization of unavoidable formulas (without reversal)
More informationOutside ZF - Set Cardinality, the Axiom of Choice, and the Continuum Hypothesis
Outside ZF - Set Cardinality, the Axiom of Choice, and the Continuum Hypothesis Tali Magidson June 6, 2017 Synopsis In June 2002, "Two Classical Surprises Concerning the Axiom of Choice and the Continuum
More information#A67 INTEGERS 18 (2018) ON THE NESTED LOCAL POSTAGE STAMP PROBLEM
#A67 INTEGERS 18 (2018) ON THE NESTED LOCAL POSTAGE STAMP PROBLEM Edgar Federico Elizeche Department of Mathematics, St. Stephen s College, University of Delhi, Delhi 110007, India edgar.federico@elizeche.com
More informationFermat numbers and integers of the form a k + a l + p α
ACTA ARITHMETICA * (200*) Fermat numbers and integers of the form a k + a l + p α by Yong-Gao Chen (Nanjing), Rui Feng (Nanjing) and Nicolas Templier (Montpellier) 1. Introduction. In 1849, A. de Polignac
More informationTHE EXT ALGEBRA AND A NEW GENERALISATION OF D-KOSZUL ALGEBRAS
THE EXT ALGEBRA AND A NEW GENERALISATION OF D-KOSZUL ALGEBRAS JOANNE LEADER AND NICOLE SNASHALL Abstract. We generalise Koszul and D-Koszul algebras by introducing a class of graded algebras called (D,
More informationBOUNDS ON ZIMIN WORD AVOIDANCE
BOUNDS ON ZIMIN WORD AVOIDANCE JOSHUA COOPER* AND DANNY RORABAUGH* Abstract. How long can a word be that avoids the unavoidable? Word W encounters word V provided there is a homomorphism φ defined by mapping
More informationMATH 521, WEEK 2: Rational and Real Numbers, Ordered Sets, Countable Sets
MATH 521, WEEK 2: Rational and Real Numbers, Ordered Sets, Countable Sets 1 Rational and Real Numbers Recall that a number is rational if it can be written in the form a/b where a, b Z and b 0, and a number
More informationMTH 428/528. Introduction to Topology II. Elements of Algebraic Topology. Bernard Badzioch
MTH 428/528 Introduction to Topology II Elements of Algebraic Topology Bernard Badzioch 2016.12.12 Contents 1. Some Motivation.......................................................... 3 2. Categories
More informationRMT 2014 Power Round Solutions February 15, 2014
Introduction This Power Round develops the many and varied properties of the Thue-Morse sequence, an infinite sequence of 0s and 1s which starts 0, 1, 1, 0, 1, 0, 0, 1,... and appears in a remarkable number
More information11-711: Algorithms for NLP Homework Assignment #1: Formal Language Theory Solutions
-: Algorithms for NLP Homework Assignment #: Formal Language Theory Solutions Out: September 4, 204 Due: September 8, 204 Problem [5 points] Prove that, for any deterministic FSA A = (Q, Σ, δ, q 0, F,
More informationK 4 -free graphs with no odd holes
K 4 -free graphs with no odd holes Maria Chudnovsky 1 Columbia University, New York NY 10027 Neil Robertson 2 Ohio State University, Columbus, Ohio 43210 Paul Seymour 3 Princeton University, Princeton
More informationPS2 - Comments. University of Virginia - cs3102: Theory of Computation Spring 2010
University of Virginia - cs3102: Theory of Computation Spring 2010 PS2 - Comments Average: 77.4 (full credit for each question is 100 points) Distribution (of 54 submissions): 90, 12; 80 89, 11; 70-79,
More information