Related papers: Geometric representation of binary codes and compu…
This is the first paper in a series of eight where in the first three we develop a systematic approach to the geometric algebras of multivectors and extensors, followed by five papers where those algebraic concepts are used in a novel…
It is known that reflection coefficients for bulk fields of a rational conformal field theory in the presence of an elementary boundary condition can be obtained as representation matrices of irreducible representations of the classifying…
This article provides a pedagogically oriented introduction to geometric (Clifford) calculus on pseudo-Riemannian manifolds. Unlike usual approaches to the topic, which rely on embedding the geometric algebra either within a tensor algebra…
The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…
In two previous papers we have presented partition formulae for the Fibonacci numbers motivated by the appearance of the Fibonacci numbers in the representation theory of the 3-Kronecker quiver and its universal cover, the 3-regular tree.…
We derive an explicit expression for the $1/c$ contribution to the Virasoro blocks in 2D CFT in the limit of large $c$ with fixed values of the operators' dimensions. We follow the direct approach of orthonormalising, at order $1/c$, the…
In this thesis, we develop the theory of bifibrations of polycategories. We start by studying how to express certain categorical structures as universal properties by generalising the shape of morphism. We call this phenomenon…
Here (the last paper in a series of four) we end our presentation of the basics of a systematical approach to the differential geometry of a smooth manifold M (supporting a metric field g and a general connection del) which uses the…
We unify Linear Algebra by proposing a definition of determinants via one equation that implies all known properties of them:\\ 1. Cramer's Rule,\\ 2. Cofactor expansion,\\ 3. Antisymmetry of determinants,\\ 4. Linearity of determinants,\\…
Linear codes with few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs. This paper first generalizes the method of…
Representations of Spin groups and Clifford algebras derived from the structure of qubit trees are introduced in this work. For ternary trees the construction is more general and reduction to binary trees is formally defined by deletion of…
This paper explores formalizing Geometric (or Clifford) algebras into the Lean 3 theorem prover, building upon the substantial body of work that is the Lean mathematics library, mathlib. As we use Lean source code to demonstrate many of our…
We introduce a large class of conformally-covariant differential operators and a crossing equation that they obey. Together, these tools dramatically simplify calculations involving operators with spin in conformal field theories. As an…
The weight distribution and weight hierarchy of linear codes are two important research topics in coding theory. In this paper, by choosing proper defining sets from inhomogeneous quadratic functions over $\mathbb{F}_{q}^{2},$ we construct…
This paper defines, for each convex polytope $\Delta$, a family $H_w\Delta$ of vector spaces. The definition uses a combination of linear algebra and combinatorics. When what is called exact calculation holds, the dimension $h_w\Delta$ of…
In this paper we use the Gr\"obner representation of a binary linear code $\mathcal C$ to give efficient algorithms for computing the whole set of coset leaders, denoted by $\mathrm{CL}(\mathcal C)$ and the set of leader codewords, denoted…
We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…
We develop geometric methods to study the generating weights of free modules of vector valued modular forms of half-integral weight, taking values in a complex representation of the metaplectic group. We then compute the generating weights…
The coding problem considered in this work is to construct a linear code $\mathcal{C}$ of given length $n$ and dimension $k<n$ such that a given binary vector $\mathbf{r} \in \mathbb{F}^{n}$ is contained in the code. We study a recent…
There is a classical geometric construction which uses a binary quadratic form to define an involution on the space of binary d-ics. We give a complete characterization of a general class of such involutions which are definable using…