中文
相关论文

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

200 篇论文

In this paper we consider a variety of mixed character sums. In particular we extend a bound of Heath-Brown and Pierce to the case of squarefree modulus, improve on a result of Chang for mixed sums in finite fields, we show in certain…

数论 · 数学 2014-10-15 Bryce Kerr

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…

数论 · 数学 2019-02-20 Igor E. Shparlinski

Let $G$ be a nonabelian finite group and let $d$ be an irreducible character degree of $G$. Then there is a positive integer $e$ so that $|G| = d(d+e)$. Snyder has shown that if $e > 1$, then $|G|$ is bounded by a function of $e$. This…

群论 · 数学 2014-11-13 Mark L. Lewis

We study sums of Dirichlet characters over polynomials in $\mathbb{F}_q[t]$ with a prescribed number of irreducible factors. Our main results are explicit formulae for these sums in terms of zeros of Dirichlet L-functions. We also exhibit…

数论 · 数学 2020-03-27 Samuel Porritt

Let $g(X)$ be a polynomial over a finite field ${\mathbb F}_q$ with degree $o(q^{1/2})$, and let $\chi$ be the quadratic residue character. We give a polynomial time algorithm to recover $g(X)$ (up to perfect square factors) given the…

计算复杂性 · 计算机科学 2026-01-13 Swastik Kopparty

We obtain a new bound on certain double sums of multiplicative characters improving the range of several previous results. This improvement comes from new bounds on the number of collinear triples in finite fields, which is a classical…

数论 · 数学 2018-03-26 Ilya D. Shkredov , Igor E. Shparlinski

We define the $L$-measure on the set of Dirichlet characters as an analogue of the Plancherel measure, once considered as a measure on the irreducible characters of the symmetric group. We compare the two measures and study the limit in…

概率论 · 数学 2017-01-17 Yacine Barhoumi-Andréani

In this paper we proved a new numerically explicit version of the P\'{o}lya--Vinogradov inequality. Our proof is based on the new ideas of V.A. Bykovskii and improves a recent inequality obtained by C. Pomerance.

数论 · 数学 2011-07-05 Dmitriy Frolenkov

In 2016 Ananyan and Hochster proved Stillman's conjecture by showing the existence of a uniform upper bound on the length of an $R_\eta$-sequence containing fixed $n$ forms of degree at most $d$ in polynomial rings over a field. This result…

交换代数 · 数学 2026-05-28 Giulio Caviglia , Yihui Liang , Cheng Meng

Let $p$ be a prime. For $p=2$, the fields of values of the complex irreducible characters of finite groups whose degrees are not divisible by $p$ have been classified; for odd primes $p$, a conjectural classification has been proposed. In…

表示论 · 数学 2026-01-26 Nguyen N. Hung , Gabriel Navarro , Pham Huu Tiep

Let us recall the well-known Shirshov's Height Theorem. "Let A be a finitely generated algebra of degree d. Then there exists a finite set Y which is the subset of A that A has and an integer h' = h(A) such that A has Shirshov's height h'…

组合数学 · 数学 2011-10-13 Mikhail Kharitonov

Let $V$ be a finite abelian group of odd order, equipped with a non-degenerate, alternating form $\omega\colon V\times V \to \mathbb{Z}/m\mathbb{Z}$. We give closed formulas for the character values of the Weil representation associated…

表示论 · 数学 2023-03-20 Frieder Ladisch

In this paper, we consider universal sums of generalized polygonal numbers. Fixing $m\in\mathbb{N}_{\geq 3}$, we show two finiteness theorems for universal sums of generalized polygonal numbers whose inputs have a restricted number $L$ of…

数论 · 数学 2026-04-10 Soumyarup Banerjee , Ben Kane , Kwan To Ng

A border of a string is a non-empty prefix of the string that is also a suffix of the string, and a string is unbordered if it has no border other than itself. Loptev, Kucherov, and Starikovskaya [CPM 2015] conjectured the following: If we…

数据结构与算法 · 计算机科学 2018-12-18 Patrick Hagge Cording , Travis Gagie , Mathias Bæk Tejs Knudsen , Tomasz Kociumaka

We present a strong upper bound on the number k(B) of irreducible characters of a p-block B of a finite group G in terms of local invariants. More precisely, the bound depends on a chosen major B-subsection (u,b), its normalizer N_G(\langle…

表示论 · 数学 2018-07-24 Benjamin Sambale

The paper studies the probability for a Galois group of a random polynomial to be $A_n$. We focus on the so-called large box model, where we choose the coefficients of the polynomial independently and uniformly from $\{-L,\ldots, L\}$. The…

数论 · 数学 2024-04-02 Lior Bary-Soroker , Or Ben-Porath , Vlad Matei

We obtain new effective results in best approximation theory, specifically moduli of uniqueness and constants of strong unicity, for the problem of best uniform approximation with bounded coefficients, as first considered by Roulier and…

经典分析与常微分方程 · 数学 2021-12-30 Andrei Sipos

Under Poincar\'e-type conditions, upper bounds are explored for the Kolmogorov distance between the distributions of weighted sums of dependent summands and the normal law. Based on improved concentration inequalities on high-dimensional…

概率论 · 数学 2020-11-19 S. G. Bobkov , G. P. Chistyakov , F. Götze

Let \chi be an irreducible character of the finite group G. If g is an element of G and \chi(g) is not zero, then we conjecture that the order of g divides |G|/\chi(1). The conjecture is a generalization of the classical fact that…

表示论 · 数学 2007-05-23 Tom Wilde

Serre obtained a sharp bound on how often two irreducible degree $n$ complex characters of a finite group can agree, which tells us how many local factors determine an Artin $L$-function. We consider the more delicate question of finding a…

群论 · 数学 2017-09-11 Kimball Martin , Nahid Walji