Related papers: Relative Generalized Hamming weights of affine Car…
We describe several general methods for calculating weights of mixed tilting sheaves. We introduce a notion called "non-cancellation property" which implies a strong uniqueness of mixed tilting sheaves and enables one to calculate their…
We study the module of universal norms associated with a de Rham $p$-adic Galois representation in a perfectoid field extension. In particular, we compute precisely this module when the Hodge-Tate weights of a representation are greater…
The Grassmannian is an important object in Algebraic Geometry. One of the many techniques used to study the Grassmannian is to build a vector space from its points in the projective embedding and study the properties of the resulting linear…
In this paper, we present the harmonic generalizations of well-known polynomials of codes over finite fields, namely the higher weight enumerators and the extended weight enumerators, and we derive the correspondences between these weight…
This article derives and presents the Feynman rules for (effective) Quantum General Relativity coupled to the Standard Model for any vertex valence and with general gauge parameter $\zeta$. The results are worked out for the metric…
We develop a general framework for studying relative weight representations for certain pairs consisting of an associative algebra and a commutative subalgebra. Using these tools we describe projective and simple weight modules for quantum…
Recently, Gautschi introduced so-called generalized Gauss-Radau and Gauss-Lobatto formulae which are quadrature formulae of Gaussian type involving not only the values but also the derivatives of the function at the endpoints. In the…
The generalized Hamming weight (GHW) $d_r(C)$ of linear codes $C$ is a natural generalization of the minimum Hamming distance $d(C)(=d_1(C))$ and has become one of important research objects in coding theory since Wei's originary work [23]…
This note presents a descending method that allows us to classify quotients of Reed-Muller codes of lenghth 128 under the action of the affine general linear group.
We obtain sharp estimates on the connectivity of complex affine hypersurfaces in terms of the decomposition of the defining equation as a sum of weighted homogeneous components relative to some weight system.
In this work, we make new developments in generic cotangent bundle geometries, depending on all phase-space variables. In particular, we will focus on the so-called generalized Hamilton spaces, discussing how the main ingredients of this…
This work demonstrates that a complete description of the interaction of matter and all forces, gravitational and non-gravitational, can in fact be realized within a quantum affine algebraic framework. Using the affine group formalism, we…
When it is based on Kac-Peterson form of Affine Weyl Groups, Weyl-Kac character formula could be formulated in terms of Theta functions and a sum over finite Weyl groups. We, instead, give a reformulation in terms of Schur functions which…
Locally affine Lie algebras are generalizations of affine Kac--Moody algebras with Cartan subalgebras of infinite rank whose root system is locally affine. In this note we study a class of representations of locally affine algebras…
In this paper, we first introduce the notion of generalized pair weights of an $[n, k]$-linear code over the finite field $\mathbb{F}_q$ and the notion of pair $r$-equiweight codes, where $1\le r\le k-1$. Some basic properties of…
To any graph with external half-edges and internal masses, we associate canonical integrals which depend non-trivially on particle masses and momenta, and are always finite. They are generalised Feynman integrals which satisfy graphical…
We study Hilbert functions of certain non-reduced schemes A supported at finite sets of points in projective space, in particular, fat point schemes. We give combinatorially defined upper and lower bounds for the Hilbert function of A using…
In this note we show that the minimum distance of a linear code equals one plus the smallest shift in the first step of the minimal graded free resolution of the Orlik-Terao algebra (i.e., the initial degree of the Orlik-Tearo ideal)…
In the recent work \cite{shi18}, a combinatorial problem concerning linear codes over a finite field $\F_q$ was introduced. In that work the authors studied the weight set of an $[n,k]_q$ linear code, that is the set of non-zero distinct…
This paper studies the problem of learning weighted automata from a finite labeled training sample. We consider several general families of weighted automata defined in terms of three different measures: the norm of an automaton's weights,…