Related papers: Extension of Arakelyan's Theorem

In this paper, we show that for a broad class of pseudoconvex formal-analytic arithmetic surfaces over $\text{Spec}(\mathbb{Z})$, those which admit a nonconstant monic such regular function, that a conjecture of Bost-Charles that the ring…

The hyperfinite $G$-expectation is a nonstandard discrete analogue of $G$-expectation (in the sense of Robinsonian nonstandard analysis). A lifting of a continuous-time $G$-expectation operator is defined as a hyperfinite $G$-expectation…

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…

If a function $f$, acting on a Euclidean space $\mathbb{R}^n$, is "almost" orthogonally additive in the sense that $f(x+y)=f(x)+f(y)$ for all $(x,y)\in\bot\setminus Z$, where $Z$ is a "negligible" subset of the $(2n-1)$-dimensional manifold…

Let $\mathcal{F}$ be a set of $n$ real analytic functions with linearly independent derivatives restricted to a compact interval $I$. We show that for any finite set $A \subset I$, there is a function $f \in \mathcal{F}$ that satisfies…

Let $C$ and $D$ be smooth, proper and geometrically integral curves over a finite field $F$. Any morphism from $D$ to $C$ induces a morphism of their \'etale fundamental groups. The anabelian philosophy proposed by Grothendieck suggests…

This paper consists of two halves. In the first half of the paper, we consider real-valued functions $f$ whose domain is the vertex set of a graph $G$ and that are Lipschitz with respect to the graph distance. By placing a uniform…

We present a necessary and sufficient condition for Alt's system to be represented by a continuous utility function. Moreover, we present a necessary and sufficient condition for this utility function to be concave. The latter condition can…

We consider convex sets and functions over idempotent semifields, like the max-plus semifield. We show that if $K$ is a conditionally complete idempotent semifield, with completion $\bar{K}$, a convex function $K^n\to\bar{K}$ which is lower…

We use the differentiability of the arithmetic volume function and an arithmetic Bertini type theorem to classify when one can find a closed point on the generic fiber of an arithmetic variety, whose heights with respect to some finite…

By a [$K$-]approximate subring of a ring we mean an additively symmetric subset $X$ such that $X \cdot X \cup (X + X)$ is covered by finitely many [resp.\ $K$] additive translates of $X$. We prove a structure theorem for finite approximate…

A closure operator on a set $X$ is a function $\operatorname{cl}: \wp(X) \to \wp(X)$ satisfying, for all $A, B \subseteq X$, the following properties: extensivity, $A \subseteq \operatorname{cl}(A)$; monotonicity, which states that if $A…

Let {X_n} be a sequence of analytic sets converging to some analytic set X in the sense of holomorphic chains. We introduce a condition which implies that every irreducible component of X is the limit of a sequence of irreducible components…

Generic absoluteness is the phenomenon that certain truths in the set-theoretic universe remain stable under forcing expansions. A classical result by Kripke asserts that every complete Boolean algebra completely embeds into a countably…

The following refinement of the Higman embedding theorem is proved: A finitely generated group $R$ is recursively presented if and only if there exists a quasi-isometric malnormal embedding of $R$ into a finitely presented group $H$ such…

In a seminal paper, Choquet introduced an integral formula to extend a monotone increasing setfunction on a sigma-algebra to a (nonlinear) functional on bounded measurable functions. The most important special case is when the setfunction…

For graphs $G$ and $T$, and a family of graphs $\mathcal{F}$ let $\mathrm{ex}(G,T,\mathcal{F})$ denote the maximum possible number of copies of $T$ in an $\mathcal{F}$-free subgraph of $G$. We investigate the algorithmic aspects of…

This is the second in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. The research in this article aims to find conditions of an algorithmic nature that are necessary and sufficient to…

Let $A$ be a finite subset of an abelian group $G$, and suppose that $|A+A|\leq K|A|$. We show that for any $\epsilon>0$, there exists a constant $C_\epsilon$ such that $A$ can be covered by at most $\exp(C_\epsilon \log(2K)^{1+\epsilon})$…

A real valued function $f$ defined on a subset $E$ of $\textbf{R}$, the set of real numbers, is statistically upward continuous if it preserves statistically upward half quasi-Cauchy sequences, is statistically downward continuous if it…