Mark van Hoeij

ORCID: 0000-0003-0789-1523
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Polynomial and algebraic computation
  • Algebraic Geometry and Number Theory
  • Advanced Numerical Analysis Techniques
  • Advanced Algebra and Geometry
  • Coding theory and cryptography
  • Numerical methods for differential equations
  • Cryptography and Residue Arithmetic
  • Analytic Number Theory Research
  • Nonlinear Waves and Solitons
  • Commutative Algebra and Its Applications
  • Black Holes and Theoretical Physics
  • Advanced Differential Equations and Dynamical Systems
  • graph theory and CDMA systems
  • Advanced Combinatorial Mathematics
  • BIM and Construction Integration
  • Homotopy and Cohomology in Algebraic Topology
  • Advanced Topics in Algebra
  • Cryptography and Data Security
  • Advanced Mathematical Identities
  • Algebraic and Geometric Analysis
  • semigroups and automata theory
  • Algebraic structures and combinatorial models
  • Parallel Computing and Optimization Techniques
  • Geometric and Algebraic Topology
  • Matrix Theory and Algorithms

Florida State University
2014-2024

Breast International Group
2024

Institut national de recherche en informatique et en automatique
2016

Université Paris-Saclay
2016

Inria Saclay - Île de France
2016

Florida Department of State
2012

Florida A&M University - Florida State University College of Engineering
2011

Framingham State University
2010

Radboud University Nijmegen
1994-1997

We calculate 3-loop master integrals for heavy quark correlators and the QCD corrections to $ρ$-parameter. They obey non-factorizing differential equations of second order with more than three singularities, which cannot be factorized in Mellin-$N$ space either. The solution homogeneous is possible terms convergent close integer power series as $_2F_1$ Gauß hypergeometric functions at rational argument. In some cases, this type can mapped complete elliptic This class appears next one arising...

10.1063/1.4986417 article EN Journal of Mathematical Physics 2018-06-01

10.1016/j.jsc.2025.102419 article EN Journal of Symbolic Computation 2025-01-01

10.1006/jsco.1997.0151 article EN publisher-specific-oa Journal of Symbolic Computation 1997-11-01

10.1016/s0022-4049(99)00008-0 article EN Journal of Pure and Applied Algebra 1999-06-01

10.1016/s0167-2789(01)00156-7 article EN Physica D Nonlinear Phenomena 2001-05-01

10.1006/jnth.2001.2763 article EN publisher-specific-oa Journal of Number Theory 2002-08-01

The Riemann theta function is a complex-valued of $g$ complex variables. It appears in the construction many (quasi-)periodic solutions various equations mathematical physics. In this paper, algorithms for its computation are given. First, formula derived allowing pointwise approximation functions, with arbitrary, user-specified precision. This used to construct uniform formula, again arbitrary

10.1090/s0025-5718-03-01609-0 article EN Mathematics of Computation 2003-12-19

Let $K$ be a number field, and let $E/K$ an elliptic curve over $K$. The Mordell--Weil theorem asserts that the $K$-rational points $E(K)$ of $E$ form finitely generated abelian group. In this work, we complete classification finite groups which appear as torsion subgroup for cubic field. To do so, determine on modular curves $X_1(N)$ \[N = 21, 22, 24, 25, 26, 28, 30, 32, 33, 35, 36, 39, 45, 65, 121.\] As part our analysis, list $N$ $J_0(N)$ (resp., $J_1(N)$, resp., $J_1(2,2N)$) has rank 0....

10.2140/ant.2021.15.1837 article EN Algebra & Number Theory 2021-11-01

10.1006/jsco.1996.0084 article EN publisher-specific-oa Journal of Symbolic Computation 1997-02-01

10.1016/s0022-314x(01)92763-5 article EN Journal of Number Theory 2002-08-01

10.1006/jsco.1994.1051 article EN publisher-specific-oa Journal of Symbolic Computation 1994-10-01

Article Free Access Share on Rational solutions of linear difference equations Author: Mark van Hoeij Department Mathematics, Florida State University, Tallahassee, FL FLView Profile Authors Info & Claims ISSAC '98: Proceedings the 1998 international symposium Symbolic and algebraic computationAugust Pages 120–123https://doi.org/10.1145/281508.281592Online:01 August 1998Publication History 39citation236DownloadsMetricsTotal Citations39Total Downloads236Last 12 Months11Last 6 weeks3 Get...

10.1145/281508.281592 article EN 1998-08-01

A new algorithm is presented for factoring bivariate approximate polynomials over C[x, y]. Given a particular polynomial, the method constructs nearby composite if one exists, and its irreducible factors. Subject to conjecture, time produce factors polynomial in degree of problem. This has been implemented Maple, demonstrated be efficient numerically robust.

10.1145/384101.384114 article EN 2001-07-01

We prove that van Hoeij's original algorithm to factor univariate polynomials over the rationals runs in polynomial time, as well natural variants. In particular, our approach also yields time complexity results for bivariate a finite field.

10.5802/jtnb.655 article EN Journal de Théorie des Nombres de Bordeaux 2009-01-01

We show that almost all the linear differential operators factors obtained in analysis of n-particle contributions 's susceptibility Ising model for n ⩽ 6 are associated with elliptic curves. Beyond simplest which homomorphic to symmetric powers second order operator complete integral E, and third Z2, F2, F3, can actually be interpreted as modular forms curve model. A last order-4 globally nilpotent is not reducible this curve, form scheme. This shown correspond a natural generalization...

10.1088/1751-8113/44/4/045204 article EN Journal of Physics A Mathematical and Theoretical 2011-01-06

10.1016/j.jsc.2017.07.005 article EN publisher-specific-oa Journal of Symbolic Computation 2017-07-14

10.1006/jsco.1997.0110 article EN publisher-specific-oa Journal of Symbolic Computation 1997-07-01

10.1007/s00200-005-0192-x article EN Applicable Algebra in Engineering Communication and Computing 2006-04-10

10.1016/j.jalgebra.2014.06.026 article EN publisher-specific-oa Journal of Algebra 2014-07-16

10.1016/j.jalgebra.2015.06.008 article EN publisher-specific-oa Journal of Algebra 2015-07-04

Article An algorithm for computing the Weierstrass normal form Share on Author: Mark van Hoeij Department of mathematics, University Nijmegen, 6525 ED The Netherlands NetherlandsView Profile Authors Info & Claims ISSAC '95: Proceedings 1995 international symposium Symbolic and algebraic computationApril Pages 90–95https://doi.org/10.1145/220346.220358Published:01 April 23citation390DownloadsMetricsTotal Citations23Total Downloads390Last 12 Months4Last 6 weeks0 Get Citation AlertsNew Alert...

10.1145/220346.220358 article EN 1995-01-01
Coming Soon ...