Related papers: Partial-twuality polynomials of delta-matroids

Let $\mathcal{A}$ be a Weyl arrangement. We introduce and study the notion of $\mathcal{A}$-Eulerian polynomial producing an Eulerian-like polynomial for any subarrangement of $\mathcal{A}$. This polynomial together with shift operator…

Duality identities in random matrix theory for products and powers of characteristic polynomials, and for moments, are reviewed. The structure of a typical duality identity for the average of a positive integer power $k$ of the…

We give an analogue of the Tutte polynomial for hypermaps. This polynomial can be defined as either a sum over subhypermaps, or recursively through deletion-contraction reductions where the terminal forms consist of isolated vertices. Our…

We present those properties of planar doodles, especially when regarded as 4-valent graphs, that enable us to classify them into {\it prime} and {\it super prime} doodles by analogy to a knot sum. We describe a method for partially…

Unitary matrix integrals over symmetric polynomials play an important role in a wide variety of applications, including random matrix theory, gauge theory, number theory, and enumerative combinatorics. We derive novel results on such…

Inspired by a recent result of Brakensiek et al. that symmetric tensor matroids and rigidity matroids are linked by matroid duality, we define abstract symmetric tensor matroids as a dual concept to abstract rigidity matroids and establish…

We establish a relation between the Bollobas-Riordan polynomial of a ribbon graph with the relative Tutte polynomial of a plane graph obtained from the ribbon graph using its projection to the plane in a nontrivial way. Also we give a…

Let $\Gamma$ be a $Q$-polynomial distance-regular graph with diameter at least $3$. Terwilliger (1993) implicitly showed that there exists a polynomial, say $T(\lambda)\in \mathbb{C}[\lambda]$, of degree $4$ depending only on the…

To every finite metric space $X$, including all connected unweighted graphs with the minimum edge-distance metric, we attach an invariant that we call its blowup-polynomial $p_X(\{ n_x : x \in X \})$. This is obtained from the blowup…

Using Tutte's combinatorial definition of a map we define a $\Delta$-matroid purely combinatorially and show that it is identical to Bouchet's topological definition.

We introduce thagomizer matroids and compute the Kazhdan-Lusztig polynomial of a rank $n+1$ thagomizer matroid by showing that the coefficient of $t^k$ is equal to the number of Dyck paths of semilength $n$ with $k$ long ascents. We also…

Let $\mathcal{M}$ and $\mathcal{N}$ be two matroids on the same ground set $V$. Let $A_1,\dots,A_{2n-1}$ be sets which are independent in both $\mathcal{M}$ and $\mathcal{N}$, satisfying $|A_i|\geq \textrm{min}(i,n)$ for all $i$. We show…

Given two tuples of subspaces, can you tell whether the tuples are isomorphic? We develop theory and algorithms to address this fundamental question. We focus on isomorphisms in which the ambient vector space is acted on by either a unitary…

We discuss various dualities, relating integrable systems and show that these dualities are explained in the framework of Hamiltonian and Poisson reductions. The dualities we study shed some light on the known integrable systems as well as…

In previous work, we have introduced delta-forms on the Berkovich analytification of an algebraic variety in order to study smooth or formal metrics via their associated Chern delta-forms. In this paper, we investigate positivity properties…

This paper studies signed graphs with possible outer-edges. We introduce and investigate the chain group, the boundary operator, the co-boundary operator, the flow group, the tension group, the homology group, the cohomology group, with…

We establish a connection between the algebraic geometry of the type B permutohedral toric variety and the combinatorics of delta-matroids. Using this connection, we compute the volume and lattice point counts of type B generalized…

This paper proves an identity between flagged Schur polynomials, giving a duality between row flags and column flags. This identity generalises both the binomial determinant duality theorem due to Gessel and Viennot and the symmetric…

In the last chapter of his book "The Algebraic Theory of Modular Systems " published in 1916, F. S. Macaulay developped specific techniques for dealing with " unmixed polynomial ideals " by introducing what he called " inverse systems ".…

The domination polynomial of a graph $G$ is given by $D(G,x)=\sum_{k=0}^{n} d_k(G)x^k$ where $d_k(G)$ records the number of $k$-element dominating sets in $G$. A conjecture of Alikhani and Peng asserts that these polynomials have unimodal…