Related papers: A functional equation arising from multiplication …

We consider the $q$th root number function for the symmetric group. Our aim is to develop an asymptotic formula for the multiplicities of the $q$th root number function as $q$ tends to $\infty$. We use character theory, number theory and…

In this paper, by making use of properties of elliptic functions, we describe meromorphic solutions of Fermat-type functional equations $f(z)^{n}+f(L(z))^{m}=1$ over the complex plane $\mathbb{C}$, where $L(z)$ is a nonconstant entire…

Recently, the functional equation \[ \sum_{i=0}^mf_i(b_ix+c_iy)= \sum_{i=1}^na_i(y)v_i(x) \] with $x,y\in\mathbb{R}^d$ and $b_i,c_i\in\mathbf{GL}_d(\mathbb{C})$, was studied by Almira and Shulman, both in the classical context of continuous…

We introduce the language QML, a functional language for quantum computations on finite types. Its design is guided by its categorical semantics: QML programs are interpreted by morphisms in the category FQC of finite quantum computations,…

$q$-analogs of special functions, including hypergeometric functions, play a central role in mathematics and have numerous applications in physics. In the theory of probability, $q$-analogs of various probability distributions have been…

Let $F_n$ be the $n$th Fibonacci number. Let $m, n$ be positive integers. Define a sequence $(G(k,n,m))_{k\geq 1}$ by $G(1,n,m) = F^m_n$, and $G(k+1,n,m) = F_{nG(k,n,m)}$ for all $k\geq 1$. We show that $F_n^{k+m-1}\mid G(k,n,m)$ for all…

In this paper, we give the general solution of the functional equation $$\big\{\|f(x)+f(y)\|,\|f(x)-f(y)\|\big\}=\big\{\|x+y\|,\|x-y\|\big\}\qquad(x,y\in X)$$ where $f:X\to Y$ and $X,Y$ are inner product spaces. Related equations are also…

Let E_n={x_i=1, x_i+x_j=x_k, x_i*x_j=x_k: i,j,k \in {1,...,n}}. We prove: (1) there is an algorithm that for every computable function f:N-->N returns a positive integer m(f), for which a second algorithm accepts on the input f and any…

For a simple connected graph $G$, the $Q$-generating function of the numbers $N_k$ of semi-edge walks of length $k$ in $G$ is defined by $W_Q(t)=\sum\nolimits_{k = 0}^\infty {N_k t^k }$. This paper reveals that the $Q$-generating function…

Some families of linear permutation polynomials of $\mathbb{F}_{q^{ms}}$ with coefficients in $\mathbb{F}_{q^{m}}$ are explicitly described (via conditions on their coefficients) as isomorphic images of classical subgroups of the general…

New methods for obtaining functional equations for Feynman integrals are presented. Application of these methods for finding functional equations for various one- and two- loop integrals described in detail. It is shown that with the aid of…

A monic polynomial in F_q[t] of degree n over a finite field F_q of odd characteristic can be written as the sum of two irreducible monic elements in F_q[t] of degrees n and n-1 if q is larger than a bound depending only on n. The main tool…

This paper initiates a systematic study of quantum functions, which are (partial) functions defined in terms of quantum mechanical computations. Of all quantum functions, we focus on resource-bounded quantum functions whose inputs are…

Using the representation of E_q(2) on the non-commutative space zz^*-qz^*z=\sigma; q<1, \sigma>0 summation formulas for the product of two, three and four q-Kummer functions are derived.

We consider some $q$-series which depend on a pair of positive integers $(k,m)$. While positivity of these series holds for the first few values of $(k,m)$, the situation is quite unclear for other values of $(k,m)$. In addition, our series…

In this paper, we study the binomial sum $S_{n}(q):=% \overset{n}{\underset{k=0}{\sum }}a_{k}\binom{n}{k}\left( 1-q\right) ^{k}q^{n-k}$ for a given sequence $\left( a_{n}\right) $ of real or complex numbers. We express $S_{n}(q)$ in…

The $q$-calculus for generic $q$ is developed and related to the deformed oscillator of parameter $q^{1/2}$. By passing with care to the limit in which $q$ is a root of unity, one uncovers the full algebraic structure of ${{\cal…

A set of functions is defined which is indexed by a positive integer $n$ and partitions of integers. The case $n=1$ reproduces the standard Schur polynomials. These functions are seen to arise naturally as a determinant of an action on the…

What is the computational power of a quantum computer? We show that determining the output of a quantum computation is equivalent to counting the number of solutions to an easily computed set of polynomials defined over the finite field…

We construct classes of permutation polynomials over F_{Q^2} by exhibiting classes of low-degree rational functions over F_{Q^2} which induce bijections on the set of (Q+1)-th roots of unity in F_{Q^2}. As a consequence, we prove two…