Source author record

Zoltán Kovács

Zoltán Kovács appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

22works
15topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

22 published item(s)

preprint2026arXiv

Soohak: A Mathematician-Curated Benchmark for Evaluating Research-level Math Capabilities of LLMs

Following the recent achievement of gold-medal performance on the IMO by frontier LLMs, the community is searching for the next meaningful and challenging target for measuring LLM reasoning. Whereas olympiad-style problems measure step-by-step reasoning alone, research-level problems use such reasoning to advance the frontier of mathematical knowledge itself, emerging as a compelling alternative. Yet research-level math benchmarks remain scarce because such problems are difficult to source (e.g., Riemann Bench and FrontierMath-Tier 4 contain 25 and 50 problems, respectively). To support reliable evaluation of next-generation frontier models, we introduce Soohak, a 439-problem benchmark newly authored from scratch by 64 mathematicians. Soohak comprises two subsets. On the Challenge subset, frontier models including Gemini-3-Pro, GPT-5, and Claude-Opus-4.5 reach 30.4%, 26.4%, and 10.4% respectively, leaving substantial headroom, while leading open-weight models such as Qwen3-235B, GPT-OSS-120B, and Kimi-2.5 remain below 15%. Notably, beyond standard problem solving, Soohak introduces a refusal subset that probes a capability intrinsic to research mathematics: recognizing ill-posed problems and pausing rather than producing confident but unjustified answers. On this subset, no model exceeds 50%, identifying refusal as a new optimization target that current models do not directly address. To prevent contamination, the dataset will be publicly released in late 2026, with model evaluations available upon request in the interim.

preprint2022arXiv

Automated Discovery of Geometrical Theorems in GeoGebra

We describe a prototype of a new experimental GeoGebra command and tool, Discover, that analyzes geometric figures for salient patterns, properties, and theorems. This tool is a basic implementation of automated discovery in elementary planar geometry. The paper focuses on the mathematical background of the implementation, as well as methods to avoid combinatorial explosion when storing the interesting properties of a geometric figure.

preprint2022arXiv

Online Generation of Proofs Without Words

Understanding geometric relationships with little mathematical knowledge can be challenging for today's students and teachers. A new toolset is introduced that is able to create a proof without words by combining the benefits of the Geometric Deduction Database method (to obtain a readable proof of a geometric statement) and the GeoGebra framework (that makes it possible to export these data as an online applet in a simple way).

preprint2022arXiv

Parametric Root Finding for Supporting Proving and Discovering Geometric Inequalities in GeoGebra

We introduced the package/subsystem GeoGebra Discovery to GeoGebra which supports the automated proving or discovering of elementary geometry inequalities. In this case study, for inequality exploration problems related to isosceles and right angle triangle subclasses, we demonstrate how our general real quantifier elimination (RQE) approach could be replaced by a parametric root finding (PRF) algorithm. The general RQE requires the full cell decomposition of a high dimensional space, while the new method can avoid this expensive computation and can lead to practical speedups. To obtain a solution for a 1D-exploration problem, we compute a Groebner basis for the discriminant variety of the 1-dimensional parametric system and solve finitely many nonlinear real (NRA) satisfiability (SAT) problems. We illustrate the needed computations by examples. Since Groebner basis algorithms are available in Giac (the underlying free computer algebra system in GeoGebra) and freely available efficient NRA-SAT solvers (SMT-RAT, Tarski, Z3, etc.) can be linked to GeoGebra, we hope that the method could be easily added to the existing reasoning tool set for educational purposes.

preprint2022arXiv

Supporting Proving and Discovering Geometric Inequalities in GeoGebra by using Tarski

We introduce a system of software tools that can automatically prove or discover geometric inequalities. The system, called GeoGebra Discovery, consisting of an extended version of GeoGebra, a controller web service realgeom, and the computational tool Tarski (with the extensive help of the QEPCAD B system) successfully solves several non-trivial problems in Euclidean planar geometry related to inequalities.

preprint2022arXiv

Symbolic Comparison of Geometric Quantities in GeoGebra

Comparison of geometric quantities usually means obtaining generally true equalities of different algebraic expressions of a given geometric figure. Today's technical possibilities already support symbolic proofs of a conjectured theorem, by exploiting computer algebra capabilities of some dynamic geometry systems as well. We introduce GeoGebra's new feature, the Compare command, that helps the users in experiments in planar geometry. We focus on automatically obtaining conjectures and their proofs at the same time, including not just equalities but inequalities too. Our contribution can already be successfully used to support teaching geometry classes at secondary level, by getting several well-known and some previously unpublished result within seconds on a modern personal computer.

preprint2022arXiv

Towards understanding the central limit theorem by learning Python basics

We report on a first experiment about an email based course that connects learning Python basics and introductory probability theory. In the experiment 7 short sequences of homework were sent out to prospective mathematics teachers who did not have any programming background formerly, but already had some minor knowledge on probability theory. The experiment was about to decide if learning basics of programming can promote understanding main concepts of probability theory.

preprint2021arXiv

Proceedings of the 13th International Conference on Automated Deduction in Geometry

Automated Deduction in Geometry (ADG) is a forum to exchange ideas and views, to present research results and progress, and to demonstrate software tools at the intersection between geometry and automated deduction. Relevant topics include (but are not limited to): polynomial algebra, invariant and coordinate-free methods; probabilistic, synthetic, and logic approaches, techniques for automated geometric reasoning from discrete mathematics, combinatorics, and numerics; interactive theorem proving in geometry; symbolic and numeric methods for geometric computation, geometric constraint solving, automated generation/reasoning and manipulation with diagrams; design and implementation of geometry software, automated theorem provers, special-purpose tools, experimental studies; applications of ADG in mechanics, geometric modelling, CAGD/CAD, computer vision, robotics and education. Traditionally, the ADG conference is held every two years. The previous editions of ADG were held in Nanning in 2018, Strasbourg in 2016, Coimbra in 2014, Edinburgh in 2012, Munich in 2010, Shanghai in 2008, Pontevedra in 2006, Gainesville in 2004, Hagenberg in 2002, Zurich in 2000, Beijing in 1998, and Toulouse in 1996. The 13th edition of ADG was supposed to be held in 2020 in Hagenberg, Austria, but due to the COVID-19 pandemic, it was postponed for 2021, and held online (still hosted by RISC Institute, Hagenberg, Austria), September 15-17, 2021 (https://www.risc.jku.at/conferences/adg2021).

preprint2020arXiv

On Euler's inequality and automated reasoning with dynamic geometry

Euler's inequality $R\geq 2r$ can be investigated in a novel way by using implicit loci in GeoGebra. Some unavoidable side effects of the implicit locus computation introduce unexpected algebraic curves. By using a mixture of symbolic and numerical methods a possible approach is sketched up to investigate the situation. By exploiting fast GPU computations, a web application written in CindyJS helps in understanding the situation even better.

preprint2020arXiv

Teaching fractals for gifted learners at age 12 by using novel technologies

A summary of an experimental course on fractals is given that was held for young learners at age 12. The course was a part of Epsilon camp, a program designed for very gifted students who have already demonstrated high interest in studying mathematics. Prerequisites for the course were mastery of Algebra I, experience and fluency in skills like exponentials and square roots, solving equations. Also, at least two preliminary years were required in a prior Epsilon camp. The summary gives an overview of the flow of teaching, the achieved results and some evaluation of the given feedback.

preprint2020arXiv

Towards a Geometry Automated Provers Competition

The geometry automated theorem proving area distinguishes itself by a large number of specific methods and implementations, different approaches (synthetic, algebraic, semi-synthetic) and different goals and applications (from research in the area of artificial intelligence to applications in education). Apart from the usual measures of efficiency (e.g. CPU time), the possibility of visual and/or readable proofs is also an expected output against which the geometry automated theorem provers (GATP) should be measured. The implementation of a competition between GATP would allow to create a test bench for GATP developers to improve the existing ones and to propose new ones. It would also allow to establish a ranking for GATP that could be used by "clients" (e.g. developers of educational e-learning systems) to choose the best implementation for a given intended use.

preprint2020arXiv

Towards Automated Discovery of Geometrical Theorems in GeoGebra

We describe a prototype of a new experimental GeoGebra command and tool Discover that analyzes geometric figures for salient patterns, properties, and theorems. This tool is a basic implementation of automated discovery in elementary planar geometry. The paper focuses on the mathematical background of the implementation, as well as methods to avoid combinatorial explosion when storing the interesting properties of a geometric figure.

preprint2016arXiv

GeoGebra Tools with Proof Capabilities

We report about significant enhancements of the complex algebraic geometry theorem proving subsystem in GeoGebra for automated proofs in Euclidean geometry, concerning the extension of numerous GeoGebra tools with proof capabilities. As a result, a number of elementary theorems can be proven by using GeoGebra's intuitive user interface on various computer architectures including native Java and web based systems with JavaScript. We also provide a test suite for benchmarking our results with 200 test cases.

preprint2016arXiv

New tools in GeoGebra offering novel opportunities to teach loci and envelopes

GeoGebra is an open source mathematics education software tool being used in thousands of schools worldwide. Since version 4.2 (December 2012) it supports symbolic computation of locus equations as a result of joint effort of mathematicians and programmers helping the GeoGebra developer team. The joint work, based on former researches, started in 2010 and continued until present days, now enables fast locus and envelope computations even in a web browser in full HTML5 mode. Thus, classroom demonstrations and deeper investigations of dynamic analytical geometry are ready to use on tablets or smartphones as well. In our paper we consider some typical secondary school topics where investigating loci is a natural way of defining mathematical objects. We discuss the technical possibilities in GeoGebra by using the new commands LocusEquation and Envelope, showing through different examples how these commands can enrich the learning of mathematics. The covered school topics include definition of a parabola and other conics in different situations like synthetic definitions or points and curves associated with a triangle. Despite the fact that in most secondary schools, no other than quadratic curves are discussed, simple generalization of some exercises, and also every day problems, will smoothly introduce higher order algebraic curves. Thus our paper mentions the cubic curve "strophoid" as locus of the orthocenter of a triangle when one of the vertices moves on a circle. Also quartic "cardioid" and sextic "nephroid" can be of every day interest when investigating mathematics in, say, a coffee cup. We also focus on GeoGebra specific tips and tricks when constructing a geometric figure to be available for getting the locus equation. Among others, simplification and synthetization (via the intercept theorem) are mentioned.

preprint2015arXiv

Thin accretion disks around cold Bose-Einstein Condensate stars

Due to their superfluid properties some compact astrophysical objects, like neutron or quark stars, may contain a significant part of their matter in the form of a Bose-Einstein Condensate. Observationally distinguishing between neutron/quark stars and Bose-Einstein Condensate stars is a major challenge for this latter theoretical model. An observational possibility of indirectly distinguishing Bose-Einstein Condensate stars from neutron/quark stars is through the study of the thin accretion disks around compact general relativistic objects. In the present paper, we perform a detailed comparative study of the electromagnetic and thermodynamic properties of the thin accretion disks around rapidly rotating Bose-Einstein Condensate stars, neutron stars and quark stars, respectively. Due to the differences in the exterior geometry, the thermodynamic and electromagnetic properties of the disks (energy flux, temperature distribution, equilibrium radiation spectrum and efficiency of energy conversion) are different for these classes of compact objects. Hence in this preliminary study we have pointed out some astrophysical signatures that may allow to observationally discriminate between Bose-Einstein Condensate stars and neutron/quark stars, respectively.

preprint2011arXiv

Accretion processes in magnetically and tidally perturbed Schwarzschild black holes

We study the accretion process in the region of the Preston-Poisson space-time describing a Schwarzschild black hole perturbed by asymptotically uniform magnetic field and axisymmetric tidal structures. We find that the accretion disk shrinks and the marginally stable orbit shifts towards the black hole with the perturbation. The radiation intensity of the accretion disk increases, while the radius where radiation is maximal remains unchanged. The spectrum is blue-shifted. Finally, the conversion efficiency of accreting mass into radiation is decreased by both the magnetic and the tidal perturbations.

preprint2011arXiv

Maximal spin and energy conversion efficiency in a symbiotic system of black hole, disk and jet

We study a combined model of black hole - accretion disk - magnetosphere - jet symbiosis, applicable for supermassive black holes. We quantify the mass and spin evolution and we analyze how the limiting value of the spin parameter and the conversion efficiency of accreted mass into radiation depend on the interplay of electromagnetic radiation reaction, magnetosphere characteristics and truncation radius of radiation. The dominant effect comes from the closed magnetic field line region, which reduces the spin limit to values ~0.89 (instead ~0.99 in its absence). Therefore observations on black hole spins could favour or disfavour the existence of the closed magnetic field line region (or its coupling to the disk). We also find that the suppression of radiation from the innermost part of the accretion disk, inferred from observations, and a collimated jet both increase the spin limit and the energy conversion efficiency.

preprint2011arXiv

Thin accretion disk signatures of slowly rotating black holes in Hořava gravity

In the present work, we consider the possibility of observationally testing Hořava gravity by using the accretion disk properties around slowly rotating black holes of the Kehagias-Sfetsos solution in asymptotically flat spacetimes. The energy flux, temperature distribution, the emission spectrum as well as the energy conversion efficiency are obtained, and compared to the standard slowly rotating general relativistic Kerr solution. Comparing the mass accretion in a slowly rotating Kehagias-Sfetsos geometry in Hořava gravity with the one of a slowly rotating Kerr black hole, we verify that the intensity of the flux emerging from the disk surface is greater for the slowly rotating Kehagias-Sfetsos solution than for rotating black holes with the same geometrical mass and accretion rate. We also present the conversion efficiency of the accreting mass into radiation, and show that the rotating Kehagias-Sfetsos solution provides a much more efficient engine for the transformation of the accreting mass into radiation than the Kerr black holes. Thus, distinct signatures appear in the electromagnetic spectrum, leading to the possibility of directly testing Hořava gravity models by using astrophysical observations of the emission spectra from accretion disks.

preprint2010arXiv

Solar System tests of Hořava-Lifshitz black holes

In the present paper we consider the possibility of observationally testing Horava gravity at the scale of the Solar System, by considering the classical tests of general relativity (perihelion precession of the planet Mercury, deflection of light by the Sun and the radar echo delay) for the Kehagias-Sfetsos asymptotically flat black hole solution of Horava-Lifshitz gravity. All these gravitational effects can be fully explained in the framework of the vacuum solution of Horava gravity, and it is shown that the analysis of the classical general relativistic tests severely constrain the free parameter of the solution.

preprint2010arXiv

Thin accretion disk signatures in dynamical Chern-Simons modified gravity

A promising extension of general relativity is Chern-Simons (CS) modified gravity, in which the Einstein-Hilbert action is modified by adding a parity-violating CS term, which couples to gravity via a scalar field. In this work, we consider the interesting, yet relatively unexplored, dynamical formulation of CS modified gravity, where the CS coupling field is treated as a dynamical field, endowed with its own stress-energy tensor and evolution equation. We consider the possibility of observationally testing dynamical CS modified gravity by using the accretion disk properties around slowly-rotating black holes. The energy flux, temperature distribution, the emission spectrum as well as the energy conversion efficiency are obtained, and compared to the standard general relativistic Kerr solution. It is shown that the Kerr black hole provide a more efficient engine for the transformation of the energy of the accreting mass into radiation than their slowly-rotating counterparts in CS modified gravity. Specific signatures appear in the electromagnetic spectrum, thus leading to the possibility of directly testing CS modified gravity by using astrophysical observations of the emission spectra from accretion disks.