Related papers: Perfect snake-in-the-box codes for rank modulation
The moduli space of rank $n$ graphs, the outer automorphism group of the free group of rank $n$ and Kontsevich's Lie graph complex have the same rational cohomology. We show that the associated Euler characteristic grows like…
We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the $n!$ Hamilton cycles in a complete directed graph on $n+1$ vertices corresponds with each of the $n!$ $n$-permutation matrices $P$,…
Let $S$ be a set of transpositions such that the girth of the transposition graph of $S$ is at least 5. It is shown that the automorphism group of the Cayley graph of the permutation group $H$ generated by $S$ is the semidirect product…
In this note we present a simplified and slightly generalized version of a lemma the authors published in 1987. The lemma as stated here asserts that if the order of a permutation of $n$ elements is greater than $n^{\alpha}$ then some…
We prove that braid group representations associated to braided fusion categories and mapping class group representations associated to modular fusion categories are always semisimple. The proof relies on the theory of extensions in…
Finding general conditions which ensure that a graph is Hamiltonian is a central topic in graph theory. An old and well known conjecture in the area states that any $d$-regular $n$-vertex graph $G$ whose second largest eigenvalue in…
Support and rank varieties of modules over a group algebra of an elementary abelian p-group have been well studied. In particular, Avrunin and Scott showed that in this setting, the rank and support varieties are equivalent. Avramov and…
A characteristic-dependent linear rank inequality is a linear inequality that holds by ranks of subspaces of a vector space over a finite field of determined characteristic, and does not in general hold over other characteristics. In this…
Let $\mathrm{Mat}_{n \times n}(\mathbb{C})$ be the affine space of $n \times n$ complex matrices with coordinate ring $\mathbb{C}[\mathbf{x}_{n \times n}]$. We define graded quotients of $\mathbb{C}[\mathbf{x}_{n \times n}]$ which carry an…
In this paper, we introduce and investigate a new notion of exact sequences of semimodules over semirings relative to the canonical image factorization. Several homological results are proved using the new notion of exactness including some…
The Schreier graphs of Thompson's group F with respect to the stabilizer of 1/2 and generators x_0 and x_1, and of its unitary representation in L_2([0,1]) induced by the standard action on the interval [0,1] are explicitly described. The…
Divide a deck of $kn$ cards into $k$ equal piles and place them from left to right. The standard shuffle $\sigma$ is performed by picking up the top cards one by one from left to right and repeating until all cards have been picked up. For…
We study a closed differential form on the symmetric space of positive definite matrices, which is defined using the Pfaffian and is $\mathsf{GL}_{2n}(\mathbb{Z})$ invariant up to a sign. It gives rise to an infinite family of unstable…
We prove that the Khovanov homology of alternating knots and 2-component links is equal (as a singly graded group) to the singular homology of a certain space of trace- free, binary dihedral representations of the link group. More…
Box complex is a $\mathbb{Z}_2$-space associated to a graph, and it is known that a certain $\mathbb{Z}_2$-homotopy invariant of it, called the $\mathbb{Z}_2$-index, gives an effective lower bound for the chromatic number. On the other…
Recently, Anderson et al. (2019) proposed the concept of rankability, which refers to a dataset's inherent ability to produce a meaningful ranking of its items. In the same paper, they proposed a rankability measure that is based on a…
We shed some light on the problem of determining the orbits of the braid group action on semiorthonormal bases of Mukai lattices as considered in \cite{GK04} and \cite{GO1}. We show that there is an algebraic (and in particular algorithmic)…
We show that there is an absolute constant $c>0$ such that every large connected $n$-vertex Cayley graph with degree $d\geq n^{1-c}$ has a Hamilton cycle. This makes progress towards the Lov\'asz conjecture and improves upon the previous…
In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…
A finite group of order $n$ can be represented by its Cayley table. In the word-RAM model the Cayley table of a group of order $n$ can be stored using $O(n^2)$ words and can be used to answer a multiplication query in constant time. It is…