Related papers: Iterative Roots of Multifunctions
We consider the problem of finding a condition for a univariate polynomial having a given multiplicity structure when the number of distinct roots is given. It is well known that such conditions can be written as conjunctions of several…
We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…
We prove a sufficient condition for the Jacobian problem in the setting of real, complex and mixed polynomial mappings. This follows from the study of the bifurcation locus of a mapping subject to a new Newton non-degeneracy condition.
We provide the law of large numbers for roots of finite free multiplicative convolution of polynomials which have only non-negative real roots. Moreover, we study the empirical root distributions of limit polynomials obtained through the…
Our main result is that possibly some non-null set of reals cannot be divided to uncountably many non-null sets. We deal also with a non-null set of reals, the graph of any function from it is null and deal with our iterations somewhat more…
Let G be a graph in a 3-manifold M. We compress the pair (M,G) along admissible 2-spheres as long as possible. What we get is a root of (M,G). Our main result is that for any pair (M,G) the root exists and is unique. As a corollary we get…
We combine several folklore observations to provide a working framework for iterating constructions which contradict the axiom of choice. We use this to define a model in which any kind of structural failure must fail with a proper class of…
The criteria for determining graph isomorphism are crucial for solving graph isomorphism problems. The necessary condition is that two isomorphic graphs possess invariants, but their function can only be used to filtrate and subdivide…
We will show that a multifunction is strictly proto-differentiable at a point of its graph if and only if it is graphically strictly differentiable, i.e., the graph of the multifunction locally coincides, up to a change of coordinates, with…
Jones conjectures the arboreal representation of a degree two rational map will have finite index in the full automorphism group of a binary rooted tree except under certain conditions. We prove a version of Jones' Conjecture for quadratic…
A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.
We provide upper bounds on the total number of irreducible factors, and in particular irreducibility criteria for some classes of bivariate polynomials $f(x,y)$ over an arbitrary field $\mathbb{K}$. Our results rely on information on the…
This paper is concerned with factor left prime factorization problems for multivariate polynomial matrices without full row rank. We propose a necessary and sufficient condition for the existence of factor left prime factorizations of a…
We specify what is meant for a polytope to be reconstructible from its graph or dual graph. And we introduce the problem of class reconstructibility, i.e., the face lattice of the polytope can be determined from the (dual) graph within a…
Iterated integrals of paths arise frequently in the study of the Taylor's expansion for controlled differential equations. We will prove a factorial decay estimate, conjectured by M. Gubinelli, for the iterated integrals of non-geometric…
A new necessary and sufficient condition for the existence of minor left prime factorizations of multivariate polynomial matrices without full row rank is presented. The key idea is to establish a relationship between a matrix and its full…
We consider difference equations with several non-monotone deviating arguments and nonnegative coefficients. The deviations (delays and advances) are, generally, unbounded. Sufficient oscillation conditions are obtained in an explicit…
We prove that the ribbon graph polynomial of a graph embedded in an orientable surface is irreducible if and only if the embedded graph is neither the disjoint union nor the join of embedded graphs. This result is analogous to the fact that…
We study rational iterated preimages of the origin under unicritical maps $f_{d,c}(x)=x^d+c$. Earlier works of Faber--Hutz--Stoll and Hutz--Hyde--Krause established finiteness and conditional bounds in the quadratic case. Building on this,…
A new method of root finding is formulated that uses a numerical iterative process involving three points. A given function y = f(x) whose roots are desired is fitted and approximated by a polynomial function of the form P(x)= a(x-b)^N that…