DeepAI AI Chat
Log In Sign Up

k-Equivalence Relations and Associated Algorithms

02/09/2021
by   Daniel Selsam, et al.
Microsoft
University of Pittsburgh
0

Lines and circles pose significant scalability challenges in synthetic geometry. A line with n points implies n 3 collinearity atoms, or alternatively, when lines are represented as functions, equality among n 2 different lines. Similarly, a circle with n points implies n 4 cocyclicity atoms or equality among n 3 circumcircles. We introduce a new mathematical concept of k-equivalence relations, which generalizes equality (k=1) and includes both lines (k=2) and circles (k=3), and present an efficient proof-producing procedure to compute the closure of a k-equivalence relation.

READ FULL TEXT

page 1

page 2

page 3

page 4

06/19/2020

The Fluted Fragment with Transitive Relations

We study the satisfiability problem for the fluted fragment extended wit...
06/11/2020

Tight frames over the quaternions and equiangular lines

We show that much of the theory of finite tight frames can be generalise...
04/07/2020

egg: Easy, Efficient, and Extensible E-graphs

An E-graph is a data structure that can efficiently encode the congruenc...
01/25/2019

Calculational HoTT

Based on a loose correspondence between, on one hand, a first order vers...
07/29/2020

Towards a Homotopy Domain Theory (HoDT)

A favourable environment is proposed for the achievement of λ-models wit...
10/11/2021

Logical Foundations of Quantitative Equality (long version)

Quantitative reasoning provides a flexible approach capable to deal with...
09/17/2021

Level Sets or Gradient Lines? A Unifying View of Modal Clustering

The paper establishes a strong correspondence, if not an equivalence, be...