Related papers: Equivariant theory for codes and lattices I

I give an elementary introduction to the study of gauge theories coupled to fermions with many degrees of freedom. Besides their intrinsic interest, these theories are candidates for nonperturbative extensions of the Higgs sector of the…

We develop a Van der Waerden type theorem in an axiomatic setting of graded lattices and show that this axiomatic formulation can be applied to various lattices, for instance the set partition and the Boolean lattices. We derive the…

In this article we define an encoding for parabolic permutations that distinguishes between parabolic $231$-avoiding permutations. We prove that the componentwise order on these codes realizes the parabolic Tamari lattice, and conclude a…

Aiming to provide weak as possible axiomatic assumptions in which one can develop basic linear algebra, we give a uniform and integral version of the short propositional proofs for the determinant identities demonstrated over $GF(2)$ in…

In this paper, we give a notation on the Singleton bounds for linear codes over a finite commutative quasi-Frobenius ring in the work of Shiromoto [5]. We show that there exists a class of finite commutative quasi-Frobenius rings. The…

We generalize Aztec diamond theorem (N. Elkies, G. Kuperberg, M. Larsen, and J. Propp, Alternating-sign matrices and domino tilings, Journal Algebraic Combinatoric, 1992) by showing that the numbers of tilings of a certain family of regions…

We explore the equimultiplicity theory of the $F$-invariants Hilbert--Kunz multiplicity, $F$-signature, Frobenius Betti numbers, and Frobenius Euler characteristic over strongly $F$-regular rings. Techniques introduced in this article…

The problem of the restoring of the equivalence between Light-Front (LF) Hamiltonian and conventional Lorentz-covariant formulations of gauge theory is solved for QED(1+1) and (perturbatively to all orders) for QCD(3+1). For QED(1+1) the LF…

Let $G$ be a finite group acting on a small category $I$. We study functors $X \colon I \to \mathscr{C}$ equipped with families of compatible natural transformations that give a kind of generalized $G$-action on $X$. Such objects are called…

We previously proposed the first nontrivial examples of a code having support $t$-designs for all weights obtained from the Assmus-Mattson theorem and having support $t'$-designs for some weights with some $t'>t$. This suggests the…

We construct equivariant, string and leading order characteristic classes and Chern-Simons classes for certain infinite rank bundles associated to fibrations occurring in loop spaces, Gromov-Witten theory and gauge theory. Results include a…

We study Galois extensions Coinv(M)<M for M an H-comodule algebra and H a Frobenius Hopf algebroid. We obtain generalizations of various theorems in Hopf-Galois theory by Kreimer-Takeuchi, Doi-Takeuchi and Cohen-Fischman-Montgomery. An…

Equivariant "Ham Sandwich" Theorems are obtained for the finite subgroups G of the unit spheres S(F) in the classical algebras F = R, C, and H. Given any n F-valued mass distributions on F^n, it is shown that there exists a G-equivariant…

Several properties of a hyepergeometric series related to Gromov-Witten theory of some Calabi-Yau geometries was studied in [8]. These properties play basic role in the study of higher genus Gromov-Witten theories. We extend the results of…

According to the well-known Heyde theorem the Gaussian distribution on the real line is characterized by the symmetry of the conditional distribution of one linear form of independent random variables given another. We study analogues of…

Let G be a finite subgroup of GL_n(C). A study is made of the ways in which resolutions of the quotient space C^n / G can parametrise G-constellations, that is, G-regular finite length sheaves. These generalise G-clusters, which are used in…

There is a nice combinatorial formula of P. Beelen and M. Datta for the $r$-th generalized Hamming weight of an affine cartesian code. Using this combinatorial formula we give an easy to evaluate formula to compute the $r$-th generalized…

Given a group $G$ and a subgroup $H$, we let $\mathcal{O}_G(H)$ denote the lattice of subgroups of $G$ containing $H$. This paper provides a classification of the subgroups $H$ of $G$ such that $\mathcal{O}_{G}(H)$ is Boolean of rank at…

Past few years have seen an extensive use of RAM chips with wide I/O data (e.g. 16, 32, 64 bits) in computer memory systems. These chips are highly vulnerable to a special type of byte error, called an $m$-spotty byte error, which can be…

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…