273 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Flensburg University of Applied SciencesDE5 papers
- University of Veterinary Medicine ViennaAT4 papers
- Charles Darwin UniversityAU3 papers
- Technical University of DenmarkDK3 papers
- Technische Hochschule IngolstadtDE3 papers
- University of South CarolinaUS3 papers
- Cornell UniversityUS2 papers
- ETH ZurichCH2 papers
- Forschungszentrum JülichDE2 papers
- Freie Universität BerlinDE2 papers
- Friedrich-Alexander-Universität Erlangen-NürnbergDE2 papers
- German Institute for Economic ResearchDE2 papers
5 papers · 1 filter
Independent domination in the graph defined by two consecutive levels of the -cube
Thomas Kalinowski, Uwe Leck
Fix a positive integer and consider the bipartite graph whose vertices are the -element subsets and the -element subsets of , and there is an edge be…
Efficient Calculation the Number of Partitions of the Set into Subsets Satisfying
Christian Hercher, Frank Niedermeyer
Consider the set . We are interested in the number of partitions of this set into subsets of three elements each, where the sum of two of them equals the third.…
Using Large Language Models for (De-)Formalization and Natural Argumentation Exercises for Beginner's Students
Merlin Carl
We describe two systems currently being developed that use large language models for the automatized correction of (i) exercises in translating back and forth between natural langu…
Improving the Diproche CNL through Autoformalization via Large Language Models
Merlin Carl
The Diproche system is an automated proof checker for texts written in a controlled fragment of German, designed for didactical applications in classes introducing students to proo…
Sizes of flat maximal antichains of subsets
Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck +2
This is the second of two papers investigating for which positive integers there exists a maximal antichain of size in the Boolean lattice (the power set of $[n]:=\{1…