In this work, we show how number theoretical problems can be fruitfully approached with the tools of statistical physics. We focus on g-Sidon sets, which describe sequences of integers whose pairwise sums are different, and propose a random decision problem which addresses the probability of a random set of k integers to be g-Sidon. First, we provide numerical evidence showing that there is a crossover between satisfiable and unsatisfiable phases which converts to an abrupt phase transition in a properly defined thermodynamic limit. Initially assuming independence, we then develop a mean-field theory for the g-Sidon decision problem. We further improve the mean-field theory, which is only qualitatively correct, by incorporating deviations f...
For many random constraint satisfaction problems, by now there exist asymptotically tight estimates ...
The major promise of phase transitions in combinatorial problems was to shed light on the “practical...
Phase-transition in random SAT formulas is one of the properties best studied by theoretical SAT res...
In this work, we show how number theoretical problems can be fruitfully approached with the tools of...
We present a combinatorial decision problem, inspired by the celebrated quiz show called Countdown, ...
A subset A of the set [n] = {1, 2,..., n}, \A\ = k, is said to form a Sidon (or B-h) sequence, h gre...
A subset A of the set [n] = {1, 2,..., n}, \A\ = k, is said to form a Sidon (or B-h) sequence, h gre...
We identify a natural parameter for random number partitioning, and show that there is a rapid trans...
A subset A of the set [n] = {1, 2,..., n}, |A | = k, is said to form a Sidon (or Bh) sequence, h ≥...
We outline a technique for studying phase transition behaviour in computational problems using numbe...
AbstractA subsetAof the set [n]={1,2,…,n}, |A|=k, is said to form aSidon(orBh) sequence,h⩾2, if each...
We study an exactly solvable version of the well known random Boolean satisfiability (SAT) problem, ...
A subsetAof the set [n]={1,2,...,n}, A=k, is said to form aSidon(orBh) sequence,h≥2, if each of the ...
We illustrate the use of phase transition behavior in the study of heuristics. Using an "annealed" t...
AbstractThe statistical physics approach to the number partioning problem, a classical NP-hard probl...
For many random constraint satisfaction problems, by now there exist asymptotically tight estimates ...
The major promise of phase transitions in combinatorial problems was to shed light on the “practical...
Phase-transition in random SAT formulas is one of the properties best studied by theoretical SAT res...
In this work, we show how number theoretical problems can be fruitfully approached with the tools of...
We present a combinatorial decision problem, inspired by the celebrated quiz show called Countdown, ...
A subset A of the set [n] = {1, 2,..., n}, \A\ = k, is said to form a Sidon (or B-h) sequence, h gre...
A subset A of the set [n] = {1, 2,..., n}, \A\ = k, is said to form a Sidon (or B-h) sequence, h gre...
We identify a natural parameter for random number partitioning, and show that there is a rapid trans...
A subset A of the set [n] = {1, 2,..., n}, |A | = k, is said to form a Sidon (or Bh) sequence, h ≥...
We outline a technique for studying phase transition behaviour in computational problems using numbe...
AbstractA subsetAof the set [n]={1,2,…,n}, |A|=k, is said to form aSidon(orBh) sequence,h⩾2, if each...
We study an exactly solvable version of the well known random Boolean satisfiability (SAT) problem, ...
A subsetAof the set [n]={1,2,...,n}, A=k, is said to form aSidon(orBh) sequence,h≥2, if each of the ...
We illustrate the use of phase transition behavior in the study of heuristics. Using an "annealed" t...
AbstractThe statistical physics approach to the number partioning problem, a classical NP-hard probl...
For many random constraint satisfaction problems, by now there exist asymptotically tight estimates ...
The major promise of phase transitions in combinatorial problems was to shed light on the “practical...
Phase-transition in random SAT formulas is one of the properties best studied by theoretical SAT res...