Related papers: On multiplicative functions which are additive on …
Fix integers $b>a\geq1$ with $g:=\gcd(a,b)$. A set $S\subseteq\mathbb{N}$ is \emph{$\{a,b\}$-multiplicative} if $ax\neq by$ for all $x,y\in S$. For all $n$, we determine an $\{a,b\}$-multiplicative set with maximum cardinality in $[n]$, and…
In this note we present a method for obtaining a wide class of combinatorial identities. We give several examples, in particular, based on the Gamma and Beta functions. Some of them have already been considered by previously, and other are…
A triple (a, b, c) of positive integers is called a Markoff triple iff it satisfies the Diophantine equation a2+b2+c2=abc . Recasting the Markoff tree, whose vertices are Markoff triples, in the framework of integral upper triangular 3x3…
For $ k \geq 2 $, we let $ A = (a_{1}, a_{2}, \ldots, a_{k}) $ be a $k$-tuple of positive integers with $\gcd(a_{1}, a_2, \ldots, a_k) =1$ and, for a non-negative integer $s$, the generalized Frobenius number of $A$, $g(A;s) = g(a_1, a_2,…
The essential variables in a finite function $f$ are defined as variables which occur in $f$ and weigh with the values of that function. The number of essential variables is an important measure of complexity for discrete functions. When…
Given an infinite sequence of positive integers $\cA$, we prove that for every nonnegative integer $k$ the number of solutions of the equation $n=a_1+...+a_k$, $a_1,\,..., a_k\in \cA$, is not constant for $n$ large enough. This result is a…
Let $R$ be a commutative ring with identity. A unit $u$ of $R$ is called exceptional if $1-u$ is also a unit. When $R$ is a finite commutative ring, we determine the additive and multiplicative structures of its exceptional units; and then…
Let $M_n(\mathbb{F})$ be the algebra of $n \times n$ matrices over a field $\mathbb{F}$ of characteristic not equal to $2$. If $n\ge 2$, we show that an arbitrary map $\phi : M_n(\mathbb{F}) \to M_n(\mathbb{F})$ is Jordan multiplicative,…
We study sets of recurrence, in both measurable and topological settings, for actions of $(\mathbb{N},\times)$ and $(\mathbb{Q}^{>0},\times)$. In particular, we show that autocorrelation sequences of positive functions arising from…
In this note I present a readable version of the proof of my 2001 result, giving a sufficient and necessary condition for a function on a combinatorial cube to essentially (locally) depend on at most one variable (see the end of the paper…
We say a power series $a_0+a_1q+a_2q^2+\cdots$ is \emph{multiplicative} if $n\mapsto a_n/a_1$ for positive integers $n$ is a multiplicative function. Given the Eisenstein series $E_{2k}(q)$, we consider formal multiplicative power series…
Let A be a set of integers. For every integer n, let r_{A,2}(n) denote the number of representations of n in the form n = a_1 + a_2, where a_1 and a_2 are in A and a_1 \leq a_2. The function r_{A,2}: Z \to N_0 \cup {\infty} is the…
A subset $M \subset \textbf{R}^3$ is called a \emph{basic subset}, if for any funciton $f \colon M \to \textbf{R}$ there exist such functions $f_1; f_2; f_3 \colon \textbf{R} \to \textbf{R}$ that $f(x_1, x_2, x_3) = f_1(x_1) + f_2(x_2) +…
We determine all possible orders of automorphisms of complex K3 surfaces. A positive integer N is the order of an automorphism of a complex K3 surface if and only if $\phi(N) \leq 20$ where $\phi$ is the Euler function.
The partition function $p(n)$, which counts the number of partitions of a positive integer $n$, is widely studied. Here, we study partition functions $p_S(n)$ that count partitions of $n$ into distinct parts satisfying certain congruence…
In this article, I introduce a group-theoretical method to prove positivity of certain linear combinations (with coefficients generally lying in $\mathbb{C}$) of exponential functions under a set of semidefinite linear constraints. The…
We show that any multiplicative bijection between the algebras of differentiable functions, defined on differentiable manifolds of positive dimension, is an algebra isomorphism, given by composition with a unique diffeomorphism.
Call a noncommutative rational function $r$ regular if it has no singularities, i.e., $r(X)$ is defined for all tuples of self-adjoint matrices $X$. In this article regular noncommutative rational functions $r$ are characterized via the…
Let $A$ be a set and $f:A\rightarrow A$ a bijective function. Necessary and sufficient conditions on $f$ are determined which makes it possible to endow $A$ with a binary operation $*$ such that $(A,*)$ is a cyclic group and $f\in…
If o and * are two binary operations in a number system, then three elements a,b,c in that number system are said to satisfy the distributive property of the operation o over the operation * if, ao(b*c)= (aob)*(aoc) Now, suppose that the…