AI Chat AI Image Generator AI Video Text to Speech

Learning proofs for the classification of nilpotent semigroups

06/06/2021

∙

by Carlos Simpson, et al.

∙

∙

Machine learning is applied to find proofs, with smaller or smallest numbers of nodes, for the classification of 4-nilpotent semigroups.

page 1

page 2

page 3

page 4

research

∙ 07/29/2021

Simple proofs of estimations of Ramsey numbers and of discrepancy

In this expository note we present simple proofs of the lower bound of R...

0 A. Buchaev, et al. ∙

research

∙ 04/26/2021

Bijective proofs for Eulerian numbers in types B and D

Let ⟨n k⟩, ⟨B_n k⟩, and ⟨D_n k⟩ be the Eulerian numbers in the types A, ...

0 Luigi Santocanale, et al. ∙

research

∙ 07/23/2021

Comments on lumping the Google matrix

On the case that the number of dangling nodes is large, PageRank computa...

0 Yongxin Dong, et al. ∙

research

∙ 02/09/2018

ATPboost: Learning Premise Selection in Binary Setting with ATP Feedback

ATPboost is a system for solving sets of large-theory problems by interl...

0 Bartosz Piotrowski, et al. ∙

research

∙ 11/21/2022

Lemmas of Differential Privacy

We aim to collect buried lemmas that are useful for proofs. In particula...

0 Yiyang Huang, et al. ∙

research

∙ 03/24/2021

New Proofs of the Basel Problem using Stochastic Processes

The number π ^2/6 is involved in the variance of several distributions i...

0 Uwe Hassler, et al. ∙

research

∙ 05/07/2022

Bounds on the Total Coefficient Size of Nullstellensatz Proofs of the Pigeonhole Principle and the Ordering Principle

In this paper, we investigate the total coefficient size of Nullstellens...

0 Aaron Potechin, et al. ∙