Related papers: A Markov model for factorisation of iterated cubic…

Performing numerical integration when the integrand itself cannot be evaluated point-wise is a challenging task that arises in statistical analysis, notably in Bayesian inference for models with intractable likelihood functions. Markov…

Let $K$ be the function field of a smooth, irreducible curve defined over $\overline{\mathbb{Q}}$. Let $f\in K[x]$ be of the form $f(x)=x^q+c$ where $q = p^{r}, r \ge 1,$ is a power of the prime number $p$, and let $\beta\in \overline{K}$.…

Parallel Markov Chain Monte Carlo (pMCMC) algorithms generate clouds of proposals at each step to efficiently resolve a target probability distribution. We build a rigorous foundational framework for pMCMC algorithms that situates these…

In this article we provide a combinatorial sufficient (and conjecturally, necessary) condition (called $\alpha$-symmetry) for the mating of two postcritically finite polynomials in $\mathcal{S}_1$ to be obstructed. To do this, we study the…

We apply Markov Chain Monte Carlo (MCMC) to the problem of parametric galaxy modeling, estimating posterior distributions of galaxy properties such as ellipticity and brightness for more than 100,000 images of galaxies taken from DC2, a…

We generalize the classical lifting and recombination scheme for rational and absolute factorization of bivariate polynomials to the case of a critical fiber. We explore different strategies for recombinations of the analytic factors,…

Filtering---estimating the state of a partially observable Markov process from a sequence of observations---is one of the most widely studied problems in control theory, AI, and computational statistics. Exact computation of the posterior…

A numerical semigroup is an additive subsemigroup of the non-negative integers. In this paper, we consider parametrized families of numerical semigroups of the form $P_n = \langle f_1(n), \ldots, f_k(n) \rangle$ for polynomial functions…

In this article, a Probability Mass Function (PMF) estimation method which tames the curse of dimensionality is proposed. This method, called Partial Coupled Tensor Factorization of 3D marginals or PCTF3D, has for principle to partially…

We describe a method for doing computations with Orlov's equivalence between the bounded derived category of certain hypersurfaces and the stable category of graded matrix factorisations of the polynomials describing these hypersurfaces. In…

We present a new algorithm to decompose generic spinor polynomials into linear factors. Spinor polynomials are certain polynomials with coefficients in the geometric algebra of dimension three that parametrize rational conformal motions.…

We extend recent orbit counts for finitely generated semigroups acting on $\mathbb{P}^N$ to certain infinitely generated, polarized semigroups acting on projective varieties. We then apply these results to semigroup orbits generated by some…

Cumulative prospect theory (CPT) is the first theory for decision-making under uncertainty that combines full theoretical soundness and empirically realistic features [P.P. Wakker - Prospect theory: For risk and ambiguity, Page 2]. While…

Let f be a real or complex polynomial. We give an algorithm to compute the set of generalized critical values. The algorithm uses a finite dimensional space of rational arcs along which we can reach all generalized critical values of f.

This manuscript explores many convolution (restricted summation) type sequences via certain types of matrix based factorizations that can be used to express their generating functions. The last primary (non-appendix) section of the thesis…

Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…

In this paper we present an algorithm to obtain the parameter planes of families of root-finding methods with several free critical points. The parameter planes show the joint behaviour of all critical points. This algorithm avoids the…

The arboreal Galois group of a polynomial $f$ over a field $K$ encodes the action of Galois on the iterated preimages of a root point $x_0\in K$, analogous to the action of Galois on the $\ell$-power torsion of an abelian variety. We…

We introduce the polygonalisation complex of a surface, a cube complex whose vertices correspond to polygonalisations. This is a geometric model for the mapping class group and it is motivated by works of Harer, Mosher and Penner. Using…

Let $f_{c,d}(x)=x^d+c\in \mathbb{C}[x]$. The $c_0$ values for which $f_{c_0,d}$ has a strictly pre-periodic finite critical orbit are called Misiurewicz points. Any Misiurewicz point lies in $\bar{\mathbb{Q}}$. Suppose that the Misiurewicz…