English
Related papers

Related papers: On equation $x^q=a$ over $\bq_p$

200 papers

The existence of a positive solution to a class of Choquard equations with potential going at a positive limit at infinity possibly from above or oscillating is proved. Our results include the physical case and do not require any symmetry…

Analysis of PDEs · Mathematics 2021-07-20 Liliane Maia , Benedetta Pellacci , Delia Schiera

In this paper we obtain explicit estimates and existence results on the number of $\mathbb{F}_q$-rational solutions of certain systems defined by families of diagonal equations over finite fields. Our approach relies on the study of the…

Number Theory · Mathematics 2020-10-07 Mariana Pérez , Melina Privitelli

Given a polynomial $Q(x_1,\cdots, x_t)=\lambda_1 x_1^{k_1}+\cdots +\lambda_t x_t^{k_t}$, for every $c\in \mathbb{Z}$ and $n\geq 2$, we study the number of solutions $N_J(Q;c,n)$ of the congruence equation $Q(x_1,\cdots, x_t)\equiv…

Number Theory · Mathematics 2017-05-23 Songsong Li , Yi Ouyang

In this paper we use the comparison method for investigation of first order polynomial differential equations. We prove two comparison criteria for these equations. The proved criteria we use to obtain some global solvability criteria for…

Classical Analysis and ODEs · Mathematics 2024-06-13 G. A. Grigorian

We study the set of common $\mathbb{F}_q$-rational solutions of "smooth" systems of multivariate symmetric polynomials with coefficients in a finite field $\mathbb{F}_q$. We show that, under certain conditions, the set of common solutions…

Algebraic Geometry · Mathematics 2023-12-18 Nardo Giménez , Guillermo Matera , Mariana Pérez , Melina Privitelli

Let $f=ax+x^{r(q-1)+1}\in \mathbb{F}_{q^2}^*[x], r\in \{5,7\}.$ We give explicit conditions on the values $(q,a)$ for which $f$ is a permutation polynomials of $\mathbb{F}_{q^2}.$

Number Theory · Mathematics 2014-06-19 Stephen Lappano

By using some recent results for divergence form equations, we study the $L_p$-solvability of second-order elliptic and parabolic equations in nondivergence form for any $p\in (1,\infty)$. The leading coefficients are assumed to be in…

Analysis of PDEs · Mathematics 2012-02-02 Hongjie Dong

Bilinear systems of equations are defined, motivated and analyzed for solvability. Elementary structure is mentioned and it is shown that all solutions may be obtained as rank one completions of a linear matrix polynomial derived from…

Rings and Algebras · Mathematics 2013-03-21 Charles R. Johnson , Helena Šmigoc , Dian Yang

We reveal a natural algebraic problem whose complexity appears to interpolate between the well-known complexity classes BQP and NP: (*) Decide whether a univariate polynomial with exactly m monomial terms has a p-adic rational root. In…

Quantum Physics · Physics 2007-05-23 J. Maurice Rojas

Let $\mathbb F_q$ denote the finite field with $q$ elements. In this paper we use the relationship between suitable polynomials and number of rational points on algebraic curves to give the exact number of elements $a\in \mathbb F_q$ for…

Number Theory · Mathematics 2019-07-23 José Alves Oliveira , F. E. Brochero Martínez

In this paper we consider generalized monomial functions $f, g\colon \mathbb{F}\to \mathbb{C}$ (of possibly different degree) that also fulfill \[ f(P(x))= Q(g(x)) \qquad \left(x\in \mathbb{F}\right), \] where $P\in \mathbb{F}[x]$ and $Q\in…

Commutative Algebra · Mathematics 2025-01-29 Eszter Gselmann , Mehak Iqbal

We investigate the solvability of the Diophantine equation in the title, where $d>1$ is a square-free integer, $p, q$ are distinct odd primes and $x,y,a,b$ are unknown positive integers with $\gcd(x,y)=1$. We describe all the integer…

Number Theory · Mathematics 2021-11-11 Kalyan Chakraborty , Azizul Hoque

Let $m$ be any integer $\geq 3$. We consider the polynomial equation $$X^n + a_{n-1}\cdot X^{n-1} + \dots + a_1 \cdot X + a_0 \cdot I = O,$$ over $(m \times m)$-matrices $X$ with the real entries, where $I$ is the identity matrix, $O$ is…

Rings and Algebras · Mathematics 2025-07-10 Vitalij A. Chatyrko , Alexandre Karassev

Using properties of Gauss and Jacobi sums, we derive explicit formulas for the number of solutions to a diagonal equation of the form $x_1^{2^m}+\dots+x_n^{2^m}=0$ over a finite field of characteristic $p\equiv\pm 3\pmod{8}$. All of the…

Number Theory · Mathematics 2016-05-13 Ioulia N. Baoulina

Existence results for a class of Choquard equations with potentials are established. The potential has a limit at infinity and it is taken invariant under the action of a closed subgroup of linear isometries of $\mathbb{R}^N$. As a…

Analysis of PDEs · Mathematics 2021-07-27 Liliane Maia , Benedetta Pellacci , Delia Schiera

Let $f\in \mathbb{Q}(x)$ be a non-constant rational function. We consider "Waring's Problem for $f(x)$," i.e., whether every element of $\bbq$ can be written as a bounded sum of elements of $\{f(a)\mid a\in \mathbb{Q}\}$. For rational…

Number Theory · Mathematics 2018-01-23 Bo-Hae Im , Michael Larsen

Not any nonsingular equation over a metabelian group has solution in a larger metabelian group. However, any nonsingular equation over a solvable group with a subnormal series with abelian torsion-free quotients has a solution in a larger…

Group Theory · Mathematics 2023-10-24 Anton A. Klyachko , Mikhail A. Mikheenko , Vitaly A. Roman'kov

Let $q$ be a Pisot or Salem number. Let $f_j(x)$ $(j=1,2,\dots)$ be integer-valued polynomials of degree $\ge2$ with positive leading coefficients, and let $\{a_j (n)\}_{n\ge1}$ $(j=1,2,\dots)$ be sequences of algebraic integers in the…

Number Theory · Mathematics 2025-09-17 Shinya Kudo

Let $p>3$ be a prime, $a_1,a_2,a_3\in\Bbb Z$ and let $N_p(x^3+a_1x^2+a_2x+a_3)$ denote the number of solutions to the congruence $x^3+a_1x^2+a_2x+a_3\equiv 0\pmod p$. In this paper, we give an explicit criterion for…

Number Theory · Mathematics 2025-04-02 Zhi-Hong Sun

We study the computational complexity of fundamental problems over the $p$-adic numbers ${\mathbb Q}_p$ and the $p$-adic integers ${\mathbb Z}_p$. Gu\'epin, Haase, and Worrell proved that checking satisfiability of systems of linear…

Computational Complexity · Computer Science 2025-04-21 Arno Fehm , Manuel Bodirsky
‹ Prev 1 3 4 5 6 7 10 Next ›