Related papers: Every function is the representation function of a…

For a set $A\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let $R_A(n)$ denote the number of ordered pairs $(a,a')\in A\times A$ such that $a+a'=n$. The celebrated Erd\H{o}s-Tur\'an conjecture says that, if $R_A(n)\ge 1$ for all sufficiently…

A set A=A_{k,n} in [n]\cup{0} is said to be an additive k-basis if each element in {0,1,...,kn} can be written as a k-sum of elements of A in at least one way. Seeking multiple representations as k-sums, and given any function phi(n), with…

Let $\mathbb{N}$ be the set of all nonnegative integers. For any positive integer $k$ and any subset $A$ of nonnegative integers, let $r_{1,k}(A,n)$ be the number of solutions $(a_1,a_2)$ to the equation $n=a_1+ka_2$. In 2016, Qu proved…

In this note I prove the following property of Herglotz functions, which to my knowledge is new: For a Herglotz function $h(z)$ and a real number $r \in \mathbb R$ define a Herglotz function $g_r(z) = (r - h(z))^{-1}.$ Let $\mu_r^{(s)}$ be…

Let~$A$ be a set of nonnegative integers. Let~$(h A)^{(t)}$ be the set of all integers in the sumset~$hA$ that have at least~$t$ representations as a sum of~$h$ elements of~$A$. In this paper, we prove that, if~$k \geq 2$,…

We give complete, finite quasiequational axiomatisations for algebras of unary partial functions under the operations of composition, domain, antidomain, range and intersection. This completes the extensive programme of classifying algebras…

Let m>2 be an integer. We show that ZF + "For every integer n, Every countable family of non-empty sets of cardinality at most n has an infinite partial choice function" is not strong enough to prove that every countable set of m-element…

Every measurable function f on the circle can be represented as a sum of harmonics with positive spectrum, converging in measure. For convergence almost everywhere this is not true. We discuss several other subsets of Z for which one might…

Arbitrarily sparse sets A of integers are constructed with the property that every integer can be represented uniquely in the form n = a + a', where a and a' belong to the set A and a < a' or a = a'. Some related open problems are stated.

If $f$ is an entire function and $a$ is a complex number, $a$ is said to be an asymptotic value of $f$ if there exists a path $\gamma$ from $0$ to infinity such that $f(z) - a$ tends to $0$ as $z$ tends to infinity along $\gamma$. The…

It is shown that there exist infinitely many non-integers $r>2$ such that the Dehn function of some finitely presented group is $\simeq n^r$. For each positive rational number $s$ we construct pairs of finitely presented groups $H\subset G$…

Given a sequence $\mathscr{A}=\{a_0<a_1<a_2\ldots\}\subseteq \mathbb{N}$, let $r_{\mathscr{A},h}(n)$ denote the number of ways $n$ can be written as the sum of $h$ elements of $\mathscr{A}$. Fixing $h\geq 2$, we show that if $f$ is a…

We first introduce the arithmetic subderivative of a positive integer with respect to a non-empty set of primes. This notion generalizes the concepts of the arithmetic derivative and arithmetic partial derivative. More generally, we then…

For an arbitrary group, the subgroups form a lattice with order determined by set inclusion. Not every lattice is isomorphic to the subgroup lattice for a group. However, Birkhoff and Frink proved that any compactly generated lattice is…

We prove that for a positive integer a the integer sequence P(n) satisfying for all n, -infty<n<infty, the recurrence P(n)=a+P(n-phi(a)), phi(a) the Euler function, generates in increasing order all integers P(n) coprime to a.The finite…

Let $\mathcal{A}$ be a finite subset of $\mathbb{N}$ including $0$ and $f_\mathcal{A}(n)$ be the number of ways to write $n=\sum_{i=0}^{\infty}\epsilon_i2^i$, where $\epsilon_i\in\mathcal{A}$. We consider asymptotics of the summatory…

Given a function f with an absolutely convergent Fourier series, we define the norm of f as ||f||_A = the sum of absolute values of the Fourier coefficients of f. We study the behavior of ||f^n||_A as n goes to infinity, for f of the form…

We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…

Let $D$ be an open disk of radius $\le 1$ in $\mathbb C$, and let $(\epsilon_n)$ be a sequence of $\pm 1$. We prove that for every analytic function $f: D \to \mathbb C$ without zeros in $D$, there exists a unique sequence $(\alpha_n)$ of…

We study the number of representations of an integer n=F(x_1,...,x_s) by a homogeneous form in sufficiently many variables. This is a classical problem in number theory to which the circle method has been succesfully applied to give an…