相关论文: Every function is the representation function of a…

We show that there is always a uniformly antisymmetric f:A-> {0,1} if A subset R is countable. We prove that the continuum hypothesis is equivalent to the statement that there is an f:R-> omega with |S_x| <= 1 for every x in R. If the…

A classical additive basis question is Waring's problem. It has been extended to integer polynomial and non-integer power sequences. In this paper, we will consider a wider class of functions, namely functions from a Hardy field, and show…

Let $f$ be a $r\times m$-matrix of holomorphic functions that is generically surjective. We provide explicit integral representation of holomorphic $\psi$ such that $\phi=f\psi$, provided that $\phi$ is holomorphic and annihilates a certain…

For $\alpha >0$, let $$\mathscr{A}=\{ a_1<a_2<a_3<\cdots\}$$ and $$\mathscr{L}=\{ \ell_1, \ell_2, \ell_3,\cdots\} \quad \text{(not~necessarily~different)}$$ be two sequences of positive integers with $\mathscr{A}(m)>(\log m)^\alpha $ for…

Let $\mathbb{N}$ be the set of all nonnegative integers. For $S\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let the representation function $R_{S}(n)$ denote the number of solutions of the equation $n=s+s'$ with $s, s'\in S$ and $s<s'$. In…

Let $k\geq 2$ be a positive integer. We study concentration results for the ordered representation functions $r^{\leq}_k(A,n) = \# \big\{ (a_1 \leq \dots \leq a_k) \in A^k : a_1+\dots+a_k = n \big\}$ and $r^{<}_k(A,n) = \# \big\{ (a_1 <…

We provide several asymptotic expansions of the prime counting function $\pi(x)$ and related functions. We define an {\it asymptotic continued fraction expansion} of a complex-valued function of a real or complex variable to be a possibly…

We extend the study of the Pick class, the set of complex analytic functions taking the upper half plane into itself, to the noncommutative setting. R. Nevanlinna showed that elements of the Pick class have certain integral representations…

A simple sparse coding mechanism appears in the sensory systems of several organisms: to a coarse approximation, an input $x \in \R^d$ is mapped to much higher dimension $m \gg d$ by a random linear transformation, and is then sparsified by…

Let f be an arithmetic function satisfying certain conditions. In this paper, we give an asymptotic formula for the sum \[\sum_{n_1 n_2 \cdots n_r \leq x} f\left(\left\lfloor \frac{x}{n_1 n_2 \cdots n_r} \right\rfloor\right), \quad r \geq…

A piecewise linear function can be described in different forms: as an arbitrarily nested expression of $\min$- and $\max$-functions, as a difference of two convex piecewise linear functions, or as a linear combination of maxima of…

We define a function by refining Stern's diatomic sequence. We name it the {\it assembly function}. It is strictly increasing continuous. The first and the second main theorems are on an action to the function. The third theorem is on…

We deduce an asymptotic formula with error term for the sum $\sum_{n_1,\ldots,n_k \le x} f([n_1,\ldots, n_k])$, where $[n_1,\ldots, n_k]$ stands for the least common multiple of the positive integers $n_1,\ldots, n_k$ ($k\ge 2$) and $f$…

Set functions are a feature of functional logic programming to encapsulate all results of a non-deterministic computation in a single data structure. Given a function $f$ of a functional logic program written in Curry, we describe a…

We investigate the problem of succinctly representing an arbitrary permutation, \pi, on {0,...,n-1} so that \pi^k(i) can be computed quickly for any i and any (positive or negative) integer power k. A representation taking (1+\epsilon) n lg…

The following representation theorem is proven: A partially ordered commutative ring $R$ is a subring of a ring of almost everywhere defined continuous real-valued functions on a compact Hausdorff space $X$ if and only if $R$ is archimedean…

The Bessel-Neumann expansion (of integer order) of a function $g:\mathbb{C}\rightarrow\mathbb{C}$ corresponds to representing $g$ as a linear combination of basis functions $\phi_0,\phi_1,\ldots$, i.e., $g(z)=\sum_{\ell = 0}^\infty w_\ell…

We relate the singularities of a scheme $X$ to the asymptotics of the number of points of $X$ over finite rings. This gives a partial answer to a question of Mustata. We use this result to count representations of arithmetic lattices. More…

We interpret a fuzzy set as a random availability function and provide sufficient conditions under which a preference relation over the set of all random availability functions can be represented by a utility function.

Let f be a nonconstant meromorphic function in the plane and h be a nonconstant elliptic function. We show that if all zeros of f are multiple exept finitely many and T(r,h)=o{T(r,f)} as r tends to infinity, then f'=h has infinitely many…