
Explore connections between polytopes and algebraic combinatorics, focusing on sums of weighted lattice points and their computational implications in estimating maximal weighted lattice points.

Explore a computational approach to the Riemann Hypothesis, challenging traditional mathematical assumptions and proposing a new perspective on this famous conjecture.

Explore methods for solving square polynomial systems, focusing on enumerative geometry techniques and their applications in mathematical research.

Exploration of tensor subrank and border subrank, including construction of maximal border subrank tensors and lower bound computation for the dimension of maximal border subrank tensor sets.

Explore innovative approaches to solve high-dimensional optimal control problems using Tensor Train approximation, with applications to destabilized viscous Burgers and diffusion equations.

Explore numerical methods for analyzing likelihood correspondences in statistical models, focusing on applications in enumerative geometry and algebraic statistics.

Explore certified homotopy tracking in enumerative geometry with Kisun Lee from Clemson University, focusing on advanced mathematical concepts and applications.

Explore A^1-Brouwer degrees using Macaulay2 software in this Fields Institute talk by Thomas Brazelton from Harvard University, focusing on applications in enumerative geometry.

Explore the potential of computers in theorem-proving and advanced mathematics, from basic logic to modern research, and their future role in mathematical discovery.

Explore the potential of computers in theorem-proving and advanced mathematics, from basic logic to modern research, and their future role in mathematical discovery.

Challenging the Fundamental Theorem of Algebra: Exploring its limitations, implications for calculus and linear algebra, and the need for a more accurate formulation in rational numbers.

Explore new Mathematica 13.3 features for finite field computations, including arithmetic, mappings, and polynomials. Learn about upcoming linear algebra and equation solving capabilities.

Explore special functions, Mellin-Barnes integration, and integral transforms using advanced computational techniques for math and physical science applications.

Master symbolic integration using Rubi's rule-based approach. Explore transparent, systematic methods for finding antiderivatives and compare with traditional algorithms.

Explore modern computational number theory, covering primes, factorization, divisibility, congruence, and advanced topics like analytic and additive number theory.

Explore numerical techniques for calculating quasi-stationary distributions in complex systems, enhancing understanding of long-term behavior in stochastic processes.

Explore data-assisted algorithms for inverse random source scattering problems, enhancing reconstruction accuracy with fewer realizations and comparing performance of various data-driven methods.

Explore close formulas for computing rational zeta series, featuring unique insights not reproducible by current software.

Explore a novel algorithm using monodromy to solve large systems of analytic nonlinear equations, developed during a Wolfram internship.

Explore computational mathematics at the intersection of dynamics, geometry, and algebra, focusing on geometric numerical integration and structure-preserving discretization of differential equations.

Discover SymPy for solving complex math problems with Python. Learn to use Jupyter for assignments and contribute to computational mathematics.