اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPartitions of Matrix Spaces With an Application to $q$-Rook Polynomials
69
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study the row-space partition and the pivot partition on the matrix space $mathbb{F}_q^{n times m}$. We show that both these partitions are reflexive and that the row-space partition is self-dual. Moreover, using various combinatorial methods, we explicitly compute the Krawtchouk coefficients associated with these partitions. This establishes MacWilliams-type identities for the row-space and pivot enumerators of linear rank-metric codes. We then generalize the Singleton-like bound for rank-metric codes, and introduce two new concepts of code extremality. Both of them generalize the notion of MRD codes and are preserved by trace-duality. Moreover, codes that are extremal according to either notion satisfy strong rigidity properties analogous to those of MRD codes. As an application of our results to combinatorics, we give closed formulas for the $q$-rook polynomials associated with Ferrers diagram boards. Moreover, we exploit connections between matrices over finite fields and rook placements to prove that the number of matrices of rank $r$ over $mathbb{F}_q$ supported on a Ferrers diagram is a polynomial in $q$, whose degree is strictly increasing in $r$. Finally, we investigate the natural analogues of the MacWilliams Extension Theorem for the rank, the row-space, and the pivot partitions.
قيم البحث
اقرأ أيضاً
Integer partitions express the different ways that a positive integer may be written as a sum of other positive integers. Here we explore the analytic properties of a polynomial $f_lambda(x)$ that we call the partition polynomial for the partition $l
ambda$, with the hope of learning new properties of partitions. We prove a recursive formula for the derivatives of $f_lambda(x)$ involving Stirling numbers of the second kind, show that the set of integrals from 0 to 1 of a normalized version of $f_lambda(x)$ is dense in $[0,1/2]$, pose a few open questions, and formulate a conjecture relating the integral to the length of the partition. We also provide specific examples throughout to support our speculation that an in-depth analysis of partition polynomials could further strengthen our understanding of partitions.
It is well known that linear rank-metric codes give rise to $q$-polymatroids. Analogously to classical matroid theory one may ask whether a given $q$-polymatroid is representable by a rank-metric code. We provide a partial answer by presenting exampl
es of $q$-matroids that are not representable by ${mathbb F}_{q^m}$-linear rank-metric codes. We then go on and introduce deletion and contraction for $q$-polymatroids and show that they are mutually dual and that they correspond to puncturing and shortening of rank-metric codes. Finally, we introduce a closure operator along with the notion of flats and show that the generalized rank weights of a rank-metric code are fully determined by the flats of the associated $q$-polymatroid.
Lattice-based Cryptography is considered to have the characteristics of classical computers and quantum attack resistance. We will design various graphic lattices and matrix lattices based on knowledge of graph theory and topological coding, since ma
ny problems of graph theory can be expressed or illustrated by (colored) star-graphic lattices. A new pair of the leaf-splitting operation and the leaf-coinciding operation will be introduced, and we combine graph colorings and graph labellings to design particular proper total colorings as tools to build up various graphic lattices, graph homomorphism lattice, graphic group lattices and Topcode-matrix lattices. Graphic group lattices and (directed) Topcode-matrix lattices enable us to build up connections between traditional lattices and graphic lattices. We present mathematical problems encountered in researching graphic lattices, some problems are: Tree topological authentication, Decompose graphs into Hanzi-graphs, Number String Decomposition Problem, $(p,s)$-gracefully total numbers.
In this note, we provide a description of the elements of minimum rank of a generalized Gabidulin code in terms of Grassmann coordinates. As a consequence, a characterization of linearized polynomials of rank at most $n-k$ is obtained, as well as par
ametric equations for MRD-codes of distance $d=n-k+1$.
We propose a novel application of coded computing to the problem of the nearest neighbor estimation using MatDot Codes [Fahim. et.al. 2017], that are known to be optimal for matrix multiplication in terms of recovery threshold under storage constrain
ts. In approximate nearest neighbor algorithms, it is common to construct efficient in-memory indexes to improve query response time. One such strategy is Multiple Random Projection Trees (MRPT), which reduces the set of candidate points over which Euclidean distance calculations are performed. However, this may result in a high memory footprint and possibly paging penalties for large or high-dimensional data. Here we propose two techniques to parallelize MRPT, that exploit data and model parallelism respectively, by dividing both the data storage and the computation efforts among different nodes in a distributed computing cluster. This is especially critical when a single compute node cannot hold the complete dataset in memory. We also propose a novel coded computation strategy based on MatDot codes for the model-parallel architecture that, in a straggler-prone environment, achieves the storage-optimal recovery threshold, i.e., the number of nodes that are required to serve a query. We experimentally demonstrate that, in the absence of straggling, our distributed approaches require less query time than execution on a single processing node, providing near-linear speedups with respect to the number of worker nodes. Through our experiments on real systems with simulated straggling, we also show that our strategy achieves a faster query execution than the uncoded strategy in a straggler-prone environment.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
