Related papers: The Canada Day Theorem

A half-tree is an edge configuration whose superimposition with a perfect matching is a tree. In this paper, we prove a half-tree theorem for the Pfaffian principal minors of a skew-symmetric matrix whose column sum is zero; introducing an…

Let $\mathcal{S}_{n}$ be the symmetric group on $[n]=\{1, \ldots, n\}$. The $k$-point fixing graph $\mathcal{F}(n,k)$ is defined to be the graph with vertex set $\mathcal{S}_{n}$ and two vertices $g$, $h$ of $\mathcal{F}(n,k)$ are joined if…

We generalize the Cauchy-Davenport theorem to locally compact groups.

We give a shorter proof of the following theorem of Kathryn Mann \cite{M}: the identity component of the group of the compactly supported $C^r$ diffeomorphisms of $\R^n$ cannot admit a nontrivial $C^p$-action on $S^1$, provided $n\geq2$,…

For a general inelastic Kac-like equation recently proposed, this paper studies the long-time behaviour of its probability-valued solution. In particular, the paper provides necessary and sufficient conditions for the initial datum in order…

A well known conjecture of Wigner, Dyson, and Mehta asserts that the (appropriately normalized) $k$-point correlation functions of the eigenvalues of random $n \times n$ Wigner matrices in the bulk of the spectrum converge (in various…

In 1982 Macdonald published his now famous constant term conjectures for classical root systems. This paper begins with the almost trivial observation that Macdonald's constant term identities admit an extra set of free parameters, thereby…

We determine the distribution of the sandpile group (also known as the Jacobian) of the Erd\H{o}s-R\'{e}nyi random graph $G(n,q)$ along with its canonical duality pairing as $n$ tends to infinity, fully resolving a conjecture from 2015 due…

Algorithmic meta-theorems are general algorithmic results applying to a whole range of problems, rather than just to a single problem alone. They often have a "logical" and a "structural" component, that is they are results of the form:…

We classify the pairs of subsets (A,B) of a locally compact abelian group satisfying m(A+B)=m(A)+m(B), where m is Haar measure. This generalizes a result of M. Kneser classifying such pairs under the additional assumption that G is compact…

We provide a new computation of the K-theory of the group $C^*$-algebra of the solvable Baumslag-Solitar group $BS(1,n)\;(n\neq 1)$; our computation is based on the Pimsner-Voiculescu 6-terms exact sequence, by viewing $BS(1,n)$ as a…

The path integral for the partition function of Chern-Simons gauge theory with a compact gauge group is evaluated on a general Seifert 3-manifold. This extends previous results and relies on abelianisation, a background field method and…

An old conjecture of Graham stated that if $n$ is a prime and $S$ is a sequence of $n$ terms from the cyclic group $C_n$ such that all (nontrivial) zero-sum subsequences have the same length, then $S$ must contain at most two distinct…

Keller proposed a combinatorial conjecture on construction of an n-by-infinite matrix, which comes from showing the existence of many orbits of different sizes in certain linear group actions. He proved it for the case n=4, and we show that…

This short note deals with the so-called $ Sock \; Matching \; Problem$. We define $B_{n,k}$ as the number of all the finite sequences $a_1, \ldots, a_{2n}$ of nonnegative integers which contain at least one occurrence of $k$ $(1 \leq k…

We show that the K-theory of C*-algebras can be defined by pairs of matrices satisfying less strict relations than idempotency.

We construct a random matrix model that, in the large $N$ limit, reduces to the low energy limit of the QCD partition function put forward by Leutwyler and Smilga. This equivalence holds for an arbitrary number of flavors and any value of…

We construct a new bivariant theory, that we call $KE$-theory, which is intermediate between the $KK$-theory of G. G. Kasparov, and the $E$-theory of A. Connes and N. Higson. For each pair of separable graded $C^*$-algebras $A$ and $B$,…

There is a well understood way of generating random coverings of a fixed manifold by sampling homomorphisms from the fundamental group of this manifold into the symmetric group. We prove a central limit theorem for the number of connected…

Let $k$ be a positive integer. A $k$-cycle-factor of an oriented graph is a set of disjoint cycles of length $k$ that covers all vertices of the graph. In this paper, we prove that there exists a positive constant $c$ such that for $n$…