Determining the winner in Kalah is a difficult problem
Researchers show that deciding if a player can force a win in Kalah is PSPACE-complete.
Researchers show that deciding if a player can force a win in Kalah is PSPACE-complete.
New computations help classify orbifold compactifications of and study Milnor fibers.
Early observations of a disease model can inform the epidemic threshold even when individual rates are uncertain.
Researchers developed a way to apply Malliavin calculus to random variables that are conditionally independent given a latent random variable .
Researchers developed a framework to speed up sampling in systems where competing phases create bottlenecks.
Researchers found upper and lower bounds for the asymptotic propagation speed of travelling wave solutions.
Researchers developed a method to find spectral gap bounds for block dynamics and improved bounds for random forests.
The work identifies the algebraic principal ideal generated by a Gaussian product of two Hilbert-Schmidt operators.
A study examines how retaining edges with probability affects the geometry and transport of band random graphs.
Researchers studied how different payout schemes respond to power adjusting block withholding attacks.
A new mathematical proof shows how random flat combinatorial disks scale into Jackiw--Teitelboim gravity.
Researchers found zero-free regions for specific models on random regular graphs.
Researchers established discrete counterparts for limits involving Brownian excursions or meanders in the maximal current phase.
A study examines how agents interact in systems where memory effects influence dynamics.
A new approach uses full graphicality to show that certain graph sampling methods mix rapidly.
Learned factors can reduce variance in Monte Carlo simulations for path-dependent claims.
Researchers used lattice models to find new ways to calculate Schubert structure constants.
Researchers studied how space-time Hawkes processes behave when starting from a specific field of past events.
The splitting type of the logarithmic bundle for up to sixteen lines is combinatorial.
Researchers found that certain mathematical bundles exist on surfaces and varieties in positive characteristic.
The stochastic gradient Leimkuhler-Matthews integrator offers a second order discretization error.
Researchers discovered that particle paths in the Heisenberg group form non-convex limit shapes.
The algorithm computes the structural signature and mean time-to-failure for every state of a monotone binary system.
Researchers studied the quantization of a semigroup to understand conformal field theory.