Related papers: Conglomerability and Finitely Additive Representat…
We study the Euler-Frobenius numbers, a generalization of the Eulerian numbers, and the probability distribution obtained by normalizing them. This distribution can be obtained by rounding a sum of independent uniform random variables; this…
By generalizing Frobenius' polynomial method to good partition algebra, we will develop new character theories for a finite group $G$. A uniform defining equations are derived for these kinds of character theories. The new character…
We adapt the commutator theory of universal algebra to the particular setting of racks and quandles, exploiting a Galois connection between congruences and certain normal subgroups of the displacement group. Congruence properties such as…
Given a $1$-cocycle $b$ with coefficients in an orthogonal representation, we show that any finite dimensional summand of $b$ is cohomologically trivial if and only if $\| b(X_n) \|^2/n$ tends to a constant in probability, where $X_n$ is…
In this paper we revisit the notion of grouped dispersal that have been introduced by Soubeyrand and co-authors \cite{soubeyrand2011patchy} to model the simultaneous (and hence dependent) dispersal of several propagules from a single source…
The Gumbel trick is a method to sample from a discrete probability distribution, or to estimate its normalizing partition function. The method relies on repeatedly applying a random perturbation to the distribution in a particular way, each…
We introduce the notion of a probabilistic identity of a residually finite group. We prove that a finitely generated linear group satisfies a probabilistic identity if and only if it is virtually solvable. As an application, we prove a…
The problem of finding the number of ordered commuting tuples of elements in a finite group is equivalent to finding the size of the solution set of the system of equations determined by the commutator relations that impose commutativity…
We introduce the notion of a restricted exchangeable partition of $\mathbb{N}$. We obtain integral representations, consider associated fragmentations, embeddings into continuum random trees and convergence to such limit trees. In…
The beta distribution is the best-known distribution for modelling doubly-bounded data, \eg percentage data or probabilities. A new generalization of the beta distribution is proposed, which uses a cubic transformation of the beta random…
Approximate algebraic structures play a defining role in arithmetic combinatorics and have found remarkable applications to basic questions in number theory and pseudorandomness. Here we study approximate representations of finite groups:…
We consider a combinatorial problem occurring naturally in a group theoretical setting and provide a constructive solution in a special case. More precisely, in 1999 the author established a logarithmic bound for the derived length of the…
In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constructions of objects with such properties are often very difficult, or…
We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…
This paper describes the expected characteristic polynomial of the commutator of randomly rotated matrices, in the context of the finite free probability theory initiated by Marcus, Spielman, and Srivastava. The key technical features are…
We prove that the probability that a sum of independent random variables in $\mathbb{R}^d$ with bounded densities lies in a ball is maximized by taking uniform distributions on balls. This in turn generalizes a result by Rogozin on the…
Quasirandomness is a general mathematical concept meant to encapsulate several characteristics usually satisfied by random combinatorial objects, and which we regard as describing when a given object 'looks random'. In this survey we…
By means of several examples, we motivate that universal properties are the simplest way to solve a given mathematical problem, explaining in this way why they appear everywhere in mathematics. In particular, we present the co-universal…
As we go along with a bioinformatic analysis we stumbled over a new combinatorial question. Although the problem is a very special one, there are maybe more applications than only this one we have. This text is mainly about the general…
Here we present in a single essay a combination and completion of the several aspects of the problem of randomness of individual objects which of necessity occur scattered in our texbook "An Introduction to Kolmogorov Complexity and Its…