Related papers: A note on n-divisible positive definite functions

This is the English translation of my old paper 'Definici\'on y estudio de una funci\'on indefinidamente diferenciable de soporte compacto', Rev. Real Acad. Ciencias 76 (1982) 21-38. In it a function (essentially Fabius function) is defined…

An arithmetic function $f$ is Leibniz-additive if there is a completely multiplicative function $h_f$, i.e., $h_f(1)=1$ and $h_f(mn)=h_f(m)h_f(n)$ for all positive integers $m$ and $n$, satisfying $$ f(mn)=f(m)h_f(n)+f(n)h_f(m) $$ for all…

We study the groups $G$ with the curious property that there exists an element $k\in G$ and a function $f\colon G\to G$ such that $f(xk)=xf(x)$ holds for all $x\in G$. This property arose from the study of near-rings and input-output…

Let $f(x)\in \mathbb{F}_q[x]$ be an irreducible polynomial of degree $m$ and exponent $e$, and $n$ be a positive integer such that $\nu_p(q-1)\ge \nu_{p}(e)+\nu_p(n)$ for all $p$ prime divisor of $n$. We show a fast algorithm to determine…

We say that a function $\alpha(x)$ belongs to the set ${\bf A}^{(\gamma)}$ if it has an asymptotic expansion of the form $\alpha(x)\sim \sum^\infty_{i=0}\alpha_ix^{\gamma-i}$ as $x\to\infty$, which can be differentiated term by term…

A finite word $w$ of length $n$ contains at most $n+1$ distinct palindromic factors. If the bound $n+1$ is attained, the word $w$ is called rich. An infinite word $w$ is called rich if every finite factor of $w$ is rich. Let $w$ be a word…

Let $N$ be a positive integer. We say a non-constant rational function $U(x)\in{\mathbb C}(x)$ is $N$-\emph{unital} if all the zeros and poles of both $U(x)$ and $1-U(x)$ are either 0 or $N$-th roots of unity. These functions are called…

A discrete function of $n$ variables is a mapping $g : X_1 \times \ldots \times X_n \rightarrow A$, where $X_1, \ldots, X_n$, and $A$ are arbitrary finite sets. Function $g$ is called {\em separable} if there exist $n$ functions $g_i : X_i…

For a group G and an element a in G let |a|_k denote the cardinality of the set of commutators [a,x_1,...,x_k], where x_1,...,x_k range over G. The main result of the paper states that a group G is finite-by-nilpotent if and only if there…

Let $F$ be a finite field, let $f$ be a function from $F$ to $F$, and let $a$ be a nonzero element of $F$. The discrete derivative of $f$ in direction $a$ is $\Delta_a f \colon F \to F$ with $(\Delta_a f)(x)=f(x+a)-f(x)$. The differential…

Let $q$ be a prime power, and $d$ a positive integer. We study the proportion of irreducible characters of $\mathrm{GL}(n,q)$ whose values evaluated on a fixed matrix $g$ are divisible by $d$. As $n$ approaches infinity, this proportion…

A nonempty finite set of positive integers A is relatively prime if gcd(A) = 1 and it is relatively prime to n if gcd(A [ fng) = 1. The number of nonempty subsets of A which are relatively prime to n is \Phi(A, n) and the number of such…

We study testing properties of functions on finite groups. First we consider functions of the form $f:G \to \mathbb{C}$, where $G$ is a finite group. We show that conjugate invariance, homomorphism, and the property of being proportional to…

Let $n$ be a positive integer and let $A$ be nonempty finite set of positive integers. We say that $A$ is relatively prime if $\gcd(A) =1$ and that $A$ is relatively prime to $n$ if $\gcd(A,n)=1$. In this work we count the number of…

In this paper we establish a new formula for the arithmetic functions that verify $ f(n) = \sum_{d|n} g(d)$ where $g$ is also an arithmetic function. We prove the following identity, $$\forall n \in \mathbb{N}^*, \ \ \ f(n) = \sum_{k=1}^n…

Let $F$ be an integral linear recurrence, $G$ be an integer-valued polynomial splitting over the rationals, and $h$ be a positive integer. Also, let $\mathcal{A}_{F,G,h}$ be the set of all natural numbers $n$ such that $\gcd(F(n), G(n)) =…

Let $s_0,s_1,s_2,\ldots$ be a sequence of rational numbers whose $m$th divided difference is integer-valued. We prove that $s_n$ is a polynomial function in $n$ if $s_n \ll \theta^n$ for some positive number $\theta$ satisfying $\theta <…

Let $ n, q $ be positive integers. We show that if $ G $ is a finitely generated residually finite group satisfying the identity $ [x,_ny^q]\equiv 1, $ then there exists a function $ f(n) $ such that $ G $ has a nilpotent subgroup of finite…

Let $G$ be a graph. A good function is a function $f:V(G)\rightarrow \{-1,1\}$, satisfying $f(N(v))\geq 1$, for each $v\in V(G)$, where $ N(v)=\{u\in V(G)\, |\, uv\in E(G) \} $ and $f(S) = \sum_{u\in S} f(u)$ for every $S \subseteq V(G) $.…

For a positive integer $n$, let $p(n)$ be the number of ways to express $n$ as a sum of positive integers. In this note, we revisit the derivation of the Rademacher's convergent series for $p(n)$ in a pedagogical way, with all the details…