2024-02-21 16:28:44 +0100 | edited question | Is there a plot function for ordered trees? Is there a plot function for ordered trees? My workflow is: # Integer compositions -> Dyck paths def dyckpath(c): |
2024-02-21 16:22:12 +0100 | edited question | Is there a plot function for ordered trees? Is there a plot function for ordered trees? My workflow is: # Integer compositions -> Dyck paths def dyckpath(c): |
2024-02-21 15:03:57 +0100 | marked best answer | Is there a plot function for ordered trees? My workflow is: You can print a dyckpath with But my question is related to: This gives me something which looks like Is there a plot function that knows this format and transforms it into a nice plot? Edit: Taking John's answer as a starting point I tried: This works, but note that you have to use additionally the function 'show'. According to this logic I would now expect that show(bit.plot()) would also work. Unfortunately, this is not the case. Then you get the error message: 'BinaryTrees_all_with_category.element_class' object has no attribute 'plot'. What can I do in this case? |
2024-02-21 15:03:39 +0100 | edited question | Is there a plot function for ordered trees? Is there a plot function for ordered trees? My workflow is: # Integer compositions -> Dyck paths def dyckpath(c): |
2024-02-20 22:14:03 +0100 | asked a question | Is there a plot function for ordered trees? Is there a plot function for ordered trees? My workflow is: c some Composition dyck = dyckpath(c) bit = dyck.to_b |
2024-02-20 22:00:39 +0100 | commented question | Finding all integer solutions of binary quadratic form Here you might find some functions that might be of interest for you (and, among other things, also encapsulate pari's q |
2023-11-05 02:32:33 +0100 | received badge | ● Notable Question (source) |
2023-07-08 06:52:08 +0100 | received badge | ● Famous Question (source) |
2023-07-04 17:50:44 +0100 | received badge | ● Notable Question (source) |
2023-07-04 17:50:44 +0100 | received badge | ● Popular Question (source) |
2023-05-28 13:02:40 +0100 | received badge | ● Notable Question (source) |
2023-05-28 13:02:40 +0100 | received badge | ● Popular Question (source) |
2023-04-05 11:44:13 +0100 | asked a question | Expanding a bivariate exponential generating function, part II Expanding a bivariate exponential generating function, part II From FrédéricC's answer to question 66860 I learned the f |
2023-03-29 12:20:04 +0100 | received badge | ● Notable Question (source) |
2023-03-10 23:32:52 +0100 | marked best answer | Expanding a bivariate exponential generating function Expanding an univariate exponential generating function can be done like this: For example egfExpand1(sec, 10) returns [1, 0, 1, 0, 5, 0, 61, 0, 1385, 0, 50521]. But how can I expand a bivariate exponential generating function? Say The expected output is an integer triangle (i.e. a list of integer lists). The example would return an unsigned version of A119879, which starts: Edit: Frédéric suggested the following solution, slightly rewritten here. The univariate case can also be written more elegantly with this method: |
2023-03-10 23:32:46 +0100 | commented answer | Expanding a bivariate exponential generating function Yes, this is quite nice. Thank you. |
2023-03-10 23:32:14 +0100 | edited question | Expanding a bivariate exponential generating function Expanding a bivariate exponential generating function Expanding an univariate exponential generating function can be don |
2023-03-10 15:50:19 +0100 | commented answer | Expanding a bivariate exponential generating function This is what I get: "TypeError: cannot coerce arguments: no canonical coercion from Lazy Power Series Ring over Univaria |
2023-03-09 22:38:21 +0100 | asked a question | Expanding a bivariate exponential generating function Expanding a bivariate exponential generating function Expanding an univariate exponential generating function can be don |
2023-03-09 22:25:03 +0100 | received badge | ● Famous Question (source) |
2023-03-08 14:48:20 +0100 | received badge | ● Notable Question (source) |
2022-10-30 15:12:07 +0100 | received badge | ● Famous Question (source) |
2021-12-06 15:32:34 +0100 | received badge | ● Popular Question (source) |
2021-10-21 23:44:22 +0100 | received badge | ● Nice Question (source) |
2021-10-21 23:44:18 +0100 | marked best answer | Redirecting the output of show() to a file? Consider the tree The output is a TeX-tikzpicture. I want to post-process this picture at the TeX level (for a motivation see my last question). To do so I have to manually copy and paste the output in some editor. It would be much easier if I could redirect the output into a text file and proceed from this file. Is it possible to do so? |
2021-10-21 23:43:53 +0100 | received badge | ● Popular Question (source) |
2021-10-20 20:36:55 +0100 | received badge | ● Popular Question (source) |
2021-06-09 16:50:45 +0100 | received badge | ● Popular Question (source) |
2021-06-03 10:17:14 +0100 | received badge | ● Notable Question (source) |
2021-02-03 18:35:40 +0100 | received badge | ● Popular Question (source) |
2020-12-16 15:56:50 +0100 | received badge | ● Popular Question (source) |
2020-12-11 20:07:15 +0100 | received badge | ● Popular Question (source) |
2020-12-11 20:06:58 +0100 | marked best answer | Seeking an efficient filter for partitions. From the docs: I find this parlance confusing. Obviously the partition [1, 1, 1, 1] has no max part = 2. Be that as it may, I do want to filter those partitions which greatest part is 2, so in the example would return What is the most efficient way to implement where MAX_PART is defined in my sense? |
2020-12-11 20:06:39 +0100 | received badge | ● Notable Question (source) |
2020-12-11 20:06:39 +0100 | received badge | ● Popular Question (source) |
2020-11-09 04:12:52 +0100 | received badge | ● Popular Question (source) |
2020-10-30 16:03:25 +0100 | received badge | ● Notable Question (source) |
2020-10-01 18:04:02 +0100 | received badge | ● Popular Question (source) |
2020-05-07 16:11:38 +0100 | received badge | ● Nice Question (source) |
2020-05-06 15:23:44 +0100 | asked a question | How to compute the alternating Hurwitz zeta function? Hi all! What is the best way to compute the alternating Hurwitz zeta function with Sage? Sage has an implementation of the Hurwitz zeta function, hurwitz_zeta(s,x), where s and x are complex, but not for the alternating Hurwitz zeta function. There is the formula https://dlmf.nist.gov/25.11#E35 albeit with significant restrictions on the domain of s and x. Which is a reliable way to implement hurwitz_alt_zeta(s,x) for general complex s and x, based on Sage functions? |
2020-04-07 17:19:05 +0100 | received badge | ● Popular Question (source) |
2020-02-24 04:48:20 +0100 | received badge | ● Notable Question (source) |
2019-10-28 03:59:42 +0100 | received badge | ● Self-Learner (source) |
2019-10-21 00:07:22 +0100 | answered a question | Hypergeometric Bug? The reason given in the documentation cited in the comment above is debatable. Read this section in DLMF https://dlmf.nist.gov/15.2#ii which deals with a similar case and says: "Because of the analytic properties [...] it is usually legitimate to take limits in formulas involving functions that are undefined for certain values of the parameters." For instance Maple gives the same values as Maxima. |
2019-10-20 20:11:38 +0100 | answered a question | How do I write and implement a program in Sage for Windows? Perhaps it is this what you want: After the installation of SageMath you will see a button "SageMath Notebook" on your desktop. Click, your default browser opens what is "Jupyter's home", click the button "New", choose SageMath, a new notebook opens and than you can write and save your programs without using the Console. This will look similar to https://github.com/davidlowryduda/not... |
2019-10-20 14:49:33 +0100 | edited answer | An analog to Pari's serlaplace Here a potential solution: It seems to me it would be worthwhile to include such a function in Sage. EDIT: After an edit this now works also with and returns 4z + 3z^2 + 16z^3 + 24z^4 + O(z^5), as desired. |