相关论文: Finding Proofs in Tarskian Geometry

This is a first graduate course in algebraic geometry. It aims to give the student a lift up into the subject at the research level, with lots of interesting topics taken from the classification of surfaces, and a human-oriented discussion…

We introduce and elaborate a novel formalism for the manipulation and analysis of proofs as objects in a global manner. In this first approach the formalism is restricted to first-order problems characterized by condensed detachment. It is…

We address the decision problem for a fragment of real analysis involving differentiable functions with continuous first derivatives. The proposed theory, besides the operators of Tarski's theory of reals, includes predicates for…

We extend the theoretical framework of proof mining by establishing general logical metatheorems that allow for the extraction of the computational content of theorems with prima facie "non-computational" proofs from probability theory,…

This paper is part of the general project of proof mining, developed by Kohlenbach. By "proof mining" we mean the logical analysis of mathematical proofs with the aim of extracting new numerically relevant information hidden in the proofs.…

In this work we study five Grovers algorithm modifications, where each iteration is constructed by two generalized Householder reflections, against inaccuracies in the phases. By using semi-empirical methods, we investigate various…

In this PhD thesis we propose an algorithmic approach to the study of the Hilbert scheme. Developing algorithmic methods, we also obtain general results about Hilbert schemes. In Chapter 1 we discuss the equations defining the Hilbert…

Using Gromov-Witten theory the numbers of complex plane rational curves of degree d through 3d-1 general given points can be computed recursively with Kontsevich's formula that follows from the so-called WDVV equations. In this paper we…

The first half of the thesis concerns Abelian vortices and Yang-Mills (YM) theory. It is proved that the 5 types of vortices recently proposed by Manton are symmetry reductions of (A)SDYM equations with suitable gauge groups and symmetry…

In Mathematics is common to make a mistake and therefore a false conclusion arises. In each case it is important to recognize the mistake in order to avoid a similar one in the future. Geometric figures provide decisive help in order to…

The polynomial method has been used recently to obtain many striking results in combinatorial geometry. In this paper, we use affine Hilbert functions to obtain an estimation theorem in finite field geometry. The most natural way to state…

The Gromov-Wasserstein (GW) distances define a family of metrics, based on ideas from optimal transport, which enable comparisons between probability measures defined on distinct metric spaces. They are particularly useful in areas such as…

Studying worked examples has been shown by extensive research to be an effective method for learning to solve well-structured problems in physics and mathematics. The effectiveness of learning with worked examples has been demonstrated and…

We investigate how large language models can be used as research tools in scientific computing while preserving mathematical rigor. We propose a human-in-the-loop workflow for interactive theorem proving and discovery with LLMs. Human…

We present a brief but nearly self-contained proof of a formula for the Weil-Petersson Hessian of the geodesic length of a closed curve (either simple or not simple) on a hyperbolic surface. The formula is the sum of the integrals of two…

The Tensor Isomorphism problem (TI) has recently emerged as having connections to multiple areas of research within complexity and beyond, but the current best upper bound is essentially the brute force algorithm. Being an algebraic…

We introduce Goedel-Prover, an open-source language model that achieves state-of-the-art (as of April 5 2025) performance in automated formal proof generation for mathematical problems. A key challenge in this field is the scarcity of…

In the context of the Equational Theories Project, Terence Tao posed the challenge of finding alternatives to a complicated 62-step proof found by the Vampire superposition prover. We introduce a proof minimization tool called Krympa. Using…

When a computer algebra system fails to solve an Ordinary Differential Equation, is this a limitation of its implementation, or a genuine computational barrier? Three traditions bear on the question. Modern computer algebra algorithms can…

We resolve a longstanding open problem in the computational modeling of nonlinear plates by introducing a numerical method that exactly enforces the isometry constraint, namely, that the first fundamental form of the mid-surface coincides…