Timeline for palindromic subsequences
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 25, 2011 at 20:35 | vote | accept | Steve | ||
| Jan 25, 2011 at 20:23 | comment | added | Steve | That is a better wording; thanks. I unconsciously took "longest common subsequence" as an unbreakable term of art. | |
| Jan 24, 2011 at 0:56 | answer | added | user6976 | timeline score: 3 | |
| Jan 23, 2011 at 22:10 | answer | added | Anthony Quas | timeline score: 7 | |
| Jan 23, 2011 at 20:55 | comment | added | Matt Fayers | Better still, since there is trivially a longest common subsequence, say "among the longest common subsequences, there is at least one which is a palindrome". | |
| Jan 23, 2011 at 20:17 | comment | added | Joel David Hamkins | In Conjecture 1, I think you mean to say "which is a palindrome" rather than "that is a palindrome", since you don't want this part of the clause to delimit the prior "longest" property. That is, I think you are conjecturing that there is a longest common subsequence, which moreover has the additional property of being a palindrome. | |
| Jan 23, 2011 at 20:09 | history | asked | Steve | CC BY-SA 2.5 |