Items tagged with composition composition Tagged Items Feed

RandomCompositions:= proc(n::posint, k::posint)
local
C,
Compositions:= [seq(C-~1, C= combinat:-composition(n+k, k))],
Rand:= rand(1..nops(Compositions))
;
()-> Compositions[Rand()]
end proc:

R:= RandomCompositions(9,6):
n:= 2^13:
S:= 'R()' $ n:

 

I want to compile statistics each number in a sequence cannot  occur  over twice.

The sequences that do not fit the rule above must be ommitted.

The statistic is  Fermi-Dirac statistics.

confused the Bose-Einstein condensation and Fermi-Dirac statistics.

But the theory is right.

RandomCompositions:= proc(n::posint, k::posint)
local
C,
Compositions:= [seq(C-~1, C= combinat:-composition(n+k, k))],
Rand:= rand(1..nops(Compositions))
;
()-> Compositions[Rand()]
end proc:

R:= RandomCompositions(9,6):
n:= 10:
S:= 'R()' $ n;

S := [4, 1, 1, 1, 2, 0], [3, 2, 1, 1, 0, 2], [0, 1, 1, 0, 0, 7], [0, 1, 1, 5, 0, 2], [1, 0, 3, 1, 3, 1],

        [1, 3, 1, 1, 0, 3], [1, 4, 2, 0, 2, 0], [5, 0, 0, 3, 1, 0], [1, 1, 1, 4, 0, 2], [0, 1, 2, 1, 0, 5]

 

[4, 1, 1, 1, 2, 0] , [1, 1, 1, 4, 0, 2]  and [0, 1, 1, 5, 0, 2] , [0, 1, 2, 1, 0, 5]  are same number 

  but different order.

There are two same sequence. I want to  count  as one, and compile statistics the summation, and 

divide by 8.

the result

0=14/8

1=17/8

2=6/8

...

4=2/8

5=2/8

...

 

How to do composition for finite group?

is the composition like permutation group ?

if express finite group like permutation group,

if so, can elements in first row duplicate? can the second row duplicate?

however, do not know how to map when there are more than or equal two choices

my guess is that

if finite group can be expressed into permutation group

for example 3*3 matrx, each column is a permutation group

then there will be 3 permutation groups, when do composition , first column's permutation group composite with first column's permutation group , second composite with second etc

is it right?

can it be said colimit...

February 13 2014 rit 230

(A o C) o Colimit = (B o C) o Colimit

if known A, B, C and framework of Colimit

can it be said colimit?

 

Bonus, what are A,B,C? <- this can be not answered

i have a sense that substitution represent associative x*y and x+y

is my understanding correct?

if i change associative property to gcd and lcd,

how to do composition?

if associative is a pair of function, x+y, x*y

does it mean that non associative should also a pair

 

is it possible replace substitution with two operation x+y and x*y?

Good time friends,

Recently, I saw this link http://math.stackexchange.com/q/613753/8581. There we asked to find the functions f(x) ang g(x) by having both composition functions fog(x) and gof(x). I know what to do to find any of f(x) (or g(x)) if I am given fog(x) (or gof(x)) respectively, but I confess I don't know what to do with this one. Can Maple overcome this knid of problem? Thanks for your time.

hi 

if I have two partition Pi and Pi 'I want to know the decomposition of Pi' 

How can i specify the ground field C= complex numbers and calculate a primary decomposition for an ideal defined over C? For example

with(PolynomialIdeals):
J:= <x^2 +1 >;
PrimaryDecomposition(J);

should return x+I, x-I, but instead returns x^2+1

Forgive me for not using the "Maple Math" and "Maple Plot" commands.  I tried, but it says everything that I enter is an invalid expression so I'm just entering it as text...

I define two functions, they plot as expected:

 

f(x) := sin(x);

g(x) := 2*x;

plot( f(x) );

plot( g(x) );

 

Now I want to plot the composition:

 

plot( f(g(x)) ); 

 

Doesn't work!

Let

    G:=s->q(1-ps)^(-1)

be a generating function with 1-p=q in (0,1). Then the repeated function composition

    G(G(G(s)));(G@@3)(s);simplify(%);

gives me some concrete expression. What is the simplest way to get the general expression for 3 replaced by n?   

Page 1 of 1