Tag Info

Delete elements less than the last largest element

A variant using FoldList: Union@Rest@FoldList[If[#2[[2]] > #1[[2]], #2, #1] &, {0, 0}, list] {{1, 170.93}, {3, 174.08}, ...
• 27.9k

Delete elements less than the last largest element

Using IncreasingFilter by Sander Huisman ...
• 81.7k
1 vote

Check if number is in list

list1 = {{1, 2, 3, 4, 5}, {1, 2, 3, 4, 5, 6, 7}, {1, 2, 3, 4, 5, a}}; list2 = {{1, 2, 3, 4, 5}, {1, 2, 3, 4, 5, a}, {1, 2, 3, 4, 5, -1}}; Using ...
• 27.9k
1 vote

How can I print only the lines for a file that contain consecutive digits?

string = "123 321 567 765 124 568"; Using StringSplit and Select: ...
• 27.9k
1 vote

...
• 81.7k

Check if number is in list

list = { {1, 2, 3, 4, 5}, {1, 2, 3, 4, 5, 6, 7}, {1, 2, 3, 4, 5, a}}; 1. Using LookupPart by Richard Hennigan (Wolfram ...
• 81.7k

Simplifying products of DiracDelta

Here's an extension of @Ulrich's solution, taking into account the Jacobian of the transformation: ...
• 239k
1 vote

Flattening the output of Solve[]

expr = Solve[y[x] == x^2 + c, c]; Using Query Query[Flatten, {Keys, Values}] @ expr {c, -...
• 81.7k

Canonical way to map a function to diagonal elements of a square matrix?

A = {{E, 0, 0}, {0, E, 0}, {0, 0, E}}; Using SubsetMap: ...
• 27.9k
1 vote

How to compile the code for generate Pythagorean_triple?

A variation of Mr.Wizard, a little faster: ...
• 15.6k
1 vote

...
• 81.7k

Any built-in function to generate successive sublists from a list?

Using AccumulateApply by Ian Ford and Jon McLoone ...
• 81.7k
1 vote

Creating a list of lists as a function of a list

Inspired by @ubpdqn's answer, I propose the following variant: ...
• 27.9k

Approximate value for the area between the curve

Using IntegralApproximationPlot by Dennis M Schneider ...
• 81.7k
1 vote

SubsetQ[] without ignoring duplicates

Using MultisetIntersection by Robert B. Nachbar (Wolfram Solutions) ...
• 81.7k
1 vote

Creating a list of lists as a function of a list

f[a_] := MapAt[-1 &, Table[1, Length[a]], #] & @@@ Position[a, -1] f[a : {1 ..}] := f[-a] f @ {-1, -1, 1} {{-1, 1, ...
• 81.7k
1 vote

A fast, robust DropWhile

Using DropWhile by Sander Huisman DropWhile = ResourceFunction["DropWhile"]; DropWhile[{2, 4, 6, 1, 2, 3}, EvenQ] {...
• 81.7k

How to get multiplication of the elements of a specific list/matrix

list = {a, b, c, d}; Using AccumulateApply by Ian Ford and Jon McLoone ...
• 81.7k

Are there contributed Mathematica programs which yield the normal form and Lyapunov coefficients of an ODE at a bifurcation point, in dimens 3 or more

This is not an answer to the question or at least only a partial one. It may help to get started though. A Hopf bifurcation at an equilibrium, if I understand correctly, happens when the Jacobian has ...
• 59.6k
Accepted

Are there contributed Mathematica programs which yield the normal form and Lyapunov coefficients of an ODE at a bifurcation point, in dimens 3 or more

I have no method but Let's refine the script you provided to ensure it handles the computation of the L1 coefficient and the normal form correctly. I'll integrate improvements while maintaining the ...
• 1,049

...
• 81.7k

Use Mathematica to calculate the area enclosed between two curves

Using 3 resource functions by Wolfram|Alpha Math Team: ...
• 81.7k

...
• 81.7k

How to replace identical positions in two different lists

la = {1, 2, 3, 4, 5}; lb = {a, b, c, d, e}; p = {1, 5}; Using SubsetMap (new in 12.0) ...
• 81.7k

How to group lists that own one common element?

list = {{1, 2}, {3, 4}, {2, 5}, {2, 6}, {5, 4}, {9, 7}}; Using IntersectingQ (new in 10.0) ...
• 81.7k

Restricted accumulation of values

Using Min: data = {-1050, 50, 1001, 1950, 1950, 1950, 525, 0}; FoldList[Min[#1 + #2, #2] &, data] -> {-1050, -1000, 1, ...
• 62.8k