Related papers: Iteration and the Minimal Resultant

Let $K$ be a number field, and $\varphi_{1},\ldots,\varphi_{g}\in K(t)$ be finitely many rational maps, each of degree at least $2$. We first show that for generic finite sets $\mathcal{A}_{1},\ldots,\mathcal{A}_{g}$ consisting entirely of…

We first introduce the class of quasi-algebraically stable meromorphic maps of $\P^k.$ This class is strictly larger than that of algebraically stable meromorphic self-maps of $\P^k.$ Then we prove that all maps in the new class enjoy a…

We compute the resultant measures for iterations $P^j$, $j\ge 1$, of a polynomial $P$ of degree $>1$ on the $n$-th level Trucco's trees $\Gamma_n$, $n\ge 0$, in the Berkovich projective line over a non-archimedean field and also determine…

Let phi: P^1 --> P^1 be a rational map defined over a field K. We construct the moduli space M_d(N) parameterizing conjugacy classes of degree-d maps with a point of formal period N and present an algebraic proof that M_2(N) is…

The degree of a map between orientable manifolds is a fundamental concept in topology, providing deep insights into the structure of manifolds and the behavior of maps between them. Recently, this notion has been extensively studied,…

Ioffe's criterion and various reformulations of it have become a~standard tool in proving theorems guaranteeing various regularity properties such as metric regularity, i.e., the openness with a linear rate around the reference point, of…

We classify all rational maps $H \in K(x)^n$ for which ${\rm trdeg}_K K(tH_1,tH_2,\ldots,tH_n) \le 2$, where $K$ is any field and $t$ is another indeterminate. Furthermore, we classify all such maps for which additionally $JH \cdot H = {\rm…

In this paper we present a new class of complexity measures, induced by a new data structure for representing $k$-valued functions (operations), called minor decision diagram. The results are presented in terms of Multi-Valued Logic…

Given a digraph D, the minimum semi-degree of D is the minimum of its minimum indegree and its minimum outdegree. D is k-ordered Hamiltonian if for every ordered sequence of k distinct vertices there is a directed Hamilton cycle which…

In this note, we derive a uniqueness theorem for minimal graphs of general codimension under certain restrictions closed related to the convexity (not strict convexity) of the area functional with respect to singular values, improving the…

In this short paper, we aim at giving a more conceptual and simpler proof of Rumely's moduli theoretic characterization of type II minimal locus of the resultant function $\operatorname{ordRes}_\phi$ on the Berkovich hyperbolic space for a…

Let \({\mathbb K}\) be any field, let \(X\subset {\mathbb P}^{k-1}\) be a set of \(n\) distinct \({\mathbb K}\)-rational points, and let \(a\geq 1\) be an integer. In this paper we find lower bounds for the minimum distance \(d(X)_a\) of…

We consider the map X defined on the rational numbers given by x --> x * ceil(x), where ceil(x) denotes the smallest integer greater than or equal to x, and study the problem of finding, for each rational, the smallest number of iterations…

Let $A_{\varphi}$ denote the matrix of rotation with angle $\varphi$ of the Euclidean plane, FLOOR the function, which rounds a real point to the nearest lattice point down on the left and ROUND the function for rounding off a vector to the…

The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a new algorithm for matrix completion that minimizes the least-square distance on the sampling set over…

In this paper, we introduce and study the iterates of the following family of functions $\varphi_k$ defined on natural numbers which exhibits nice properties. $$\varphi_k(x)=\left\lbrace \begin{array}{ll} x+k, & \mbox{ if $x$ is prime;}\\…

The o-minimal structure generated by the restricted Pfaffian functions, known as restricted sub-Pfaffian sets, admits a natural measure of complexity in terms of a format $\mathcal{F}$, recording information like the number of variables and…

We leverage the connections between nonexpansive maps, monotone Lipschitz operators, and proximal mappings to obtain near-optimal (i.e., optimal up to poly-log factors in terms of iteration complexity) and parameter-free methods for solving…

The Carmichael lambda function $\lambda(n)$ is defined to be the smallest positive integer $m$ such that $a^m$ is congruent to 1 modulo $n,$ for all $a$ and $n$ relatively prime. The function $\lambda_k(n)$ is defined to be the $k$th…

We study surfaces in Euclidean space ${\mathbb R}^3$ that are minimal for a log-linear density $\phi(x,y,z)=\alpha x+\beta y+\gamma y$, where $\alpha,\beta,\gamma$ are real numbers not all zero. We prove that if a surface is $\phi$-minimal…