Related papers: On quasi-polynomials counting planar tight maps

For a labeled tree on the vertex set $\set{1,2,\ldots,n}$, the local direction of each edge $(i\,j)$ is from $i$ to $j$ if $i<j$. For a rooted tree, there is also a natural global direction of edges towards the root. The number of edges…

We prove a formula for the multidegrees of a rational map defined by generalized monomials on a projective variety, in terms of integrals over an associated Newton region. This formula leads to an expression of the multidegrees as volumes…

We study the asymptotic behaviour of uniform random maps with a prescribed face-degree sequence, in the bipartite case, as the number of faces tends to infinity. Under mild assumptions, we show that, properly rescaled, such maps converge in…

Given a quadratic map Q : K^n -> K^k defined over a computable subring D of a real closed field K, and a polynomial p(Y_1,...,Y_k) of degree d, we consider the zero set Z=Z(p(Q(X)),K^n) of the polynomial p(Q(X_1,...,X_n)). We present a…

We define the \emph{visual complexity} of a plane graph drawing to be the number of basic geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (e.g., one needs only one line segment to…

Exposed positive maps in matrix algebras define a dense subset of extremal maps. We provide a class of indecomposable positive maps in the algebra of 2n x 2n complex matrices with n>1. It is shown that these maps are exposed and hence…

We give a new, systematic proof for a recent result of Larry Guth and thus also extend the result to a setting with several families of varieties: For any integer $D\geq 1$ and any collection of sets $\Gamma_1,\ldots,\Gamma_j$ of low-degree…

The notions of cutwidth and pathwidth of digraphs play a central role in the containment theory for tournaments, or more generally semi-complete digraphs, developed in a recent series of papers by Chudnovsky, Fradkin, Kim, Scott, and…

Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi-isometric to graphs of…

We consider maps with tight boundaries, i.e. maps whose boundaries have minimal length in their homotopy class, and discuss the properties of their generating functions $T^{(g)}_{\ell_1,\ldots,\ell_n}$ for fixed genus $g$ and prescribed…

We study, for the first time, the maximum modulus set of a quasiregular map. It is easy to see that these sets are necessarily closed, and contain at least one point of each modulus. Blumenthal showed that for entire maps these sets are…

A quasiplane $f(V)$ is the image of an $n$-dimensional Euclidean subspace $V$ of ${\Bbb R}^N$ ($1\leq n\leq N-1$) under a quasiconformal map $f:{\Bbb R}^N\to{\Bbb R}^N$ . We give sufficient conditions in terms of the weak quasisymmetry…

This paper deals with properties of the algebraic variety defined as the set of zeros of a "typical" sequence of polynomials. We consider various types of "nice" varieties: set-theoretic and ideal-theoretic complete intersections,…

The Tutte polynomial of a graph, or equivalently the $q$-state Potts model partition function, is a two-variable polynomial graph invariant of considerable importance in both combinatorics and statistical physics. The computation of this…

We present new real algebraic maps of non-positive codimensions with prescribed images whose boundaries consist of explicit non-singular real algebraic hypersurfaces satisfying so-called "transversality" as follows. Explicit information on…

The aim of this paper is to show that any finite undirected bipartite graph can be considered as a polynomial $p \in \mathbb{N}[x]$, and any directed finite bipartite graph can be considered as a polynomial $p\in\mathbb{N}[x,y]$, and vise…

The problem of map enumeration concerns counting connected spatial graphs, with a specified number $j$ of vertices, that can be embedded in a compact surface of genus $g$ in such a way that its complement yields a cellular decomposition of…

We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. We also give a weighted variant for the generating polynomial $Q_g^n(x)$ where $x$ is a parameter taking the number of…

Quasi-Yamanouchi tableaux connect the two most studied types of tableaux. They are a subset of semistandard Young tableaux that are also a refinement on standard Young tableaux, and they can be used to improve the fundamental quasisymmetric…

We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…