相关论文: Complex bounds for multimodal maps: bounded combin…

We show NP-completeness for several planar variants of the monotone satisfiability problem with bounded variable appearances. With one exception the presented variants have an associated bipartite graph where the vertex degree is bounded by…

We give a combinatorial upper bound for the gonality of a curve that is defined by a bivariate Laurent polynomial with given Newton polygon. We conjecture that this bound is generically attained, and provide proofs in a considerable number…

By using a selective filtration argument, we prove that the satisfiability problem of the unimodal logic of density is in $EXPTIME$. By using a tableau-like approach, we prove that the satisfiability problem of the bimodal logic of weak…

We give necessary and sufficient conditions for Riemannian maps to be biharmonic. We also define pseudo umbilical Riemannian maps as a generalization of pseudo-umbilical submanifolds and show that such Riemannian maps put some restrictions…

We study the convergence of graphs consisting of finitely many internal rays for degenerating Newton maps. We state a sufficient condition to guarantee the convergence. As an application, we investigate the boundedness of hyperbolic…

Bounded-type 3-manifolds arise as combinatorially bounded gluings of irreducible 3-manifolds chosen from a finite list. We prove effective hyperbolization and effective rigidity for a broad class of 3-manifolds of bounded type and large…

We find sharp upper bounds on the order of the automorphism group of a hypersurface in complex projective space in every dimension and degree. In each case, we prove that the hypersurface realizing the upper bound is unique up to…

We compute the continuous bounded cohomology of the full automorphism groups of regular trees in all positive degrees, with coefficients arising from any irreducible continuous unitary representations. To the author's knowledge, this seems…

Let $\mathbb C$ be the set of complex numbers, and let $\mathcal P$ be a collection of complex polynomial maps in several variables. Assuming at least one $P\in\mathcal P$ depends on at least two variables, we classify all possibilities for…

We continue the study of non-invertible topological dynamical systems with expanding behavior. We introduce the class of {\em finite type} systems which are characterized by the condition that, up to rescaling and uniformly bounded…

We study quasiconformal mappings of the unit disk that have planar extension with controlled distortion. For these mappings we prove a bound for the modulus of continuity of the inverse map, which somewhat surprisingly is almost as good as…

Perturbative renormalization group theory is developed as a unified tool for global asymptotic analysis. With numerous examples, we illustrate its application to ordinary differential equation problems involving multiple scales, boundary…

Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…

Thom polynomials are universal cohomological obstructions to the appearance of singularities of given types in differentiable maps. As an application, various invariants of immersions have been expressed in terms of singularities of their…

We develop a theory of limits for sequences of dense abstract simplicial complexes, where a sequence is considered convergent if its homomorphism densities converge. The limiting objects are represented by stacks of measurable [0,1]-valued…

Inou and Shishikura provided a class of maps that is invariant by near-parabolic renormalization, and that has proved extremely useful in the study of the dynamics of quadratic polynomials. We provide here another construction, using more…

One measure of the complexity of a first-order theory, and similarly a type, is the complexity of the formulas required to axiomatize it. We say a theory is bounded if there is an axiomatization involving only $\forall_n$-formulas for some…

We consider possible reconstructions of a binary image of which the row and column sums are given. For any reconstruction we can define the length of the boundary of the image. In this paper we prove a new lower bound on the length of this…

The paper proposes a vector generalization of the basic concepts of the theory of complex variable: the concept of modulus and argument of complex number. The author introduces some generalizations of the notion of holomorphic functions and…

We give a method of solution to the problem of iterating holomorphic functions to fractional or complex heights. We construct an auxiliary function from natural iterates of a holomorphic function; the auxiliary function will be…