Related papers: Switch Functions

This paper is a continuation of my previous work on absolutely continuous and singular spectral shift functions, where it was in particular proved that the singular part of the spectral shift function is an a.e. integer-valued function. It…

The switch process alternates independently between 1 and -1, with the first switch to 1 occurring at the origin. The expected value function of this process is defined uniquely by the distribution of switching times. The relation between…

The signature function of a knot is an integer-valued step function on the unit circle in the complex plane. Necessary and sufficient conditions for a function to be the signature function of a knot are presented.

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 <…

We examine the exponentially improved asymptotic expansion of the Lerch zeta function $L(\lambda,a,s)=\sum_{n=1}^\infty \exp (2\pi ni\lambda)/(n+a)^s$ for large complex values of $a$, with $\lambda$ and $s$ regarded as parameters. It is…

For any real $t$, the unitary divisor function $\sigma_t^*$ is the multiplicative arithmetic function defined by $\sigma_t^*(p^{\alpha})=1+p^{\alpha t}$ for all primes $p$ and positive integers $\alpha$. Let $\overline{\sigma_t^*(\mathbb…

Consider a permutation $\sigma\in S_n$ as a deck of cards numbered from 1 to $n$ and laid out in a row, where $\sigma_j$ denotes the number of the card that is in the $j$-th position from the left.\rm\ We define two cyclic to random…

In measure theory several results are known how measure spaces are transformed into each other. But since moment functionals are represented by a measure we investigate in this study the effects and implications of these measure…

A function $f$ from an Abelian group $(A,+)$ to an Abelian group $(B,+)$ is $(n, m, S)$ zero-difference (ZD), if $S=\{\lambda_\alpha \mid \alpha \in A\setminus\{0\}\}$ where $n=|A|$, $m=|f(A)|$ and $\lambda_\alpha=|\{x \in A \mid…

Let $F_{BC}(\lambda,k;t)$ be the Heckman-Opdam hypergeometric function of type BC with multiplicities $k=(k_1,k_2,k_3)$ and weighted half sum $\rho(k)$ of positive roots. We prove that $F_{BC}(\lambda+\rho(k),k;t)$ converges for…

We construct a Schwartz function $\varphi$ such that for every exponentially small perturbation of integers $\Lambda$, the set of translates $\{\varphi(t-\lambda), \lambda\in\Lambda\}$ spans the space $L^p(R)$, for every $p > 1$. This…

This paper is about certain string-to-string functions, called the polyregular functions. These are like the regular string-to-string functions, except that they can have polynomial (and not just linear) growth. The class has four…

If $f(x,y)$ is a real function satisfying $y>0$ and $\sum_{r=0}^{n-1}f(x+ry,ny)=f(x,y)$ for $n=1,2,3,\ldots$, we say that $f(x,y)$ is an invariant function. Many special functions including Bernoulli polynomials, Gamma function and Hurwitz…

The counting function on binary values is extended to the signed case in order to count the number of transitions between contiguous locations. A generalized subdifferential for the sign change counting function is given where classical…

We say that a function $f \in L^1(\mathbb{R})$ tiles at level $w$ by a discrete translation set $\Lambda \subset \mathbb{R}$, if we have $\sum_{\lambda \in \Lambda} f(x-\lambda)=w$ a.e. In this paper we survey the main results, and prove…

Let $A(x): =(A_{i, j}(x))$ be a continuous function defined on some subshift of $\Omega:= \{0,1, \cdots, m-1\}^\mathbb{N}$, taking $d\times d$ non-negative matrices as values and let $\nu$ be an ergodic $\sigma$-invariant measure on the…

Let $S=\{s_i\in\mathbb N\cup\{0\}:0\leq s_i<s_{i+1}\}$ and let $d_{0}=s_{0}$ and $\Delta(S)=\{d_{n}\}_{n}$ where $d_{n}=s_{n}-s_{n-1}$. In this note, we show that an $S$-gap shift is subshift of finite type (SFT) if and only if $S$ is…

We give necessary and sufficient conditions on a function $f:[0,1]\to {0,1,2,...,\omega,\continuum}$ under which there exists a continuous function $F:[0,1]\to [0,1]$ such that for every $y\in[0,1]$ we have $|F^{-1}(y)|=f(y)$.

We call an objective function or algorithm symmetric with respect to an input if after swapping two parts of the input in any algorithm, the solution of the algorithm and the output remain the same. More formally, for a permutation $\pi$ of…

Let $f$ and $g$ be real-valued continuous injections defined on a non-empty real interval $I$, and let $(X, \mathscr{L}, \lambda)$ and $(Y, \mathscr{M}, \mu)$ be probability spaces in each of which there is at least one measurable set whose…