Ameneh Farhadian

collaborators

3 papers

math.NT2025

Goldbach Conjecture: Violation Probability and Generalization to Prime-like Distributions

Ameneh Farhadian

Due to the distribution of primes among integers, we establish an upper bound for the probability $P_{n}$ that the Goldbach conjecture fails. Assuming the conjecture holds t…

math.CO2018

A Simple Algorithm for a Computationally Hard Problem

Ameneh Farhadian

Graph isomorphism problem is a known hard problem. In this paper, a novel randomized algorithm is proposed for this problem which is very simple and fast. It solves the graph isomo…

math.CO2018

Almost every $n$ -vertex graph is determined by its $3 lo g_{2} n$ -vertex subgraphs

Ameneh Farhadian

The paper shows that almost every $n$ -vertex graph is such that the multiset of its induced subgraphs on $3 lo g_{2} n$ vertices is sufficient to determine it up to isomorphism. The…

Goldbach Conjecture: Violation Probability and Generalization to Prime-like Distributions

A Simple Algorithm for a Computationally Hard Problem

Almost every n-vertex graph is determined by its 3log2​n-vertex subgraphs

Almost every $n$ -vertex graph is determined by its $3 lo g_{2} n$ -vertex subgraphs