Related papers: Hybrid Character Sums From Vectorial Dual-Bent Fun…
Character polynomials are used to study the restriction of a polynomial representation of a general linear group to its subgroup of permutation matrices. A simple formula is obtained for computing inner products of class functions given by…
One of the main features of eigenvalue matrix models is that the averages of characters are again characters, what can be considered as a far-going generalization of the Fourier transform property of Gaussian exponential. This is true for…
Let $p$ be a prime, and $N$ be a positive integer not divisible by $p$. Denote by ${\rm ord}_N(p)$ the multiplicative order of $p$ modulo $N$. Let $\mathbb{F}_q$ represent the finite field of order $q=p^{{\rm ord}_N(p)}$. For $a,…
The class of non-commutative hypercomplex number systems (HNS) of 4-dimension constructed by using of non-commutative procedure of Grassman-Clifford doubling of 2-dimensional systems is investigated in the article. All HNS of this class are…
Recent methods for learning vector space representations of words have succeeded in capturing fine-grained semantic and syntactic regularities using vector arithmetic. However, these vector space representations (created through large-scale…
We use bounds of mixed character sum to study the distribution of solutions to certain polynomial systems of congruences modulo a prime $p$. In particular, we obtain nontrivial results about the number of solution in boxes with the side…
Ensemble models are widely used to solve complex tasks by their decomposition into multiple simpler tasks, each one solved locally by a single member of the ensemble. Decoding of error-correction codes is a hard problem due to the curse of…
In this paper, we investigate the distribution of the maximum of character sums over the family of primitive quadratic characters attached to fundamental discriminants $|d|\leq x$. In particular, our work improves results of Montgomery and…
VBP is the class of polynomial families that can be computed by the determinant of a symbolic matrix of the form $A_0 + \sum_{i=1}^n A_ix_i$ where the size of each $A_i$ is polynomial in the number of variables (equivalently, computable by…
Polynomial sequences $p_n(x)$ of binomial type are a principal tool in the umbral calculus of enumerative combinatorics. We express $p_n(x)$ as a \emph{path integral} in the ``phase space'' $\Space{N}{} \times {[-\pi,\pi]}$. The Hamiltonian…
In this article, we investigate large values of Dirichlet character sums with multiplicative coefficients $\sum_{n\le N}f(n)\chi(n)$. We prove an Omega result in the region $\exp((\log q)^{\frac12+\varepsilon})\le N\le\sqrt q$, where $q$ is…
This paper describes algorithms to deal with nested symbolic sums over combinations of harmonic series, binomial coefficients and denominators. In addition it treats Mellin transforms and the inverse Mellin transformation for functions that…
Association schemes play an important role in algebraic combinatorics and have important applications in coding theory, graph theory and design theory. The methods to construct association schemes by using bent functions have been…
We present a number of results about (finite) multiple harmonic sums modulo a prime, which provide interesting parallels to known results about multiple zeta values (i.e., infinite multiple harmonic series). In particular, we prove a…
Let $R$ be a commutative ring, $f \in R[X_1,\ldots,X_k]$ a multivariate polynomial, and $G$ a finite subgroup of the group of units of $R$ satisfying a certain constraint, which always holds if $R$ is a field. Then, we evaluate $\sum…
Sequence discriminative training is a great tool to improve the performance of an automatic speech recognition system. It does, however, necessitate a sum over all possible word sequences, which is intractable to compute in practice.…
We compute generating functions for the sum of the real-valued character degrees of the finite general linear and unitary groups, through symmetric function computations. For the finite general linear group, we get a new combinatorial proof…
A modified Dirichlet character $f$ is a completely multiplicative function such that for some Dirichlet character $\chi$, $f(p)=\chi(p)$ for all but a finite number of primes $p\in S$, and for those exceptional primes $p\in S$, $|f(p)|\leq…
Fibonacci codes are self-synchronizing variable-length codes that are proven useful for their robustness and compression capability. Asymptotically, these codes provide better compression efficiency as the order of the underlying Fibonacci…
A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…