English
Related papers

Related papers: Irreducible quadratic polynomials and Euler's func…

200 papers

For every multivariable polynomial $p$, with $p(0)=1$, we construct a determinantal representation $$p=\det (I - K Z),$$ where $Z$ is a diagonal matrix with coordinate variables on the diagonal and $K$ is a complex square matrix. Such a…

Functional Analysis · Mathematics 2012-08-14 Anatolii Grinshpan , Dmitry S. Kaliuzhnyi-Verbovetskyi , Hugo J. Woerdeman

We obtain new estimates on the level of distribution of the set $\{Q(n)\}$ where $Q\in{\mathbb Z}[X]$ is irreducible quadratic, for well-factorable moduli, improving a result due to Iwaniec. As a by-product of our arguments, we study the…

Number Theory · Mathematics 2019-05-08 Régis de la Bretèche , Sary Drappeau

We consider the distance to the nearest integer of f(p), where f is a quadratic polynomial with irrational leading coefficient. This distance is very small as a function of p, for infinitely many primes p. We give a 14% improvement in the…

Number Theory · Mathematics 2017-04-21 Roger Baker

We present a structure theorem for the multiple non-cyclotomic irreducible factors appearing in the family of all univariate polynomials with a given set of coefficients and varying exponents. Roughly speaking, this result shows that the…

Number Theory · Mathematics 2015-09-04 F. Amoroso , M. Sombra , U. Zannier

Let R be the ring of polynomials in n central variables over the real quaternion algebra H, and let I be a left ideal in R. We prove that if a polynomial p in R vanishes at all the common zeros of I in H^n with commuting coordinates, then…

Rings and Algebras · Mathematics 2024-02-05 Gil Alon , Elad Paran

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

Number Theory · Mathematics 2025-12-24 Rishu Garg , Jitender Singh

Let phi(n) be Euler's totient function and let sigma(n) be the sum of the positive divisors of n. We show that most phi-values (integers in the range of phi) are not sigma-values and vice versa.

Number Theory · Mathematics 2014-03-24 Kevin Ford , Paul Pollack

We consider random orthonormal polynomials $$ P_{n}(x)=\sum_{i=0}^{n}\xi_{i}p_{i}(x), $$ where $\xi_{0}$, . . . , $\xi_{n}$ are independent random variables with zero mean, unit variance and uniformly bounded $(2+\ep_0)$-moments, and…

Probability · Mathematics 2023-01-02 Yen Do , Doron Lubinsky , Hoi H. Nguyen , Oanh Nguyen , Igor Pritsker

Let F(n) be a polynomial of degree at least 2 with integer coefficients. We consider the products N_x=\prod_{1 \le n \le x} F(n) and show that N_x should only rarely be a perfect power. In particular, the number of x \le X for which N_x is…

Number Theory · Mathematics 2011-07-12 Paul Spiegelhalter , Joseph Vandehey

This paper studies the singularities of Cullen-regular functions of one quaternionic variable. The quaternionic Laurent series prove to be Cullen-regular. The singularities of Cullen-regular functions are thus classified as removable,…

Complex Variables · Mathematics 2010-04-14 Caterina Stoppato

The problem of writing real zero polynomials as determinants of linear matrix polynomials has recently attracted a lot of attention. Helton and Vinnikov have proved that any real zero polynomial in two variables has a determinantal…

Optimization and Control · Mathematics 2011-04-08 Tim Netzer , Andreas Thom

We study the quadratic residue problem known as an NP complete problem by way of the prime number and show that a nondeterministic polynomial process does not belong to the class P because of a random distribution of solutions for the…

General Mathematics · Mathematics 2012-12-29 Minoru Fujimoto , Kunihiko Uehara

An irreducible polynomial over $\Bbb F_q$ is said to be normal over $\Bbb F_q$ if its roots are linearly independent over $\Bbb F_q$. We show that there is a polynomial $h_n(X_1,\dots,X_n)\in\Bbb Z[X_1,\dots,X_n]$, independent of $q$, such…

Number Theory · Mathematics 2023-08-03 Xiang-dong Hou

One purpose of this paper is to construct twisted q-Euler numbers by using p-adic invariant integral on Zp in the sense of fermionic. Finally, we consider twisted Euler q-zeta function and q-l-series which interpolate twisted q-Euler…

Number Theory · Mathematics 2015-06-26 T. Kim , S. H. Rim

H. Lenstra has pointed out that a cubic polynomial of the form (x-a)(x-b)(x-c) + r(x-d)(x-e), where {a,b,c,d,e} is some permutation of {0,1,2,3,4}, is irreducible modulo 5 because every possible linear factor divides one summand but not the…

Number Theory · Mathematics 2022-09-22 Evan M. O'Dorney

In this paper, we will constructed p-adic twisted q-l-functions which is a part of answer of the question in [8]. Finally, we will treat many interesting properties related to twisted q-Euler numbers and polynomials.

Number Theory · Mathematics 2007-05-23 S. H. Rim , Y. Simsek , V. Kurt , T. Kim

Finite Euler product is known to be one of the classical zeta functions in number theory. In [1], [2] and [3], we have introduced some multivariable zeta functions and studied their definable probability distributions on R^d. They include…

Probability · Mathematics 2012-04-19 Takahiro Aoyama , Takashi Nakamura

The aim of the paper is to produce new families of irreducible polynomials, generalizing previous results in the area. One example of our general result is that for a near-separated polynomial, i.e., polynomials of the form…

Symbolic Computation · Computer Science 2019-03-21 Jaime Gutierrez , Jorge Jimenez Urroz

Let $f$ be sampled uniformly at random from the set of degree $n$ polynomials whose coefficients lie in $\{ \pm 1\}$. A folklore conjecture, known to hold under GRH, states that the probability that $f$ is irreducible tends to $1$ as $n$…

Number Theory · Mathematics 2024-01-09 Lior Bary-Soroker , David Hokken , Gady Kozma , Bjorn Poonen

We address the problem of the stability of the computations of resultants and subresultants of polynomials defined over complete discrete valuation rings (e.g. Zp or k[[t]] where k is a field). We prove that Euclide-like algorithms are…

Number Theory · Mathematics 2015-07-24 Xavier Caruso
‹ Prev 1 8 9 10 Next ›