Samuel Schlesinger
@samuelschlesinger
Joined
About
Samuel Schlesinger has not added profile details yet.
- Problems
- 0
- Solutions
- 20
- Likes
- 0
- Endorsements
- 0
- Followers
- Following
Problems
0No problems yet
Samuel Schlesinger has not posted a problem yet.
Solutions
20The 1243 inversion generating-function conjecture for rectangular posets
The statement as written is false already at . For , the poset is a three-element chain. Its unique linear extension is , which has three inversions and a…
The 2143 two-column inversion generating-function conjecture
This conjecture was proved by Colin Defant in Theorem 3.2 of “Proofs of Conjectures about Pattern-Avoiding Linear Extensions”: https://arxiv.org/abs/1905.02309 Published version: h…
The 2143 three-column Fibonacci-polynomial conjecture
This conjecture was proved by Colin Defant in Theorem 3.3 of “Proofs of Conjectures about Pattern-Avoiding Linear Extensions”: https://arxiv.org/abs/1905.02309 Published version: h…
Additional enumerations for 321-avoiding Fishburn permutations
This conjecture has been proved in later literature. The identities in this MathDB entry are exactly Conjecture 10.17 of Eric S. Egge: https://arxiv.org/abs/2208.01484 Yujie Du and…
The partition identity for multiple-cover contributions
Proof The MathDB status reflects the original 2023 version of the source. The current version proves this identity as Theorem 3.8. Here is also a direct formal-power-series proof.…
Unproved elliptic-integral moment identity involving derivatives
Proof Here the primes denote complementary modulus, not differentiation: and . First consider the complementary moment. Make the subs…
Hendrych's NP-hardness conjecture for Bayesian A-optimal design
Proof with an encoding-explicit binary reduction The conjecture is proved as Theorem 1 of Yongchun Li's Strong Formulations and Algorithms for Regularized A-optimal Design. Since r…
NP-hardness of the Fooling-Set-Submatrix problem
Proof (published by Shitov in 2013) This conjecture was resolved by Yaroslav Shitov in On the Complexity of Boolean Matrix Ranks. Here is the reduction. Let be a simple…
The monotonicity conjecture for recognizing generating complete bipartite subgraphs
Counterexample to the literal arbitrary-family statement Let be the family of graphs containing no cycles of length or , where the forbidden cycles need not be induce…
A special-case identity for generalized Umemura polynomials
Counterexample The identity is false already at . Take … These are valid nonsingular values for the source variables, since … and are all nonzero. First evaluate the…