اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدIndependent Spaces of q-Polymatroids
233
0
0.0
(
0
)
نشر من قبل
Heide Gluesing-Luerssen
تاريخ النشر
2021
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper is devoted to the study of independent spaces of q-polymatroids. With the aid of an auxiliary q-matroid it is shown that the collection of independent spaces satisfies the same properties as for q-matroids. However, in contrast to q-matroids, the rank value of an independent space does not agree with its dimension. Nonetheless, the rank values of the independent spaces fully determine the q-polymatroid, and this fact can be exploited to derive a cryptomorphism of q-polymatroids. Finally, the notions of minimal spanning spaces, maximally strongly independent spaces, and bases will be elaborated on.
قيم البحث
اقرأ أيضاً
The Assmus-Mattson theorem gives a way to identify block designs arising from codes. This result was broadened to matroids and weighted designs. In this work we present a further two-fold generalisation: first from matroids to polymatroids and also f
rom sets to vector spaces. To achieve this, we introduce the characteristic polynomial of a $q$-polymatroid and outline several of its properties.
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.
This paper studies the problem of upper bounding the number of independent sets in a graph, expressed in terms of its degree distribution. For bipartite regular graphs, Kahn (2001) established a tight upper bound using an information-theoretic approa
ch, and he also conjectured an upper bound for general graphs. His conjectured bound was recently proved by Sah et al. (2019), using different techniques not involving information theory. The main contribution of this work is the extension of Kahns information-theoretic proof technique to handle irregular bipartite graphs. In particular, when the bipartite graph is regular on one side, but it may be irregular in the other, the extended entropy-based proof technique yields the same bound that was conjectured by Kahn (2001) and proved by Sah et al. (2019).
After endowing the space of diagrams of probability spaces with an entropy distance, we study its large-scale geometry by identifying the asymptotic cone as a closed convex cone in a Banach space. We call this cone the tropical cone, and its elements
tropical diagrams of probability spaces. Given that the tropical cone has a rich structure, while tropical diagrams are rather flexible objects, we expect the theory of tropical diagrams to be useful for information optimization problems in information theory and artificial intelligence. In a companion article, we give a first application to derive a statement about the entropic cone.
We prove the nonexistence of lattice tilings of $mathbb{Z}^n$ by Lee spheres of radius $2$ for all dimensions $ngeq 3$. This implies that the Golomb-Welch conjecture is true when the common radius of the Lee spheres equals $2$ and $2n^2+2n+1$ is a pr
ime. As a direct consequence, we also answer an open question in the degree-diameter problem of graph theory: the order of any abelian Cayley graph of diameter $2$ and degree larger than $5$ cannot meet the abelian Cayley Moore bound.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
