Related papers: Perfect snake-in-the-box codes for rank modulation
Schmidt characterised the class of rayless graphs by an ordinal rank function, which makes it possible to prove statements about rayless graphs by transfinite induction. Halin asked whether Schmidt's rank function can be generalised to…
In 1983, Conway and Gordon proved that for every spatial complete graph on six vertices, the sum of the linking numbers over all of the constituent two-component links is odd, and that for every spatial complete graph on seven vertices, the…
The Kernel Complex Lemma states that given commutative diagram with exact rows and exact columns which covers the region under a $\Gamma$-shape, then the kernel sequence on the top and the kernel sequence at the left have in each position…
We prove that any non-amenable Cayley graph admits a factor of IID perfect matching. We also show that any connected d-regular vertex tran- sitive graph admits a perfect matching. The two results together imply that every Cayley graph…
We conjecture that every oriented graph $G$ on $n$ vertices with $\delta ^+ (G) , \delta ^- (G) \geq 5n/12$ contains the square of a Hamilton cycle. We also give a conjectural bound on the minimum semidegree which ensures a perfect packing…
We construct a family of groups from suitable higher rank graphs which are analogues of the finite symmetric groups. We introduce homological invariants showing that many of our groups are, for example, not isomorphic to $nV$, when $n \geq…
A sorting network is a shortest path from 12...n to n...21 in the Cayley graph of S_n generated by nearest-neighbour swaps. We prove that for a uniform random sorting network, as n->infinity the space-time process of swaps converges to the…
A conjecture of Bondal-Polishchuk states that, in particular for the bounded derived category of coherent sheaves on a smooth projective variety, the action of the braid group on full exceptional collections is transitive up to shifts. We…
We take another approach to Hitchin's strategy of computing the cohomology of moduli spaces of Higgs bundles by localization with respect to the circle-action. Our computation is done in the dimensional completion of the Grothendieck ring…
The odd character variety of a Riemann surface is a moduli space of SO(3) representations of the fundamental group which can be interpreted as the moduli space of stable holomorphic rank 2 bundles of odd degree and fixed determinant. This…
Given an isolated, quasi-homogeneous singularity $X$ we prove that there is a group isomorphism between the group of rank one reflexive sheaves on $X$ and the free abelian group generated by $\mathbb{C}^*$-divisors, modulo linear…
By exploiting the geometry of involutions in $N_\circ^\circ$-groups of finite Morley rank, we show that any simple group of Morley rank $5$ is a bad group all of whose proper definable connected subgroups are nilpotent of rank at most $2$.…
An important problem in the field of graph signal processing is developing appropriate overcomplete dictionaries for signals defined on different families of graphs. The Cayley graph of the symmetric group has natural applications in ranked…
An oriented graph is an orientation of a simple graph. In 2009, Keevash, K\"{u}hn and Osthus proved that every sufficiently large oriented graph $D$ of order $n$ with $(3n-4)/8$ is Hamiltonian. Later, Kelly, K\"{u}hn and Osthus showed that…
Let $X$ be a smooth complex projective curve. We prove that there exists a surjective commutative forgetful diagram from the chain of $\mathbb{C}^{*}$-flips of the moduli spaces of $\mathcal{O}_{X}$-twisted rank 2 constrained framed Hitchin…
In this note we prove that all connected Cayley graphs of every finite group $Q \times H$ are 1-factorizable, where $Q$ is any non-trivial group of 2-power order and $H$ is any group of odd order.
In 1963, Anton Kotzig famously conjectured that $K_{n}$, the complete graph of order $n$, where $n$ is even, can be decomposed into $n-1$ perfect matchings such that every pair of these matchings forms a Hamilton cycle. The problem is still…
We investigate the mathematics behind unshuffles, a type of card shuffle closely related to classical perfect shuffles. To perform an unshuffle, deal all the cards alternately into two piles and then stack the one pile on top of the other.…
The sequence of rings $H^n, n\ge 0,$ introduced in math.QA/0103190, controls categorification of the quantum sl(2) invariant of tangles. We prove that the center of $H^n$ is isomorphic to the cohomology ring of the (n,n) Springer variety…
Conway-Gordon proved that for every spatial complete graph on 6 vertices, the sum of the linking numbers over all of the constituent 2-component links is congruent to 1 modulo 2, and for every spatial complete graph on 7 vertices, the sum…