Related papers: Higher Rank-Support Weights and q-Polymatroids
The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the…
Large Language Models (LLMs) have demonstrated remarkable capabilities across diverse natural language tasks but suffer from extremely large memory footprints and computational costs. In this paper, we introduce a tensor compression…
In this paper, we introduce a general family of $q$-hypergeometric polynomials and investigate several $q$-series identities such as an extended generating function and a Srivastava-Agarwal type bilinear generating function for this family…
This dissertation presents new results on three different themes all related to matroid polytopes. First we investigate properties of Ehrhart polynomials of matroid polytopes, independence matroid polytopes, and polymatroids. We prove that…
Burst errors are very common in practice. There have been many designs in order to control and correct such errors. Recently, a new class of byte error control codes called spotty byte error control codes has been specifically designed to…
A $P_q(t,k,n)$ $q$-packing design is a selection of $k$-subspaces of $\F_q^n$ such that each $t$-subspace is contained in at most one element of the collection. A successful approach adopted from the Kramer-Mesner-method of prescribing a…
We investigate the maximum number \( L_{\mathrm{rk}}(n, m, k, q) \) of distinct nonzero rank weights that an \( \mathbb{F}_{q^m} \)-linear rank-metric code of dimension \( k \) in \( \mathbb{F}_{q^m}^n \) can attain. We determine the exact…
We use tools of additive combinatorics for the study of subvarieties defined by {\it high rank} families of polynomials in high dimensional $\mathbb{F} _q$-vector spaces. In the first, analytic part of the paper we prove a number properties…
The MacWilliams Identity is a well established theorem relating the weight enumerator of a code to the weight enumerator of its dual. The ability to use a known weight enumerator to generate the weight enumerator of another through a simple…
The Generalized Hamming weights and their relative version, which generalize the minimum distance of a linear code, are relevant to numerous applications, including coding on the wire-tap channel of type II, $t$-resilient functions,…
We consider the monomial expansion of the $q$-Whittaker and modified Hall-Littlewood polynomialsarising from specialization of the modified Macdonald polynomial. The two combinatorial formulas for the latter due to Haglund, Haiman, and…
We study a weighted low rank approximation that is inspired by a problem of constrained low rank approximation of matrices as initiated by the work of Golub, Hoffman, and Stewart (Linear Algebra and Its Applications, 88-89(1987), 317-327).…
We investigate polynomials, called m-polynomials, whose generator polynomial has coefficients that can be arranged as a matrix, where q is a positive integer greater than one. Orthogonality relations are established and coefficients are…
We consider a specialization $Y_M(q,t)$ of the Tutte polynomial of a matroid $M$ which is inspired by analogy with the Potts model from statistical mechanics. The only information lost in this specialization is the number of loops of $M$.…
In this paper we introduce a $q$-analogue of the single-element extensions of matroids for $q$-matroids, which we call one-dimensional extensions. To enumerate such extensions, we define a $q$-analogue of modular cuts and define a certain…
We unify the study of quotients of matroids, polymatroids, valuated matroids and strong maps of submodular functions in the framework of Murota's discrete convex analysis. As a main result, we compile a list of ten equivalent…
The Gaussian polynomial in variable $q$ is defined as the $q$-analog of the binomial coefficient. In addition to remarkable implications of these polynomials to abstract algebra, matrix theory and quantum computing, there is also a…
We derive explicit expressions for $q$-orthogonal polynomials arising in the enumeration of area-weighted Dyck paths with restricted height.
Multivariate random effects with unstructured variance-covariance matrices of large dimensions, $q$, can be a major challenge to estimate. In this paper, we introduce a new implementation of a reduced-rank approach to fit large dimensional…
Error-correcting pairs were introduced independently by Pellikaan and K\"otter as a general method of decoding linear codes with respect to the Hamming metric using coordinatewise products of vectors, and are used for many well-known…