Related papers: Zeilberger to the rescue
We present four open conjectures in graph theory generated by the automated conjecturing system \texttt{TxGraffiti}. Each conjecture is concise, grounded in natural graph invariants, and empirically validated across hundreds of graphs.…
We present several short proofs that resolve open problems from the algebraic and enumerative combinatorics literature. First, we consider the echelonmotion operator on modular lattices. We resolve a conjecture of Defant, Jiang, Marczinzik,…
We identify and study a simple combinatorial problem that is derived from submodularity issues encountered in the theory of tangles of graphs and abstract separation systems.
In this note, we show how a combinatorial identity of Frisch can be applied to prove and generalize some well-known identities involving harmonic numbers. We also present some combinatorial identities involving odd harmonic numbers which…
In this paper we present some results related to the problem of finding periodic representations for algebraic numbers. In particular, we analyze the problem for cubic irrationalities. We show an interesting relationship between the…
The vector Riemann-Hilbert problem is analyzed when the entries of its matrix coefficient are meromorphic and almost periodic functions. Three cases for the meromorphic functions, when they have (i) a finite number of poles and zeros…
We prove the #P-hardness of the counting problems associated with various satisfiability, graph and combinatorial problems, when restricted to planar instances. These problems include \begin{romannum} \item[{}] {\sc 3Sat, 1-3Sat, 1-Ex3Sat,…
Math reasoning is becoming an ever increasing area of focus as we scale large language models. However, even the previously-toughest evals like MATH are now close to saturated by frontier models (90.0% for o1-mini and 86.5% for Gemini 1.5…
The authors have been using a largely algebraic form of ``computational discovery'' in various undergraduate classes at their respective institutions for some decades now to teach pure mathematics, applied mathematics, and computational…
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
Paul Erdos claimed that mathematics is not yet ready to settle the 3x+1 conjecture. I agree, but very soon it will be! With the exponential growth of computer-generated mathematics, we (or rather our silicon brethrern) would have a shot at…
This is an English translation of Ludwig Bieberbach's paper ``Remarks on Hilbert's Thirteenth Problem" originally written in German and originally published in Journal f\"ur die Reine und Angewandte Mathematik - 165 (89-92) 1931, along with…
There are several forms of irreducibility in computing systems, ranging from undecidability to intractability to nonlinearity. This paper is an exploration of the conceptual issues that have arisen in the course of investigating speed-up…
Recent advancements in quantum computing and quantum-inspired algorithms have sparked renewed interest in binary optimization. These hardware and software innovations promise to revolutionize solution times for complex problems. In this…
Multiple harmonic-like numbers are studied using the generating function approach. A closed form is stated for binomial sums involving these numbers and two additional parameters. Several corollaries and examples are presented which are…
Back in 1755, Euler explored an interesting array of numbers that now frequently appears in polynomial identities, combinatorial problems, and finite calculus, among other places. These numbers share a strong connection with well-known…
We study the satisfiability problem of symbolic finite automata and decompose it into the satisfiability problem of the theory of the input characters and the monadic second-order theory of the indices of accepted words. We use our…
George Andrews's recent challenge to automated identity-proving and the WZ method is dealt with. It is argued that the rivalry between the classical and automated approaches to hypergeometric sums is beneficial to both.
The halting problem is undecidable --- but can it be solved for "most" inputs? This natural question was considered in a number of papers, in different settings. We revisit their results and show that most of them can be easily proven in a…
Over 300 sequences and many unsolved problems and conjectures related to them are presented herein. These notions, definitions, unsolved problems, questions, theorems corollaries, formulae, conjectures, examples, mathematical criteria, etc.…