Results 21 to 30 of about 115,686,837 (118)
Random Diophantine equations in the primes
Abstract We consider equations of the form a1x1k+⋯+asxsk=0$a_{1}x_{1}^{k}+\cdots +a_{s}x_{s}^{k}=0$ where the variables xi$x_{i}$ are all taken to be primes. We define an analogue of the Hasse principle for solubility in the primes (which we call the prime Hasse principle), and prove that, whenever k⩾2$k\geqslant 2$, s⩾3k+2$s\geqslant 3k+2$, this holds
Philippa Holdridge
wiley +1 more source
New results on embeddings of self‐similar sets via renormalization
Abstract For self‐similar sets X,Y⊆R$X,Y\subseteq \mathbb {R}$, we obtain new results toward the affine embeddings conjecture of Feng–Huang–Rao (2014), and the equivalent weak intersections conjecture. We show that the conjecture holds when the defining maps of X,Y$X,Y$ have algebraic contraction ratios, and also for arbitrary Y$Y$ when the maps ...
Amir Algom, Michael Hochman, Meng Wu
wiley +1 more source
Diophantine equations involving factorials [PDF]
summary:We study the Diophantine equations $(k!)^n -k^n = (n!)^k-n^k$ and $(k!)^n +k^n = (n!)^k +n^k,$ where $k$ and $n$ are positive integers. We show that the first one holds if and only if $k=n$ or $(k,n)=(1,2),(2,1)$ and that the second one holds if ...
Luca, Florian, Alzer, Horst
core +3 more sources
Kripke on Gödel Incompleteness
ABSTRACT This paper surveys six of Saul Kripke's highly creative ideas and results on Gödel incompleteness, from when he was an undergraduate to last publications. These include his extension of incompleteness from sentences to predicates, his model‐theoretic proof of incompleteness of arithmetic, his compelling analysis of incompleteness in terms of ...
Daniel Isaacson
wiley +1 more source
Double‐jump phase transition for the reverse Littlewood–Offord problem
Abstract Erdős conjectured in 1945 that for any unit vectors v1,…,vn$v_1, \ldots, v_n$ in R2$\mathbb {R}^2$ and signs ε1,…,εn$\varepsilon _1, \ldots, \varepsilon _n$ taken independently and uniformly in {−1,1}$\lbrace -1,1\rbrace$, the random Rademacher sum σ=ε1v1+⋯+εnvn$\sigma = \varepsilon _1 v_1 + \cdots + \varepsilon _n v_n$ satisfies ∥σ∥2⩽1$\Vert \
Lawrence Hollom +2 more
wiley +1 more source
Abstract We survey ideas surrounding the study of the number of integers that can be represented as the sum of three positive cubes. We focus on the early contribution of Davenport using elementary techniques, and the subsequent developments due to Vaughan, which introduced Fourier analysis and mirrored many of the important developments of the Hardy ...
James Maynard
wiley +1 more source
HNN extensions and embedding theorems for groups
Abstract The Higman–Neumann–Neumann (HNN) paper of 1949 is a landmark of group theory in the 20th century. The proof of its main theorem covers less than a page and uses only pre‐existing technology, but the construction that it introduced, the HNN extension, quickly became one of the principal tools of combinatorial group theory, widely used to build ...
Martin R. Bridson +1 more
wiley +1 more source
Random Diophantine equations in the primes II
Abstract Let d⩾2$d\geqslant 2$ and n⩾d$n\geqslant d$ with (d,n)∉{(2,2),(3,3)}$(d,n)\notin \lbrace (2,2),(3,3)\rbrace$. We consider homogeneous Diophantine equations of degree d$d$ in n+1$n+1$ variables and whether they have solutions in the primes.
Philippa Holdridge
wiley +1 more source
ABSTRACT In this paper, we continue the development of the Cartan neural networks programme, launched with three previous publications, by focusing on some mathematical foundational aspects that we deem necessary for our next steps forward. The mathematical and conceptual results are diverse and span various mathematical fields, but the inspiring ...
Pietro Fré +4 more
wiley +1 more source
Combinatorial Diophantine equations and a refinement of a theorem on separated variables equations [PDF]
We look at Diophantine equations arising from equating classical counting functions such as perfect powers, binomial coefficients and Stirling numbers of the first and second kind.
Bilu, Yuri F. +3 more
core +1 more source

