Related papers: On transitive uniform partitions of F^n into binar…
Let $p$ be a prime, $m$ be a positive integer ( $m \geq 1$, and $m \geq 2$ if $p=2$), and $\chi_n$ be a multiplicative complex character on $\mathbb F^*_{p^m}$ with order $n| (p^m-1)$. We show that a partition $\mathcal A_1 \cup \mathcal…
Families of codes such as group codes, constacyclic and skew cyclic codes, some of which independently suggested in the literature, turn out to be special instances of the general family of crossed product codes. Hamming-metric is a main…
We develop a framework for the classification of invertible translation-invariant stabilizer codes modulo condensation and stabilization with simple codes. We introduce generalizations of the Pauli groups of local unitaries for quantum…
We study quantum transport in disordered systems with particle-hole symmetric Hamiltonians. The particle-hole symmetry is spontaneously broken after averaging with respect to disorder, and the resulting massless mode is treated in a…
The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…
We prove that every $1$-error-correcting code over a finite field can be embedded in a $1$-perfect code of some larger length. Embedding in this context means that the original code is a subcode of the resulting $1$-perfect code and can be…
Let C be an additive subgroup of $\Z_{2k}^n$ for any $k\geq 1$. We define a Gray map $\Phi:\Z_{2k}^n \longrightarrow \Z_2^{kn}$ such that $\Phi(\codi)$ is a binary propelinear code and, hence, a Hamming-compatible group code. Moreover,…
Using the the theory of FS^op modules, we study the asymptotic behavior of the homology of $\overline M_{g,n}$, the Deligne--Mumford compactification of the moduli space of curves, for $n >> 0$. An FS^op module is a contravariant functor…
A known Kronecker construction of completely regular codes has been investigated taking different alphabets in the component codes. This approach is also connected with lifting constructions of completely regular codes. We obtain several…
A new construction for constant weight codes is presented. The codes are constructed from $k$-dimensional subspaces of the vector space $\F_q^n$. These subspaces form a constant dimension code in the Grassmannian space $\cG_q(n,k)$. Some of…
We report on a computational and experimental study of permanents. On the computational side, we use the GPU to greaatly accelerate the computation of permanents over $\mathbb{C},$ $\mathbb{R},$ $\mathbb{F}_p$ and $\mathbb{Q}.$ First, for…
This paper investigates the hull codes of free linear codes over a non-unital ring $ E= \langle \kappa,\tau \mid 2 \kappa =2 \tau=0,~ \kappa^2=\kappa,~ \tau^2=\tau,~ \kappa \tau=\kappa,~ \tau \kappa=\tau \rangle$. Initially, we examine the…
The generalized Hamming weights (GHWs) are fundamental parameters of linear codes. In this paper, we investigate the generalized Hamming weights of two classes of linear codes constructed from defining sets and determine them completely…
A bijection is presented between (1): partitions with conditions $f_j+f_{j+1}\leq k-1$ and $ f_1\leq i-1$, where $f_j$ is the frequency of the part $j$ in the partition, and (2): sets of $k-1$ ordered partitions $(n^{(1)}, n^{(2)}, ...,…
Motivated by problems arising in the complex analysis of perturbative quantum field theory, we investigate the homology of finite unions of certain non-degenerate quadratic affine hypersurfaces of complex dimension $n$ in general position.…
We study some combinatorial statistics defined on the set $NC^{(mton)}(n)$ of monotonically ordered non-crossing partitions of {1,...,n}, and on the set $NC_2^{(mton)}(2n)$ of monotonically ordered non-crossing pair-partitions of…
We establish recursions counting various classes of chains in the noncrossing partition lattice of a finite Coxeter group. The recursions specialize a general relation which is proven uniformly (i.e. without appealing to the classification…
Let $C(\mathbf I)$ be the set of all continuous self-maps from ${\mathbf I}=[0,1]$ with the topology of uniformly convergence. A map $f\in C({\mathbf I})$ is called a transitive map if for every pair of non-empty open sets $U,V$ in…
We say that a finite subset of the unit sphere in $\mathbf{R}^d$ is transitive if there is a group of isometries which acts transitively on it. We show that the width of any transitive set is bounded above by a constant times $(\log…
A code of length $n$ is said to be (combinatorially) $(\rho,L)$-list decodable if the Hamming ball of radius $\rho n$ around any vector in the ambient space does not contain more than $L$ codewords. We study a recently introduced class of…