2017-04-03 16:10:03 -0500 | received badge | ● Famous Question (source) |

2015-03-21 15:53:56 -0500 | received badge | ● Popular Question (source) |

2014-06-29 09:56:35 -0500 | received badge | ● Famous Question (source) |

2014-06-29 09:56:35 -0500 | received badge | ● Popular Question (source) |

2014-06-29 09:56:35 -0500 | received badge | ● Notable Question (source) |

2014-06-29 04:02:44 -0500 | received badge | ● Popular Question (source) |

2014-06-29 04:02:44 -0500 | received badge | ● Notable Question (source) |

2014-06-29 04:02:44 -0500 | received badge | ● Famous Question (source) |

2014-04-23 12:12:53 -0500 | received badge | ● Notable Question (source) |

2014-01-04 10:48:30 -0500 | received badge | ● Notable Question (source) |

2013-03-27 06:30:07 -0500 | received badge | ● Popular Question (source) |

2012-12-12 04:49:06 -0500 | received badge | ● Famous Question (source) |

2012-11-26 03:13:59 -0500 | received badge | ● Famous Question (source) |

2012-11-25 12:05:07 -0500 | received badge | ● Popular Question (source) |

2012-02-17 05:56:36 -0500 | received badge | ● Notable Question (source) |

2011-09-22 19:17:23 -0500 | received badge | ● Notable Question (source) |

2011-06-08 04:27:20 -0500 | received badge | ● Popular Question (source) |

2011-06-03 01:53:36 -0500 | received badge | ● Popular Question (source) |

2010-10-14 16:11:12 -0500 | received badge | ● Student (source) |

2010-10-14 16:11:11 -0500 | received badge | ● Editor (source) |

2010-09-19 20:15:05 -0500 | asked a question | how to change the subset function give subset?? get the code how to make change's to file and take subset with more conditions to the same code run it I triend running in python but some module's are missing or there are some error's possed I tried to find module's asked but unable to find like banner,version,prandom Help me what to do to Re use the subset with some more contions to it rewritten by me. |

2010-09-18 02:37:03 -0500 | asked a question | subsets with condition given a collection say ([(0, 1), (0, 2), (0, 4), (3, 5)],[(0, 1), (0, 2), (0, 5), (3, 4)],[(0, 1), (0, 4), (0, 5), (2, 3)],[(0, 2), (0, 4), (0, 5), (1, 3)],[(0, 1), (1, 2), (1, 5), (3, 4)] } How to obtain subset or sub collection say size 3 or as specified by user such that intersection between (first internal set and second internal set) is one set and (first internal set and Third internal set) is zero sets ,(second internal set and Third internal set) is one set . That is like ([(0, 1), (0, 2), (0, 4), (3, 5)],[(0, 1), (1, 3), (1, 5), (2, 4)],[(0, 4), (1, 3), (2, 5),(4,5)] The number of intersection between sets in each to be specified by user. How to do without enumerating all subsets any hint. |

2010-09-18 02:35:52 -0500 | asked a question | subsets with condition given a collection say ([(0, 1), (0, 2), (0, 4), (3, 5)],[(0, 1), (0, 2), (0, 5), (3, 4)],[(0, 1), (0, 4), (0, 5), (2, 3)],[(0, 2), (0, 4), (0, 5), (1, 3)],[(0, 1), (1, 2), (1, 5), (3, 4)] } How to obtain subset or sub collection say size 3 or as specified by user such that intersection between (first internal set and second internal set) is one set and (first internal set and Third internal set) is zero sets ,(second internal set and Third internal set) is one set . That is like ([(0, 1), (0, 2), (0, 4), (3, 5)],[(0, 1), (1, 3), (1, 5), (2, 4)],[(0, 4), (1, 3), (2, 5),(4,5)] The number of intersection between sets in each to be specified by user. How to do without enumerating all subsets any hint. |

2010-09-18 00:58:20 -0500 | asked a question | where to get python coding tutorial for beginners link PDF reading a tutorial on writing Python code Link to PDF file |

2010-09-17 23:00:14 -0500 | asked a question | collection of sets How to create a collection of sets and how find its subcollections of specified size ordered pairs for example say a collection of set {[1,2,3],[3,2,4],[1,2,4]} subcollection of size 2 {[1,2,3],[3,2,4]} {[3,2,4],[1,2,3]} {[3,2,4],[1,20,4]} {[1,20,4],[3,2,4]} {[1,2,3],[1,2,4]} {[1,2,4],[1,2,3]} Is it possible to do this program below without finding all subsets sage: s = set([1,3,"two"]) # make a set from a list of items sage: t = list(subsets(s)); t # this is the list of all subsets of s [[], [1], [3], [1, 3], ['two'], [1, 'two'], [3, 'two'], [1, 3, 'two']] sage: for x in subsets(s): # subsets(s) is an iterator, so you can loop through it
....: if len(x) == 2: # and extract items of a specified length
....: print x
....: |

2010-09-17 02:23:50 -0500 | asked a question | how to remove duplicate elements in a list From a list L = ([1,2,3,4],[3,5,6,7],[7,8,9,10],[1,2,3.4]) remove duplicate sets here [1,2,3,4] has occurred twice and put only one making L = ([1,2,3,4],[3,5,6,7],[7,8,9,10]) |

2010-09-17 01:38:04 -0500 | asked a question | collection of sets How to create a collection of sets and how find its subcollections of specified size |

2010-09-17 00:53:56 -0500 | asked a question | sublist of a given list of objects Sublist of specified size of a given list of graph objects |

2010-09-16 23:46:00 -0500 | commented answer | sub list like subsets find all sublists of set of a specified size say 3,4,5... from a given given list of sets |

2010-09-16 23:08:08 -0500 | asked a question | sub list like subsets how to take lists of size from a list like subsets of size example L = ([1,2,3,4],[3,5,6,7],[7,8,9,10]) From the above list find sublists of size 2 ([1,2,3,4],[3,5,6,7]) ([1,2,3,4],[7,8,9,10]) ([3,5,6,7],[7,8,9,10]) subsets can also be size 3,4,5 as specified |

2010-09-14 19:17:45 -0500 | asked a question | Enumerate isomrphic subgraphs of graph vertex labeled Enumerate all isomorphic subgraphs of given graph given the subgraph adjacency matrix |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.