相关论文: Enumerating Partial Duals of Hypermaps by Genus

We introduce polynomials that represent general degeneracy loci for maps of vector bundles. These polynomials specialize to the known classical and quantum forms of single and double Schubert polynomials. This is the final version of the…

We give an expansion in $1/N$ and $\beta$ of the cumulants of power sums of the particles of the $\beta$-ensemble. This new expansion is obtained using the tridiagonal model of Dumitriu and Edelman. The coefficients of the expansion are…

In 2007 Sami Assaf introduced dual equivalence graphs as a method for demonstrating that a quasisymmetric function is Schur positive. The method involves the creation of a graph whose vertices are weighted by Ira Gessel's fundamental…

This paper addresses the enumeration of rooted and unrooted hypermaps of a given genus. For rooted hypermaps the enumeration method consists of considering the more general family of multirooted hypermaps, in which darts other than the root…

We present a polynomial partitioning theorem for finite sets of points in the real locus of an irreducible complex algebraic variety of codimension at most two. This result generalizes the polynomial partitioning theorem on the Euclidean…

A map-guided superpixel segmentation method for hyperspectral imagery is developed and introduced. The proposed approach develops a hyperspectral-appropriate version of the SLIC superpixel segmentation algorithm, leverages map information…

We introduce a Whitney polynomial for hypermaps and use it to generalize the results connecting the circuit partition polynomial to the Martin polynomial and the results on several graph invariants.

The distributive property can be studied through bilinear maps and various morphisms between these maps. The adjoint-morphisms between bilinear maps establish a complete abelian category with projectives and admits a duality. Thus the…

We give an excluded minor characterisation of the class of ribbon graphs that admit partial duals of Euler genus at most one.

The Euler genus of a graph is a fundamental and well-studied parameter in graph theory and topology. Computing it has been shown to be NP-hard by [Thomassen '89 & '93], and it is known to be fixed-parameter tractable. However, the…

Starting from an arbitrary sequence of polygons whose total perimeter is $2n$, we can build an (oriented) surface by pairing their sides in a uniform fashion. Chmutov and Pittel (arXiv:1503.01816) have shown that, regardless of the…

We revisit in a probabilistic framework the umbral approach of Bernoulli, Euler and Carlitz Hermite polynomials by Gessel [1].

Dirichlet-to-Neumann maps enable the coupling of multiphysics simulations across computational subdomains by ensuring continuity of state variables and fluxes at artificial interfaces. We present a novel method for learning…

In this paper we follow the general approach, proposed earlier by the first author, which is derived from the invariant theory field and provides a way of obtaining of the polynomial identities for any arbitrary polynomial family. We…

We develop the theory of halving spaces to obtain lower bounds in real enumerative geometry. Halving spaces are topological spaces with an action of a Lie group $\Gamma$ with additional cohomological properties. For $\Gamma=\mathbb{Z}_2$ we…

Computing the Euler genus of a graph is a fundamental problem in graph theory and topology. It has been shown to be NP-hard by [Thomassen '89] and a linear-time fixed-parameter algorithm has been obtained by [Mohar '99]. Despite extensive…

We describe a relation between Arnold's strange duality and a polar duality between the Newton polytopes which is mostly due to M.~Kobayashi. We show that this relation continues to hold for the extension of Arnold's strange duality found…

This is the first in a series of papers that deals with duality statements such as Mukai-duality (T-duality, from algebraic geometry) and the Baum-Connes conjecture (from operator $K$-theory). These dualities are expressed in terms of…

We apply Hilbert module methods to show that normal completely positive maps admit weak tensor dilations. Appealing to a duality between weak tensor dilations and extensions of CP-maps, we get an existence proof for certain extensions. We…

We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm to exactly sample a random ET of the given generalized…