Sets of primes determined by systems of polynomial congruences
From MaRDI portal
Publication:1837232
zbMATH Open0507.12004MaRDI QIDQ1837232FDOQ1837232
Authors: Jeffrey C. Lagarias
Publication date: 1983
Published in: Illinois Journal of Mathematics (Search for Journal in Brave)
Recommendations
- Congruences for Sets of Primes
- Polynomial configurations in the primes
- Solvability of systems of polynomial congruences modulo a large prime
- scientific article; zbMATH DE number 3057472
- Glasner sets and polynomials in primes
- On a system of equations with primes
- On the number of solutions of a system of equations in prime numbers
- Root sets of polynomials modulo prime powers
- scientific article; zbMATH DE number 25362
- Polynomial patterns in the primes
Chebotarev densityChebotarev setsfundamental formsring class field theoryFrobenius densityFrobenius sets
Class field theory (11R37) Polynomials (irreducibility, etc.) (11R09) Primes (11A41) General binary quadratic forms (11E16)
Cited In (8)
- Chebotarev sets
- Hessian matrices, automorphisms of \(p\)-groups, and torsion points of elliptic curves
- Kirillov's orbit method and polynomiality of the faithful dimension of $p$-groups
- Polynomiality of the faithful dimension for nilpotent groups over finite truncated valuation rings
- Pro-isomorphic zeta functions of some 𝐷* Lie lattices of even rank
- A new set of necessary and sufficient conditions for a system to be prime
- Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)
- Polynomials with roots modulo every integer
This page was built for publication: Sets of primes determined by systems of polynomial congruences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1837232)