Related papers: On enumeration of $l$-hypermaps

We present an algorithm which can generate all pairwise non-isomorphic $K_2$-hypohamiltonian graphs, i.e. non-hamiltonian graphs in which the removal of any pair of adjacent vertices yields a hamiltonian graph, of a given order. We…

Let $V$ be a finite dimensional representations of the group $\operatorname{SL}_2$ of $2\times 2$ matrices with complex coefficients and determinant one. Let $R=\mathbb{C}[V]^{\operatorname{SL}_2}$ be the algebra of…

In a recent paper, Gonek, Graham, and Lee introduced a notion of the Lindel\"of hypothesis (LH) for general sequences which coincides with the usual Lindel\"of hypothesis for the Riemann zeta function in the case of the sequence of positive…

We prove an analogue of Kirchhoff's matrix tree theorem for computing the volume of the tropical Prym variety for double covers of metric graphs. We interpret the formula in terms of a semi-canonical decomposition of the tropical Prym…

Let $K$ be a field whose absolute Galois group is finitely generated. If $K$ neither finite nor of characteristic 2, then every hyperelliptic curve over $K$ with all of its Weierstrass points defined over $K$ has infinitely many $K$-points.…

The Erd\H{o}s-Ko-Rado theorem states that for $r \leq \frac{n}{2}$, the largest intersecting family of $r$-subsets of $[n]$ is given by fixing a common element in all subsets, which trivially ensures pairwise intersection. We investigate…

In this paper we extend the Chern-Weil-Lecomte characteristic map to the setting of $L_{\infty}$-algebras. In this general framework, characteristic classes of $L_{\infty}$-algebra extensions are defined by means of the Chern-Weil-Lecomte…

We provide a strengthened version of the famous Jakobson's theorem. Consider an interval map $f$ satisfying a summability condition. For a generic one-parameter family $f_t$ of maps with $f_0=f$, we prove that $t=0$ is a Lebesgue density…

Motivated by the question of how macromolecules assemble, the notion of an {\it assembly tree} of a graph is introduced. Given a graph $G$, the paper is concerned with enumerating the number of assembly trees of $G$, a problem that applies…

Estimating the discrepancy of the hypergraph of all arithmetic progressions in the set $[N]=\{1,2,\hdots,N\}$ was one of the famous open problems in combinatorial discrepancy theory for a long time. An extension of this classical hypergraph…

The main goal of this paper is to introduce the notion of restricted Lie-Rinehart superalgebra over a field of characteristic $p>2$, motivated by a generalization of Hochschild's lemma to the super setting. We extend Schauenburg's proof of…

We enumerate certain geometric equivalence classes of subgraphs induced by Hamiltonian paths and cycles in complete graphs. Said classes are orbits under the action of certain direct products of dihedral and cyclic groups on sets of strings…

We reformulate superalgebra and supergeometry in completely categorical terms by a consequent use of the functor of points. The increased abstraction of this approach is rewarded by a number of great advantages. First, we show that one can…

This paper develops analityc methods for investigating uniform hypergraphs. Its starting point is the spectral theory of 2-graphs, in particular, the largest and the smallest eigenvalues of 2-graphs. On the one hand, this simple setup is…

Let $G$ be a group with a finite subgroup $H$. We define the $L^2$-multiplicity of an irreducible representation of $H$ in the $L^2$-homology of a proper $G$-CW-complex. These invariants generalize the $L^2$-Betti numbers. Our main results…

We give an expansion in $1/N$ and $\beta$ of the cumulants of power sums of the particles of the $\beta$-ensemble. This new expansion is obtained using the tridiagonal model of Dumitriu and Edelman. The coefficients of the expansion are…

We introduce the notion of k-hyperclique complexes, i.e., the largest simplicial complexes on the set [n] with a fixed k-skeleton. These simplicial complexes are a higher-dimensional analogue of clique (or flag) complexes (case k=2) and…

We obtain simple quadratic recurrence formulas counting bipartite maps on surfaces with prescribed degrees (in particular, $2k$-angulations), and constellations. These formulas are the fastest known way of computing these numbers. Our work…

Using the Hilbert-Schmidt theorem, we reformulate the R-matrix theory in terms of a uniformly and absolutely convergent expansion. Term by term differentiation is possible with this expansion in the neighborhood of the surface. Methods for…

The main result of this article is the fact that the currents defined by Levin give a description of the polylogarithm of an abelian scheme at the topological level. This result was a conjecture of Levin. This provides a method to explicit…