English
Related papers

Related papers: SQS-graphs of Solov'eva-Phelps codes

200 papers

Let ${\cal C}$ be a ${\mathbb{Z}}_2{\mathbb{Z}}_4$-additive code of length $n > 3$. We prove that if the binary Gray image of ${\cal C}$, $C=\Phi({\cal C})$, is a 1-perfect nonlinear code, then ${\cal C}$ cannot be a…

Combinatorics · Mathematics 2015-10-22 Joaquim Borges , Cristina Fernández-Córdoba

We study the linear extension complexity of stable set polytopes of perfect graphs. We make use of known structural results permitting to decompose perfect graphs into basic perfect graphs by means of two graph operations: 2-join and skew…

Combinatorics · Mathematics 2018-11-20 Hao Hu , Monique Laurent

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…

Information Theory · Computer Science 2023-05-03 Nicolas Charpenay , Maël le Treust , Aline Roumy

We study the BPS particle spectrum of five-dimensional superconformal field theories (SCFTs) on $\mathbb{R}^4\times S^1$ with one-dimensional Coulomb branch, by means of their associated BPS quivers. By viewing these theories as arising…

High Energy Physics - Theory · Physics 2021-08-03 Fabrizio Del Monte , Pietro Longhi

We study finite foldable cubical complexes of nonpositive curvature (in the sense of A.D. Alexandrov). We show that such a complex X admits a graph of spaces decomposition. It is also shown that when dim X=3, X contains a closed rank one…

Metric Geometry · Mathematics 2014-10-01 Xiangdong Xie

Quasi-polycyclic (QP for short) codes over a finite chain ring $R$ are a generalization of quasi-cyclic codes, and these codes can be viewed as an $R[x]$-submodule of $\mathcal{R}_m^{\ell}$, where $\mathcal{R}_m:= R[x]/\langle f\rangle$,…

Information Theory · Computer Science 2021-11-10 Rongsheng Wu , Minjia Shi , Patrick Solé

Matrix representations of quantum operators are computationally complete but often obscure the structural topology of information flow within a quantum circuit \cite{nielsen2000}. In this paper, we introduce a generalized graph-theoretic…

Quantum Physics · Physics 2026-03-03 Wesley Lewis , Darsh Pareek , Umesh Kumar , Ravi Janjam

A graph is chordal if every cycle of length at least four contains a chord, that is, an edge connecting two nonconsecutive vertices of the cycle. Several classical applications in sparse linear systems, database management, computer vision,…

Data Structures and Algorithms · Computer Science 2016-12-07 David Bergman , Carlos H. Cardonha , Andre A. Cire , Arvind U. Raghunathan

We prove that many spaces of positive scalar curvature metrics have the homotopy type of infinite loop spaces. Our result in particular applies to the path component of the round metric inside $\mathcal{R}^+ (S^d)$ if $d \geq 6$. To achieve…

Algebraic Topology · Mathematics 2025-11-24 Johannes Ebert , Oscar Randal-Williams

Recently, simplicial complexes are used in constructions of several infinite families of minimal and optimal linear codes by Hyun {\em et al.} Building upon their research, in this paper more linear codes over the ring $\mathbb{Z}_4$ are…

Information Theory · Computer Science 2024-01-24 Yansheng Wu , Chao Li , Lin Zhang , Fu Xiao

We work on a projective threefold $X$ which satisfies the Bogomolov-Gieseker conjecture of Bayer-Macr\`i-Toda, such as $\mathbb P^3$ or the quintic threefold. We prove certain moduli spaces of 2-dimensional torsion sheaves on $X$ are smooth…

Algebraic Geometry · Mathematics 2026-04-15 Soheyla Feyzbakhsh , Richard P. Thomas

The non-linear binary Kerdock codes are known to be Gray images of certain extended cyclic codes of length $N = 2^m$ over $\mathbb{Z}_4$. We show that exponentiating these $\mathbb{Z}_4$-valued codewords by $\imath \triangleq \sqrt{-1}$…

Information Theory · Computer Science 2021-08-20 Trung Can , Narayanan Rengaswamy , Robert Calderbank , Henry D. Pfister

Magnetic quivers and Hasse diagrams for Higgs branches of rank $r$ 4d $\mathcal{N}=2$ SCFTs arising from $\mathbb{Z}_{\ell}$ $\mathcal{S}$-fold constructions are discussed. The magnetic quivers are derived using three different methods: 1)…

High Energy Physics - Theory · Physics 2021-02-24 Antoine Bourget , Simone Giacomelli , Julius F. Grimminger , Amihay Hanany , Marcus Sperling , Zhenghao Zhong

Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between orbits of graphs and error-correcting codes. We define a new…

Combinatorics · Mathematics 2013-08-09 Lars Eirik Danielsen , Matthew G. Parker , Constanza Riera , Joakim Grahl Knudsen

Let $G$ be a finite simple non-complete connected graph on $\{1, \ldots, n\}$ and $\kappa(G) \geq 1$ its vertex connectivity. Let $f(G)$ denote the number of free vertices of $G$ and $\mathrm{diam}(G)$ the diameter of $G$. Being motivated…

Combinatorics · Mathematics 2021-03-29 Takayuki Hibi , Sara Saeedi Madani

In this work, we study a class of generalized quasi-cyclic (GQC) codes called skew GQC codes. By the factorization theory of ideals, we give the Chinese Remainder Theorem over the skew polynomial ring, which leads to a canonical…

Information Theory · Computer Science 2013-09-09 Jian Gao , Linzhi Shen , Fang-Wei Fu

We introduce a twisted fiber bundle construction of quantum CSS codes over group algebras \(R=\mathbb F_2[G]\), where each base generator carries a generator-dependent \(R\)-linear fiber twist satisfying a flatness condition. This…

Quantum Physics · Physics 2026-05-29 Chaobin Liu

Six-dimensional superconformal field theories (SCFTs) give rise to four-dimensional (4d) ones when compactified on Riemann surfaces. In the $\mathcal{N}=(2,0)$ case, this yields the famous class S family. For $\mathcal{N}=(1,0)$ theories…

High Energy Physics - Theory · Physics 2025-10-22 Fabio Apruzzi , Noppadol Mekareeya , Brandon Robinson , Alessandro Tomasiello

We study a two-parameter family of quantum spin systems on the complete graph, which is the most general model invariant under the complex orthogonal group. In spin $S=\frac{1}{2}$ it is equivalent to the XXZ model, and in spin $S=1$ to the…

Mathematical Physics · Physics 2022-03-03 Kieran Ryan

The construction of the topologically protected code space of Kitaev's model for fault-tolerant quantum computation is extended from complex semisimple to arbitrary finite-dimensional Hopf algebras admitting pairs in involution. One input…

Quantum Algebra · Mathematics 2025-06-12 Sebastian Halbig , Ulrich Krähmer