arXiv subjects

Miroslav Marinov

Publications and source records attributed to Miroslav Marinov.

7 recordsLinked to original sources

arXiv2026

Solvability of meromorphic equations in elementary functions

An equation $f(x)=a$, where $f$ is a complex meromorphic function and $a\in\mathbb{C}$ is a parameter, is solvable in elementary functions if the inverse map $x=f^{-1}(a)$ can be expressed as a finite composition of arithmetic operations (addition, subtraction, multiplication, and division), the exponential function, the complex logarithm, and constants. Specific functions such as $\tan x - x$, $\exp x + x$, $x^x$ have been proven to be unsolvable by Kanel-Belov, Malistov, Zaytsev, while almost all entire surjective functions of at most exponential growth have been covered by Zelenko. All these rely on one-dimensional topological Galois theory, developed by Khovanskii. We generalize to provide a proof for the unsolvability of all elementary meromorphic functions $f$ such that the derivative of $f$ has infinitely many roots $x_i$ and the set of distinct values $f(x_i)$ is infinite.

math.GR↗

arXiv2026

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

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, high-quality dataset of human-evaluated proofs. While expensive to create, such a dataset is essential for driving improvements in training and enabling a rigorous analysis of proof generation capabilities. In this work, we present the Open Proof Corpus (OPC), a dataset comprising over 5,000 human-evaluated proofs produced by state-of-the-art LLMs. The OPC was specifically designed for broad applicability and downstream usage in proof generation research and is the first to include a substantial number of correct, LLM-generated solutions to problems from prestigious mathematics competitions such as the USAMO and IMO. Using the OPC, we explore critical questions in automated proof generation: (1) the performance gap between natural language and formal proof generation, (2) the discrepancy between final-answer accuracy and full-proof validity, and (3) the impact of best-of-n selection on proof quality. Finally, to showcase the utility of the OPC, we finetune an 8B-parameter model on the dataset, obtaining a model that performs on par with the best model, Gemini-2.5-Pro, on the task of evaluating proof correctness.

cs.CL↗

arXiv2025

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

A family $\mathcal{F}\subseteq\mathcal{P}(n)$ is an $(a,b)$-town$\pmod k$ if all sets in it have cardinality $a\pmod k$ and all pairwise intersections in it have cardinality $b\pmod k$. For $k=2$ the maximal size of such a family is known for each $a,b$, while for $k=3$ only $b-a\equiv 2 \pmod 3$ is fully understood. We provide a bound for $k=3$ when $b-a\equiv 1 \pmod 3$ and $n\equiv 2 \pmod 3$, which turns out to be tight for infinitely many such $n$. We also give sufficient conditions on the parameters $a,b,k,n$, which result in a better bound than the one from general settings by Ray-Chaudhuri--Wilson, in particular showing that this bound occurs infinitely often in a sense where all of $a,b,n$ can vary for a fixed $k$.

math.CO↗

arXiv2025

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

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$, is more than a quarter when $x$ is sufficiently large. They have also conjectured that this holds from the very beginning, that is, for all $x \geq 9$. Here we give a proof of this conjecture. For $x\geq 1.1 \cdot 10^{13}$ we take an explicit approach based on their work. We rely on classical estimates for prime counting functions, as well as on very recent explicit improvements by Bennett, Martin, O'Bryant, and Rechnitzer, which have wide applications in essentially any setting involving estimations of sums over primes in arithmetic progressions. All $x < 1.1 \cdot 10^{13}$ are covered by a computed assisted verification.

math.NT↗

arXiv2022

Realizing Artin-Schreier Covers with Minimal $a$-numbers in Positive Characteristic

Suppose $X$ is a smooth projective connected curve defined over an algebraically closed field of characteristic $p>0$ and $B \subset X$ is a finite, possibly empty, set of points. Booher and Cais determined a lower bound for the $a$-number of a $\mathbf{Z}/p \mathbf{Z}$-cover of $X$ with branch locus $B$. For odd primes $p$, in most cases it is not known if this lower bound is realized. In this note, when $X$ is ordinary, we use formal patching to reduce that question to a computational question about $a$-numbers of $\mathbf{Z}/p\mathbf{Z}$-covers of the affine line. As an application, when $p=3$ or $p=5$, for any ordinary curve $X$ and any choice of $B$, we prove that the lower bound is realized for Artin-Schreier covers of $X$ with branch locus $B$.

math.NT↗

arXiv2022

Exponentially sized pointsets with angles less than 61 degrees

We prove that any set of points in $\mathbb{R}^d$, any three of which form an angle less than $\fracπ{3} + c$, has size $(1+Θ(c))^d$ for sufficiently small $c>0$. The proof is based on a refinement of an approach by Erdős and Füredi. The lower bound is relying on a problem about large hypegraphs with small edge intersections, while the upper bound is tightly connected to the problem of packing disjoint caps on a sphere.

math.CO↗

arXiv2020

On Banzhaf and Shapley-Shubik Fixed Points and Divisor Voting Systems

The Banzhaf and Shapley-Shubik power indices were first introduced to measure the power of voters in a weighted voting system. Given a weighted voting system, the fixed point of such a system is found by continually reassigning each voter's weight with its power index until the system can no longer be changed by the operation. We characterize all fixed points under the Shapley-Shubik power index of the form $(a,b,\ldots,b)$ and give an algebraic equation which can verify in principle whether a point of this form is fixed for Banzhaf; we also generate Shapley-Shubik fixed classes of the form $(a,a,b,\ldots,b)$. We also investigate the indices of divisor voting systems of abundant numbers and prove that the Banzhaf and Shapley-Shubik indices differ for some cases.

math.NT↗