Related papers: Introducing irrational enumeration: analytic combi…
Arithmetic combinatorics is often concerned with the problem of bounding the behaviour of arbitrary finite sets in a group or ring with respect to arithmetic operations such as addition or multiplication. Similarly, combinatorial geometry…
The asymptotic behaviour is studied of exponentially bounded sequences of codimensions of identities of algebras with unity. A series of algebras is constructed for which the base of the exponential increases by exactly one when an outer…
We prove a Tauberian theorem concerning power series admitting square root singularities. More precisely we give an asymptotic expansion to any order of the coefficients of a power series admitting square-root type singularities. This…
We approach Riordan arrays and their generalizations via umbral symbolic methods. This new approach allows us to derive fundamental aspects of the theory of Riordan arrays as immediate consequences of the umbral version of the classical…
We introduce the notion of exact tilting objects, which are partial tilting objects $T$ inducing an equivalence between the abelian category generated by $T$ and the category of modules over the endomorphism algebra of $T$. Given a chain of…
We analyse q-functional equations arising from tree-like combinatorial structures, which are counted by size, internal path length, and certain generalisations thereof. The corresponding counting parameters are labelled by a positive…
Ufnarovski remarked in 1990 that it is unknown whether any finitely presented associative algebra of linear growth is automaton, that is, whether the set of normal words in the algebra form a regular language. If the algebra is graded, then…
We consider a generalized Mathieu series where the summands of the classical Mathieu series are multiplied by powers of a complex number. The Mellin transform of this series can be expressed by the polylogarithm or the Hurwitz zeta…
We introduce and study a category of representations of the Borel algebra, associated with a quantum loop algebra of non-twisted type. We construct fundamental representations for this category as a limit of the Kirillov-Reshetikhin modules…
We prove a general large sieve statement in the context of random walks on subgraphs of a given graph. This can be seen as a generalization of previously known results where one performs a random walk on a group enjoying a strong spectral…
We construct exponential objects in categories of generalized uniform hypergraphs and use embeddings induced by nerve-realization adjunctions to show why conventional categories of graphs and hypergraphs do not have exponential objects.
We obtain a differential equation for the enumeration of the path length of general increasing trees. By using differential operators and their combinatorial interpretation we give a bijective proof of a version of Fa\`a di Bruno formula,…
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…
In previous work on Clebsch-Gordan coefficients, certain remarkable hexagonal arrays of integers are constructed that display behaviors found in Pascal's Triangle. We explain these behaviors further using the binomial transform and discrete…
In this series of papers, we propose a theory of enumerative invariants counting self-dual objects in self-dual categories. Ordinary enumerative invariants in abelian categories can be seen as invariants for the structure group $\mathrm{GL}…
Ramanujan derived the well known divergent-sum of integers in more than one way. We generalise the informal method to higher powers of the Riemann zeta function through a study of the Eulerian numbers in particular. Within the context of…
We obtain bivariate asymptotics for the number of (unicellular) combinatorial maps (a model of discrete surfaces) as both the size and the genus grow. This work is related to two research topics that have been very active recently:…
We consider the problem of counting lattice points contained in domains in $\mathbb{R}^d$ defined by products of linear forms and we show that the normalized discrepancies in these counting problems satisfy non-degenerate Central Limit…
We develop the relation between hyperbolic geometry and arithmetic equidistribution problems that arises from the action of arithmetic groups on real hyperbolic spaces, especially in dimension up to 5. We prove generalisations of Mertens'…
Inference in expressive probabilistic models is generally intractable, which makes them difficult to learn and limits their applicability. Sum-product networks are a class of deep models where, surprisingly, inference remains tractable even…