Related papers: Switch Functions
In this paper, we recall hypergeometric functions $\mathscr{F}^{\rm Dw}_{a_1,\cdots,a_s}(t),$ $\mathscr{F}^{(\sigma)}_{a_1,\cdots,a_s}(t)$, $\widehat{\mathscr{F}}^{(\sigma)}_{a,\cdots,a}(t)$ and their transformation formulas. Then we prove…
It is shown that if $\gamma$ is a path of finite $p$ variation ($1\leq p< 2$) in a euclidean vector space and $f,g,h$ are Lipschitz functions on the trace of $\gamma$ then $s\mapsto F(s)=\int_\gamma f^sg dh$ defines an entire holomorphic…
We define eventually symmetric functions to be those power series of bounded degree in infinitely many variables that are invariant under interchanging all the variables with large enough indices. We show how this ring $\tilde{\Lambda}$ is…
Consider exponential Carmichael function $\lambda^{(e)}$ such that $\lambda^{(e)}$ is multiplicative and $\lambda^{(e)}(p^a) = \lambda(a)$, where $\lambda$ is usual Carmichael function. We discuss the value of $\sum \lambda^{(e)}(n)$, where…
Let $f \in C^n(\mathbb{R})$ be such that $\Vert f^{(n)} \Vert_\infty < \infty$. Let $f^{[n]} \in C(\mathbb{R}^{n+1})$ be the $n$th order divided difference. A special case of our main result states that for $1 < p < \infty$ we have \[\Vert…
A map $f{:}\,[0,1)\to [0,1)$ is a {\it piecewise contraction of $n$ intervals} ($n$-PC) if there exist $0<\lambda<1$ and a partition of $[0,1)$ into intervals $I_1,\ldots,I_n$ such that $f\vert_{I_i}$ is $\lambda$-Lipschitz for every $1\le…
The symmetric function theorem states that a polynomial that is invariant under permutation of variables, is a polynomial in the elementary symmetric polynomials. We deduce this classical result, in the analytic setting, from the…
We define a "shifted analogue" $\mathrm{SH}_n$ of the parking function symmetric function $\mathrm{PF}_n$. The expansion of $\mathrm{SH}_n$ in terms of three bases for shifted symmetric functions is explicitly described. We don't know a…
Stanley defined a partition function t(n) as the number of partitions $\lambda$ of n such that the number of odd parts of $\lambda$ is congruent to the number of odd parts of the conjugate partition $\lambda'$ modulo 4. We show that t(n)…
The present article is devoted to one example which related to the Salem function. The main attention is given to properties of one type of functions including items related to functional equations, graphs, the Lebesgue integral, etc.
The Riemann zeta function can be written as the Mellin transform of the unit interval map w(x) = floor(1/x)*(-1+x*floor(1/x)+x) multiplied by s((s+1)/(s-1)). A finite-sum approximation to \zeta (s) denoted by \zeta_w(N;s) which has real…
For a finite dimensional algebra $A$ with $0 < \phi dim (A) = m < \infty$ we prove that there always exist modules $M$ and $N$ such that $\phi(M) = m-1$ and $\phi (N) = 1$. On the other hand, we see an example of an algebra that not every…
For $0<\alpha, \lambda \leq 1$, the Lerch zeta-function is defined by $L(s;\alpha, \lambda)$$:= \sum_{n=0}^\infty e^{2\pi i\lambda n} (n+\alpha)^{-s}$, where $\sigma>1$. In this paper, we prove joint universality for Lerch zeta-functions…
The Additive Transform of an arithmetic function represents a novel approach to examining the interplay between multiplicative arithmetic function and additive functions. This transform concept introduces a method to systematically generate…
We consider Boolean functions f:{-1,1}^n->{-1,1} that are close to a sum of independent functions on mutually exclusive subsets of the variables. We prove that any such function is close to just a single function on a single subset. We also…
A parking function of length $n$ is a sequence $\pi=(\pi_1,\dots, \pi_n)$ of positive integers such that if $\lambda_1\leq\cdots\leq \lambda_n$ is the increasing rearrangement of $\pi_1,\dots,\pi_n$, then $\lambda_i\leq i$ for $1\leq i\leq…
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.
The signature is an infinite graded sequence of statistics known to characterise a stream of data up to a negligible equivalence class. It is a transform which has previously been treated as a fixed feature transformation, on top of which a…
Suppose $\Lambda$ is a discrete infinite set of nonnegative real numbers. We say that $ {\Lambda}$ is of type 1 if the series $s(x)=\sum_{\lambda\in\Lambda}f(x+\lambda)$ satisfies a zero-one law. This means that for any non-negative…
While transformers have proven enormously successful in a range of tasks, their fundamental properties as models of computation are not well understood. This paper contributes to the study of the expressive capacity of transformers,…