English
Related papers

Related papers: Spreads and Packings of PG(3,2), Formally!

200 papers

This extended abstract is about an effort to build a formal description of a triangulation algorithm starting with a naive description of the algorithm where triangles, edges, and triangulations are simply given as sets and the most complex…

Logic in Computer Science · Computer Science 2018-09-05 Yves Bertot

This paper describes a formalization of discrete real closed fields in the Coq proof assistant. This abstract structure captures for instance the theory of real algebraic numbers, a decidable subset of real numbers with good algorithmic…

Logic in Computer Science · Computer Science 2015-07-01 Assia Mahboubi , Cyril Cohen

Perfectoid spaces are sophisticated objects in arithmetic geometry introduced by Peter Scholze in 2012. We formalised enough definitions and theorems in topology, algebra and geometry to define perfectoid spaces in the Lean theorem prover.…

Logic in Computer Science · Computer Science 2020-05-29 Kevin Buzzard , Johan Commelin , Patrick Massot

Proof assistants are software-based tools that are used in the mechanization of proof construction and validation in mathematics and computer science, and also in certified program development. Different tools are being increasingly used in…

Formal Languages and Automata Theory · Computer Science 2015-05-04 Marcus Vinícius Midena Ramos , Ruy J. G. B. de Queiroz

In this work we find new minimum sizes for the maximal partial spreads of PG$(3,q)$, for $q=8,9,16$ and for every $q$ such that $25\leq q\leq 101$. Furthermore, for $q=8,9,16,25$ and 27 we find all the unknown sizes between our minimums and…

Combinatorics · Mathematics 2011-11-15 Maurizio Iurlo , Sandro Rajola

We have developed an alternative approach to teaching computer science students how to prove. First, students are taught how to prove theorems with the Coq proof assistant. In a second, more difficult, step students will transfer their…

Logic in Computer Science · Computer Science 2018-03-06 Sebastian Böhne , Christoph Kreitz

What provides the highest level of assurance for correctness of execution within a programming language? One answer, and our solution in particular, to this problem is to provide a formalization for, if it exists, the denotational semantics…

Category Theory · Mathematics 2023-03-17 Zachary Flores , Angelo Taranto , Eric Bond , Yakir Forman

Matching logic is a formalism for specifying, and reasoning about, mathematical structures, using patterns and pattern matching. Growing in popularity, it has been used to define many logical systems such as separation logic with recursive…

Logic in Computer Science · Computer Science 2022-09-22 Péter Bereczky , Xiaohong Chen , Dániel Horpácsi , Lucas Peña , Jan Tušil

The ever-growing complexity of mathematical proofs makes their manual verification by mathematicians very cognitively demanding. Autoformalization seeks to address this by translating proofs written in natural language into a formal…

Computation and Language · Computer Science 2023-01-06 Garett Cunningham , Razvan C. Bunescu , David Juedes

In this paper we give a preliminary formalization of the p-adic numbers, in the context of the second author's univalent foundations program. We also provide the corresponding code verifying the construction in the proof assistant Coq.…

Logic · Mathematics 2013-02-07 Álvaro Pelayo , Vladimir Voevodsky , Michael A. Warren

Let $\mathrm{PG}(3,q)$ be the projective space of dimension three over the finite field with $q$ elements. Consider a twisted cubic in $\mathrm{PG}(3,q)$. The structure of the point-plane incidence matrix in $\mathrm{PG}(3,q)$ with respect…

Combinatorics · Mathematics 2020-03-03 Daniele Bartoli , Alexander A. Davydov , Stefano Marcugini , Fernanda Pambianco

A spread of a Hermitian unital in PG(2,q^2) is a set of q^2+q+1 pairwise disjoint blocks that partition the points of the unital. In this paper, we discuss the results of an exhaustive computer search for spreads of Hermitian unitals of…

Combinatorics · Mathematics 2017-02-07 Jeremy M. Dover

For performance and verification in machine learning, new methods have recently been proposed that optimise learning systems to satisfy formally expressed logical properties. Among these methods, differentiable logics (DLs) are used to…

Logic in Computer Science · Computer Science 2024-07-08 Reynald Affeldt , Alessandro Bruni , Ekaterina Komendantskaya , Natalia Ślusarz , Kathrin Stark

This report presents a formalization of May's theorem in the proof assistant Coq. It describes how the theorem statement is first translated into Coq definitions, and how it is subsequently proved. Various aspects of the proof and related…

Logic in Computer Science · Computer Science 2022-10-12 Kwing Hei Li

Let X be a projective complex 3-fold, quasihomogeneous with respect to an action of a linear algebraic group. We show that X is a compactification of SL_2/G, G a discrete subgroup, or that X can be equivariantly transformed into the 3-dim.…

Algebraic Geometry · Mathematics 2007-05-23 Stefan Kebekus

This report describes three particular technological advances in formal proofs. The HOL Light proof assistant will be used to illustrate the design of a highly reliable system. Today, proof assistants can verify large bodies of advanced…

Logic in Computer Science · Computer Science 2014-08-28 Thomas C. Hales

The algebraic properties of the combination of probabilistic choice and nondeterministic choice have long been a research topic in program semantics. This paper explains a formalization in the Coq proof assistant of a monad equipped with…

Logic in Computer Science · Computer Science 2023-12-12 Reynald Affeldt , Jacques Garrigue , David Nowak , Takafumi Saikawa

In this article, the partial plane spreads in $PG(6,2)$ of maximum possible size $17$ and of size $16$ are classified. Based on this result, we obtain the classification of the following closely related combinatorial objects: Vector space…

Combinatorics · Mathematics 2018-12-17 Thomas Honold , Michael Kiermaier , Sascha Kurz

An invaluable feature of computer algebra systems is their ability to plot the graph of functions. Unfortunately, when one is trying to design a library of mathematical functions, this feature often falls short, producing incorrect and…

Software Engineering · Computer Science 2021-08-10 Guillaume Melquiond

Distribution theory is a cornerstone of the theory of partial differential equations. We report on the progress of formalizing the theory of tempered distributions in the interactive proof assistant Lean, which is the first formalization in…

Logic in Computer Science · Computer Science 2025-10-29 Moritz Doll
‹ Prev 1 2 3 10 Next ›