Benjamin Przybocki

MaRDI QIDQ2073304zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Bender-Knuth involutions on linear extensions of posets (available as arXiv preprint)	N/A	Paper
Shininess, strong politeness, and unicorns	2026-02-26	Paper
Being polite is not enough (and other limits of theory combination)	2026-01-21	Paper
Doubly Saturated Ramsey Graphs: A Case Study in Computer-Assisted Mathematical Discovery (available as arXiv preprint)	2026-01-01	Paper
Bringing closure to theory combination properties (available as arXiv preprint)	2026-01-01	Paper
Toward Satisfiability Modulo Realizability (available as arXiv preprint)	2026-01-01	Paper
A SAT Attack on Tarski's High School Algebra Problem (available as arXiv preprint)	2026-01-01	Paper
Bringing closure to theory combination properties	2026-01-01	Paper
The termination of Nielsen transformations applied to word equations with length constraints	2026-01-01	Paper
Optimal and Efficient Partite Decompositions of Hypergraphs (available as arXiv preprint)	2025-01-01	Paper
Characterizing Sets of Theories That Can Be Disjointly Combined (available as arXiv preprint)	2025-01-01	Paper
Bender-Knuth involutions on linear extensions of posets Discrete Mathematics	2024-06-11	Paper
The maximum hook length of d-distinct simultaneous core partitions The Electronic Journal of Combinatorics	2024-02-23	Paper
The nonexistence of unicorns and many-sorted Löwenheim-Skolem theorems (available as arXiv preprint)	2024-01-01	Paper
Lengths of irreducible and delicate words The Electronic Journal of Combinatorics	2022-07-04	Paper
Hat guessing on books and windmills The Electronic Journal of Combinatorics	2022-02-01	Paper
Lengths of Irreducible and Delicate Words (available as arXiv preprint)	2021-08-14	Paper

Research outcomes over time

This page was built for person: Benjamin Przybocki