相关论文: Tame and wild degree functions

We consider various collections of functions from the Baire space X into itself naturally arising in (effective) descriptive set theory and general topology, including computable (equivalently, recursive) functions, contraction mappings,…

In representation theory, the problem of classifying pairs of matrices up to simultaneous similarity is used as a measure of complexity; classification problems containing it are called wild problems, and the other are referred to as tame.

We study the problem of testing whether a function $f: \mathbb{R}^n \to \mathbb{R}$ is a polynomial of degree at most $d$ in the \emph{distribution-free} testing model. Here, the distance between functions is measured with respect to an…

Let $G$ be a graph and let $m_{ij}(G)$, $i,j\ge 1$, be the number of edges $uv$ of $G$ such that $\{d_v(G), d_u(G)\} = \{i,j\}$. The {\em $M$-polynomial} of $G$ is introduced with $\displaystyle{M(G;x,y) = \sum_{i\le j} m_{ij}(G)x^iy^j}$.…

In this note we show that the set mdeg(Aut(C^3)) mdeg(Tame(C^3)) is not empty. Moreover we show that this set has infinitely many elements. Since for the famous Nagata's example N of wild automorphism, mdeg N =(5,3,1) is an element of…

Consider tuples of separable algebras over a common local or global number field, related to each other by specified resolvent constructions. Under the assumption that all ramification is tame, simple group-theoretic calculations give best…

We construct examples of Lipschitz continuous functions, with pathological subgradient dynamics both in continuous and discrete time. In both settings, the iterates generate bounded trajectories, and yet fail to detect any (generalized)…

Some properties of $m$-density points and density-degree functions are studied. Moreover the following main results are provided: \vskip2mm \begin{itemize} \item {\it Let $\lambda$ be a continuous differential form of degree $h$ in…

Let G be a finite group of order n and V an irreducible representation over the complex numbers of dimension d. For some nonnegative number e, we have n=d(d+e). If e is small, then the character of V has unusually large degree. We fix e and…

We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…

A classical theorem of Nisan and Szegedy says that a boolean function with degree $d$ as a real polynomial depends on at most $d2^{d-1}$ of its variables. In recent work by Chiarelli, Hatami and Saks, this upper bound was improved to $C…

We establish the theorems that give necessary and sufficient conditions for an arbitrary function defined in the unit disk of complex plane in order to has boundary values along classes of equivalencies of simple curves. Our results…

We introduce and study algebraic dynamical systems generated by triangular systems of rational functions. We obtain several results about the degree growth and linear independence of iterates as well as about possible lengths of…

Suppose that a function $F$ is meromorphic in the domain $\mathbb H(-m) = \{ z : \mathrm{Im}\, z > -m(\mathrm{Re}\, z) \}$, where $m$ is an even, positive, and continuous function that does not increase on $\mathbb R_{\ge 0}$, and suppose…

Tame functions are a class of nonsmooth, nonconvex functions, which feature in a wide range of applications: functions encountered in the training of deep neural networks with all common activations, value functions of mixed-integer…

Let $F$ be a non-negatively graded free module over a polynomial ring $\mathbb{K}[x_1,\dots,x_n]$ generated by $m$ basis elements. Let $M$ be a submodule of $F$ generated by elements in $F$ with degrees bounded by $D$ and dim $F/M$=$r$. We…

We exploit a result by Nerman which shows that conditional limit theorems hold when a certain monotonicity condition is satisfied. Our main result is an application to vertex degrees in random graphs, where we obtain asymptotic normality…

Given a semi-algebraic set S, we study compactifications of S that arise from embeddings into complete toric varieties. This makes it possible to describe the asymptotic growth of polynomial functions on S in terms of combinatorial data. We…

Polynomial representations of Boolean functions over various rings such as $\mathbb{Z}$ and $\mathbb{Z}_m$ have been studied since Minsky and Papert (1969). From then on, they have been employed in a large variety of fields including…

We find an asymptotic enumeration formula for the number of simple $r$-uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula is given in terms of the solution of a system of equations.…