Related papers: On depth spectra of constacyclic codes

The Lichtenbaum--Quillen conjecture (LQC) relates special values of zeta functions to algebraic K-theory groups. The Ausoni--Rognes red-shift conjectures generalize the LQC to higher chromatic heights in a precise sense. In this paper, we…

We systematically determine circular chromatic index of small graphs and multigraphs with maximum degree $4$, $5$, $6$ (and also their number for a given small order). We construct several infinite families of such graphs with circular…

The acyclic chromatic number of a graph is the least number of colors needed to properly color its vertices so that none of its cycles has only two colors. We show that for all $\alpha>2^{-1/3}$ there exists an integer $\Delta_{\alpha}$…

This paper studies the co-maximal graph $\Om(R)$, the induced subgraph $\G(R)$ of $\Om(R)$ whose vertex set is $R\setminus (U(R)\cup J(R))$ and a retract $\G_r(R)$ of $\G(R)$, where $R$ is a commutative ring. We show that the core of…

We consider discrete Schr\"odinger operators $H_{\mu Q}=\Delta+\mu Q$ with real periodic potentials $Q$ on periodic graphs, where $\Delta$ is the adjacency operator and $\mu\in\mathbb R$ is a coupling constant. The spectra of the operators…

Let $G$ be a graph with adjacency matrix $A(G)$, and let $D(G)$ be the diagonal matrix of the degrees of $G$. For any real $\alpha\in[0,1]$, write $A_\alpha(G)$ for the matrix $$A_\alpha(G)=\alpha D(G)+(1-\alpha)A(G).$$ This paper presents…

In this paper we give an Immerman's Theorem for real-valued computation. We define circuits operating over real numbers and show that families of such circuits of polynomial size and constant depth decide exactly those sets of vectors of…

For any given positive integer $m$, a necessary and sufficient condition for the existence of Type I $m$-adic constacyclic codes is given. Further, for any given integer $s$, a necessary and sufficient condition for $s$ to be a multiplier…

We examine regular and irregular repeat-accumulate (RA) codes with repetition degrees which are all even. For these codes and with a particular choice of an interleaver, we give an upper bound on the decoding error probability of a…

In this paper, the investigation on the algebraic structure of the ring $\frac{\mathbb{F}_q[v]}{\langle\,v^q-v\,\rangle}$ and the description of its automorphism group, enable to study the algebraic structure of codes and their dual over…

In this note, we study skew cyclic and skew constacyclic codes over the ring $\mathcal{R}=F_{q}+uF_{q}+vF_{q}+uvF_{q}$ where $q=p^{m},$ $p$ is an odd prime, $u^{2}=u,~v^{2}=v,~uv=vu$. We show that Gray images of a skew cyclic and skew…

Let $R^t$ denote the finite chain ring $\frac{\mathbb{F}_{p^m}[u]}{\langle u^t \rangle},$ where $p$ is a prime and $t$ is a positive integer. In this article, for a prime $p$ and an automorphism $\theta$ of $\mathbb{F}_{p^m}$, we give the…

We introduce a non-Hermitian $\beta$-ensemble and determine its spectral density in the limit of large $\beta$ and large matrix size $n$. The ensemble is given by a general tridiagonal complex random matrix of normal and chi-distributed…

The motivation for this paper is to study the complexity of constant-width arithmetic circuits. Our main results are the following. 1. For every k > 1, we provide an explicit polynomial that can be computed by a linear-sized monotone…

Ring oscillators are biochemical circuits consisting of a ring of interactions capable of sustained oscillations. The non-linear interactions between genes hinder the analytical insight into their function, usually requiring computational…

Pure electronic Raman spectra with no phonon structures superimposed to the electronic continuum, are reported, in optimally doped HgBa_{2}CaCu_{2}O_{6+\delta } single crystals (T_{c }=126 K). As a consequence, the spectra in the A_{1g },…

A subset $C$ of the vertex set of a graph $\Gamma$ is said to be $(\alpha,\beta)$-regular if $C$ induces an $\alpha$-regular subgraph and every vertex outside $C$ is adjacent to exactly $\beta$ vertices in $C$. In particular, if $C$ is an…

This paper leverages the use of \emph{Gram iteration} an efficient, deterministic, and differentiable method for computing spectral norm with an upper bound guarantee. Designed for circular convolutional layers, we generalize the use of the…

We study Hamiltonicity and pancyclicity in the graph obtained as the union of a deterministic $n$-vertex graph $H$ with $\delta(H)\geq\alpha n$ and a random $d$-regular graph $G$, for $d\in\{1,2\}$. When $G$ is a random $2$-regular graph,…

We derive the spectral domain properties of two-dimensional (2-D) $(\lambda_1, \lambda_2)$-constacyclic codes over $\mathbb{F}_q$ using the 2-D finite field Fourier transform (FFFT). Based on the spectral nulls of 2-D $(\lambda_1,…