Related papers: Means of iterates
The affine group of a tree is the group of the isometries of a homogeneous tree that fix an end of its boundary. Consider a probability measure on this group and the associated random walk. The main goal of this paper is to determine the…
We provide a necessary and sufficient condition for a simple object in a pivotal k-category to be ambidextrous. In turn, these objects imply the existence of nontrivial trace functions in the category. These functions play an important role…
Andrews introduced the partition function $\overline{C}_{k, i}(n)$, called singular overpartition, which counts the number of overpartitions of $n$ in which no part is divisible by $k$ and only parts $\equiv \pm i\pmod{k}$ may be overlined.…
We continue work started in [1] concerning integer sequences q(n), n in N, defined by q(n) = q(n-q(n-1)) + f(n), with q(1) = 1. Here, f(n), with f(1) = 0, is a given sequence. We define F as the set of semi-infinite sequence f such that the…
A $\textit{square-full}$ number is a positive integer for which all its prime divisors divide itself at least twice. The counting function of square-full integers of the form $f(n)$ for $n\leqslant N$ is denoted by…
In this paper upper bounds are given for the successive differences $A_{n+1}-A_{n}$ and B$_{n}-B_{n-1}$ where $A_{n}=1/(n-1) \tsum_{r=1}^{n-1}f(r/n)$, $B_{n}=1/(n+1) \tsum_{r=0}^{n}f(r/n)$ and $f$ is superquadratic function. We obtain…
Given an iterated function system of affine dilations with fixed points the vertices of a regular polygon, we characterize which points in the limit set lie on the boundary of its convex hull.
We consider convex sets and functions over idempotent semifields, like the max-plus semifield. We show that if $K$ is a conditionally complete idempotent semifield, with completion $\bar{K}$, a convex function $K^n\to\bar{K}$ which is lower…
Let $\phi(n)$ be the Euler-phi function, define $\phi_0(n) = n$ and $\phi_{k+1}(n)=\phi(\phi_{k}(n))$ for all $k\geq 0$. We will determine an asymptotic formula for the set of integers $n$ less than $x$ for which $\phi_k(n)$ is $y$-smooth,…
Let $s(n)$ be the number of different remainders $n \bmod k$, where $1 \leq k \leq \lfloor n/2 \rfloor$. This rather natural sequence is sequence A283190 in the OEIS and while some basic facts are known, it seems that surprisingly it has…
Classification of Non-linear Boolean functions is a long-standing problem in the area of theoretical computer science. In this paper, effort has been made to achieve a systematic classification of all n-variable Boolean functions, where…
Determining the approximate degree composition for Boolean functions remains a significant unsolved problem in Boolean function complexity. In recent decades, researchers have concentrated on proving that approximate degree composes for…
In this paper we investigate one Wakimoto-type construction of affine Kac-Moody algebras. We obtain a version of the regular representation, on which the affine algebra acts from the left and from the right with the sum of levels equal to…
For completely multiplicative functions f(n) taking values 1 and -1, under certain conditions on f(n) we show that f(n) changes sign at least x exp(-7(log log x)sqrt(log x)) times as n runs through the integers <= x.
We associate to each Boolean function a polynomial whose evaluations represents the distances from all possible Boolean affine functions. Both determining the coefficients of this polynomial from the truth table of the Boolean function and…
In this note, we study the general form of a multiplicative bijection on several families of functions defined on manifolds, both real or complex valued. In the real case, we prove that it is essentially defined by a composition with a…
In this paper, we focus on ordered $k$-flaw preference sets. Let $\mathcal{OP}_{n,\geq k}$ denote the set of ordered preference sets of length $n$ with at least $k$ flaws and $\mathcal{S}_{n,k}=\{(x_1,...,x_{n-k})\mid x_1+x_2+...…
We give a bijective proof of the fact that the number of k-prefixes of minimal factorisations of the n-cycle (1...n) as a product of n-1 transpositions is n^{k-1}\binom{n}{k+1}. Rather than a bijection, we construct a surjection with fibres…
We study the compositions of an integer n whose part sizes do not exceed a fixed integer k. We use the methods of analytic combinatorics to obtain precise asymptotic formulas for the number of such compositions, the total number of parts…
This paper concerns the values of the Euler phi-function evaluated simultaneously on k arithmetic progressions a_1 n + b_1, a_2 n + b_2, ..., a_k n + b_k. Assuming the necessary condition that no two of the polynomials a_i x + b_i are…