On pseudo‐polynomials
From MaRDI portal
Publication:5632632
Recommendations
- On primary pseudo-polynomials (around Ruzsa’s conjecture)
- scientific article; zbMATH DE number 1221069
- On pseudo-polynomials divisible only by a sparse set of primes and \(\alpha\)-primary pseudo-polynomials
- On pseudo-primality of the \(n\)-th power of prime entire functions
- On periodic \(\text{mod }p\) sequences and \(G\)-functions. (On a conjecture of Ruzsa)
Cited in
(21)- scientific article; zbMATH DE number 1746523 (Why is no real title available?)
- Pseudo pcf
- On Some Properties of Pseudo-complex Polynomials
- Linear pseudo-polynomials over \(GF[q,x]\)
- Equidistribution from the Chinese Remainder Theorem
- Polynomials over GF(q,x) with integral-valued differences
- On the local closure of clones on countable sets
- An analogue of Ruzsa's conjecture for polynomials over finite fields
- On periodic \(\text{mod }p\) sequences and \(G\)-functions. (On a conjecture of Ruzsa)
- On \(q\)-arithmetic entire functions
- The inverse sieve problem in high dimensions
- Derangements and the 𝑝-adic incomplete gamma function
- Uniformly distributed sequences in computer algebra or how to construct program generators of random numbers
- Derangements and the \(p\)-adic incomplete gamma function
- Pseudo-polynomial functions over finite distributive lattices
- Entire functions having a concordant value sequence
- A Ring with Arithmetical Congruence Lattice Not Preserved by Any Pixley Function
- Concordant sequences and concordant entire functions
- Nondeterministic state complexity of proportional removals
- On primary pseudo-polynomials (around Ruzsa’s conjecture)
- On pseudo-polynomials divisible only by a sparse set of primes and \(\alpha\)-primary pseudo-polynomials
This page was built for publication: On pseudo‐polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5632632)
