Related papers: Higher Rank-Support Weights and q-Polymatroids
Consider the following online version of the submodular maximization problem under a matroid constraint: We are given a set of elements over which a matroid is defined. The goal is to incrementally choose a subset that remains independent…
Low-rank matrix approximation is one of the central concepts in machine learning, with applications in dimension reduction, de-noising, multivariate statistical methodology, and many more. A recent extension to LRMA is called low-rank…
Properties of certain $q$-orthogonal polynomials are connected to the $q$-oscillator algebra. The Wall and $q$-Laguerre polynomials are shown to arise as matrix elements of $q$-exponentials of the generators in a representation of this…
We construct a class of linear codes by choosing a proper defining set and determine their complete weight enumerators and weight enumerators. The results show that they are at most three-weight codes and they are suitable for applications…
We compare the two duality theories of rank-metric codes proposed by Delsarte and Gabidulin, proving that the former generalizes the latter. We also give an elementary proof of MacWilliams identities for the general case of Delsarte…
Cointegration analysis was developed for non-stationary linear processes that exhibit stationary relationships between coordinates. Estimation of the cointegration relationships in a multi-dimensional cointegrated process typically proceeds…
Let $\mathscr{L}$ denote the $\mathbf{Q}$-vector space of logarithms of algebraic numbers. In this expository work, we provide an introduction to the study of ranks of matrices with coefficients in $\mathscr{L}$. We begin by considering a…
Determining the weight distribution of a linear code is a classical and fundamental topic in coding theory that has been extensively investigated. Repeated-root cyclic codes, which form a significant subclass of error-correcting codes, have…
When a monomial ideal has linear quotients with respect to an admissible order of increasing support-degree, we provide two proofs of different flavors to show that it is componentwise support-linear. We also introduce the variable…
We exhibit explicit expressions, in terms of components, of discriminants, determinants, characteristic polynomials and polynomial identities for matrices of higher rank. We define permutation tensors and in term of them we construct…
We consider linear codes over some fixed finite field extension over an arbitrary finite field. Gabidulin introduced rank metric codes, by endowing linear codes over the extension field with a rank weight over the base field and studied…
For a finite Coxeter group $W$, Josuat-Verg\`es derived a $q$-polynomial counting the maximal chains in the lattice of noncrossing partitions of $W$ by weighting some of the covering relations, which we call bad edges, in these chains with…
We propose dimension reduction methods for sparse, high-dimensional multivariate response regression models. Both the number of responses and that of the predictors may exceed the sample size. Sometimes viewed as complementary, predictor…
Many selection problems are multilayered: agents first decide whether to participate and then sort among ordered or unordered categories. This paper shows that the sorting layer changes the geometry of identification. Unlike binary…
A $q$-rank function is a real-valued function defined on the subspace lattice that is non-negative, upper bounded by the dimension function, non-drecreasing, and satisfies the submodularity law. Each such function corresponds to the rank…
We give a survey on recent results on inequalities between the ranks of homotopy and cohomology groups (resp., graded components of mixed Hodge structures on these groups) of rationally elliptic spaces (resp., quasi-projective varieties…
It has been conjectured that asymptotically almost all matroids are sparse paving, i.e. that $s(n) \sim m(n)$, where $m(n)$ denotes the number of matroids on a fixed groundset of size $n$, and $s(n)$ the number of sparse paving matroids. In…
Let $\mathbb{F}_q$ be a finite field of characteristic not equal to $2$ or $3$. We compute the weight enumerators of some projective and affine Reed-Muller codes of order $3$ over $\mathbb{F}_q$. These weight enumerators answer enumerative…
We investigate the asymptotic behavior of entropy polymatroids associated with algebraic matroids over finite fields. Given an algebraic matroid ${\sf M}:=(\mathcal{E},r)$ and the irreducible variety $V$ associated with ${\sf M}$, we…
Large Language Models' (LLMs) weight matrices can often be expressed in low-rank form with potential to relax memory and compute resource requirements. Unlike prior efforts that focus on developing novel matrix decompositions, in this work…