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

It is known that a Markov basis of the binary graph model of a graph $G$ corresponds to a set of binomial generators of cut ideals $I_{\widehat{G}}$ of the suspension $\widehat{G}$ of $G$. In this paper, we give another application of cut…

We consider the family of polynomials $f_{d,c}(x)=x^d+c$ over the rational field $\Q$. Fixing integers $d, n\ge 2$, we show that the density of primes that can appear as primitive prime divisors of $f_{d,c}^n(0)$ for some $c\in\Q$ is…

We describe the iterated monodromy groups associated with post-critically finite quadratic polynomials, and explicit their connection to the `kneading sequence' of the polynomial. We then give recursive presentations by generators and…

We provide an explicit construction of the arboreal Galois group for the postcritically finite polynomial $f(z) = z^2 +c$, where $c$ belongs to some arbitrary field of characteristic not equal to $2$. In this first of two papers, we…

Let $\tilde{f}(X)\in\mathbb{Z}[X]$ be a degree-$n$ polynomial such that $f(X):=\tilde{f}(X)\bmod p$ factorizes into $n$ distinct linear factors over $\mathbb{F}_p$. We study the problem of deterministically factoring $f(X)$ over…

Let K be a number field and let f(x) = x^q + c where q is a prime power, c is in K, and f is not post-critically finite. We show that for any strictly preperiodic b in K, the iterated Galois group at b with respect to f has finite index in…

For a rational polynomial $f$ and rational numbers $c, u$, we put $f_c(x):=f(x)+c$, and consider the Zsigmondy set $\mathcal{Z}(f_c,u)$ associated to the sequence $\{f_c^n(u)-u\}_{n\geq 0}$, where $f_c^n$ is the $n$-st iteration of $f_c$.…

We study algebraic relations among postcritically finite (PCF) parameters in the family $f_c(z) = z^2 + c$. Ghioca, Krieger, Nguyen and Ye proved that an algebraic curve in $\mathbb{C}^2$ contains infinitely many PCF pairs $(c_1, c_2)$ if…

We study a classical model for the accumulation of errors in multi-qubit quantum computations. By modeling the error process in a quantum computation using two coupled Markov chains, we are able to capture a weak form of time-dependency…

We give an expository review of applications of computational algebraic statistics to design and analysis of fractional factorial experiments based on our recent works. For the purpose of design, the techniques of Gr\"obner bases and…

Let f be a degree d polynomial defined over the nonarchimedean field C_p, normalized so f is monic and f(0)=0. We say f is post-critically bounded, or PCB, if all of its critical points have bounded orbit under iteration of f. It is known…

We prove a factorization theorem for Fuchsian groups similar to those proved by Agol and Liu for 3-manifold groups. As an application, we build Makanin-Razborov diagrams, which parametrize the collection of all discrete representations from…

We generalize the classical theory of periodic continued fractions (PCFs) over ${\mathbf Z}$ to rings ${\mathcal O}$ of $S$-integers in a number field. Let ${\mathcal B}=\{\beta, {\beta^*}\}$ be the multi-set of roots of a quadratic…

Parametric Markov chains have been introduced as a model for families of stochastic systems that rely on the same graph structure, but differ in the concrete transition probabilities. The latter are specified by polynomial constraints for…

We elaborate the idea behind Markov chain Monte Carlo (MCMC) methods in a mathematically coherent, yet simple and understandable way. To this end, we proof a pivotal convergence theorem for finite Markov chains and a minimal version of the…

In 2010, A. Shpilka and I. Volkovich established a prominent result on the equivalence of polynomial factorization and identity testing. It follows from their result that a multilinear polynomial over the finite field of order 2 can be…

Motivated by entanglement-assisted quantum error-correcting codes, where the hull dimension determines the number of required pre-shared entangled pairs, we study hulls of two families of $\mathbb{F}_q$-linear codes defined by…

Let K be a number field, t a parameter, F=K(t) and f in K[x] a polynomial of degree d. The polynomial P_n(x,t)= f^n(x) - t in F[x] where f^n is the n-fold iterate of f, is absolutely irreducible over F; we compute a recursion for its…

A polynomial $f$ of degree $d$ and coefficients in an algebraically closed field $k$ defines a morphism $f:\mathbb{P}^1_k\longrightarrow\mathbb{P}^1_k$ which, if char$(k)\nmid d$, is unramified outside a finite set of points in the image:…

The Markov Chain Monte Carlo (MCMC) algorithm is a widely recognised as an efficient method for sampling a specified posterior distribution. However, when the posterior is multi-modal, conventional MCMC algorithms either tend to become…