相关论文: Computation in Coxeter groups II. Minimal roots
We propose a numerical analysis of a simplified version of the previous paper "Multiplicity hunting and approximating multiple roots of polynomial systems" written by the two authors.
A collection of algorithms is described for numerically computing with smooth functions defined on the unit disk. Low rank approximations to functions in polar geometries are formed by synthesizing the disk analogue of the double Fourier…
We give formulas for the second and third integral homology of an arbitrary finitely generated Coxeter group, solely in terms of the corresponding Coxeter diagram. The first of these calculations refines a theorem of Howlett, while the…
An elementary approach to the construction of Coxeter group representations is presented.
These notes give a short introduction to finite Coxeter groups, their classification, and some parts of their representation theory, with a focus on the infinite families. They are based on lectures delivered by the author at the…
We further develop the group-theoretic approach to fast matrix multiplication introduced by Cohn and Umans, and for the first time use it to derive algorithms asymptotically faster than the standard algorithm. We describe several families…
In paper a new definition of reduced Pade approximant and algorithm for its computing is proposed. Our approach is based on the investigation of the kernel structure of the Toeplitz matrix. It is shown that the reduced Pade approximant…
Pseudo panels constituted with repeated cross-sections are good substitutes to true panel data. But individuals grouped in a cohort are not the same for successive periods, and it results in a measurement error and inconsistent estimators.…
We refine the infinitesimal Hecke algebra associated to a 2-reflection group into a $\Z/2\Z$-graded Lie algebra, as a first step towards a global understanding of a natural $\mathbbm{N}$-graded object. We provide an interpretation of this…
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…
We present a general diagrammatic approach to the construction of efficient algorithms for computing a Fourier transform on a semisimple algebra. This extends previous work wherein we derive best estimates for the computation of a Fourier…
In any Coxeter group, the conjugates of elements in its Coxeter generating set are called reflections and the reflection length of an element is its length with respect to this expanded generating set. In this article we give a simple…
We show that all groups in a very large class of Coxeter groups are locally quasiconvex and have uniform membership problem solvable in quadratic time. If a group in the class satisfies a further hypothesis it is subgroup separable and…
We settle a long-standing problem in the theory of Hecke algebras of complex reflection groups by constructing many (graded) integral cellular bases of these algebras. As applications, we explicitly construct the simple modules of Ariki's…
In this sixth part we study rank $3$ reflection groups not well generated: $G(2r,r,2)$, $G_{12}$, $G_{13}$ and $G_{22}$. We start from a reflection representation of a rank $3$ Coxeter group and we show that we can obtain in this manner…
In this extended abstract we announce a proof that, in a Coxeter group of rank 3, low elements are in bijection with small inversion sets. This gives a partial confirmation of Conjecture 2 in [Dyer, Hohlweg '16]. That same article provides…
Coxeter groups possess an associative operation, called variously the Demazure, greedy, or $0$-Hecke product. For symmetric groups, this product has an amusing formulation as matrix multiplication in the min-plus (tropical) semiring of two…
We review the properties of the finite Coxeter groups which are most useful for applications to cohomological invariants, namely their classes of involutions and their "cubes" (abelian subgroups generated by reflections).
In this paper we prove a series of matching theorems for two sets of Coxeter generators of a finitely generated Coxeter group that identify common features of the two sets of generators. As an application, we describe an algorithm for…
The invariants of finite-dimensional representations of simple Lie algebras, such as even-degree indices and anomaly numbers, are considered in the context of the non-crystallographic finite reflection groups $H_2$, $H_3$ and $H_4$. Using a…