Related papers: Revitalized automatic proofs: demonstrations
In this paper I present a kind of proof for classical Euclidean geometric problems which relies on both synthetic and analytic geometry. Using the elementary tools of polynomial algebra and multivariate calculus we manage to reduce the…
We present selfdual manifolds for coupled Potts models on the triangular lattice. We exploit two different techniques: duality followed by decimation, and mapping to a related loop model. The latter technique is found to be superior, and it…
Representation determines how we can reason about a specific problem. Sometimes one representation helps us find a proof more easily than others. Most current automated reasoning tools focus on reasoning within one representation. There is,…
The main purpose of this note is to provide an elementary discussion of some simple triangles of integer numbers in particular through their connections with representation theory of $sl_2$. The triangles under consideration are the Catalan…
In a recent beautiful but technical article, William Y.C. Chen, Qing-Hu Hou, and Doron Zeilberger developed an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequences,…
This paper presents the first model-checking algorithm for an expressive modal mu-calculus over timed automata, $L^{\mathit{rel}, \mathit{af}}_{\nu,\mu}$, and reports performance results for an implementation. This mu-calculus contains…
In this paper, we define four transformations on the classical Catalan triangle $\mathcal{C}=(C_{n,k})_{n\geq k\geq 0}$ with $C_{n,k}=\frac{k+1}{n+1}\binom{2n-k}{n}$. The first three ones are based on the determinant and the forth is…
We provide some variations on the Greene-Krammer's identity which involve q-Catalan numbers. Our method reveals a curious analogy between these new identities and some congruences modulo a prime.
We investigate the combinatorial analogues, in the context of normal surfaces, of taut and transversely measured (codimension 1) foliations of 3-manifolds. We establish that the existence of certain combinatorial structures, a priori weaker…
In this paper we develop a combinatorial abstraction of tropical linear programming. This generalizes the search for a feasible point of a system of min-plus-inequalities. It is based on the polyhedral properties of triangulations of the…
In this paper, firstly, by a determinant of deformed Pascal's triangle, namely the normalized Hessenberg matrix determinant, to count Dyck paths, we give another combinatorial proof of the theorems which are of Catalan numbers determinant…
We present a method to prove the decidability of provability in several well-known inference systems. This method generalizes both cut-elimination and the construction of an automaton recognizing the provable propositions.
In 2007, the first author gave an alternative proof of the refined alternating sign matrix theorem by introducing a linear equation system that determines the refined ASM numbers uniquely. Computer experiments suggest that the numbers…
Artificial intelligence assisted mathematical proof has become a highly focused area nowadays. One key problem in this field is to generate formal mathematical proofs from natural language proofs. Due to historical reasons, the formal proof…
This set of notes re-proves known results on weighted automata (over a field, also known as multiplicity automata). The text offers a unified view on theorems and proofs that have appeared in the literature over decades and were written in…
We establish a new simple explicit description of combinatorial wall-crossing for the rational Cherednik algebra applied to the trivial representation. In this way we recover a theorem of P. Dimakis and G. Yue. We also present two…
Walnut is a software that using automata can prove theorems in combinatorics on words about automatic sequences. We are able to apply this software to both prove new results as well as reprove some old results on avoiding squares and cubes…
We introduce poly-Cauchy permutations that are enumerated by the poly-Cauchy numbers. We provide combinatorial proofs for several identities involving poly-Cauchy numbers and some of their generalizations. The aim of this work is to…
We present a method for obtaining congruences modulo powers of 3 for sequences given by recurrences of finite depth with polynomial coefficients. We apply this method to Catalan numbers, Motzkin numbers, Riordan numbers, Schr\"oder numbers,…
We show that a proof in multiplicative linear logic can be represented as a decorated surface, such that two proofs are logically equivalent just when their surfaces are geometrically equivalent. This is an extended abstract for…