English
Related papers

Related papers: Hybrid Character Sums From Vectorial Dual-Bent Fun…

200 papers

Brain-inspired hyperdimensional (HD) computing models neural activity patterns of the very size of the brain's circuits with points of a hyperdimensional space, that is, with hypervectors. Hypervectors are $D$-dimensional (pseudo)random…

Emerging Technologies · Computer Science 2019-04-04 Manuel Schmuck , Luca Benini , Abbas Rahimi

Let $P = \{p(i)\}$ be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, there are nontrivial $P$ for which known methods find a…

Information Theory · Computer Science 2016-11-17 Michael B. Baer

A current trend in HPC systems is the utilization of architectures with SIMD or vector extensions to exploit data parallelism. There are several ways to take advantage of such modern vector architectures, each with a different impact on the…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-11-05 Marc Blancafort , Roger Ferrer , Guillaume Houzeaux , Marta Garcia-Gasulla , Filippo Mantovani

Let $p$ be a prime, $m$ be a positive integer ( $m \geq 1$, and $m \geq 2$ if $p=2$), and $\chi_n$ be a multiplicative complex character on $\mathbb F^*_{p^m}$ with order $n| (p^m-1)$. We show that a partition $\mathcal A_1 \cup \mathcal…

Number Theory · Mathematics 2021-02-16 Michele Elia

Let $\chi$ be a non-real Dirichlet character modulo a prime $q$. In this paper we prove that the distribution of the short character sum $S_{\chi,H}(x)=\sum_{x< n\leq x+H} \chi(n)$, as $x$ runs over the positive integers below $q$,…

Number Theory · Mathematics 2011-07-01 Youness Lamzouri

A known result for the finite general linear group $\GL(n,\FF_q)$ and for the finite unitary group $\U(n,\FF_{q^2})$ posits that the sum of the irreducible character degrees is equal to the number of symmetric matrices in the group. Fulman…

Representation Theory · Mathematics 2007-09-20 Nathaniel Thiem , C. Ryan Vinroot

We study the parameterized complexity of algorithmic problems whose input is an integer set $A$ in terms of the doubling constant $C := |A + A|/|A|$, a fundamental measure of additive structure. We present evidence that this new…

Data Structures and Algorithms · Computer Science 2024-07-26 Tim Randolph , Karol Węgrzycki

This paper introduces and motivates the use of hybrid robust feature extraction technique for spoken language identification (LID) system. The speech recognizers use a parametric form of a signal to get the most important distinguishable…

Sound · Computer Science 2010-03-31 Pawan Kumar , Astik Biswas , A . N. Mishra , Mahesh Chandra

We consider nested sums involving the Pochhammer symbol at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi,$ $\log(2)$ or zeta values. In order to perform these simplifications, we view the series as…

Combinatorics · Mathematics 2019-04-11 Jakob Ablinger

In this investigation of character tables of finite groups we study basic sets and associated representation theoretic data for complementary sets of conjugacy classes. For the symmetric groups we find unexpected properties of characters on…

Representation Theory · Mathematics 2012-06-05 Christine Bessenrodt , Jørn B. Olsson

Let $q=p^n$ with $n=2m$ and $p$ be an odd prime. Let $0\leq k\leq n-1$ and $k\neq m$. In this paper we determine the value distribution of following exponential(character) sums \[\sum\limits_{x\in \bF_q}\zeta_p^{\Tra_1^m (\alpha…

Information Theory · Computer Science 2009-02-27 Jinquan Luo , Yuansheng Tang , Hongyu Wang

Codebooks with small inner-product correlation have application in unitary space-time modulations, multiple description coding over erasure channels, direct spread code division multiple access communications, compressed sensing, and coding…

Information Theory · Computer Science 2019-05-23 Yanfeng Qi , Sihem Mesnager , Chunming Tang

A combinatorial Hopf algebra is a graded connected Hopf algebra over a field $F$ equipped with a character (multiplicative linear functional) $\zeta:H\to F$. We show that the terminal object in the category of combinatorial Hopf algebras is…

Combinatorics · Mathematics 2016-11-08 Marcelo Aguiar , Nantel Bergeron , Frank Sottile

In 1961, Solomon gave upper and lower bounds for the sum of all the entries in the character table of a finite group in terms of elementary properties of the group. In a different direction, we consider the ratio of the character table sum…

Representation Theory · Mathematics 2024-06-11 Arvind Ayyer , Hiranya Kishore Dey , Digjoy Paul

We introduce a class of $f(t)$-factorials, or $f(t)$-Pochhammer symbols, that includes many, if not most, well-known factorial and multiple factorial function variants as special cases. We consider the combinatorial properties of the…

Combinatorics · Mathematics 2017-03-31 Maxie D. Schmidt

We introduce and analyze a novel class of binary operations on finite-dimensional vector spaces over a field K, defined by second-order multilinear expressions with linear shifts. These operations generate polynomials whose degree increases…

General Mathematics · Mathematics 2025-07-08 Stanislav Semenov

We propose a new class of convex penalty functions, called \emph{variational Gram functions} (VGFs), that can promote pairwise relations, such as orthogonality, among a set of vectors in a vector space. These functions can serve as…

Optimization and Control · Mathematics 2017-04-13 Amin Jalali , Maryam Fazel , Lin Xiao

We estimate character sums with n!, on average, and individually. These bounds are used to derive new results about various congruences modulo a prime p and obtain new information about the spacings between quadratic nonresidues modulo p.…

Number Theory · Mathematics 2007-05-23 Moubariz Z. Garaev , Florian Luca , Igor E. Shparlinski

A majority of coded matrix-matrix computation literature has broadly focused in two directions: matrix partitioning for computing a single computation task and batch processing of multiple distinct computation tasks. While these works…

Information Theory · Computer Science 2022-01-04 Lev Tauz , Lara Dolecek

Hardware/Software (HW/SW) co-designed processors provide a promising solution to the power and complexity problems of the modern microprocessors by keeping their hardware simple. Moreover, they employ several runtime optimizations to…

Hardware Architecture · Computer Science 2021-03-01 Rakesh Kumar , Alejandro Martinez , Antonio Gonzalez