mastodon.ie is one of the many independent Mastodon servers you can use to participate in the fediverse.
Irish Mastodon - run from Ireland, we welcome all who respect the community rules and members.

Administered by:

Server stats:

1.5K
active users

#polynomials

0 posts0 participants0 posts today

**A Hyper-Catalan Series Solution to Polynomial Equations, and the Geode**

“_....the hyper-Catalan numbers 𝐶𝐦 count the number of subdivisions of a polygon into a given number of triangles, quadrilaterals, pentagons, etc. (its type 𝐦), and we show that their generating series solves a polynomial equation of a particular geometric form. This solution is straightforwardly extended to solve the general univariate polynomial equation._”

Wildberger, N. J. and Rubine, D. (2025) ‘A Hyper-Catalan Series Solution to Polynomial Equations, and the Geode’, The American Mathematical Monthly, pp. 1–20. doi: doi.org/10.1080/00029890.2025..

I ran across the Wikipedia article on Littlewood polynomials. It has a plot of all the roots of the degree 15 polynomials, that looks very nice. I thought I would create an animation showing the roots for degree 1, degree 2, etc. I also thought maybe I'd add a plot of the roots for something with degree higher than 15. Here is the degree 16 plot (this is reduced to 25% of the original image). It took 2 hours in Sage on my laptop, so I might try 17, even 18 - who knows? I have the thought that I ought to be able to reduce the precision, and this ought to speed things up a lot (since for plotting much lower precision than the default is needed). I don't particularly like blue, though: I'll have to try other colors.
en.wikipedia.org/wiki/Littlewo

In #mathematics, a polynomial is a #mathematicalExpression consisting of #indeterminates (also called #variables) and #coefficients, that involves only the operations of #addition, #subtraction, #multiplication and #exponentiation to #nonnegativeInteger powers, and has a finite number of #terms. An example of a polynomial of a single indeterminate x is x2 − 4x + 7. An example with three indeterminates is x3 + 2xyz2 − yz + 1. #Polynomials appear in many areas of mathematics and science.

`We show that the Weierstrass method, like the well known #Newton method, is not generally convergent: there are open sets of #polynomials p of every degree d≥3 such that the dynamics of the Weierstrass method applied to p exhibits attracting periodic orbits.`

arxiv.org/abs/2004.04777

arXiv.orgThe Weierstrass root finder is not generally convergentFinding roots of univariate polynomials is one of the fundamental tasks of numerics, and there is still a wide gap between root finders that are well understood in theory and those that perform well in practice. We investigate the root finding method of Weierstrass, a root finder that tries to approximate all roots of a given polynomial in parallel (in the Jacobi version, i.e., with parallel updates). This method has a good reputation for finding all roots in practice except in obvious cases of symmetry, but very little is known about its global dynamics and convergence properties. We show that the Weierstrass method, like the well known Newton method, is not generally convergent: there are open sets of polynomials $p$ of every degree $d \ge 3$ such that the dynamics of the Weierstrass method applied to $p$ exhibits attracting periodic orbits. Specifically, all polynomials sufficiently close to $Z^3 + Z + 180$ have attracting cycles of period $4$. Here, period $4$ is minimal: we show that for cubic polynomials, there are no periodic orbits of length $2$ or $3$ that attract open sets of starting points. We also establish another convergence problem for the Weierstrass method: for almost every polynomial of degree $d\ge 3$ there are orbits that are defined for all iterates but converge to $\infty$; this is a problem that does not occur for Newton's method. Our results are obtained by first interpreting the original problem coming from numerical mathematics in terms of higher-dimensional complex dynamics, then phrasing the question in algebraic terms in such a way that we could finally answer it by applying methods from computer algebra.

@rwxrwxrwx
I wrote this function #'LAMBDAISE that turns a cl-buchberger:polynomial into an unevaluated lambda form at run time. I feel like this is going to have a more elegant expression, but I figure if
the lambdaiseing is happening offline it's okay. What do you think? What do other #CommonLisp #lisp users think? #polynomials will use for synth later

#100daystooffload on codes for turning symbolic polynomials into lambda forms
gopher.tildeverse.org/tilde.cl

@82mhz @thankfulmachine @AlgoCompSynth

Learn how to symbolically #solve #math equations using computer #algebra in #Python: With the release of #SymPy 1.12, the symbolic #equation #solving guide pages I wrote are all live in the latest version of the documentation. I wrote ten pages on topics such as systems of #equations, ordinary #differential equations, #polynomials, #inequalities, #matrix equations, and Diophantine equations, and #numerical solving. docs.sympy.org/latest/guides/s

docs.sympy.orgSolve Equations - SymPy 1.12 documentation