Related papers: A note on the factorization of iterated quadratics…

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…

We give an infinite family of polynomials that have roots modulo every positive integer but fail to have rational roots. Each polynomial in this family is made up of monic quadratic factors that do not have linear term.

Newton iteration (NI) is an almost 350 years old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsNI) that approximates all the roots simultaneously. In this…

In this article almost semi-continuous processes with stationary independent increments on a finite irreducible Markov chain are considered. For these processes the components of matrix factorization identity are concretely defined. On the…

The investigation and classification of non-unique factorization phenomena have attracted some interest in recent literature. For finitely generated monoids, S.T. Chapman and P. Garcia-Sanchez, together with several co-authors, derived a…

Given a map f:Z-->Z and an initial argument alpha, we can iterate the map to get a finite set of iterates modulo a prime p. In particular, for a quadratic map f(z)=z^2 +c, c constant, work by Pollard suggests that this set should have…

Using Monte Carlo simulations and advanced knot localization methods, we analyze the length and distribution of prime components in composite knots tied on Freely Jointed Rings (FJRs). For increasing contour length, we observe the…

Choose a random degree d poly f with coefficients in a finite field F. We estimate the ultimate period of f under compositional iteration. We also determine the joint distribution of the small cycle lengths in the graph with edges (x,f(x)),…

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…

This paper investigates stochastic finite matrices and the corresponding finite Markov chains constructed using recurrence matrices for general families of orthogonal polynomials and multiple orthogonal polynomials. The paper explores the…

We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings; that is, we study the number of ways a permutation can be decomposed into a product of a given number of 2-cycles, 3-cycles, etc.…

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

The joint use of counting functions, Hilbert basis and Markov basis allows to define a procedure to generate all the fractions that satisfy a given set of constraints in terms of orthogonality. The general case of mixed level designs,…

In continuation to our recent work on noncommutative polynomial factorization, we consider the factorization problem for matrices of polynomials and show the following results. (1) Given as input a full rank $d\times d$ matrix $M$ whose…

Following the works by Lin et al. (Circuits Syst. Signal Process. 20(6): 601-618, 2001) and Liu et al. (Circuits Syst. Signal Process. 30(3): 553-566, 2011), we investigate how to factorize a class of multivariate polynomial matrices. The…

Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…

Consider an ergodic Markov chain on a countable state space for which the return times have exponential tails. We show that the stationary version of any such chain is a finitary factor of an i.i.d. process. A key step is to show that any…

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,…

We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing numerical values. Our framework is an articulation of the…

Let $Q_{p,q}(t)\in\mathbb{Z}[t]$ be Sharipov's even monic degree-$10$ second cuboid polynomial depending on coprime integers $p\neq q>0$. Writing $Q_{p,q}(t)$ as a quintic in $t^{2}$ produces an associated monic quintic polynomial. After…