Related papers: Hybrid Character Sums From Vectorial Dual-Bent Fun…
As quantum computing becomes an emerging reality, designing efficient quantum programming capabilities is becoming more and more important. Particularly, the debugging and validation of quantum programs is of paramount importance, as these…
Central to near-term quantum machine learning is the use of hybrid quantum-classical algorithms. This paper develops a formal framework for describing these algorithms in terms of string diagrams: a key step towards integrating these hybrid…
In this paper we introduce a graph structure, called subspace sum graph $\mathcal{G}(\mathbb{V})$ on a finite dimensional vector space $\mathbb{V}$ where the vertex set is the collection of non-trivial proper subspaces of a vector space and…
Let $f$ be a complex valued function on a finite field $F$ such that $f(0) = 0$, $f(1) = 1$, and $|f(x)| = 1$ for $x \neq 0$. Cohn asked if it follows that $f$ is a nontrivial multiplicative character provided that $\sum_{x \in F} f(x)…
We identify two seemingly disparate structures: supercharacters, a useful way of doing Fourier analysis on the group of unipotent uppertriangular matrices with coefficients in a finite field, and the ring of symmetric functions in…
This work proves a Burgess bound for short mixed character sums in $n$ dimensions. The non-principal multiplicative character of prime conductor $q$ may be evaluated at any "admissible" form, and the additive character may be evaluated at…
We study the character sums \[\phi_{(m,n)}(a,b)=\sum_{x\in\mathbb{F}_q}\phi\left(x(x^{m}+a)(x^{n}+b)\right),\textrm{ and, } \psi_{(m,n)}(a,b)=\sum_{x\in\mathbb{F}_q}\phi\left((x^{m}+a)(x^{n}+b)\right)\] where $\phi$ is the quadratic…
We first find the combinatorial degree of any map $f:V\to F$ where $F$ is a finite field and $V$ is a finite-dimensional vector space over $F$. We then simplify and generalize a certain construction due to Chein and Goodaire that was used…
We study three classes of combinatorial sums involving central binomial coefficients and harmonic numbers, odd harmonic numbers, and even indexed harmonic numbers, respectively. In each case we use summation by parts to derive recursive…
Previous work has modeled the compositionality of words by creating character-level models of meaning, reducing problems of sparsity for rare words. However, in many writing systems compositionality has an effect even on the…
We consider the size of large character sums, proving new lower bounds for the quantity $\Delta(N,q) = \sup_{\chi\neq \chi_0 mod q} |\sum_{n < N} \chi(n)|$ for almost all ranges of $N$. The results are proven using the resonance method and…
We develop a systematic and fully explicit approach to the evaluation of binomial sums involving reciprocals of binomial coefficients based on Beta integral techniques. Starting from a simple integral representation, we provide a derivation…
We show that certain sums studied in two recent papers are basically character coordinates (as they are called in the literature). These sums involve values of Dirichlet characters and powers of $\cot(\pi k/n)$, $1\le k\le n-1$. We also…
In this paper, we present two new constructions of complex codebooks with multiplicative characters, additive characters and trace functions over finite fields, and determine the maximal cross-correlation amplitude of these codebooks. We…
We prove character sum estimates for additive Bohr subsets modulo a prime. These estimates are analogous to classical character sum bounds of Polya-Vinogradov and Burgess. These estimates are applied to obtain results on recurrence mod $p$…
The character table of the symmetric group $S_n$, of permutations of $n$ objects, is of fundamental interest in theoretical physics, combinatorics as well as computational complexity theory. We investigate the implications of an identity,…
Permutation polynomials over finite fields are fundamental objects as they are used in various theoretical and practical applications in cryptography, coding theory, combinatorial design, and related topics. This family of polynomials…
In the paper we obtain new estimates for binary and ternary sums of multiplicative characters with additive convolutions of characteristic functions of sets, having small additive doubling. In particular, we improve a result of M.-C. Chang.…
We develop an approach to study character sums, weighted by a multiplicative function $f:\mathbb{F}_q[t]\to S^1$, of the form \begin{equation} \sum_{G\in \mathcal{M}_N}f(G)\chi(G)\xi(G), \end{equation} where $\chi$ is a Dirichlet character…
Let $E$ be an elliptic curve over the finite field $\mathbb{F}_p$, and $P \in E(\mathbb{F}_p)$ be an $\mathbb{F}_p$-rational point. We study the sums \[ S_{\chi,P}(N,h) = \sum_{n=1}^N \chi(\psi_n(P)) \chi(\psi_{n+h}(P)), \] where…