Related papers: A pleasant exercise
We define and study a class of finite topological spaces, which model the cell structure of a space obtained by gluing finitely many Euclidean convex polyhedral cells along congruent faces. We call these finite topological spaces,…
Tractability results for the model checking problem of logics yield powerful algorithmic meta theorems of the form: Every computational problem expressible in a logic $L$ can be solved efficiently on every class $\mathscr{C}$ of structures…
Association schemes are combinatorial objects that allow us solve problems in several branches of mathematics. They have been used in the study of permutation groups and graphs and also in the design of experiments, coding theory, partition…
Partial combinatory algebras are algebraic structures that serve as generalized models of computation. In this paper, we study embeddings of pcas. In particular, we systematize the embeddings between relativizations of Kleene's models, of…
Categories of partitions are combinatorial structures arising from the representation theory of certain compact quantum groups and are linked to classical diagram algebras such as the Temperley-Lieb algebra. In this paper, we present…
In this article, we consider some simple combinatorial game and a winning strategy in this game. This game is then used to prove several known results about non-repetitive sequences and approximations with denominators from a lacunary…
Functions with uniform level sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used, e.g., in multicriteria optimization, decision theory, mathematical…
This is the final paper in the series of five, in which we prove the geometric Langlands conjecture (GLC). We conclude the proof of GLC by showing that there exists a unique (up to tensoring up by a vector space) Hecke eigensheaf…
We use Cramer's formula for the inverse of a matrix and a combinatorial expression for the determinant in terms of paths of an associated digraph (which can be traced back to Coates) to give a combinatorial interpretation of M\"obius…
A paper of the first author and Zilke proposed seven combinatorial problems around formulas for the characteristic polynomial and the exponents of an isolated quasihomogeneous singularity. The most important of them was a conjecture on the…
The Laver tables are finite combinatorial objects with a simple elementary definition, which were introduced by R. Laver from considerations of logic and set theory. Although these objects exhibit some fascinating properties, they seem to…
This text surveys classical and recent results in the field of amenability of groups, from a combinatorial standpoint. It has served as the support of courses at the University of G\"ottingen and the \'Ecole Normale Sup\'erieure. The goals…
The Lovasz Local Lemma [EL75] is a powerful tool to prove the existence of combinatorial objects meeting a prescribed collection of criteria. The technique can directly be applied to the satisfiability problem, yielding that a k-CNF formula…
Combinatorial design theory studies set systems with certain balance and symmetry properties and has applications to computer science and elsewhere. This paper presents a modular approach to formalising designs for the first time using…
The enumeration of points on (or off) the union of some linear or affine subspaces over a finite field is dealt with in combinatorics via the characteristic polynomial and in algebraic geometry via the zeta function. We discuss the basic…
Considering Schur positivity of differences of plethysms of homogeneous symmetric functions, we introduce a new relation on integer partitions. This relation is conjectured to be a partial order, with its restriction to one part partitions…
This is a detailed survey -- with rigorous and self-contained proofs -- of some of the basics of elementary combinatorics and algebra, including the properties of finite sums, binomial coefficients, permutations and determinants. It is…
The authors and Fischer recently proved that any hereditary property of two-dimensional matrices (where the row and column order is not ignored) over a finite alphabet is testable with a constant number of queries, by establishing the…
In this work we derive a simple argument which shows that Gabor systems consisting of odd functions of $d$ variables and symplectic lattices of density $2^d$ cannot constitute a Gabor frame. In the 1--dimensional, separable case, this is a…
We consider simple modules for a Hecke algebra with a parameter of quantum characteristic $e$. Equivalently, we consider simple modules $D^{\lambda}$, labelled by $e$-restricted partitions $\lambda$ of $n$, for a cyclotomic KLR algebra…