Related papers: A generalization of weight polynomials to matroids
We establish that matroids characterized by the Tutte polynomial $\sum_{i,j\ge 0}t_{i,j}x^iy^j$ with coefficients $t_{i,j}$ vanishing for $(i,j)\ge (k,l)$ precisely coincide with $(k,l)$-uniform matroids. This characterization implies that…
Let $S=K[x_1,\ldots,x_n]$ be the ring of polynomials in $n$ variables over an arbitrary field $K$. Given a finitely generated multigraded module $M$, its Stanley length, denoted by $\operatorname{slength}(M)$, is the minimal length of a…
We transform Tutte-Grothedieck invariants thus also Tutte polynomials on matroids so that the contraction-deletion rule for loops (isthmuses) coincides with the general case.
The paper describes a method to determine symmetrized weight enumerators of $p^m$-linear codes based on the notion of a disjoint weight enumerator. Symmetrized weight enumerators are given for the lifted quadratic residue codes of length 24…
Let $G$ be a matrix and $M(G)$ be the matroid defined by linear dependence on the set $E$ of column vectors of $G.$ Roughly speaking, a parcel is a subset of pairs $(f,g)$ of functions defined on $E$ to an Abelian group $A$ satisfying a…
Pomset block metric is a generalization of pomset metric. In this paper, we define weight enumerator of linear block codes in pomset metric over $\mathbb{Z}_m$ and establish MacWilliams type identities for linear block codes with respect to…
Reed-Muller (RM) codes are among the oldest, simplest and perhaps most ubiquitous family of codes. They are used in many areas of coding theory in both electrical engineering and computer science. Yet, many of their important properties are…
There is a one-to-one correspondence between geometric lattices and the intersection lattices of arrangements of homotopy spheres. When the arrangements are essential and fully partitioned, Zaslavsky's enumeration of the cells of the…
We define the generalized basic hypergeometric polynomial of degree $N \geq 1$ in terms of the generalized basic hypergeometric function, which depends on (arbitrary, generic, possibly complex) parameters $q \neq 1$, the $r \geq 0$…
This paper contributes to the study of rank-metric codes from an algebraic and combinatorial point of view. We introduce $q$-polymatroids, the $q$-analogue of polymatroids, and develop their basic properties. We associate a pair of…
In this paper we prove that the Stanley--Reisner ideal or cover ideal $I$ of a matroid is minimally resolvable by iterated mapping cones. As a technical tool for this purpose, we introduce and study focal matroids, which are submatroids of…
The classical volume polynomial in algebraic geometry measures the degrees of ample (and nef) divisors on a smooth projective variety. We introduce an analogous volume polynomial for matroids, and give a complete combinatorial formula. For…
The spectral density for random matrix $\beta$ ensembles can be written in terms of the average of the absolute value of the characteristic polynomial raised to the power of $\beta$, which for even $\beta$ is a polynomial of degree…
The weighted transition polynomial of a multimatroid is a generalization of the Tutte polynomial. By defining the activity of a skew class with respect to a basis in a multimatroid, we obtain an activities expansion for the weighted…
We study various binomial and monomial ideals arising in the theory of divisors, orientations, and matroids on graphs. We use ideas from potential theory on graphs and from the theory of Delaunay decompositions for lattices to describe…
We interpret the symmetrized weight enumerator of linear codes over finite commutative Frobenius rings as a summation over multisets and thereby provide a new proof of the MacWilliams identity for the symmetrized weight enumerator. The…
We determine all permutations in two large classes of polynomials over finite fields, where the construction of the polynomials in each class involves the denominators of a class of rational functions generalizing the classical Redei…
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…
Classical local Weyl modules for a simple Lie algebra are labeled by dominant weights. We generalize the definition to the case of arbitrary weights and study the properties of the generalized modules. We prove that the representation…
We consider tiling rectangles of size 4m x 4n by T-shaped tetrominoes. Each tile is assigned a weight that depends on its orientation and position on the lattice. For a particular choice of the weights, the generating function of tilings is…