Related papers: On Brylawski's generalized duality
Given a matroid or flag of matroids we introduce several broad classes of polynomials satisfying Deletion-Contraction identities, and study their singularities. There are three main families of polynomials captured by our approach:…
Given a map $\mathcal M$ on a connected and closed orientable surface, the delta-matroid of $\mathcal M$ is a combinatorial object associated to $\mathcal M$ which captures some topological information of the embedding. We explore how…
We first propose a generalization of the image conjecture [Z3] for the commuting differential operators related with classical orthogonal polynomials. We then show that the non-trivial case of this generalized image conjecture is equivalent…
A generalization of the semisimplicity concept for polyadic algebraic structures is proposed. If semisimple structures can be presented in block diagonal matrix form (resulting in the Wedderburn decomposition), a general form of polyadic…
$q$-Matroids are defined on complemented modular support lattices. Minors of length 2 are of four types as in a "classical" matroid. Tutte polynomials $\tau(x,y)$ of matroids are calculated either by recursion over deletion/contraction of…
Duality transformations reveal unexpected equivalences between seemingly distinct models. We introduce an out-of-equilibrium generalisation of matrix product operators to implement duality transformations in one-dimensional boundary-driven…
Two generalizations of the Minkowski ?(x) function are given. As ?(x) maps quadratic irrationals to rational numbers, it is shown that both generalizations send natural classes of pairs of cubic irrational numbers in the same cubic number…
We introduce a formalism based on a combinatorial notion of cell complex subject to an inclusion-reversing duality operation. Our main goal is to open the way for a functorial definition of field theories in a context where no manifold or…
We study Dressians of matroids using the initial matroids of Dress and Wenzel. These correspond to cells in regular matroid subdivisions of matroid polytopes. An efficient algorithm for computing Dressians is presented, and its…
Macaulay Duality, between quotients of a polynomial ring over a field, annihilated by powers of the variables, and finitely generated submodules of the ring's graded dual, is generalized over any Noetherian ring, and used to provide…
We provide a unified framework in which the interlace polynomial and several related graph polynomials are defined more generally for multimatroids and delta-matroids. Using combinatorial properties of multimatroids rather than…
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…
We give a correspondence between simple matroids and a reconstruction of Alfred North Whitehead's theory of dimension, as developed in "On Mathematical Concepts of the Material World" (1906). In brief, if a geometrical system in the…
The recent proposal by Ben-Zvi, Sakellaridis and Venkatesh of a duality in the relative Langlands program, leads, via the process of quantization of Hamiltonian varieties, to a duality theory of branching problems. This often unexpectedly…
The transfer property for the generalized Browder's theorem both of the tensor product and of the left-right multiplication operator will be characterized in terms of the $B$-Weyl spectrum inclusion. In addition, the isolated points of…
This is a general introduction to duality in field theories. The existence and breaking of global symmetries is used as a guideline to systematically prove duality between different field theories. Systems discussed include abelian and…
Binary functions are a generalisation of the cocircuit spaces of binary matroids to arbitrary functions. Every rank function is assigned a binary function, and the deletion and contraction operations of binary functions generalise matroid…
Finding a maximum cardinality common independent set in two matroids (also known as \textsc{Matroid Intersection}) is a classical combinatorial optimization problem, which generalizes several well-known problems, such as finding a maximum…
The matroid parity (or matroid matching) problem, introduced as a common generalization of matching and matroid intersection problems, is so general that it requires an exponential number of oracle calls. Nevertheless, Lov\'asz (1980)…
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.