arXiv subjects
Publications and source records attributed to Yurii Burman.
We provide a direct correspondence between the $b$-Hurwitz numbers with $b=1$ from \cite{ChapuyDolega}, and twisted Hurwtiz numbers from \cite{TwistedHurwitz}. This provides a description of real coverings of the sphere with ramification on the real line in terms of monodromy.
Ribbon decomposition is a way to obtain a surface with boundary (compact, not necessarily oriented) from a collection of disks by joining them with narrow ribbons attached to segments of the boundary. Counting ribbon decompositions gives rise to a "twisted" version of the classical Hurwitz numbers (studied earlier in \cite{CD} in a different context) and of the cut-and-join equation. We also provide an algebraic description of these numbers and an explicit formula for them in terms of zonal polynomials.
For a finite-dimensional representation V of a group G we introduce and study the notion of a Lie element in the group algebra k[G]. The set L(V) \subset k[G] of Lie elements is a Lie algebra and a G-module acting on the original representation V. Lie elements often exhibit nice combinatorial properties. Thus, for G = S_n and V, a permutation representation, we prove a formula for the characteristic polynomial of a Lie element similar to the classical matrix-tree theorem.
We describe the algebraic relations satisfied by the harmonic and anti-harmonic moments of simply connected, but not necessarily convex planar polygons with a given number of vertices.
This paper is a continuation of arXiv:1612.03873. We prove a three-parameter family of identities (Theorem 1.1) involving a version of the Tutte polynomial for directed graphs introduced by Awan and Bernardi in arXiv:1610.01839. A particular case of this family (Corollary 1.6) is the higher-degree generalization of the matrix-tree theorem proved in arXiv:1612.03873, which thus receives a new proof, shorter (and less direct) than the original one. The theory has a parallel version for undirected graphs (Theorem 1.2).
The classical matrix-tree theorem discovered by G.Kirchhoff in 1847 relates the principal minor of the nxn Laplace matrix to a particular sum of monomials of matrix elements indexed by directed trees with n vertices and a single sink. In this paper we consider a generalization of this statement: for any k \ge n we define a degree k polynomial det_{n,k} of matrix elements and prove that this polynomial applied to the Laplace matrix gives a sum of monomials indexed by acyclic graphs with n vertices and k edges.
For a point $p\in CP^2$ and a triple $(g,d,\ell)$ of non-negative integers we define a {\em Hurwitz--Severi number} ${\mathfrak H}_{g,d,\ell}$ as the number of generic irreducible plane curves of genus $g$ and degree $d+\ell$ having an $\ell$-fold node at $p$ and at most ordinary nodes as singularities at the other points, such that the projection of the curve from $p$ has a prescribed set of local and remote tangents and lines passing through nodes. In the cases $d+\ell\ge g+2$ and $d+2\ell \ge g+2 > d+\ell$ we express the Hurwitz--Severi numbers via appropriate ordinary Hurwitz numbers. The remaining case $d+2\ell<g+2$ is still widely open.
The classical matrix-tree theorem was discovered by G.~Kirchhoff in 1847. It relates the principal minor of the Laplace (nxn)-matrix to a particular sum of monomials indexed by the set of trees with n vertices. The aim of this paper is to present a generalization of the (nonsymmetric) matrix-tree theorem containing no trees and essentially no matrices. Instead of trees we consider acyclic directed graphs with a prescribed set of sinks, and instead of determinant, a polynomial invariant of the matrix determined by directed graph such that any two vertices of the same connected component are mutually reacheable.
We calculate determinants of weighted sums of reflections and of (nested) commutators of reflections. The results obtained generalize the Kirchhoff's matrix-tree theorem and the matrix-3-hypertree theorem by G.\,Massbaum and A.\,Vaintrob.
The classical Whitney formula relates the number of times an oriented plane curve cuts itself to its rotation number and the index of a base point. In this paper we generalize Whitney's formula to curves on an oriented punctured surface. To define analogs of the rotation number and the index of a base point of a curve, we fix an arbitrary vector field on the surface. Similar formulas are obtained for non-based curves.
Using Dunkl operators, we introduce a continuous family of canonical invariants of finite reflection groups. We verify that the elementary canonical invariants of the symmetric group are deformations of the elementary symmetric polynomials. We also compute the canonical invariants for all dihedral groups as certain hypergeometric functions.
Consider factorizations into transpositions of an n-cycle in the symmetric group S_n. To every such factorization we assign a monomial in variables w_{ij} that retains the transpositions used, but forgets their order. Summing over all possible factorizations of n-cycles we obtain a polynomial that happens to admit a closed expression. From this expression we deduce a formula for the number of 1-faced embeddings of a given graph.
We introduce and study deformations of finite-dimensional modules over rational Cherednik algebras. Our main tool is a generalization of usual harmonic polynomials for Coxeter groups -- the so-called quasiharmonic polynomials. A surprising application of this approach is the construction of canonical elementary symmetric polynomials and their deformations for all Coxeter groups.
Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given graph with a fixed 2-core. We use this generalization to obtain an analog of the matrix-tree theorem for the root system $D_n$ (the classical theorem corresponds to the $A_n$-case). Several byproducts of the developed technique, such as a new formula for a specialization of the multivariate Tutte polynomial, are of independent interest.