中文
相关论文

相关论文: Comparing EQP and MOD_{p^k}P using Polynomial Degr…

200 篇论文

In this paper, we consider the relationship between the Mahler measure of a polynomial and its separation. In 1964, Mahler proved that if $f(x) \in \mathbb{Z}[x]$ is separable of degree $n$, then $\operatorname{sep}(f) \gg_n M(f)^{-(n-1)}$.…

数论 · 数学 2025-09-10 Greg Knapp , Chi Hoi Yip

We explore the space "just above" BQP by defining a complexity class PDQP (Product Dynamical Quantum Polynomial time) which is larger than BQP but does not contain NP relative to an oracle. The class is defined by imagining that quantum…

量子物理 · 物理学 2014-12-22 Scott Aaronson , Adam Bouland , Joseph Fitzsimons , Mitchell Lee

We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q n^{-1} + O(n^{-2})$. More generally, we give an asymptotic formula for the…

数论 · 数学 2016-05-25 Andreas Weingartner

What is the maximum possible value of the lead coefficient of a degree $d$ polynomial $Q(x)$ if $|Q(1)|,|Q(2)|,\ldots,|Q(k)|$ are all less than or equal to one? More generally we write $L_{d,[x_k]}(x)$ for what we prove to be the unique…

数论 · 数学 2015-06-11 Karl Levy

An open problem in complexity theory is to find the minimal degree of a polynomial representing the $n$-bit OR function modulo composite $m$. This problem is related to understanding the power of circuits with $\text{MOD}_m$ gates where $m$…

计算复杂性 · 计算机科学 2015-11-13 Holden Lee

Given a lower envelope in the form of an arbitrary sequence $u$, let $LSP(u, d)$ denote the maximum length of any subsequence of $u$ that can be realized as the lower envelope of a set of polynomials of degree at most $d$. Let $sp(m, d)$…

组合数学 · 数学 2016-06-07 Jesse Geneson

Let $F$ be a non-negatively graded free module over a polynomial ring $\mathbb{K}[x_1,\dots,x_n]$ generated by $m$ basis elements. Let $M$ be a submodule of $F$ generated by elements in $F$ with degrees bounded by $D$ and dim $F/M$=$r$. We…

交换代数 · 数学 2022-04-22 Yihui Liang

We show that every (possibly unbounded) convex polygon $P$ in $R^2$ with $m$ edges can be represented by inequalities $p_1 \ge 0,...,p_n \ge 0,$ where the $p_i$'s are products of at most $k$ affine functions each vanishing on an edge of $P$…

度量几何 · 数学 2010-02-05 Gennadiy Averkov , Christian Bey

Let $G$ be a finite group, $p$ a prime, and $IBr_p(G)$ the set of irreducible $p$-Brauer characters of $G$. Let $\bar e_p(G)$ be the largest integer such that $p^{\bar e_p(G)}$ divides $\chi(1)$ for some $\chi \in IBr_p(G)$. We show that…

群论 · 数学 2020-01-30 Christine Bessenrodt , Yong Yang

Let K/Q be Galois, and let eta in K* whose conjugates are multiplicatively independent. For a prime p, unramified, prime to eta, let np be the residue degree of p and gp the number of P I p, then let o\_P(eta) and o\_p(eta) be the orders of…

数论 · 数学 2021-08-06 Georges Gras

Let $G$ be a finite group and $Irr(G)$ the set of irreducible complex characters of $G$. Let $e_p(G)$ be the largest integer such that $p^{e_p(G)}$ divides $\chi(1)$ for some $\chi \in Irr(G)$. We show that $|G:\mathbf{F}(G)|_p \leq p^{k…

群论 · 数学 2015-07-27 Yong Yang , Guohua Qian

The concept of p-ordering for a prime p was introduced by Manjul Bhargava (in his PhD thesis) to develop a generalized factorial function over an arbitrary subset of integers. This notion of p-ordering provides a representation of…

数论 · 数学 2020-11-24 Aditya Gulati , Sayak Chakrabarti , Rajat Mittal

Consider the polynomial optimization problem whose objective and constraints are all described by multivariate polynomials. Under some genericity assumptions, %% on these polynomials, we prove that the optimality conditions always hold on…

最优化与控制 · 数学 2008-02-12 Jiawang Nie , Kristian Ranestad

We derive an explicit upper bound for the number of systems of Hecke eigenvalues coming from Siegel modular forms (mod p) of dimension g and level N relatively prime to p. In the special case of elliptic modular forms (g=1), our result…

数论 · 数学 2007-05-23 Alexandru Ghitza

We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…

We are interested in determining the bound of the average of the degrees of the irreducible characters whose degrees are not divisible by some prime $p$ that guarantees a finite group $G$ of odd order is $p$-nilpotent. We find a bound that…

群论 · 数学 2022-03-25 Ramadan Elsharif , Mark L. Lewis

In this paper, for positive integers $H$ and $k \leq n$, we obtain some estimates on the cardinality of the set of monic integer polynomials of degree $n$ and height bounded by $H$ with exactly $k$ roots of maximal modulus. These include…

数论 · 数学 2024-09-16 Artūras Dubickas , Min Sha

For an odd prime number $p$, we consider degree $p$ extensions $L/K$ of $p$-adic fields with normal closure $\widetilde{L}$ such that the Galois group of $\widetilde{L}/K$ is the dihedral group of order $2p$. We shall prove a complete…

数论 · 数学 2022-11-15 Daniel Gil-Muñoz

Linear recursions of degree $k$ are determined by evaluating the sequence of Generalized Fibonacci Polynomials, $\{F_{k,n}(t_1,...,t_k)\}$ (isobaric reflects of the complete symmetric polynomials) at the integer vectors $(t_1,...,t_k)$. If…

数论 · 数学 2007-12-17 Trueman MacHenry , Kieh Wong

We derive a lower and an upper bound for the rank of the finite part of operator $K$-theory groups of maximal and reduced $C^*$-algebras of finitely generated groups. The lower bound is based on the amount of polynomially growing conjugacy…

K理论与同调 · 数学 2017-05-24 Süleyman Kağan Samurkaş