Related papers: Generalized Spectral Bound for Quasi-Twisted Codes
The quantum chromatic number, $\chi_q(G)$, of a graph $G$ was originally defined as the minimal number of colors necessary in a quantum protocol in which two provers that cannot communicate with each other but share an entangled state can…
In this paper, a Roos like bound on the minimum distance for skew cyclic codes over a general field is provided. The result holds in the Hamming metric and in the rank metric. The proofs involve arithmetic properties of skew polynomials and…
Results from helically symmetric scalar field models and first results from a convergent helically symmetric binary neutron star code are reported here; these are models stationary in the rotating frame of a source with constant angular…
In this paper, we first consider the iterated skew polynomial ring $\mathscr{R}[z_1;\tau_1,\delta_{\tau_1}]$\\$[z_2;\tau_2,\delta_{\tau_2}]$, where $\mathscr{R}$ is a finite ring with unity. Then we use this structure for the construction…
Proposed in 1954 by Gell-Mann, Goldberger, and Thirring, crossing symmetry postulates that particles are indistinguishable from anti-particles traveling back in time. Its elusive proof amounts to demonstrating that scattering matrices in…
The Gilbert-Varshamov (GV) lower bound on the maximum cardinality of a q-ary code of length n with minimum Hamming distance at least d can be obtained by application of Turan's theorem to the graph with vertex set {0,1,..,q-1}^n in which…
We investigate a very recent concept for visualizing various aspects of a graph in the plane using a collection of drawings introduced by Hlin\v{e}n\'y and Masa\v{r}\'ik [GD 2023]. Formally, given a graph $G$, we aim to find an uncrossed…
In this paper, we give the concepts of properly distributed and simply distributed sequences, and prove that they are almost convergent. Basing on these, we review the work of Feng and Li [Feng, B. Q. and Li, J. L., Some estimations of…
In this paper, nested Gallager regions with a single parameter is introduced to exploit Gallager's first bounding technique (GFBT). We present a necessary and sufficient condition on the optimal parameter. We also present a sufficient…
Dielectric spheres of various sizes may sustain electromagnetic whispering-gallery modes resonating at optical frequencies with very narrow linewidths. Arbitrary small deviations from the spherical shape typically shift and broaden such…
Given $n$ non-vertical lines in 3-space, their vertical depth (above/below) relation can contain cycles. We show that the lines can be cut into $O(n^{3/2}\mathop{\mathrm{polylog}} n)$ pieces, such that the depth relation among these pieces…
Hopping cyclic codes (HCCs) are (non-linear) cyclic codes with the additional property that the $n$ cyclic shifts of every given codeword are all distinct, where $n$ is the code length. Constant weight binary hopping cyclic codes are also…
We revisit the well-known Gilbert-Varshamov (GV) bound for constrained systems. In 1991, Kolesnik and Krachkovsky showed that GV bound can be determined via the solution of some optimization problem. Later, Marcus and Roth (1992) modified…
Bound state in the continuum (BIC) and quasi-BIC represent a remarkable class of wave functions that disobey conventional intuition by exhibiting spatially localized modes embedded in the continuum spectrum. In recent years, these states…
In this paper, we will analyze a three dimensional supersymmetric Chern-Simons theory on a manifold with a boundary. The boundary we will consider in this paper will be defined by $n\cdot x=0$, where $n$ is a light-like vector. It will be…
A computable expression for the rate-distortion (RD) function proposed by Heegard and Berger has eluded information theory for nearly three decades. Heegard and Berger's single-letter achievability bound is well known to be optimal for…
Let $C$ be a proper convex cone generated by a compact set which supports a measure $\mu$. A construction due to A.Barvinok, E.Veomett and J.B. Lasserre produces, using $\mu$, a sequence $(P_k)_{k\in \mathbb{N}}$ of nested spectrahedral…
The best degree-based upper bound for the spectral radius is due to Liu and Weng. This paper begins by demonstrating that a (forgotten) upper bound for the spectral radius dating from 1983 is equivalent to their much more recent bound. This…
We prove super-polynomial lower bounds for low-depth arithmetic circuits using the shifted partials measure [Gupta-Kamath-Kayal-Saptharishi, CCC 2013], [Kayal, ECCC 2012] and the affine projections of partials measure [Garg-Kayal-Saha, FOCS…
We present an extension of known semidefinite and linear programming upper bounds for spherical codes. We apply the main result for the distance distribution of a spherical code and show that this method can work effectively In particular,…