Related papers: On generating functions and automata associated to…
We derive the P-finite recurrences for classes of sequences with ordinary generating function containing roots of polynomials. The focus is on establishing the D-finite differential equations such that the familiar steps of reducing their…
We show how Coxeter's work implies a bijection between complex reflection groups of rank two and real reflection groups in $O(3)$. We also consider this magic square of reflections and rotations in the framework of Clifford algebras: we…
We introduce and study a class of multivariate rational functions associated with hyperplane arrangements, called flag Hilbert-Poincar\'e series. These series are intimately connected with Igusa local zeta functions of products of linear…
We define in an axiomatic fashion a \emph{Coxeter datum} for an arbitrary Coxeter group $W$. This Coxeter datum will specify a pair of reflection representations of $W$ in two vector spaces linked only by a bilinear paring without any…
A finite irreducible real reflection group of rank l and Coxeter number h has root system of cardinality h*l. It is shown that the fake degree for the permutation action on its roots is divisible by [h]_q = 1+q+q^2+...+q^{h-1}, and that in…
In previous papers, the author showed that in many cases of interest there exists an isomorphism between certain path algebras related to the structure of the subregular J-rings of Coxeter systems and matrix rings over a free product of…
It is well known that the normaliser of a parabolic subgroup of a finite Coxeter group is the semidirect product of the parabolic subgroup by the stabiliser of a set of simple roots. We show that a similar result holds for all finite…
The reduced Kronecker coefficients are particular instances of Kronecker coefficients that contain enough information to recover them. In this notes we compute the generating function of a family of reduced Kronecker coefficients. We also…
Let $A \cong k\langle X \rangle / I$ be an associative algebra. A finite word over alphabet $X$ is $I${\it-reducible} if its image in $A$ is a $k$-linear combination of length-lexicographically lesser words. An {\it obstruction} in a…
We introduce an algebraic model, based on the determinantal expansion of the product of two matrices, to test combinatorial reductions of set functions. Each term of the determinantal expansion is deformed through a monomial factor in d…
Aiming for a revival of the theory of crystallographic complex reflection groups, we compute (minimal) Coxeter-like reflection presentations for the infinite families of those non-genuine groups which satisfy Steinberg's fixed point…
The celebrated $3x+1$ problem is reformulated via the use of an analytic expression of the trailing zeros sequence resulting in a single branch formula $f(x)+1$ with a unique fixed point. The resultant formula $f(x)$ is also found to…
We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These…
We extend the classical Ostrowski numeration systems, closely related to Sturmian words, by allowing a wider range of coefficients, so that possible representations of a number $n$ better reflect the structure of the associated Sturmian…
We continue to consider the ordered lexicographic sequence, which is constructed according to the formal characteristics of a series of natural numbers. For analysis, we selected balanced parentheses with zeros, Motzkin words. As you know,…
Diffraction images with continuous rotation symmetry arise from amorphous systems, but also from regular crystals when investigated by powder diffraction. On the theoretical side, pinwheel patterns and their higher dimensional…
We introduce the $k$-bonacci polyominoes, a new family of polyominoes associated with the binary words avoiding $k$ consecutive $1$'s, also called generalized $k$-bonacci words. The polyominoes are very entrancing objects, considered in…
We propose a relax-and-round approach combined with a greedy search strategy for performing complex lattice basis reduction. Taking an optimization perspective, we introduce a relaxed version of the problem that, while still nonconvex, has…
Let $(W,S)$ be a Coxeter system and write $P_W(q)$ for its Poincar\'e series. Lusztig has shown that the quotient $P_W(q^2)/P_W(q)$ is equal to a certain power series $L_{W}(q)$, defined by specializing one variable in the generating…
For an arbitrary cocompact hyperbolic Coxeter group G with finite generator set S and complete growth function P(x)/Q(x), we provide a recursion formula for the coefficients of the denominator polynomial Q(x) which allows to determine…