Miroslav Marinov

collaborators

4 papers

math.GR2026

Solvability of meromorphic equations in elementary functions

Miroslav Marinov, Nikola Veselinov

An equation $f (x) = a$ , where $f$ is a complex meromorphic function and $a \in C$ is a parameter, is solvable in elementary functions if the inverse map $x = f^{- 1} (a)$ can be e…

cs.CL2026

The Open Proof Corpus: A Large-Scale Study of LLM-Generated Mathematical Proofs

Jasper Dekoninck, Ivo Petrov, Kristian Minchev +13

In recent months, large language models (LLMs) have made significant progress in mathematical proof generation, but further advancement is hindered by the lack of a large-scale, hi…

math.CO2025

On the maximal size of $(a, b)$ -town $(mod k)$ families

Nikola Veselinov, Miroslav Marinov

A family $F \subseteq P (n)$ is an $(a, b)$ -town $(mod k)$ if all sets in it have cardinality $a (mod k)$ and all pairwise intersections in it have cardinality $b\pmo…

math.NT2025

Proof of the Complete Presence of a Modulo 4 Bias for the Semiprimes

Nikola Gyulev, Miroslav Marinov

In 2016, Dummit, Granville, and Kisilevsky showed that the proportion of semiprimes (products of two primes) not exceeding a given $x$ , whose factors are congruent to $3$ modulo $4…

Solvability of meromorphic equations in elementary functions

The Open Proof Corpus: A Large-Scale Study of LLM-Generated Mathematical Proofs

On the maximal size of (a,b)-town(modk) families

Proof of the Complete Presence of a Modulo 4 Bias for the Semiprimes

On the maximal size of $(a, b)$ -town $(mod k)$ families