中文
相关论文

相关论文: Representability of $q$-matroids via rank-metric c…

200 篇论文

A new Z-basis for the space of quasisymmetric functions (QSym, for short) is presented. It is shown to have nonnegative structure constants, and several interesting properties relative to the space of quasisymmetric functions associated to…

组合数学 · 数学 2010-11-30 Kurt W. Luoto

Skew-representable matroids form a fundamental class in matroid theory, bridging combinatorics and linear algebra. They play an important role in areas such as coding theory, optimization, and combinatorial geometry, where linear structure…

We consider the problem of finding the number of matrices over a finite field with a certain rank and with support that avoids a subset of the entries. These matrices are a q-analogue of permutations with restricted positions (i.e., rook…

组合数学 · 数学 2015-10-15 Aaron J. Klein , Joel Brewster Lewis , Alejandro H. Morales

Frame matroids and lifted-graphic matroids are two interesting generalizations of graphic matroids. Here we introduce a new generalization, {\em quasi-graphic matroids}, that unifies these two existing classes. Unlike frame matroids and…

组合数学 · 数学 2017-04-25 Jim Geelen , Bert Gerards , Geoff Whittle

It is shown that the finite dimensional irreducible representaions of the quantum matrix algebra $ M_{ q,p}(2) $ ( the coordinate ring of $ GL_{q,p}(2) $) exist only when both q and p are roots of unity. In this case th e space of states…

高能物理 - 理论 · 物理学 2009-10-22 Vahid Karimipour

This paper studies systems of polynomial equations that provide information about orientability of matroids. First, we study systems of linear equations over GF(2), originally alluded to by Bland and Jensen in their seminal paper on weak…

组合数学 · 数学 2013-10-01 J. A. De Loera , J. Lee , S. Margulies , J. Miller

In this paper we present a family of $q$-ary nonlinear quasi-perfect codes with covering radius 2. The codes have length $n = q^m$ and size $ M = q^{n - m - 1}$ where $q$ is a prime power, $q \geq 3$, $m$ is an integer, $m \geq 2$. We prove…

信息论 · 计算机科学 2021-11-02 Alexander M. Romanov

A 1965 result of Crapo shows that every elementary lift of a matroid $M$ can be constructed from a linear class of circuits of $M$. In a recent paper, Walsh generalized this construction by defining a rank-$k$ lift of a matroid $M$ given a…

组合数学 · 数学 2025-02-19 Daniel Irving Bernstein , Zach Walsh

For any positive integer $l$ we prove that if $M$ is a simple matroid with no $(l+2)$-point line as a minor and with sufficiently large rank, then $|E(M)|\le \frac{q^{r(M)}-1}{q-1}$, where $q$ is the largest prime power less than or equal…

组合数学 · 数学 2011-05-23 Jim Geelen , Peter Nelson

In the realm of rank-metric codes, Maximum Rank Distance (MRD) codes are optimal algebraic structures attaining the Singleton-like bound. A major open problem in this field is determining whether an MRD code can be extended to a longer one…

信息论 · 计算机科学 2026-04-02 Daniele Bartoli , Alessandro Giannoni , Giuseppe Marino , Alessandro Neri

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…

组合数学 · 数学 2025-05-27 Gianira N. Alfarano , Sebastian Degen

We give new characterizations for the class of uniformly dense matroids and study applications of these characterizations to graphic and real representable matroids. We show that a matroid is uniformly dense if and only if its base polytope…

组合数学 · 数学 2026-02-03 Karel Devriendt , Raffaella Mulas

For a matroid of rank $r$ and a non-negative integer $k$, an element is called $k$-loose if every circuit containing it has size greater than $r-k$. Zaslavsky and the author characterized all binary matroids with a $1$-loose element. In…

组合数学 · 数学 2025-03-17 Jagdeep Singh

We show that the number of linear spaces on a set of $n$ points and the number of rank-3 matroids on a ground set of size $n$ are both of the form $(cn+o(n))^{n^2/6}$, where $c=e^{\sqrt 3/2-3}(1+\sqrt 3)/2$. This is the final piece of the…

组合数学 · 数学 2024-05-31 Matthew Kwan , Ashwin Sah , Mehtaab Sawhney

Every bi-uniform matroid is representable over all sufficiently large fields. But it is not known exactly over which finite fields they are representable, and the existence of efficient methods to find a representation for every given…

组合数学 · 数学 2014-07-29 Simeon Ball , Carles Padró , Zsuzsa Weiner , Chaoping Xing

We introduce the class of partition-balanced families of codes, and show how to exploit their combinatorial invariants to obtain upper and lower bounds on the number of codes that have a prescribed property. In particular, we derive precise…

信息论 · 计算机科学 2018-12-13 Eimear Byrne , Alberto Ravagnani

The Folkman-Lawrence topological representation theorem, which states that every (loop-free) oriented matroid of rank $r$ can be represented as a pseudosphere arrangement on the $(r-1)$-dimensional sphere $S^{r-1}$, is one of the most…

组合数学 · 数学 2020-03-05 Hiroyuki Miyata

Matrix configurations define noncommutative spaces endowed with extra structure including a generalized Laplace operator, and hence a metric structure. Made dynamical via matrix models, they describe rich physical systems including…

高能物理 - 理论 · 物理学 2024-03-15 Laura O. Felder , Harold C. Steinacker

The class of quasiseparable matrices is defined by a pair of bounds, called the quasiseparable orders, on the ranks of the maximal sub-matrices entirely located in their strictly lower and upper triangular parts. These arise naturally in…

符号计算 · 计算机科学 2016-09-20 Clement Pernet

Every minor-closed class of matroids of bounded branch-width can be characterized by a list of excluded minors, but unlike graphs, this list may need to be infinite in general. However, for each fixed finite field $\mathbb F$, the list…

组合数学 · 数学 2025-08-15 Mamadou Mostapha Kanté , Eun Jung Kim , O-joung Kwon , Sang-il Oum