sriram's profile - activity

Step 1: I want to take a number n as input from user

Step 2: We form the set S consisting of elements from 0 to n*(2^{n-1})

Step 3: Now I pick each possible two-element subsets of S and store it in P.

Step 4: Now I need to pick n*(2^{n-1}) two-element subsets from P such that each number that occurs in that set occurs exactly n times neither less nor more and put them all in a list.

Example

n = 2
n*(2^{n-1}) = 2*(2^{2-1}) = 4
S = {0,1,2,3,4}
p = {(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)}

Step 4 One element which satisfies condition of step 4; HERE n = 2.

{(0,1),(1,2),(2,3),(0,3)} which has 2*(2^{n-1}) = 2*(2^{2-1}) = 4 elements.

Now see in the above set

• 0 occurred n=2 times only in (0,1) and (0,3) only
• 1 occurred n=2 times only in (0,1) and (1,2) only
• 2 occurred n=2 times only in (1,2) and (2,3) only
• 3 occurred n=2 times only in (2,3) and (0,3) only

Similarly we may get for {(0,1),(1,4),(4,2),(2,0)} we can easily verify like above.

Now based on n the number of elements size etc will vary.

Kindly help if possible any one.

How to find all maximum length lists with a nested and display?

L=[[1,2,3,4],[1,2],[1,4,5,6],[9,10,12,8],[7,3],[4,5,6]]

Now i need to find the maximum length lists in this

that the program has to display

[1,2,3,4] [1,4,5,6] [9,10,12,8] and say maximum length is 4
I will input some arbitrary nested list L like above and it has to do this As i am novice to sagemath kind help

Or can we sort the nested list based on its inner lists lengths

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.

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.

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.

reading a tutorial on writing Python code Link to PDF file

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 ....:
[1, 3] [1, 'two'] [3, 'two']

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])

How to create a collection of sets and how find its subcollections of specified size

Sublist of specified size of a given list of graph objects

find all sublists of set of a specified size say 3,4,5... from a given given list of sets

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

Enumerate all isomorphic subgraphs of given graph given the subgraph adjacency matrix