Related papers: Simple recurrence formulas to count maps on orient…

We study iteration maps of recurrence relations arising from mutation periodic quivers of arbitrary period. Combining tools from cluster algebra theory and (pre)symplectic geometry, we show that these cluster iteration maps can be reduced…

Consider $k\ge 2$ distinct, linearly independent, homogeneous linear recurrences of order $k$ satisfying the same recurrence relation. We prove that the recurrences are related to a decomposable form of degree $k$, and there is a very broad…

We consider the problem of computing the data-cube marginals of a fixed order $k$ (i.e., all marginals that aggregate over $k$ dimensions), using a single round of MapReduce. The focus is on the relationship between the reducer size (number…

We prove the conjecture by M. Yip stating that counting genus one partitions by the number of their elements and parts yields, up to a shift of indices, the same array of numbers as counting genus one rooted hypermonopoles. Our proof…

We compute the generating function of column-strict plane partitions with parts in {1,2,...,n}, at most c columns, p rows of odd length and k parts equal to n. This refines both, Krattenthaler's ["The major counting of nonintersecting…

We formulate and discuss two conjectures concerning recursive formulae for Branson's $Q$-curvatures. The proposed formulae describe all $Q$-curvatures on manifolds of all even dimensions in terms of respective lower order $Q$-curvatures and…

A simple and efficient algorithm to numerically compute the genus of surfaces of three-dimensional objects using the Euler characteristic formula is presented. The algorithm applies to objects obtained by thresholding a scalar field in a…

The Kauffman bracket skein algebra of a surface is a generalization of the Jones polynomial invariant for links and plays a principal role in the Witten-Reshetikhin- Turaev topological quantum field theory. However, the multiplicative…

This paper shows that orbital equations generated by iteration of polynomial maps do not have necessarily a unique representation. Remarkably, they may be represented in an infinity of ways, all interconnected by certain nonlinear…

This paper explores a factorization using bidiagonal matrices of the recurrence matrix of Hahn multiple orthogonal polynomials. The factorization is expressed in terms of ratios involving the generalized hypergeometric function ${}_3F_2$…

In this paper, we present a new algorithm for computing the linear recurrence relations of multi-dimensional sequences. Existing algorithms for computing these relations arise in computational algebra and include constructing structured…

We prove that the mapping class group of a closed connected orientable surface of genus $g$ is generated by two elements of order $g$ for $g\geq 6$. Moreover, for $g\geq 7$ we found a generating set of two elements, of order $g$ and $g'$…

We prove that the mapping class group $\mathcal{M}(N_g)$ of a closed nonorientable surface of genus $g$ different than 4 is generated by three torsion elements. Moreover, for every even integer $k\ge 12$ and $g$ of the form $g=pk+2q(k-1)$…

Let $X$ be a smooth complex projective variety. Using a construction devised to Gathmann, we present a recursive formula for some of the Gromov-Witten invariants of $X$. We prove that, when $X$ is homogeneous, this formula gives the number…

We use the explicit relation between genus filtrated $s$-loop means of the Gaussian matrix model and terms of the genus expansion of the Kontsevich--Penner matrix model (KPMM), which is the generating function for volumes of discretized…

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…

Since their introduction by Andrews, generalized Frobenius partitions have interested a number of authors, many of whom have worked out explicit formulas for their generating functions in specific cases. This has uncovered interesting…

Matrix congruence can be used to mimic linear maps between homogeneous quadratic polynomials in $n$ variables. We introduce a generalization, called standard-form congruence, which mimics affine maps between non-homogeneous quadratic…

We study the dependence of recurrence coefficients in the three-term recurrence relation for orthogonal polynomials with a certain deformation of the $q$-Laguerre weight on the degree parameter $n$. We show that this dependence is described…