Related papers: Harder-Narasimhan theory for linear codes
We introduce the class of partition-balanced families of codes, and show how to exploit their combinatorial invariants to obtain upper and lower bounds on the number of codes that have a prescribed property. In particular, we derive precise…
In this paper, we propose a novel framework for modeling topological phases of matter using code-based Narain conformal field theories (NCFTs). We show that the algebraic structure of the NCFTs naturally embeds into critical lattice quantum…
A construction of Wehrheim and Woodward circumvents the problem that compositions of smooth canonical relations are not always smooth, building a category suitable for functorial quantization. To apply their construction to more examples,…
Two discretizations, linear and nonlinear, of basic notions of the complex analysis are considered. The underlying lattice is an arbitrary quasicrystallic rhombic tiling of a plane. The linear theory is based on the discrete Cauchy-Riemann…
The reduction of covering decision systems is an important problem in data mining, and covering-based rough sets serve as an efficient technique to process the problem. Geometric lattices have been widely used in many fields, especially…
We show that $\kgl$-linear cohomology theories over an affine Dedekind scheme $S$ admit a canonical weight filtration on resolvable motives without inverting residual characteristics. Combined with upcoming work of Annala--Hoyois--Iwasa,…
Generalized pair weights of linear codes are generalizations of minimum symbol-pair weights, which were introduced by Liu and Pan \cite{LP} recently. Generalized pair weights can be used to characterize the ability of protecting information…
The Doran-Harder-Thompson "gluing/splitting" conjecture unifies mirror symmetry conjectures for Calabi-Yau and Fano varieties, relating fibration structures on Calabi-Yau varieties to the existence of certain types of degenerations on their…
Association schemes are central objects in algebraic combinatorics, with the classical schemes lying at their core. These classical association schemes essentially consist of the Hamming and Johnson schemes, and their $q$-analogs: bilinear…
We characterize the combinatorial types of symmetric frameworks in the plane that are minimally generically symmetry-forced infinitesimally rigid when the symmetry group consists of rotations and translations. Along the way, we use tropical…
The complex analytic methods have found a wide range of applications in the study of multiplicity-free representations. This article discusses, in particular, its applications to the question of restricting highest weight modules with…
We construct two-dimensional ${\cal N} = (2, 2)$ supersymmetric gauge theories on a Euclidean spacetime lattice with matter in the two-index symmetric and anti-symmetric representations of SU($N_c$) color group. These lattice theories…
By using tensor analysis, we find a connection between normed algebras and the parallelizability of the spheres S$^1$, S$^3$ and S$^7.$ In this process, we discovered the analogue of Hurwitz theorem for curved spaces and a geometrical…
Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level languages with ML-style general (higher-order) storage, we…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
This paper proposes a matrix-free residual evaluation technique for the hybridizable discontinuous Galerkin method requiring a number of operations scaling only linearly with the number of degrees of freedom. The method results from…
Bounds on linear codes play a central role in coding theory, as they capture the fundamental trade-off between error-correction capability (minimum distance) and information rate (dimension relative to length). Classical results…
This paper gives an exposition of relative weight filtrations on completions of mapping class groups associated to a stable degeneration of marked genus g curves. These relative weight filtrations have been constructed using Galois theory…
We establish a correspondence between higher-derivative gravitational scalar-tensor theories of the form $\Psi(R,(\nabla R)^2,\Box R)$ and generalized hybrid metric-Palatini models $f(R,\mathcal{R})$. Restricting to the physically relevant…
In the present paper we introduce and study finite point subsets of a special kind, called optimum distributions, in the n-dimensional unit cube. Such distributions are closely related with known (delta,s,n)-nets of low discrepancy. It…