Nemo/Hecke
From MaRDI portal
Publication:5119935
DOI10.1145/3087604.3087611zbMath1457.68325arXiv1705.06134OpenAlexW3104644146MaRDI QIDQ5119935
No author found.
Publication date: 9 September 2020
Published in: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.06134
computer algebracomputational number theorydesign of symbolic computation packages and systemsimplementation and performance tuning
Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to number theory (11-04)
Related Items
Computation of lattice isomorphisms and the integral matrix similarity problem, Quantum lattice enumeration and tweaking discrete pruning, Interpretable exact linear reductions via positivity, \(k\)-point semidefinite programming bounds for equiangular lines, Solving p-adic polynomial systems via iterative eigenvector algorithms, On property (T) for \(\Aut(F_n)\) and \(\mathrm{SL}_n(\mathbb{Z})\), Multi-experiment Parameter Identifiability of ODEs and Model Theory, Differential Elimination for Dynamical Models via Projections with Applications to Structural Identifiability, Scarcity of congruences for the partition function, Computing Galois groups of Ehrhart polynomials in OSCAR, Finite subgroups of automorphisms of K3 surfaces, On parabolic subgroups of symplectic reflection groups, Exact hierarchical reductions of dynamical models via linear transformations, On the computation of general vector-valued modular forms, A bi-directional method for evaluating integrals involving higher transcendental functions. HyperRAF: a Julia package for new hyper-radial functions, Computing characteristic polynomials of hyperplane arrangements with symmetries, On the computation of overorders, On the construction of class fields, Norm relations and computational problems in number fields, Lattice Green’s Functions for High-Order Finite Difference Stencils, Computing isomorphisms between lattices, Towards practical key exchange from ordinary isogeny graphs, Efficient Gröbner bases computation over principal ideal rings, Computation of Tight Enclosures for Laplacian Eigenvalues, On the p‐adic Stark conjecture at s=1 and applications, On the computation of the endomorphism rings of abelian surfaces, Pair correlation estimates for the zeros of the zeta function via semidefinite programming, Exact inference for a class of hidden Markov models on general state spaces, The maximal discrete extension of the Hermitian modular group, Algorithmically solving the tadpole problem, Towards the classification of symplectic linear quotient singularities admitting a symplectic resolution, Exact Semidefinite Programming Bounds for Packing Problems, Primes in arithmetic progressions and semidefinite programming, Imaginary multiquadratic number fields with class group of exponent $3$ and $5$, On ideal class group computation of imaginary multiquadratic fields, Effective computations of the Atiyah-Bott formula
Uses Software
