Related papers: Integrality and rigidity for postcritically finite…
In Theorem 3.1 of [12], we proved a rigidity result for self-shrinkers under the integral condition on the norm of the second fundamental form. In this paper, we relax the such bound to any finite constant (see Theorem 4.4 for details).
We classify all post-critically finite unicritical polynomials defined over the maximal totally real algebraic extension of ${\mathbb Q}$. Two auxiliary results used in the proof of this result may be of some independent interest. The first…
On a Riemannian compact manifold, we give existence and multiplicity results for solutions of elliptic PDE by introducing isometry invariances. When the groups we used have finite orbits, we get multiplicity results for equations with the…
We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…
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…
In this paper, we proved a rigidity theorem of the Hodge metric for concave horizontal slices and a local rigidity theorem for the monodromy representation.
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.
In this paper, we study the critical orbit of a post-critically finite polynomial of the form $f_{c,d}(x) = x^d+c \in \mathbb{C}[x]$. We discover that in many cases the orbit elements satisfy some strong arithmetic properties. It is well…
A sequence of coefficients that appeared in the evaluation of a rational integral has been shown to be unimodal. An alternative proof is presented.
We prove metric rigidity for complete manifolds supporting solutions of certain second order differential systems, thus extending classical works on a characterization of space-forms. In the route, we also discover new characterizations of…
We prove that arithmetic is interpretable in any indecomposable polynomial ring (in any set of variables), and in addition we provide an alternative uniform proof of undecidability for all members in this class of rings.
We prove that certain Fuchsian triangle groups are profinitely rigid in the absolute sense, i.e. each is distinguished from all other finitely generated, residually finite groups by its set of finite quotients. We also develop a method…
We discuss a practical algorithm to compute parabolic Kazhdan-Lusztig polynomials. As an application we compute Kazhdan-Lusztig polynomials which are needed to evaluate a character formula for reductive groups due to Lusztig. Some…
We prove effective finiteness results concerning polynomial values of the sums $$ b^k +\left(a+b\right)^k + \cdots + \left(a\left(x-1\right) + b\right)^k $$ and $$ b^k - \left(a+b\right)^k + \left(2a+b\right)^k - \ldots + (-1)^{x-1}…
We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials and indicate potential for extensions. As our main tool, we show that for a large class of Newton maps that includes all hyperbolic…
This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…
In a previous paper, we provided an explicit description of the arboreal Galois group of the postcritically finite polynomial $f(z) = z^2 +c$ in the special case when the critical point $0$ is periodic under the action of $f(z)$. In the…
We give a short proof of polynomial recurrence with large intersection for additive actions of finite-dimensional vector spaces over countable fields on probability spaces, improving upon the known size and structure of the set of strong…
We establish necessary and sufficient conditions for the realization of mapping schemata as post-critically finite polynomials, or more generally, as post-critically finite polynomial maps from a finite union of copies of the complex…
There are three kinds of multiple polylogarithms; complex, finite and symmetric. The dualities for the complex and finite cases are known. In this paper, we present proofs of them via iterated integrals and its symmetric counterpart by a…