Related papers: Perfect snake-in-the-box codes for rank modulation

A major problem in the study of combinatorial aspects of permutation groups is to determine the distances in the symmetric group $\Sym_n$ with respect to a generator set. One well-known such a case is when the generator set $S_n$ consists…

Let the symmetric group $\mathfrak{S}_n$ act on the polynomial ring $\mathbb{Q}[\mathbf{x}_n] = \mathbb{Q}[x_1, \dots, x_n]$ by variable permutation. The coinvariant algebra is the graded $\mathfrak{S}_n$-module $R_n :=…

For each integer partition $\lambda \vdash n$ we give a simple combinatorial expression for the sum of the Jack character $\theta^\lambda_\alpha$ over the integer partitions of $n$ with no singleton parts. For $\alpha = 1,2$ this gives…

In this paper we study various versions of extension complexity for polygons through the study of factorization ranks of their slack matrices. In particular, we develop a new asymptotic lower bound for their nonnegative rank, shortening the…

Given a graph $X$ with a Hamilton cycle $C$, the {\em compression factor $\kappa(X,C)$ of $C$} is the order of the largest cyclic subgroup of $\operatorname{Aut}(C)\cap\operatorname{Aut}(X)$, and the {\em Hamilton compression $\kappa(X)$ of…

Let $\{G_i\}$ be the random graph process: starting with an empty graph $G_0$ with $n$ vertices, in every step $i \geq 1$ the graph $G_i$ is formed by taking an edge chosen uniformly at random among the non-existing ones and adding it to…

It is known that the automorphism group of the elementary abelian $2$-group $Z_2^n$ is isomorphic to the general linear group $GL(n,F_2)$ of degree $n$ over $F_2$. Let $W$ be the collection of permutation matrices of order $n$. It is clear…

A recently fertile strand of research in Group Theory is developing non-abelian analogues of classical combinatorial results for arithmetic Cayley graphs, describing properties such as growth, expansion, mixing, diameter, etc. We consider…

We present a polynomial complexity, deterministic, heuristic for solving the Hamiltonian Cycle Problem (HCP) in an undirected graph of order $n$. Although finding a Hamiltonian cycle is not theoretically guaranteed, we have observed that…

The rational cohomology of the moduli space of rank two, odd degree stable bundles over a curve (of genus g > 1) has been studied intensely in recent years and in particular the invariant subring generated by Newstead's generators alpha,…

It is shown in this paper how a connection may be made between the symmetry generators of the Hamiltonian (or potential) invariant under a symmetry group $G$, and the subcasimirs that come about when the rank of the Poisson structure of a…

Time-driven quantum systems are important in many different fields of physics like cold atoms, solid state, optics, etc. Many of their properties are encoded in the time evolution operator which is calculated by using a time-ordered product…

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…

We study the moduli space of trace-free irreducible rank 2 holomorphic connections over a complex projective curve of genus 2 and the forgetful map towards the moduli space of underlying vector bundles (including unstable bundles), for…

We show that a generically sharply $t$-transitive permutation group of finite Morley rank on a set of rank $r$ satisfies $t\le r+2$ provided the pointwise stabilizer of a generic $(t-1)$-tuple is an $L$-group, which holds, for example, when…

An ordered graph is a graph with a linear ordering on its vertex set. We prove that for every positive integer $k$, there exists a constant $c_k>0$ such that any ordered graph $G$ on $n$ vertices with the property that neither $G$ nor its…

Motivation coming from the study of affine Weyl groups, a structure of ranked poset is defined on the set of circular permutations in $S_n$ (that is, $n$-cycles). It is isomorphic to the poset of so-called admitted vectors, and to an…

A graph is Hamiltonian if it contains a cycle which visits every vertex of the graph exactly once. In this paper, we consider the problem of Hamiltonicity of a graph $G_n$, which will be called the prime difference graph of order $n$, with…

The Immerman-Szelepcsenyi Theorem uses an algorithm for co-st- connectivity based on inductive counting to prove that NLOGSPACE is closed un- der complementation. We want to investigate whether counting is necessary for this theorem to…

We produce group structures on certain sets of topological vector bundles of fixed rank. In particular, we put a group structure on complex rank $2$ bundles on $\mathbb{C}P^3$ with fixed first Chern class. We show that this binary operation…