相关论文: Counting generalized Jenkins-Strebel differentials
Given a finite set of lattice points, we compare its sumsets and lattice points in its dilated convex hulls. Both of these are known to grow as polynomials. Generally, the former are subsets of the latter. In this paper, we will see that…
We introduce a generalization of symmetric functions and apply the resulting theory to compute the class in the Grothendieck ring of varieties of the space of geometrically irreducible hypersurfaces of a fixed degree in projective space.
The canonical sylvan resolution is a resolution of an arbitrary monomial ideal over a polynomial ring that is minimal and has an explicit combinatorial formula for the differential. The differential is a weighted sum over lattice paths of…
We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…
A basic problem for any class of nonassociative algebras is to determine the polynomial identities satisfied by the symmetrization and the skew-symmetrization of the original product. We consider the symmetrization of the product in the…
The Separation of Variables theory for the Hamilton-Jacobi equation is 'by definition' related to the use of special kinds of coordinates, for example Jacobi coordinates on the ellipsoid or St\"ackel systems in the Euclidean space. However,…
We study sets of univariate hyperbolic polynomials that share the same first few coefficients and show that they have a natural combinatorial description akin to that of polytopes. We define a stratification of such sets in terms of root…
The face lattice of the permutohedron realizes the combinatorics of linearly ordered partitions of the set $[n]=\{1,...,n\}$. Similarly, the cyclopermutohedron is a virtual polytope that realizes the combinatorics of cyclically ordered…
Let C be the set of all possible quantum states. We study the convex subsets of C with attention focused on the lattice theoretical structure of these convex subsets and, as a result, find a framework capable of unifying several aspects of…
Over the past decade, a combinatorial framework for discrete, finite, and irreversibly aggregating systems has emerged. This work reviews its progress, practical applications, and limitations. We outline the approach's assumptions and…
Recently, Taneja studied two one parameter generalizations of J-divergence, Jensen-Shannon divergence and Arithmetic-Geometric divergence. These two generalizations in particular contain measures like: Hellinger discrimination, symmetric…
The Goulden-Jackson cluster method is a powerful tool for obtaining generating functions for counting words in a free monoid by occurrences of a set of subwords. We introduce a generalization of the cluster method for monoid networks, which…
Joyce structures are a class of geometric structures that first arose in relation to Donaldson-Thomas theory. There is a special class of examples, called class $S[A_1]$, whose underlying manifold parameterises Riemann surfaces of some…
We prove the quasimodularity of generating functions for counting pillowcase covers, with and without Siegel-Veech weight. Similar to prior work on torus covers, the proof is based on analyzing decompositions of half-translation surfaces…
The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…
Color-ordered tree level scattering amplitudes in Yang-Mills theories can be written as a sum over terms which display the various propagator poles of Feynman diagrams. The numerators in these expressions which are obtained by…
In this paper, we discuss possible qualitative approaches to the problem of KPZ universality. Throughout the paper, our point of view is based on the geometrical and dynamical properties of minimisers and shocks forming interlacing…
Generalized Pl\"ucker numbers are defined to count certain types of tangent lines of generic degree $d$ complex projective hypersurfaces. They can be computed by identifying them as coefficients of GL(2)-equivariant cohomology classes of…
In this manuscript, we introduce (symmetric) Tetranacci polynomials $\xi_j$ as a twofold generalization of ordinary Tetranacci numbers, by considering both non unity coefficients and generic initial values in their recursive definition. The…
We consider positive Jacobi matrices $J$ with compact inverses and consequently with purely discrete spectra. A number of properties of the corresponding sequence of orthogonal polynomials is studied including the convergence of their…