English
Related papers

Related papers: New formulas counting one-face maps and Chapuy's r…

200 papers

In the paper, by establishing a new and explicit formula for computing the $n$-th derivative of the reciprocal of the logarithmic function, the author presents new and explicit formulas for calculating Bernoulli numbers of the second kind…

Combinatorics · Mathematics 2014-05-06 Feng Qi

We are extending results from \cite{B-Hurwitz} by building a parallel theory of simple Hurwitz numbers for the reflection groups $G(m,1,n)$. We also study analogs of the cut-and-join operators. An algebraic description as well as a…

Combinatorics · Mathematics 2024-03-05 Raphaël Fesler , Denis Gorodkov , Maksim Karev

An element $g$ of a group is called reversible if it is conjugate in the group to its inverse. An element is an involution if it is equal to its inverse. This paper is about factoring elements as products of reversibles in the group…

Group Theory · Mathematics 2014-02-11 Dmitri Zaitsev , Anthony G. O'Farrell

We introduce and study a new notion of patterns in Stirling and $k$-Stirling permutations, which we call block patterns. We prove a general result which allows us to compute generating functions for the occurrences of various block patterns…

Combinatorics · Mathematics 2014-02-17 Jeffrey B. Remmel , Andrew Timothy Wilson

A $k$-Stirling permutation of order $n$ is said to be "flattened" if the leading terms of its increasing runs are in ascending order. We show that flattened $k$-Stirling permutations of order $n+1$ are in bijection correspondence with a…

Combinatorics · Mathematics 2023-08-09 Umesh Shankar

Any deformation of a Weyl or Clifford algebra A can be realized through a `deforming map', i.e. a formal change of generators in A. This is true in particular if A is covariant under a Lie algebra g and its deformation is induced by some…

q-alg · Mathematics 2009-10-30 Gaetano Fiore

We develop a numerical method for computing with orthogonal polynomials that are orthogonal on multiple, disjoint intervals for which analytical formulae are currently unknown. Our approach exploits the Fokas--Its--Kitaev Riemann--Hilbert…

Numerical Analysis · Mathematics 2024-01-18 Cade Ballew , Thomas Trogdon

We give a formula for the spectral pairs (after Steenbrink) for composite singularities of several variables. (Note that for two variable case is studyed by Nemethi-Steenbrink.) Here composite singularity is given by the equation f(g_1,…

Algebraic Geometry · Mathematics 2007-05-23 Tomohide Terasoma

Let $A(n,m)$ denote the Eulerian numbers, which count the number of permutations on $[n]$ with exactly $m$ descents. It is well known that $A(n,m)$ also counts the number of permutations on $[n]$ with exactly $m$ excedances. In this report,…

Combinatorics · Mathematics 2023-06-22 David Dong

If $\alpha \in S_n$ is a permutation of $\{1, 2, \ldots, n\}$, the inversion set of $\alpha$ is $\Phi(\alpha) = \{(i, j) \, | \, 1 \leq i < j \leq n, \alpha(i) > \alpha(j)\}$. We describe all $r$-tuples $\alpha_1, \alpha_2, \ldots, \alpha_r…

Combinatorics · Mathematics 2014-09-04 R. Dewji , I. Dimitrov , A. McCabe , M. Roth , D. Wehlau , J. Wilson

Many combinatorial and other number triangles are solutions of recurrences of the Graham-Knuth-Patashnik (GKP) type. Such triangles and their defining recurrences are investigated analytically. They are acted on by a transformation group…

Combinatorics · Mathematics 2025-02-17 Robert S. Maier

Let R(n,k) denote the number of permutations of {1,2,...,n} with k alternating runs. We find a grammatical description of the numbers R(n,k) and then present several convolution formulas involving the generating function for the numbers…

Combinatorics · Mathematics 2012-11-29 Shi-Mei Ma

In recent, H. Sun defined a new kind of refined Eulerian polynomials, namely, \begin{eqnarray*} A_n(p,q)=\sum_{\pi\in \mathfrak{S}_n}p^{{\rm odes}(\pi)}q^{{\rm edes}(\pi)} \end{eqnarray*} for $n\geq 1$, where ${odes}(\pi)$ and ${edes}(\pi)$…

Combinatorics · Mathematics 2018-10-19 Yidong Sun , Liting Zhai

Let $\Sigma_{g,b}$ denote a closed oriented surface genus $g$ with $b$ punctures and let $Mod_{g,b}$ denote its mapping class group. Luo proved that if the genus is at least 3, the group $Mod_{g,b}$ is generated by involutions. He also…

Geometric Topology · Mathematics 2007-05-23 Martin Kassabov

In this note, we examine how the BKP structure of the generating series of several models of maps on non-oriented surfaces can be used to obtain explicit and/or efficient recurrence formulas for their enumeration according to the genus and…

Combinatorics · Mathematics 2023-06-23 Valentin Bonzom , Guillaume Chapuy , Maciej Dołęga

Let $\Gamma_{g}$ be the fundamental group of a closed connected orientable surface of genus $g\geq2$. We develop a new method for integrating over the representation space $\mathbb{X}_{g,n}=\mathrm{Hom}(\Gamma_{g},S_{n})$ where $S_{n}$ is…

Group Theory · Mathematics 2023-11-07 Michael Magee , Doron Puder

We give a reduction formula for the Waring number $g(k,q)$ over a finite field $\mathbb{F}_q$. By exploiting the relation between $g(k,q)$ with the diameter of the generalized Paley graph $\Gamma(k,q)$ and by using the characterization due…

Number Theory · Mathematics 2022-06-07 Ricardo A. Podestá , Denis E. Videla

We introduce a generalization of the Stirling numbers via symmetric functions involving two weight functions. The resulting extension unifies previously known Stirling-type sequences with known symmetric function forms, as well as other…

We present an unexpected connection between two map enumeration problems. The first one consists in counting planar maps with a boundary of prescribed length. The second one consists in counting planar maps with two points at a prescribed…

Combinatorics · Mathematics 2012-01-24 J. Bouttier , E. Guitter

By pairwise gluing of edges of a polygon, one produces two-dimensional surfaces with handles and boundaries. In this paper, we count the number ${\cal N}_{g,L}(n_1, n_2, ..., n_L)$ of different ways to produce a surface of given genus $g$…

Combinatorics · Mathematics 2008-08-24 E. T. Akhmedov , Sh. Shakirov
‹ Prev 1 3 4 5 6 7 10 Next ›