Related papers: De combinatoriek van De Bruijn

This is a survey of knot contact homology, with an emphasis on topological, algebraic, and combinatorial aspects.

This is part two of a series of four methodological papers on (bi)quaternions and their use in theoretical and mathematical physics: 1- Alphabetical bibliography, 2- Analytical bibliography, 3- Notations and terminology, and 4- Formulas and…

Inspired by the the Kourovka Notebook of unsolved problems in group theory [KhukhMaz2024], this is a notebook of unsolved problems in the combinatorics of tableaux. Contributions to the notebook are invited.

In this series of three articles, we give an exposition of various results and open problems in three areas of algebraic and geometric combinatorics: totally non-negative matrices, representations of the symmetric group, and hyperplane…

We introduce a variation of the well-known Newton-Hironaka polytope for algebroid hypersurfaces. This combinatorial object is a perturbed version of the original one, parametrized by a real number. For well-chosen values of the parameter,…

A survey written for the upcoming "Handbook of Enumerative Combinatorics".

This paper is devoted to survey composition algebras and some of their applications. After overviewing the classical algebras of quaternions and octonions, both unital composition algebras (or Hurwitz algebras) and symmetric composition…

I will share with the reader what I have learned from Richard Stanley and the ways in which he has contributed to research in combinatorics conducted by me and my collaborators.

We revisit and further explore the celebrated Combinatorial Nullstellens\"atze of N. Alon in several different directions.

The multiplicative and additive compounds of a matrix play an important role in several fields of mathematics including geometry, multi-linear algebra, combinatorics, and the analysis of nonlinear time-varying dynamical systems. There is a…

A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.

The main purpose of this survey is to provide an introduction, algebro-topological in nature, to Hirzebuch-type inequalities for plane curve arrangements in the complex projective plane. These inequalities gain more and more interest due to…

A number of finite algorithms for constructing representation theoretic data from group multiplications in a finite group G have recently been shown to be related to amplitudes for combinatoric topological strings (G-CTST) based on…

This paper surveys the recent attempts, both from the machine learning and operations research communities, at leveraging machine learning to solve combinatorial optimization problems. Given the hard nature of these problems,…

An introduction is given to the Littlewood-Richardson rule, and various combinatorial constructions related to it. We present a proof based on tableau switching, dual equivalence, and coplactic operations. We conclude with a section…

This paper provides a systematic study of fundamental combinatorial properties of one-dimensional, two-sided infinite simple Toeplitz subshifts. Explicit formulas for the complexity function, the palindrome complexity function and the…

We construct new examples of non-nil algebras with any number of generators, which are direct sums of two locally nilpotent subalgebras. As all previously known examples, our examples are contracted semigroup algebras and the underlying…

This is the second of a series of papers surveying some small part of the remarkable work of our friend and colleague Nigel Kalton. We have written it as part of a tribute to his memory. It does not contain new results. One of the many…

This is a former PhD student's take on his teacher's scientific philosophy. I describe a set of 'principles' that I believe are conducive to good applied mathematics, and that I have learnt myself from observing Hans van Duijn in action.

This habilitation thesis is intended to be a good introduction to enumeration, the problem of listing solutions. It focuses on the different ways of measuring complexity in enumeration, with a particular emphasis on my contributions to the…