English
Related papers

Related papers: q-Polymatroids associated with restricted rank-met…

200 papers

A framework of monomial codes is considered, which includes linear codes generated by the evaluation of certain monomials. Polar and Reed-Muller codes are the two best-known representatives of such codes and can be considered as two extreme…

Information Theory · Computer Science 2021-02-08 Kirill Ivanov , Rüdiger Urbanke

In this paper, we study convolutional codes with a specific cyclic structure. By definition, these codes are left ideals in a certain skew polynomial ring. Using that the skew polynomial ring is isomorphic to a matrix ring we can describe…

Information Theory · Computer Science 2007-08-13 Heide Gluesing-Luerssen , Fai-Lung Tsang

We explore complex Riemannian geometry and Hermitian metrics on complex algebraic varieties and analytic spaces, respectively. In particular, we introduce Hermitian metrics on holomorphic Lie algebroids and examine the associated…

Differential Geometry · Mathematics 2025-12-29 Abhishek Sarkar

We consider a discrete, non-Hermitian random matrix model, which can be expressed as a shift of a rank-one perturbation of an anti-symmetric matrix. We show that, asymptotically almost surely, the real parts of the eigenvalues of the…

Probability · Mathematics 2016-11-22 Philippe Sosoe , Uzy Smilansky

A notion of branch-width, which generalizes the one known for graphs, can be defined for matroids. We first give a proof of the polynomial time model-checking of monadic second-order formulas on representable matroids of bounded…

Discrete Mathematics · Computer Science 2015-03-13 Yann Strozecki

An arithmetic matroid is weakly multiplicative if the multiplicity of at least one of its bases is equal to the product of the multiplicities of its elements. We show that if such an arithmetic matroid can be represented by an integer…

Combinatorics · Mathematics 2019-10-04 Matthias Lenz

We give polynomial-time randomized algorithms for computing the girth and the cogirth of binary matroids that are low-rank perturbations of graphic matroids.

Combinatorics · Mathematics 2015-10-15 Jim Geelen , Rohan Kapadia

For each proper minor-closed subclass $\cM$ of the $\GF(q^2)$-representable matroids containing all simple $\GF(q)$-representable matroids, we give, for all large $r$, a tight upper bound on the number of points in a rank-$r$ matroid in…

Combinatorics · Mathematics 2011-05-23 Peter Nelson

We are interested in expanding our understanding of symplectic matroids by exploring the properties of a class of symplectic matroids with a "lattice of flats". Taking a well-behaved family of subdivisions of the cross polytope we obtain a…

Combinatorics · Mathematics 2026-01-08 Or Raz

In this paper we illustrate by some examples the connection between the number of solutions of polynomial equations satisfying degree conditions and the number of rank I matrices related to persymmetric matrices.

Number Theory · Mathematics 2009-09-03 Jorgen Cherly

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…

Algebraic Geometry · Mathematics 2020-07-20 David Kazhdan , Tamar Ziegler

We describe a natural geometric relationship between matroids and underlying flag matroids by relating the geometry of the greedy algorithm to monotone path polytopes. This perspective allows us to generalize the construction of underlying…

Combinatorics · Mathematics 2024-06-25 Alexander E. Black , Raman Sanyal

We present a new type of equivalence for representable matroids that uses the automorphisms of the underlying matroid. Two $r\times n$ matrices $A$ and $A'$ representing the same matroid $M$ over a field $F$ are {\it geometrically…

Combinatorics · Mathematics 2015-09-16 S. R. Kingan

The problem of finding the maximal dimension of linear or affine subspaces of matrices whose rank is constant, or bounded below, or bounded above, has attracted many mathematicians from the sixties to the present day. The problem has caught…

Rings and Algebras · Mathematics 2024-12-02 Elena Rubei

We define a functor which gives the "global rank of a quiver representation" and prove that it has nice properties which make it a generalization of the rank of a linear map. We demonstrate how to construct other "rank functors" for a…

Representation Theory · Mathematics 2009-03-10 Ryan Kinser

In this paper we investigate connections between linear sets and subspaces of linear maps. We give a geometric interpretation of the results of [18, Section 5] on linear sets on a projective line. We extend this to linear sets in arbitrary…

Combinatorics · Mathematics 2018-06-18 John Sheekey , Geertrui Van de Voorde

Let $q$ be a prime power. This paper provides a new class of linear codes that arises from the action of the alternating group on $\mathbb F_q[x_1,\dots,x_m]$ combined with the ideas in (M. Datta and T. Johnsen, 2022). Compared with…

Information Theory · Computer Science 2024-12-17 Giacomo Micheli , Vincenzo Pallozzi Lavorante , Phillip Waitkevich

In this paper we consider a family $\mathcal{F}$ of $16$-dimensional $\mathbb{F}_q$-linear rank metric codes in $\mathbb{F}_q^{8\times8}$, arising from the polynomial $x^{q^s}+\delta x^{q^{4+s}}\in\mathbb{F}_{q^8}[x]$. Examples of MRD codes…

Combinatorics · Mathematics 2023-01-25 Marco Timpanella , Giovanni Zini

We review our recent results on pseudo-hermitian random matrix theory which were hitherto presented in various conferences and talks. (Detailed accounts of our work will appear soon in separate publications.) Following an introduction of…

Mathematical Physics · Physics 2021-10-27 Joshua Feinberg , Roman Riser

In this thesis, we consider the problem of characterizing and enumerating sets of polyominoes described in terms of some constraints, defined either by convexity or by pattern containment. We are interested in a well known subclass of…

Combinatorics · Mathematics 2014-05-14 Daniela Battaglino