相关论文: Counting generalized Jenkins-Strebel differentials

The Jensen-Shannon divergence is a renown bounded symmetrization of the Kullback-Leibler divergence which does not require probability densities to have matching supports. In this paper, we introduce a vector-skew generalization of the…

We consider the polyhedral properties of two spanning tree problems with additional constraints. In the first problem, it is required to find a tree with a minimum sum of edge weights among all spanning trees with the number of leaves less…

A meromorphic quadratic differential with poles of order two, on a compact Riemann surface, induces a measured foliation on the surface, with a spiralling structure at any pole that is determined by the complex residue of the differential…

In this paper we motivate some new directions of research regarding the lattice width of convex bodies. We show that convex bodies of sufficiently large width contain a unimodular copy of a standard simplex. This implies that every lattice…

We provide a short combinatorial proof of Cayley's formula by means of a bijective map to an outcome space of an urn-drawing problem. Furthermore we introduce an algebraic structure on the set of labeled trees, which provides a more…

Counting integer points in large convex bodies with smooth boundaries containing isolated flat points is oftentimes an intermediate case between balls (or convex bodies with smooth boundaries having everywhere positive curvature) and cubes…

We consider discretization of the 'geometric cover problem' in the plane: Given a set $P$ of $n$ points in the plane and a compact planar object $T_0$, find a minimum cardinality collection of planar translates of $T_0$ such that the union…

We investigate the complement of the discriminant in the projective space PSym^d C^{n+1} of polynomials defining hypersurfaces of degree d in P^n. Following the ideas of Zariski we are able to give a presentation for the fundamental group…

We consider maps on genus-$g$ surfaces with $n$ (labeled) faces of prescribed even degrees. It is known since work of Norbury that, if one disallows vertices of degree one, the enumeration of such maps is related to the counting of lattice…

In this paper we studied infinite weighted automata and a general methodology to solve a wide variety of classical lattice path counting problems in an uniform way. This counting problems are related to Dyck paths, Motzkin paths and some…

In this review, we count and classify certain sublattices of a given lattice, as motivated by crystallography. We use methods from algebra and algebraic number theory to find and enumerate the sublattices according to their index. In…

We give a combinatorial proof of a lattice point identity involving a lattice polygon and its dual, generalizing the formula $area(\Delta) + area(\Delta^*) = 6$ for reflexive $\Delta$. The identity is equivalent to the stringy Libgober-Wood…

This article deals with the enumeration of directed lattice walks on the integers with any finite set of steps, starting at a given altitude $j$ and ending at a given altitude $k$, with additional constraints such as, for example, to never…

In this paper we study natural reconfiguration spaces associated to the problem of distributing a fixed number of resources to labeled nodes of a tree network, so that no node is left empty. These spaces turn out to be cubical complexes,…

In this note, we derive an asymptotically sharp upper bound on the number of lattice points in terms of the volume of centrally symmetric convex bodies. Our main tool is a generalization of a result of Davenport that bounds the number of…

We study the problem of counting lattice points of a polytope that are weighted by an Ehrhart quasi-polynomial of a family of parametric polytopes. As applications one can compute integrals and maximum values of such quasi-polynomials, as…

We study the growth of degrees in many autonomous and non-autonomous lattice equations defined by quad rules with corner boundary values, some of which are known to be integrable by other characterisations. Subject to an enabling…

We prove a new formula for the generating function of multitype Cayley trees counted according to their degree distribution. Using this formula we recover and extend several enumerative results about trees. In particular, we extend some…

Finding the so-called characteristic numbers of the complex projective plane ${\mathbb C}P^2$ is a classical problem of enumerative geometry posed by Zeuthen more than a century ago. For a given $d$ and $g$ one has to find the number of…

In this paper, we find computational formulae for generalized characteristic polynomials of graph bundles. We show that the number of spanning trees in a graph is the partial derivative (at (0,1)) of the generalized characteristic…