This is a preview. Log in through your library . Abstract Consider a binary Markov random field whose neighbor structure is specified by a countable graph with nodes of uniformly bounded degree. Under ...
In 1887 Runge [13] proved that a binary Diophantine equation $F(x, y) = 0$, with $F$ irreducible, in a class including those in which the leading form of $F$ is not a ...
A mathematician will turn a groundbreaking 100-page proof into computer code. The proof tool, Lean, lets users turn proofs written in prose into rules and logic for testing. Kevin Buzzard already uses ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback