Related papers: Proving Conjectures Acquired by Composing Multiple…

We present an improved incremental selection algorithm of the selection algorithm presented in [1] and prove all the selected conjectures.

In this work we resolve several conjectures stated in the On-Line Encyclopedia of Integer sequences.

Presented here are over one hundred conjectures ranging from easy to difficult, from many mathematical fields. I also summarize briefly methods and tools that have led to this collection.

We prove three conjectures, related to the paperfolding sequence, in a recent paper [arXiv:2005.04066] of P. Barry.

We prove that a large family of graphs which are decomposable with respect to the modular decomposition can be reconstructed from their collection of vertex-deleted subgraphs.

We collect here various conjectures on congruences made by the author in a series of papers, some of which involve binary quadratic forms and other advanced theories. Part A consists of 100 unsolved conjectures of the author while…

By creating a new method, the author proved the well-known world's baffling problems Goldbach conjecture, twin primes conjecture, the Proposition (C) and the Proposition $n^2+1$.

The said paper [2] entitled "Proof Of Two Dimensional Jacobian Conjecture" is with gaps.

Wang and Blei (2019) studies multiple causal inference and proposes the deconfounder algorithm. The paper discusses theoretical requirements and presents empirical studies. Several refinements have been suggested around the theory of the…

We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]: L. Gordeev, E. H. Haeusler, Proof Compression and NP Versus PSPACE, Studia Logica (107) (1): 55-83 (2019)

Several conjectural continued fractions found with the help of various algorithms are published in this paper.

We prove a number of conjectures [arXiv:2005.04066] recently stated by P. Barry, related to the paperfolding sequence and the Rueppel sequence.

We present a proof of a combinatorial conjecture from the second author's Ph.D. thesis. The proof relies on binomial and multinomial sums identities. We also discuss the relevance of the conjecture in the context of PAC-Bayesian machine…

The famous Gallai's Conjecture states that any connected graph with n vertices has a path decomposition containing at most (n+1)/2 paths. In this note, we explore graphs generated from removing edges from complete graphs. We first provide…

We give a proof of a conjecture of A. Lacasse in his doctoral thesis which has applications in machine learning algorithms. The proof relies on some interesting binomial sums identities introduced by Abel (1839), and on their generalization…

This paper describes a method used to construct infinitely many probable counterexamples of the abc conjecture over the rational integers.

Decomposition methods are often used for producing counterfactual predictions in non-strategic settings. When the outcome of interest arises from a game-theoretic setting where agents are better off by deviating from their strategies after…

Several results about the union-closed sets conjecture are presented.

Perceptions of political bias in the media are formed directly, through the independent consumption of the published outputs of a media organization, and indirectly, through observing the collective responses of political allies and…

We revisit and generalize the concept of composite likelihood as a method to make a probabilistic inference by aggregation of multiple Bayesian agents, thereby defining a class of predictive models which we call composite Bayesian. This…