Related papers: Simple formulas for constellations and bipartite m…

We introduce two new algebraic invariants, the (co)homological distances between continuous maps, which provide computable lower bounds for the homotopic distance and strictly refine the classical cup-length estimates. We then define the…

Kontsevich's work on Airy matrix integrals has led to explicit results for the intersection numbers of the moduli space of curves. In this article we show that a duality between k-point functions on $N\times N$ matrices and N-point…

We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie…

We present a method to derive new explicit expressions for bidiagonal decompositions of Vandermonde and related matrices such as the (q-, h-) Bernstein-Vandermonde ones, among others. These results generalize the existing expressions for…

One of our result is that 5 measurable sets in $R^8$ always admit an equipartition by 2 hyperplanes. This is an instance of a general equipartition problem (formulated by B. Gr{\" u}nbaum and H. Hadwiger) which can be reduced to the…

Building on work of Doyle and Hyde on polynomial maps in one variable, we produce for each odd integer $d \geq 2$ a H\'enon map of degree $d$ defined over $\mathbb{Q}$ with at least $(d-4)^2$ integral periodic points. This provides a…

We show the integrality of the simple Hurwitz numbers. The main tool is the cut-and-join operator, and our proof is a purely combinatorial one.

In recent years, a number of fast algorithms for computing the determinant of a Toeplitz matrix were developed. The fastest algorithm we know so far is of order $k^2\log{n}+k^3$, where $n$ is the number of rows of the Toeplitz matrix and…

We construct all (2+1)-dimensional PDEs depending only on 2nd-order derivatives of unknown which have the Euler-Lagrange form and determine the corresponding Lagrangians. We convert these equations and their Lagrangians to two-component…

We generalize Hirzebruch's computation of the signature of equal rank homogeneous spaces to a large class of biquotients.

This paper designs an alogrithm to compute the minimal combinations of finite sets in Euclidean spaces, and applys the algorithm of study the moment maps and geometric invariant stability of hypersurfaces. The classical example of cubic…

A celebrated conjecture of Sidorenko and Erd\H{o}s-Simonovits states that, for all bipartite graphs $H$, quasirandom graphs contain asymptotically the minimum number of copies of $H$ taken over all graphs with the same order and edge…

In general, Hurwitz numbers count branched covers of the Riemann sphere with prescribed ramification data, or equivalently, factorisations in the symmetric group with prescribed cycle structure data. In this paper, we initiate the study of…

In [5] I.P. Goulden, D.M. Jackson, and R. Vakil formulated a conjecture relating certain Hurwitz numbers (enumerating ramified coverings of the sphere) to the intersection theory on a conjectural Picard variety. We are going to use their…

We present algorithms to compute the topology of 2D and 3D hyperelliptic curves. The algorithms are based on the fact that 2D and 3D hyperelliptic curves can be seen as the image of a planar curve (the Weierstrass form of the curve), whose…

A beautiful conjecture of Erd\H{o}s-Simonovits and Sidorenko states that if H is a bipartite graph, then the random graph with edge density p has in expectation asymptotically the minimum number of copies of H over all graphs of the same…

We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…

We consider planar bipartite maps which are both tight, i.e. without vertices of degree $1$, and $2b$-irreducible, i.e. such that each cycle has length at least $2b$ and such that any cycle of length exactly $2b$ is the contour of a face.…

We find that Koschorke's $\beta$-invariant and the triple $\mu$-invariant of link maps in the critical dimension can be computed as degrees of certain maps of configuration spaces - just like the linking number. Both formulas admit…

We investigate the enumerative geometry of point configurations in projective space. We define "projective configuration counts": these enumerate configurations of points in projective space such that certain specified subsets are in fixed…