Related papers: Cyclotomic generating functions
We study the connection between the dimension of certain spaces of harmonic functions on a group and its geometric and algebraic properties. Our main result shows that (for sufficiently "nice" random walk measures) a connected, compactly…
Two linear recurrences exhibit mirror symmetry connecting the constants $e$ and $\pi$. When parametrized, their asymptotic connection constants extend to meromorphic functions satisfying additive functional equations with rational…
We present families of combinatorial classes described as trees with nodes that can carry one of two types of "flowers": integer partitions or integer compositions. Two parameters on the flowers of trees will be considered: the number of…
Filling functions are asymptotic invariants of finitely presentable groups; the seminal work on the subject is by M.Gromov. They record features of combinatorial homotopy discs (van Kampen diagrams) filling loops in Cayley 2-complexes.…
We consider random orthonormal polynomials $$ F_{n}(x)=\sum_{i=0}^{n}\xi_{i}p_{i}(x), $$ where $\xi_{0}$, \dots, $\xi_{n}$ are independent random variables with zero mean, unit variance and uniformly bounded $(2+\ep)$ moments, and…
This paper presents a noncommutative theory of symmetric functions, based on the notion of quasi-determinant. We begin with a formal theory, corresponding to the case of symmetric functions in an infinite number of independent variables.…
We explore families of pairs of quadratic polynomials $f(x)=x^2+c\in \mathbb{Q}$ and $a\in \mathbb{Q}$ with $a$ being a strictly preperiodic point of $f$ to provide infinitely many new examples for which the associated arboreal Galois…
We survey general properties of multiplicative arithmetic functions of several variables and related convolutions, including the Dirichlet convolution and the unitary convolution. We introduce and investigate a new convolution, called gcd…
In an isomorphic copy of the ring of symmetric polynomials we study some families of polynomials which are indexed by rational weight vectors. These families include well known symmetric polynomials, such as the elementary, homogeneous, and…
Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…
Let $\sum_{\beta\in\nats^d} F_\beta x^\beta$ be a multivariate power series. For example $\sum F_\beta x^\beta$ could be a generating function for a combinatorial class. Assume that in a neighbourhood of the origin this series represents a…
Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…
Graphs which generalize the simple or affine Dynkin diagrams are introduced. Each diagram defines a bilinear form on a root system and thus a reflection group. We present some properties of these groups and of their natural "Coxeter…
In a recent paper [Trans. Amer. Math. Soc. 378 (2025), 851-883], the concept of generalized partial-slice monogenic (or regular) function was introduced over Clifford algebras. The present paper shall extend the study of generalized…
We calculate asymptotic estimates for the conjugacy growth function of finitely generated class 2 nilpotent groups whose derived subgroup is infinite cyclic, including the so-called higher Heisenberg groups. We prove that these asymptotics…
We introduce a notion of representation for a class of generalised quivers known as Coxeter quivers. These representations are built using fusion categories associated to $U_q(\mathfrak{s}\mathfrak{l}_2)$ at roots of unity and we show that…
We study polynomials with complex coefficients which are nondegenerate in two senses, one of Kouchnirenko and the other with respect to its Newton polyhedron, through data on contact loci and motivic nearby cycles. Introducing an explicit…
Polynomial ensembles are determinantal point processes associated with (non necessarily orthogonal) projections onto polynomial subspaces. The aim of this survey article is to put forward the use of recurrence coefficients to obtain the…
Graph invariants are a useful tool in graph theory. Not only do they encode useful information about the graphs to which they are associated, but complete invariants can be used to distinguish between non-isomorphic graphs. Polynomial…
We study the fluctuations of the number of real roots of random polynomials with independent, nonzero-mean coefficients. Such non-centered ensembles arise naturally in signal-plus-noise models and in random perturbations of deterministic…