## Registered User | |
---|---|

real name | Sébastien Palcoux |

member since | 2013-07-01 07:09:03 +0100 |

last seen | 2023-02-12 11:01:07 +0100 |

website | https://sites.google.com/vi... |

location | Beijing, China |

age, years | 41 |

todays unused votes | 30 votes left |

Research Assistant Professor at the Beijing Institute of Mathematical Sciences and Applications (BIMSA), Huairou District, Beijing, China (it is sponsored by Tsinghua University and directed by Prof. Shing-Tung Yau).

Research interest: Operator algebras, von Neumann algebras, subfactors, planar algebras, algebraic combinatorics, finite group theory, fusion categories, vertex operators algebras, infinite dimensional Lie algebras, conformal field theory, noncommutative geometry.

I'm mainly active on MathOverflow.

116

0

- groebner_basis× 44
- ideal× 34
- PolynomialRing× 34
- cython× 33
- equations× 31
- polynomial× 20
- matrix× 17
- bug× 15
- lift× 14
- normal-basis× 13
- meta× 10
- beginner× 10
- spyx× 10
- attach× 9
- diophantine× 9
- positive× 9
- quick× 9
- windows10× 9
- partition× 9
- solutions× 8
- finite_ring× 8
- sage× 7
- tree× 6
- recursion× 6
- numerical× 5
- import× 5
- command× 5
- polynomials× 5
- ask-sage× 5
- determinant× 5
- block_matrix× 5
- jordan_form× 5
- solve× 3
- graphics× 3
- 64bit× 3
- projection× 3
- points× 3
- callable× 3
- problem× 3
- image× 3
- computation× 3
- 2Dplot× 3
- positivity× 3

● Popular Question
×
25

● Self-Learner × 2

● Supporter × 1 ● Editor × 1 ● Scholar × 1

● Autobiographer × 1

● Good Question × 4

● Organizer × 1 ● Associate Editor × 1

- Too long to compute the Groebner basis of a not so big system
- Why SageMath cannot inverte this matrix?
- Is it hopeless to compute a Groebner basis for this big system?
- All the solutions of a polynomial system over a finite ring
- How to get a solution from an ideal in a polynomial ring when it is nonzero codimensional?
- Polynomial system without solution in char. 0: classification of char. p with solution
- Is map_reduce working for parallel computing? How?
- Groebner basis step by step
- Quick (trivial) Groebner basis but too long lift of one
- How to use a GPU for HPC?
- The number of solutions of a polynomial system using a Gröbner basis
- Why spyx translates sage.all (via Google) ?
- How to install SageMath on CentOS?
- What are all the types we can declare in Cython?
- Would you agree to migrate to StackExchange if it becomes open-source ? (if it's technically possible)
- How quickly minimizing $M*x-v$ (numerically) ?
- Solve a "big" polynomial system numerically
- Substitution of a list of variables
- About Cython and the main Sage commands
- A (beginner) problem with Cython, II
- How well print a list of matrices ?
- How to implement a parallelization?
- Problem with %attach for SageMath 9.0 on Windows 10 with .spyx files
- How to compute on Cython mode with 64-bit int?
- Cython problem with map-reduce

- Groebner basis step by step
- All the solutions of a polynomial system over a finite ring
- The number of solutions of a polynomial system using a Gröbner basis
- How to implement a parallelization?
- Quick (trivial) Groebner basis but too long lift of one
- How to use a GPU for HPC?
- Why spyx translates sage.all (via Google) ?
- How to install SageMath on CentOS?
- Would you agree to migrate to StackExchange if it becomes open-source ? (if it's technically possible)
- What are all the types we can declare in Cython?
- How quickly minimizing $M*x-v$ (numerically) ?
- Substitution of a list of variables
- Solve a "big" polynomial system numerically
- About Cython and the main Sage commands
- Problem with %attach for SageMath 9.0 on Windows 10 with .spyx files
- How well print a list of matrices ?

● Self-Learner × 2

- Determinant and missing denominator
- Polynomial system without solution in char. 0: classification of char. p with solution

- All the solutions of a polynomial system over a finite ring
- How to get a solution from an ideal in a polynomial ring when it is nonzero codimensional?
- Problem with precompute and append in parallel computing
- Polynomial system without solution in char. 0: classification of char. p with solution
- Can we avoid to fall back to very slow toy implementation in the computation of Groebner basis under a finite field of large characteristic?
- Quick (trivial) Groebner basis but too long lift of one
- Why spyx translates sage.all (via Google) ?
- How well print a list of matrices ?
- Would you agree to migrate to StackExchange if it becomes open-source ? (if it's technically possible)
- Substitution of a list of variables
- Checking whether a real polynomial of 21 variables is non-negative
- Why SageMath cannot inverte this matrix?
- The number of solutions of a polynomial system using a Gröbner basis

● Supporter × 1 ● Editor × 1 ● Scholar × 1

● Autobiographer × 1

- Quick (trivial) Groebner basis but too long lift of one
- How well print a list of matrices ?
- How to install SageMath on CentOS?
- Solve a "big" polynomial system numerically
- What are all the types we can declare in Cython?
- Substitution of a list of variables
- How quickly minimizing $M*x-v$ (numerically) ?

● Good Question × 4

- Substitution of a list of variables
- Quick (trivial) Groebner basis but too long lift of one
- Why spyx translates sage.all (via Google) ?

● Organizer × 1 ● Associate Editor × 1

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.