相关论文: The Minimal Euclidean Function on the Gaussian Int…

Let $k\ge 1,a\ge 1,b\ge 0$ and $ c\ge 1$ be integers. Let $f$ be a multiplicative function with $f(n)\ne 0$ for all positive integers $n$. We define the arithmetic function $g_{k,f}$ for any positive integer $n$ by…

Euclidean functions with values in an arbitrary well-ordered set were first considered in a 1949 work of Motzkin and studied in more detail in work of Fletcher, Samuel and Nagata in the 1970's and 1980's. Here these results are revisited,…

In this paper, given a topological space $X$, an interval $I\subseteq {\bf R}$ and five continuous functions $\varphi, \psi, \omega :X\to {\bf R}$, $\alpha, \beta:I\to {\bf R}$, we are interested in the infimum of the function $\Phi:X\to…

We provide a geometric interpretation for a normalized version of the minimal denominator function, $$q_{\min}(x,\delta)=\min\left\{q\in \mathbb{N}: \text{ there exists } p\in\mathbb{Z} \text{ such that } \frac{p}{q}\in…

We prove a Bernstein theorem for $\Phi$-anisotropic minimal hypersurfaces in all dimensional Euclidean spaces that the only entire smooth solutions $u: \mathbb{R}^{n}\rightarrow \mathbb{R}$ of $\Phi$-anisotropic minimal hypersurfaces…

Generalizing the Cauchy-Riemann equations, we construct the Osserman system of the first order for a pair $\left(f(x, y), g(x,y) \right)$ of two ${\mathbb{R}}$-valued functions on the domain $\Omega \subset {\mathbb{R}}^{2}$. The graph…

Euler's totient function, $\varphi(n)$, which counts how many of $0,1,\dots,n-1$ are coprime to $n$, has an explicit asymptotic lower bound of $n/\log \log n$, modulo some constant. In this note, we generalise $\varphi$; given an…

Let $\{\phi_p\}$ be an optimal G\"odel numbering of the family of computable functions (in Schnorr's sense), where $p$ ranges over binary strings. Assume that a list of strings $L(p)$ is computable from $p$ and for all $p$ contains a…

In the paper asymptotic properties of functionals of stationary Gibbs particle processes are derived. Two known techniques from the point process theory in the Euclidean space R^d are extended to the space of compact sets on R^d equipped by…

It is known that there are infinitely many solutions to the inequality \phi(30n+1)<\phi(30n), where \phi is the familiar Euler totient function. However, there are no solutions with n<20,000,000, and computing a solution would seem to…

We characterize the function $\varphi$ of minimal $L^1$ norm among all functions $f$ of exponential type at most $\pi$ for which $f(0)=1$. This function, studied by H\"{o}rmander and Bernhardsson in 1993, has only real zeros $\pm \tau_n$,…

The simplest minimal subtraction method for massive {\lambda}{\phi}4 scalar field theory is presented. We utilize the one-particle irreducible vertex parts framework to deal only with the primitive divergent ones that can be renormalized…

D. Hensley showed in 1994 that the number of steps taken by the Euclidean algorithm to find the greatest common divisor of two natural numbers less than or equal to n follows a normal distribution in the limit as n tends to infinity. V.…

We introduce the fundamental group ${\mathcal F}(\mathcal{R}_{G, \phi})$ of a uniquely ergodic Cantor minimal $G$-system $\mathcal{R}_{G, \phi}$ where $G$ is a countable discrete group. We compute fundamental groups of several uniquely…

We present a practical algorithm to compute models of rational functions with minimal resultant under conjugation by fractional linear transformations. We also report on a search for rational functions of degrees 2 and 3 with rational…

In this paper, we extend a necessary and sufficient condition for a linear code over a Galois ring to be minimal and establish new bounds on the length of an $m$-dimensional minimal linear code. Building upon this structural…

Let $\mathbb{F}_q(T)$ be the field of rational functions in one variable over a finite field. We introduce the notion of a totally $T$-adic function: one that is algebraic over $\mathbb{F}_q(T)$ and whose minimal polynomial splits…

We introduce the notion of $R$-analytic functions. These are definable in an o-minimal expansion of a real closed field $R$ and are locally the restriction of a $K$-differentiable function (defined by Peterzil and Starchenko) where…

Hedetniemi conjectured in 1966 that $\chi(G \times H) = \min\{\chi(G), \chi(H)\}$ for any graphs G and H. Here $G\times H$ is the graph with vertex set $ V(G)\times V(H)$ defined by putting $(x,y)$ and $(x',y')$ adjacent if and only if…

We extend the Theory of Computation on real numbers, continuous real functions, and bounded closed Euclidean subsets, to compact metric spaces $(X,d)$: thereby generically including computational and optimization problems over higher types,…