Re: [sage-devel] Efficiency of Groebner basis for constraints of the form $(a_i x_i+b_i)(a_j x_j+b_j)=0$

2024-01-31 Thread Georgi Guninski
On Wed, Jan 31, 2024 at 10:54 PM Dima Pasechnik wrote: > > Do you have exactly one (or at most) relation for any pair of variables? Can > one have i=j ? > > Or it's the notation which should be improved? > The number of relations for a pair of variables can be arbitrary. i=j appears irrelevant,

Re: [sage-devel] ChatGPT article

2024-01-31 Thread 'Justin C. Walker' via sage-devel
I apologize for this. No idea how sage snuck into the addressing. > On Jan 31, 2024, at 16:24 , 'Justin C. Walker' via sage-devel > wrote: > > A quick read, about using ChatGPT (or LLM-based AI) to assist in teaching > Calculus to undergrads (or, as my dad used to call it “pouring electricity

Re: [sage-devel] Efficiency of Groebner basis for constraints of the form $(a_i x_i+b_i)(a_j x_j+b_j)=0$

2024-01-31 Thread Dima Pasechnik
On 31 January 2024 16:42:39 GMT, Georgi Guninski wrote: >This is based on numerical experiments in sage. > >Let $K$ be a ring and define the ideal where each polynomial >is of the form $(a_i x_i+b_i)(a_j x_j+b_j)=0$ for constant $a_i,b_i,a_j,b_j$. Do you have exactly one (or at most) relation

[sage-devel] Efficiency of Groebner basis for constraints of the form $(a_i x_i+b_i)(a_j x_j+b_j)=0$

2024-01-31 Thread Georgi Guninski
This is based on numerical experiments in sage. Let $K$ be a ring and define the ideal where each polynomial is of the form $(a_i x_i+b_i)(a_j x_j+b_j)=0$ for constant $a_i,b_i,a_j,b_j$. >Q1 Is it true that for constraints of this form the groebner basis is >efficiently computable? By "efficie

Re: [sage-devel] Sphinx directives in upper case?

2024-01-31 Thread TB
On 25/01/2024 7:06, Kwankyu Lee wrote: Hi, Our developer guide dictates to write Sphinx directives in upper case. So for example, ".. MATH::" instead of ".. math::". By the way, it seems that Sphinx community seems to regard low