相关论文: Tame and wild degree functions

If g and h are functions over some field, we can consider their composition f = g(h). The inverse problem is decomposition: given f, determine the ex- istence of such functions g and h. In this thesis we consider functional decom- positions…

Let $3\leq d_1\leq d_2\leq d_3$ be integers. We show the following results: (1) If $d_2$ is a prime number and $\frac{d_1}{\gcd(d_1,d_3)}\neq2$, then $(d_1,d_2,d_3)$ is a multidegree of a tame automorphism if and only if $d_1=d_2$ or…

We show that differentiable functions, defined on a convex body $K \subseteq \mathbb R^d$, whose derivatives do not exceed a suitable given sequence of positive real numbers share many properties with polynomials. The role of the degree of…

It is proved that the tame automorphism group of a differential polynomial algebra $k\{x,y\}$ over a field $k$ of characteristic $0$ in two variables $x,y$ with $m$ commuting derivations $\delta_1, \ldots, \delta_m$ is a free product with…

Let $(a,a+d,a+2d)$ be an arithmetic progression of positive integers. The following statements are proved: (1) If $a\mid 2d$, then $(a, a+d, a+2d)\in\mdeg(\Tame(\mathbb{C}^3))$. (2) If $a\nmid 2d$, then, except for arithmetic progressions…

Several counterexamples in analysis show the existence of some special object with some sort of pathological behavior. We present three different examples where the pathological behavior is not an isolated exception, but it is the "typical"…

We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…

A class of countable infinite graphs with unbounded vertex degree is considered. In these graphs, the vertices of large degree `repel' each other, which means that the path distance between two such vertices cannot be smaller than a certain…

We investigate average gradient degree of normal random polynomials of fixed algebraic degree n. In particular, for polynomials of two variables, asymptotics of the average gradient degree for large values of n is determined.

We consider simple rational functions $R_{mn}(x)=P_m(x)/Q_n(x)$, with $P_m$ and $Q_n$ polynomials of degree $m$ and $n$ respectively. We look for "nice" functions, which we define to be ones where as many as possible of the roots, poles,…

Let d be any number greather than or equal to 3. We show that the intersection of the set mdeg(Aut(C^3))\ mdeg(Tame(C3)) with {(d_1,d_2,d_3) : d=d_1 =< d_2 =< d_3} has infinitely many elements, where mdeg h = (deg h_1,...,deg h_n) denotes…

This paper explores a class of rational functions r(s(z)) with degree mn, where s(z) is a polynomial of degree m. Inequalities are derived for rational functions with specified poles, extending and refining previous results in the eld.

The majority of extensions to General Relativity display mathematical pathologies (higher derivatives, character change in equations that can be classified within PDE theory, and even unclassifiable ones) that cause severe difficulties to…

We provide the existence of new degree growths in the context of polynomial automorphisms of $\mathbb{C}^k$: if $k$ is an integer $\geq 3$, then for any $\ell\leq \left[\frac{k-1}{2}\right]$ there exist polynomial automorphisms $f$ of…

Let $V$ be a vector space over a finite field $k$. We give a condition on a subset $A \subset V$ that allows for a local criterion for checking when a function $f:A \to k$ is a restriction of a polynomial function of degree $<m$ on $V$. In…

We study arithmetic degree of a dominant rational self-map on a smooth projective variety over a function field of characteristic zero. We see that the notion of arithmetic degree and some related problems over function fields are…

We investigate the asympotic behaviour of the moduli space of morphisms from the rational curve to a given variety when the degree becomes large. One of the crucial tools is the homogeneous coordinate ring of the variey. First we explain in…

Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…

One proves a far-reaching upper bound for the degree of a generically finite rational map between projective varieties over a base field of arbitrary characteristic. The bound is expressed as a product of certain degrees that appear…

We study the boundary behavior of rational inner functions (RIFs) in dimensions three and higher from both analytic and geometric viewpoints. On the analytic side, we use the critical integrability of the derivative of a rational inner…