English
Related papers

Related papers: Cyclotomic and simplicial matroids

200 papers

We introduce the notion of sum-matroids and show its association with sum-rank metric codes. As a consequence, some results for sum-rank metric codes by Mart\'inez-Pe\~nas are generalized for sum-matroids. The sum-matroids generalize the…

Combinatorics · Mathematics 2022-03-23 Avijit Panja , Rakhi Pratihar , Tovohery Hajatiana Randrianarisoa

We give a general multiplication-convolution identity for the multivariate and bivariate rank generating polynomial of a matroid. The bivariate rank generating polynomial is transformable to and from the Tutte polynomial by simple algebraic…

Combinatorics · Mathematics 2009-09-15 Joseph P. S. Kung

We demonstrate that the transfer matrix of the inhomogeneous $N$-state chiral Potts model with two vertical superintegrable rapidities serves as the $Q$-operator of XXZ chain model for a cyclic representation of $U_{\sf q}(sl_2)$ with $N$th…

Statistical Mechanics · Physics 2011-02-16 Shi-shyr Roan

We present two new proofs of the the important q-commuting property holding among certain pairs of quantum minors of an n x n q-generic matrix. The first uses elementary quasideterminantal arithmetic; the second involves paths in an…

Quantum Algebra · Mathematics 2007-05-23 Aaron Lauve

For all positive integers $t$ exceeding one, a matroid has the cyclic $(t-1,t)$-property if its ground set has a cyclic ordering $\sigma$ such that every set of $t-1$ consecutive elements in $\sigma$ is contained in a $t$-element circuit…

Combinatorics · Mathematics 2021-08-27 Nick Brettell , Deborah Chun , Tara Fife , Charles Semple

Let $M$ be a matroid without loops or coloops and let $T(M;x,y)$ be its Tutte polynomial. In 1999 Merino and Welsh conjectured that $$\max(T(M;2,0), T(M;0,2))\geq T(M;1,1)$$ holds for graphic matroids. Ten years later, Conde and Merino…

Combinatorics · Mathematics 2016-10-28 Kolja Knauer , Leonardo Martínez-Sandoval , Jorge Luis Ramírez Alfonsín

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…

Combinatorics · Mathematics 2026-02-03 Karel Devriendt , Raffaella Mulas

We investigate spectral conditions on Hermitian matrices of roots of unity. Our main results are conjecturally sharp upper bounds on the number of residue classes of the characteristic polynomial of such matrices modulo ideals generated by…

Combinatorics · Mathematics 2023-07-18 Gary R. W. Greaves , Chin Jian Woo

It is well known that linear rank-metric codes give rise to q-polymatroids. Analogously to matroid theory one may ask whether a given q-polymatroid is representable by a rank-metric code. We provide an answer by presenting an example of a…

Information Theory · Computer Science 2022-03-14 Heide Gluesing-Luerssen , Benjamin Jany

Two $q$-supercongruences of truncated basic hypergeometric series containing two free parameters are established by employing specific identities for basic hypergeometric series. The results partly extend two $q$-supercongruences that were…

Number Theory · Mathematics 2021-01-26 Victor J. W. Guo , Michael J. Schlosser

There exist several theorems which state that when a matroid is representable over distinct fields F_1,...,F_k, it is also representable over other fields. We prove a theorem, the Lift Theorem, that implies many of these results. First,…

Combinatorics · Mathematics 2011-01-14 R. A. Pendavingh , S. H. M. van Zwam

The N distinct prime numbers that make up a composite number M allow $2^{N-1}$ bi partioning into two relatively prime factors. Each such pair defines a pair of conjugate representations. These pairs of conjugate representations, each of…

Quantum Physics · Physics 2007-05-23 M. Revzen , A. Mann , J. Zak

We initiate the study of a type $C_n$ generalization of the lattice path matroids defined by Bonin, de Mier, and Noy. These are delta matroids whose feasible sets are in bijection with lattice paths which are symmetric along the main…

Combinatorics · Mathematics 2023-11-28 Douglas M. Chen , Mario Sanchez , John Veliz , Zhiyan Ying

We show how the Tutte polynomial of a matroid $M$ can be computed from its condensed configuration, which is a statistic of its lattice of cyclic flats. The results imply that the Tutte polynomial of $M$ is already determined by the…

Combinatorics · Mathematics 2014-09-26 Jens Niklas Eberhardt

The Tutte polynomial is a well-studied invariant of graphs and matroids. We first extend the Tutte polynomial from graphs to hypergraphs, and more generally from matroids to polymatroids, as a two-variable polynomial. Our definition is…

Combinatorics · Mathematics 2020-07-23 Olivier Bernardi , Tamas Kalman , Alex Postnikov

Let $Q_n$ denote a random symmetric $n$ by $n$ matrix, whose upper diagonal entries are i.i.d. Bernoulli random variables (which take values 0 and 1 with probability 1/2). We prove that $Q_n$ is non-singular with probability…

Probability · Mathematics 2007-05-23 Kevin Costello , Terence Tao , Van Vu

We consider an analogue of Artin's primitive root conjecture for units in real quadratic fields. Given such a nontrivial unit, for a rational prime p which is inert in the field the maximal order of the unit modulo p is p+1. An extension of…

Number Theory · Mathematics 2007-05-23 Joseph Cohen

We prove that certain basic hypergeometric series truncated at $k=n-1$ have the factor $\Phi_n(q)^2$, where $\Phi_n(q)$ is the $n$-th cyclotomic polynomial. This confirms two recent conjectures of the author and Zudilin. We also put forward…

Number Theory · Mathematics 2019-01-24 Victor J. W. Guo

Let $p$ be an odd prime. We study the structure of the cyclotomic Greenberg-Selmer group attached to a general irreducible Artin motive over $\mathbb{Q}$ endowed with an ordinary $p$-stabilization. Under the Leopoldt and the weak $p$-adic…

Number Theory · Mathematics 2026-02-09 Alexandre Maksoud

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…

Combinatorics · Mathematics 2022-11-23 Eimear Byrne , Michela Ceria , Sorina Ionica , Relinde Jurrius
‹ Prev 1 4 5 6 7 8 10 Next ›