4,299 reputation
1456
bio website
location
age
visits member for 2 years, 10 months
seen Dec 5 at 15:26

Sep
11
comment How to avoid nested With[]?
@MaThEmAtika Exactly.
Sep
10
comment How can I avoid label collisions?
Ok, I did, but my code still isn't code.
Sep
10
comment How can I avoid label collisions?
Weird, I can't upload images. The toolbar is gone! What should I do? I've tried restarting safari.
Aug
29
comment What is the fastest way to count square-free words?
When I run AbsoluteTiming[sf = squareFreeTernaryWordsC[55];] CompiledFunction::cflist: Nontensor object generated; proceeding with uncompiled evaluation. >>
Aug
29
comment What is the fastest way to count square-free words?
For maximal compression, instead of a list of words, we should be using a tree. Does anyone know if there any Internal` tree implementations that are packed and quickly traversable?
Aug
29
comment Help with Permutations
Can you upload the tsv file compressed?
Aug
28
comment Determining all possible traversals of a tree
@LeonidShifrin ok thank you!
Aug
28
comment Determining all possible traversals of a tree
An unranking algorithm constructs the ith object in an underlying list given rank i. Is there a way to extend your solution to generate the ith transversal of the tree?
Aug
28
comment How can I efficiently check if a graph is unit distance?
nice references, thanks @J.M.
Aug
28
comment What is the fastest way to count square-free words?
If you can get past 70 with this method, I'll award the points now.
Aug
28
comment How can I efficiently check if a graph is unit distance?
I prefer the iterative method because of speed but also because you can see the local minima as interesting embeddings in themselves.
Aug
28
comment How can I efficiently check if a graph is unit distance?
Running my original function many times works much faster than this: Quiet@Reap[ Table[i = UnitDistanceQ[m]; If[i =!= Null, Sow[i]], {100}]][[2]] However the coordinates are not exact solutions, is there a way to rederive them?
Aug
27
comment How can I efficiently check if a graph is unit distance?
In my code g is the adj matrix, bad name i guess.
Aug
27
comment How can I efficiently check if a graph is unit distance?
This is a nice approach, but I'm trying want a general approximation algorithm: a function to run on any and all graphs.
Aug
27
comment How can I efficiently check if a graph is unit distance?
It lays out a graph with random vertex positions and then iteratively moves them to decrease the energy functional F which makes every edge become unit distance for instance: Quiet@Reap[ Table[i = UnitDistanceQ[m]; If[i =!= Null, Sow[i]], {100}]][[2]]
Aug
27
comment How can I efficiently check if a graph is unit distance?
I know about GraphData and it is a nice repository, but does not answer the question.
Aug
27
comment What is the fastest way to count square-free words?
The difficulty in enumeration is memory, the list becomes so long that Mathematica dies around n=63.
Aug
27
comment Where can I find a list of functions, specifically views, that can be translated to a C standalone executable?
mathematica.stackexchange.com/questions/1096/…
Aug
27
comment Where can I find a list of functions, specifically views, that can be translated to a C standalone executable?
I have often wished for this too! The ability to export mathematica dynamic gui code into html5 would be awesome.
Aug
24
comment What is the fastest way to count square-free words?
Correct, I want to count them.