Related papers: A note on monomials

We investigate singularly perturbed nonlinear complex differential systems of the form $\hbar \partial_x f = F (x, \hbar, f)$ where $\hbar$ is a small complex perturbation parameter. Under a geometric assumption on the eigenvalues of the…

For a field $K$, and a root $\alpha$ of an irreducible polynomial over $K$ (in some algebraic closure) the number of roots of $f(x)$ lying in $K(\alpha)$ is studied here. Given such an $f(x)$ of degree $n$ for which $r$ of the roots are i n…

This note presents a new, elementary proof of a generalization of a theorem of Halin to graphs with unbounded degrees, which is then applied to show that every connected, countably infinite graph G with a subdegree-finite, infinite…

We present the construction of an associative, commutative algebra $\hat {\mathcal G}$ of generalized functions on a manifold $X$ satisfying the following optimal set of permanence properties: (i)The space of distributions on $X$ is…

This paper compares the divisorial gonality of a finite graph $G$ to the divisorial gonality of the associated metric graph $\Gamma(G,\mathbb{1})$ with unit lengths. We show that $\text{dgon}(\Gamma(G,\mathbb{1}))$ is equal to the minimal…

We investigate solvability of a continuous Dirichlet boundary value problem together with its classical discretization using a gobal diffeomorphism theorem.

Reidl, S\'anchez Villaamil, and Stravopoulos (2019) characterized graph classes of bounded expansion as follows: A class $\mathcal{C}$ closed under subgraphs has bounded expansion if and only if there exists a function $f:\mathbb{N} \to…

Given a generically \'etale morphism $f\colon Y\to X$ of quasi-smooth Berkovich curves, we define a different function $\delta_f\colon Y\to[0,1]$ that measures the wildness of the topological ramification locus of $f$. This provides a new…

Suppose that $G=(V, E)$ is a connected locally finite graph with the vertex set $V$ and the edge set $E$. Let $\Omega\subset V$ be a bounded domain. Consider the following quasilinear elliptic equation on graph $G$ $$ \left \{…

We investigate fractional sums of arithmetic functions over products of two or three integers, with emphasis on fixed greatest common divisors and multiplicative weights. Let $f$ be an arithmetic function satisfying $f(n) \ll n^\alpha$ for…

The aim of this thesis is to present an extension to the string graphs of Dixon, Duncan and Kissinger that allows the finite representation of certain infinite families of graphs and graph rewrite rules, and to demonstrate that a logic can…

Let $G$ be a graph and $f: G\rightarrow G$ be a continuous map. We establish a structure theorem which describes the structures of the set $R(f)-\overline{P(f)}$, where $R(f)$ and $P(f)$ are the recurrent point set and the periodic point…

We consider equations of the form Bf=g, where B is a Galois connection between lattices of functions. This includes the case where B is the Legendre-Fenchel transform, or more generally a Moreau conjugacy. We characterise the existence and…

We develop a monotonicity formula for solutions of the fractional Toda system $$ (-\Delta)^s f_\alpha = e^{-(f_{\alpha+1}-f_\alpha)} - e^{-(f_\alpha-f_{\alpha-1})} \quad \text{in} \ \ \mathbb R^n,$$ when $0<s<1$, $\alpha=1,\cdots,Q$,…

For various arithmetic functions $f:\mathbb{N} \to \mathbb{R}$, the behavior of $f(n!)$ and that of $\sum_{n\le N} f(n!)$ can be intriguing. For instance, for some functions $f$, we have ${f(n!)=\sum_{k\le n}f(k)}$, for others, we have…

In this paper, we prove some uniqueness results which improve and generalize several earlier works. Also, we prove a value distribution result concerning $f^{(k)}$ which provides a partial answer to a question of Fang and Wang [A note on…

It is consistent that for every monotonically increasing function f:omega->omega there is a graph with size and chromatic number aleph_1 in which every n-chromatic subgraph has at least f(n) elements (n >= 3). This solves a $250 problem of…

Let $G$ be a simple graph of order $n$. The {\em domination polynomial} of $G$ is the polynomial ${D(G, x)=\sum_{i=0}^{n} d(G,i) x^{i}}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. Let $n$ be any positive integer…

Given a graph $H$, we denote by ${\cal M}(H)$ all graphs that can be contracted to $H$. The following extension of the Erd\H{o}s-P\'osa Theorem holds: for every $h$-vertex planar graph $H$, there exists a function $f_{H}$ such that every…

For each $a \in \mathbb{R}$, we define a Borel function $f_a : \mathbb{R} \to \mathbb{R}$ which encodes $a$ in a certain sense. We show that for each Borel $g : \mathbb{R} \to \mathbb{R}$, $f_a \cap g = \emptyset$ implies $a \in…