中文
相关论文

相关论文: Large character sums: Pretentious characters and t…

200 篇论文

Let G be a finite group and N be a non-trivial normal subgroup of G, such that the average character degree of irreducible characters in Irr(G|N) is less than or equal to 16=5. Then we prove that N is solvable. Also, we prove the…

群论 · 数学 2021-09-10 Zeinab Akhlaghi

The generalized Kazhdan-Lusztig polynomials for the finite dimensional irreducible representations of the general linear superalgebra are computed explicitly. Using the result we establish a one to one correspondence between the set of…

量子代数 · 数学 2007-05-23 Yucai Su , R. B. Zhang

We prove an upper bound for characters of the symmetric groups. Namely, we show that there exists a constant a>0 with a property that for every Young diagram \lambda with n boxes, r(\lambda) rows and c(\lambda) columns |Tr \rho^\lambda(\pi)…

表示论 · 数学 2011-03-22 Valentin Féray , Piotr Sniady

In this article, we study extreme values of quadratic character sums with multiplicative coefficients $\sum_{n \le N}f(n)\chi_d(n)$. For a positive number $N$ within a suitable range, we employ the resonance method to establish a…

数论 · 数学 2025-08-26 Zikang Dong , Zhonghua Li , Yutong Song , Shengbo Zhao

We present some results on character degree sums in connection with certain characteristics of finite groups such as p-solvability, solvability, supersolvability, and nilpotency. Some of them strengthen known results in the literature.

群论 · 数学 2013-09-17 Attila Maroti , Hung Ngoc Nguyen

In this paper, we prove some extensions of recent results given by Shkredov and Shparlinski on multiple character sums for some general families of polynomials over prime fields. The energies of polynomials in two and three variables are…

数论 · 数学 2019-07-31 Doowon Koh , Mozhgan Mirzaei , Thang Pham , Chun-Yen Shen

We consider a problem posed by Erd\H{o}s, Herzog and Piranian on the maximum product of distances of a point set of order $n$ with a given diameter. We prove that it is sufficient to consider convex polygons and obtain results on the…

组合数学 · 数学 2026-03-10 Stijn Cambie , Arne Decadt , Yanni Dong , Tao Hu , Quanyu Tang

For each $n$, let $\text{RD}(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In 1945, Segre called for a better understanding of the large…

代数几何 · 数学 2021-07-20 Alexander J. Sutherland

In recent years, maximizing G\'al sums regained interest due to a firm link with large values of $L$-functions. In the present paper, we initiate an investigation of small sums of G\'al type, with respect to the $L^1$-norm. We also consider…

数论 · 数学 2020-07-13 Régis de la Bretèche , Marc Munsch , Gérald Tenenbaum

Let N be a minimal normal nonabelian subgroup of a finite group G. We will show that there exists a nontrivial irreducible character of N of degree at least 5 which is extendible to G. This result will be used to settle two open questions…

群论 · 数学 2010-04-16 Kay Magaard , Hung P. Tong-Viet

We show that a double character sum, appearing in the work of Conrey-Iwaniec and Petrow-Young on Weyl bound for certain $L$-functions, is essentially a hypergeometric sum introduced by Katz. This produces a simple proof of the upper bound…

数论 · 数学 2023-03-01 Ping Xi

Two digraphs of order $n$ are said to pack if they can be found as edge-disjoint subgraphs of the complete digraph of order $n$. It is well established that if the sum of the sizes of the two digraphs is at most $2n-2$, then they pack, with…

组合数学 · 数学 2026-01-21 Maciej Cisiński , Andrzej Żak

We consider the set $\mathcal{M}_n(\mathbb{Z}; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain upper and lower bounds on the number of distinct irreducible characteristic polynomials which correspond to…

数论 · 数学 2025-02-18 László Mérai , Igor E. Shparlinski

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…

数论 · 数学 2025-04-17 Kurt Girstmair

In this paper we give a refinement of the bound of D. A. Burgess for multiplicative character sums modulo a prime number $q$. This continues a series of previous logarithmic improvements, which are mostly due to H. Iwaniec and E. Kowalski.…

数论 · 数学 2019-05-09 Bryce Kerr , Igor E. Shparlinski , Kam Hung Yau

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…

表示论 · 数学 2007-09-20 Nathaniel Thiem , C. Ryan Vinroot

Let $G$ be a finite group, and $\pi$ be a set of primes. The $\pi$-core $\mathbf{O}_\pi(G)$ is the unique maximal normal $\pi$-subgroup of $G$, and $b(G)$ is the largest irreducible character degree of $G$. In 2017, Qian and Yang proved…

群论 · 数学 2024-10-14 Zongshu Wu , Yong Yang

In this paper we prove two results concerning Vinogradov's three primes theorem with primes that can be called almost twin primes. First, for any $m$, every sufficiently large odd integer $N$ can be written as a sum of three primes $p_1,…

数论 · 数学 2019-02-20 Kaisa Matomäki , Xuancheng Shao

We prove that if the average of the degrees of the irreducible characters of a finite group $G$ is less than 16/5, then $G$ is solvable. This solves a conjecture of I.M. Isaacs, M. Loukaki, and the first author. We discuss related…

群论 · 数学 2013-12-06 Alexander Moretó , Hung Ngoc Nguyen

In this paper we study the complex representations of reductive groups over local non-Archimedean fields. We use the building of the reductive group to give upper-bounds for the absolute value of the character of an admissible…

表示论 · 数学 2015-06-25 Julius Witte