


default search action
Journal of Symbolic Computation, Volume 103
Volume 103, March 2021
- Christian Eder, Tommy Hofmann:
Efficient Gröbner bases computation over principal ideal rings. 1-13 - Gerhard Pfister, Andreas Steenpaß:
On the primary decomposition of some determinantal hyperedge ideal. 14-21 - Olha Shkaravska, Marko C. J. D. van Eekelen:
Polynomial solutions of algebraic difference equations and homogeneous symmetric polynomials. 22-45 - Yuki Nishida
, Sennosuke Watanabe, Yoshihide Watanabe:
Combinatorial algorithm for the computation of cyclically standard regular bracket monomials. 46-65 - Zhenyu Huang, Yao Sun, Dongdai Lin:
On the efficiency of solving Boolean polynomial systems with the characteristic set method. 66-94 - Taylor Brysiewicz
:
Necklaces count polynomial parametric osculants. 95-107 - David Krumm
, Nicole Sutherland:
Galois groups over rational function fields and Explicit Hilbert Irreducibility. 108-126 - Qing-Hu Hou, Yan-Ping Mu, Doron Zeilberger:
Polynomial reduction and supercongruences. 127-140 - Nasibeh Aramideh, Amir Hashemi, Werner M. Seiler:
Computing the resolution regularity of bi-homogeneous ideals. 141-156 - Kathlén Kohn
:
Coisotropic hypersurfaces in Grassmannians. 157-177 - Alejandro Ginory, Jongwon Kim:
Weingarten calculus and the IntHaar package for integrals over compact matrix groups. 178-200 - Ryuichi Sakamoto:
Lexicographic and reverse lexicographic quadratic Gröbner bases of cut ideals. 201-212 - Mehmet Yesil
:
A generalization of the Katzman-Zhang algorithm. 213-233 - Stephen Melczer
, Bruno Salvy
:
Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems. 234-279 - Sara Kalisnik
, Davorin Lesnik:
Symmetric polynomials in upper-bound semirings. 280-299

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.