English
Related papers

Related papers: Gauss sums over some matrix groups

200 papers

We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions with coefficients from a group algebra which is generated by…

Combinatorics · Mathematics 2021-09-07 Zhicheng Gao , Simon Kuttner , Qiang Wang

Given a number field $k$, we show that, for many finite groups $G$, all the Galois extensions of $k$ with Galois group $G$ cannot be obtained by specializing any given finitely many Galois extensions $E/k(T)$ with Galois group $G$ and $E/k$…

Number Theory · Mathematics 2017-10-25 Joachim König , François Legrand

Extending work of Foster, Doyle, and others, we show how the Foster Theorems, a family of results concerning effective resistances on finite graphs, can in certain cases be extended to infinite graphs. A family of sum rules is then…

Probability · Mathematics 2017-04-26 Greg Markowsky , José Luis Palacios

The primary goal of this paper is to introduce and investigate generalized incomplete exponential functions with matrix parameters. Integral representation, differential formula, addition formula, multiplication formula, and recurrence…

Classical Analysis and ODEs · Mathematics 2023-08-25 Ashish Verma , Komal Singh Yadav

We prove very general index formulae for integral Galois modules, specifically for units in rings of integers of number fields, for higher K-groups of rings of integers, and for Mordell-Weil groups of elliptic curves over number fields.…

Number Theory · Mathematics 2015-10-12 Alex Bartel , Bart de Smit

Recently there has been much interest in "sparsifying" sums of rank one matrices: modifying the coefficients such that only a few are nonzero, while approximately preserving the matrix that results from the sum. Results of this sort have…

Discrete Mathematics · Computer Science 2018-01-30 Marcel K. de Carli Silva , Nicholas J. A. Harvey , Cristiane M. Sato

The classical result, due to Jordan, Burnside, Dickson, says that every normal subgroup of $GL(n, K)$ ($K$ - a field, $n \geq 3$) which is not contained in the center, contains $SL(n, K)$. A. Rosenberg gave description of normal subgroups…

Group Theory · Mathematics 2021-04-23 Waldemar Hołubowski , Martyna Maciaszczyk , Sebastian Żurek

We first show joint uniform distribution of values of Kloosterman sums or Birch sums among all extensions of a finite field $\mathbb{F}_q$, for almost all couples of arguments in $\mathbb{F}_q^\times$, as well as lower bounds on…

Number Theory · Mathematics 2020-07-15 Corentin Perret-Gentil

One of the main contributions which Volker Weispfenning made to mathematics is related to Groebner bases theory. In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational…

Symbolic Computation · Computer Science 2008-05-15 Jaime Gutierrez , David Sevilla

In this paper we obtain further improvement of index bounds for character sums of polynomials over finite fields. We present some examples, which show that our new bound is an improved bound compared to both the Weil bound and the index…

Information Theory · Computer Science 2021-12-14 Yansheng Wu , Yoonjin Lee , Qiang Wang

We upper bound the number of common zeros over a finite grid of multivariate polynomials and an arbitrary finite collection of their consecutive Hasse derivatives (in a coordinate-wise sense). To that end, we make use of the tool from…

Information Theory · Computer Science 2017-07-06 Olav Geil , Umberto Martínez-Peñas

We explore a paradigm which ties together seemingly disparate areas in number theory, additive combinatorics, and geometric combinatorics including the classical Waring problem, the Furstenberg-S\'{a}rk\"{o}zy theorem on squares in sets of…

Combinatorics · Mathematics 2018-08-22 David Covert , Yeşim Demiroğlu Karabulut , Jonathan Pakianathan

We obtain new bounds on short Weil sums over small multiplicative subgroups of prime finite fields which remain nontrivial in the range the classical Weil bound is already trivial. The method we use is a blend of techniques coming from…

Number Theory · Mathematics 2022-11-16 Alina Ostafe , Igor E. Shparlinski , José Felipe Voloch

We give an elementary proof of a Caratheodory-type result on the invertibility of a sum of matrices, due first to Facchini and Barioli. The proof yields a polynomial identity, expressing the determinant of a large sum of matrices in terms…

Rings and Algebras · Mathematics 2016-04-21 Justin Chen

In this paper, the formulas of some exponential sums over finite field, related to the Coulter's polynomial, are settled based on the Coulter's theorems on Weil sums, which may have potential application in the construction of linear codes…

Cryptography and Security · Computer Science 2017-08-01 Minglong Qi , Shengwu Xiong , Jingling Yuan , Wenbi Rao , Luo Zhong

We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…

Number Theory · Mathematics 2020-07-30 Igor E. Shparlinski , Qiang Wang

We investigate the complexity of computing the Zariski closure of a finitely generated group of matrices. The Zariski closure was previously shown to be computable by Derksen, Jeandel, and Koiran, but the termination argument for their…

Computational Complexity · Computer Science 2025-03-05 Klara Nosan , Amaury Pouly , Sylvain Schmitz , Mahsa Shirmohammadi , James Worrell

We study a matrix analog of the Erd\H{o}s-Falconer distance problems in vector spaces over finite fields. There arises an interesting analysis of certain quadratic matrix Gauss sums.

Combinatorics · Mathematics 2023-05-24 Hieu T. Ngo

For two countably infinite fields whose multiplicative groups are isomorphic, we examine invariant couplings between the actions that these groups induce on the additive Pontryagin duals of the fields. We show that the actions are disjoint…

Dynamical Systems · Mathematics 2025-12-09 Michael Björklund , Alexander Fish

An elementary approach is shown which derives the value of the Gauss sum of a cubic character over a finite field $\mathbb F_{2^s}$ without using Davenport-Hasse's theorem (namely, if $s$ is odd the Gauss sum is -1, and if $s$ is even its…

Number Theory · Mathematics 2011-05-03 Davide Schipani , Michele Elia