English
Related papers

Related papers: Hamming Polynomial of a Demimatroid

200 papers

We prove a splitter theorem for tight multimatroids, generalizing the corresponding result for matroids, obtained independently by Brylawski and Seymour. Further corollaries give splitter theorems for delta-matroids and ribbon graphs.

Combinatorics · Mathematics 2017-03-09 Carolyn Chun , Deborah Chun , Steven D. Noble

It is shown that the Whitney function of a representable q-matroid and the collection of all higher weight enumerators of any representing rank-metric code determine each other via a monomial substitution. Moreover, the q-matroid itself and…

Combinatorics · Mathematics 2025-09-29 Heide Gluesing-Luerssen , Benjamin Jany

We prove the complete monotonicity on $(0,\infty)^n$ for suitable inverse powers of the spanning-tree polynomials of graphs and, more generally, of the basis generating polynomials of certain classes of matroids. This generalizes a result…

Combinatorics · Mathematics 2014-12-04 Alexander D. Scott , Alan D. Sokal

A new isomorphism invariant of matroids is introduced, in the form of a quasisymmetric function. This invariant (1) defines a Hopf morphism from the Hopf algebra of matroids to the quasisymmetric functions, which is surjective if one uses…

Combinatorics · Mathematics 2020-06-01 Louis J. Billera , Ning Jia , Victor Reiner

In the present paper, we give harmonic weight enumerators and Jacobi polynomials for the first-order Reed--Muller codes and the extended Hamming codes. As a corollary, we show the nonexistence of combinatorial $4$-designs in these codes.

Combinatorics · Mathematics 2024-01-03 Tsuyoshi Miezaki , Akihiro Munemasa

This work studies the remarkable relationships that hold among certain m-tuples of the Garsia-Haiman modules $ {\bf M}_\mu$ and corresponding elements of the Macdonald basis. We recall that ${\bf M}_\mu$ is defined for a partition $\mu\part…

Combinatorics · Mathematics 2007-05-23 F. Bergeron , G. Garsia

In this paper, we discuss the generalized Hamming weights of a class of linear codes associated with non-degenerate quadratic forms. In order to do so, we study the quadratic forms over subspaces of finite field and obtain some interesting…

Information Theory · Computer Science 2021-06-08 Fei Li

We introduce and investigate multivariate Tutte polynomials, dichromatic polynomials, subset-corank polynomials, size-corank polynomials, and rank generating polynomials of semimatroids, which generalize the corresponding polynomial…

Combinatorics · Mathematics 2025-08-04 Houshan Fu

The Kashiwara $B(\infty)$ crystal pertains to a Verma module for a Kac- Moody Lie algebra. Ostensibly it provides only a parametrisation of the global/canonical basis for the latter. Yet it is much more having a rich combinatorial structure…

Combinatorics · Mathematics 2015-10-22 Anthony Joseph

Recently, Gross, Mansour and Tucker introduced the partial duality polynomial of a ribbon graph and posed a conjecture that there is no orientable ribbon graph whose partial duality polynomial has only one non-constant term. We found an…

Combinatorics · Mathematics 2021-08-04 Qi Yan , Xian'an Jin

The multiplication theorem for univariate Hermite polynomials $H_k(\lambda x)$ is well-known. In this paper we generalize this result to multivariate Hermite polynomials ${\rm H}_{\bf k}({\mathbf{\Lambda}}{\bf x};{\mathbf{\Sigma}})$, and…

General Mathematics · Mathematics 2026-01-29 Alistair Shilton

The Tutte polynomial is a significant invariant of graphs and matroids. It is well-known that it has three equivalent definitions: bases expansion, rank generating function, and deletion-contraction formula. The polymatroid Tutte polynomial…

Combinatorics · Mathematics 2025-10-14 Xiaxia Guan , Xian'an Jin , Weiling Yang

We develop an algebraic theory of supports for $R$-linear codes of fixed length, where $R$ is a finite commutative unitary ring. A support naturally induces a notion of generalized weights and allows one to associate a monomial ideal to a…

Information Theory · Computer Science 2022-01-19 Elisa Gorla , Alberto Ravagnani

We compute the expansion of the cohomology class of the permutahedral variety in the basis of Schubert classes. The resulting structure constants $a_w$ are expressed as a sum of \emph{normalized} mixed Eulerian numbers indexed naturally by…

Combinatorics · Mathematics 2023-06-22 Philippe Nadeau , Vasu Tewari

We propose a unified theory of generalized weights for linear codes endowed with an arbitrary distance. Instead of relying on supports or anticodes, the weights of a code are defined via the intersections of the code with a chosen family of…

Information Theory · Computer Science 2025-12-22 Andrea Di Giusto , Elisa Gorla , Alberto Ravagnani

We introduce dual matroids of 2-dimensional simplicial complexes. Under certain necessary conditions, duals matroids are used to characterise embeddability in 3-space in a way analogous to Whitney's planarity criterion. We further use dual…

Combinatorics · Mathematics 2017-09-15 Johannes Carmesin

The Tutte polynomial is a fundamental invariant of graphs and matroids. In this article, we define a generalization of the Tutte polynomial to oriented graphs and regular oriented matroids. To any regular oriented matroid $N$, we associate…

Combinatorics · Mathematics 2023-10-12 Jordan Awan , Olivier Bernardi

We provide a comprehensive development of the basics of descriptive set theory for non-separable complete metric spaces whose weight is a singular cardinal $\lambda$ of countable confinality. Somewhat unexpectedly, the resulting theory is…

Logic · Mathematics 2025-11-21 Vincenzo Dimonte , Luca Motto Ros

In this work we provide a decomposition theorem for the class of quaternary and non-binary signed-graphic matroids. This generalizes previous results for binary signed-graphic matroids and graphic matroids, and it provides the theoretical…

Combinatorics · Mathematics 2015-10-26 Leonidas Pitsoulis , Eleni-Maria Vretta

Tutte's dichromate T(x,y) is a well known graph invariant. Using the original definition in terms of internal and external activities as our point of departure, we generalize the valuations T(x,1) and T(1,y) to hypergraphs. In the…

Combinatorics · Mathematics 2011-03-08 Tamás Kálmán
‹ Prev 1 4 5 6 7 8 10 Next ›