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

Let $K$ be a Gorenstein noetherian ring of finite Krull dimension, and consider the category of cohomologically noetherian commutative differential graded rings $A$ over $K$, such that $H^0(A)$ is essentially of finite type over $K$, and…

In this paper, we compute the number of z-classes (conjugacy classes of centralizers of elements) in the symmetric group S_n, when n is greater or equal to 3 and alternating group A_n, when n is greater or equal to 4. It turns out that the…

Statistical models corresponding to a new class of braid matrices ($\hat{o}_N; N\geq 3$) presented in a previous paper are studied. Indices labeling states spanning the $N^r$ dimensional base space of $T^{(r)}(\theta)$, the $r$-th order…

In this paper we are concerned with the conjecture that, for any set of generators S of the symmetric group of degree n, the word length in terms of S of every permutation is bounded above by a polynomial of n. We prove this conjecture for…

We prove that all SYM theories that have a quantum modified moduli space $\m$ defined by a single constraint equation have trivial homotopy groups $\pi_j(\m)$ for $j=0,1,2,3$ and 4. This implies that none of these theories admit skyrmions…

For any order of growth $f(n)=o(\log n)$ we construct a finitely-generated group $G$ and a set of generators $S$ such that the Cayley graph of $G$ with respect to $S$ supports a harmonic function with growth $f$ but does not support any…

In this paper, we provide a complete classification of the positive minimal monads whose cohomology is a stable rank 2 bundle on $\mathbb{P}^3$ with Chern classes $c_1=-1, c_2=10$ and we prove the existence of a new irreducible component of…

We will show that all inverse limits of finite rank free groups index by the natural numbers are isomorphic either to a finite rank free group or to a fixed universal group. In other words, any inverse system of finite rank free groups…

In a recent paper, the author proved that if $n\geq 3$ is a natural number, $R$ a commutative ring and $\sigma\in GL_n(R)$, then $t_{kl}(\sigma_{ij})$ where $i\neq j$ and $k\neq l$ can be expressed as a product of $8$ matrices of the form…

We provide a deterministic $\tilde{O}(\log N)$-space algorithm for estimating random walk probabilities on undirected graphs, and more generally Eulerian directed graphs, to within inverse polynomial additive error…

In the zero-error Slepian-Wolf source coding problem, the optimal rate is given by the complementary graph entropy $\overline{H}$ of the characteristic graph. It has no single-letter formula, except for perfect graphs, for the pentagon…

We prove that the infinite components of the Free Uniform Spanning Forest of a Cayley graph are indistinguishable by any invariant property, given that the forest is different from its wired counterpart. Similar result is obtained for the…

In $1990$, Hartsfield and Ringel introduced antimagic graphs. Hartsfield and Ringel conjectured that every connected graph (and in particular, a tree) except $K_2$ is antimagic. In $2010$, Hefetz et al.\ raised two questions: Is every…

Let $\{D_M\}_{M\geq 0}$ be the $n$-vertex random directed graph process, where $D_0$ is the empty directed graph on $n$ vertices, and subsequent directed graphs in the sequence are obtained by the addition of a new directed edge uniformly…

We introduce a notion of rank completion for bi-modules over a finite tracial von Neumann algebra. We show that the functor of rank completion is exact and that the category of complete modules is abelian with enough projective objects.…

We prove that the rank problem is decidable in the class of torsion-free word-hyperbolic Kleinian groups. We also show that every group in this class has only finitely many Nielsen equivalence classes of generating sets of a given…

We study the representations of non-commutative universal lattices and use them to compute lower bounds for the \TauC for the commutative universal lattices $G_{d,k}= \SL_d(\Z[x_1,...,x_k])$ with respect to several generating sets. As an…

An efficient implicit representation of an $n$-vertex graph $G$ in a family $\mathcal{F}$ of graphs assigns to each vertex of $G$ a binary code of length $O(\log n)$ so that the adjacency between every pair of vertices can be determined…

We show that the strongly regular graph on non-isotropic points of one type of the polar spaces of type $U(n, 2)$, $O(n, 3)$, $O(n, 5)$, $O^+(n, 3)$, and $O^-(n, 3)$ are not determined by its parameters for $n \geq 6$. We prove this by…

We prove a few results about non-nilpotent graphs of symmetric groups $S_n$ -- namely that they have a Hamiltonian cycle and they satisfy a conjecture of Nongsiang and Saikia. The latter is likewise proven for alternating groups $A_n$. We…