Related papers: Computation in Coxeter groups II. Minimal roots

Stirling numbers, which count partitions of a set and permutations in the symmetric group, have found extensive application in combinatorics, geometry, and algebra. We study analogues and q-analogues of these numbers corresponding to the…

We give a precise estimate for the number of lattice points in certain bounded subsets of $\mathbb{R}^{n}$ that involve `hyperbolic spikes' and occur naturally in multiplicative Diophantine approximation. We use Wilkie's o-minimal structure…

The goal of this paper is to refine some aspects of the cohomological study of Bruhat-Tits subgroups. It aims to complement the work done in the 1987 article. As an application, we obtain a result "\`a la Grothendieck-Serre" for Bruhat-Tits…

A polynomial time algorithm to give a complete description of all subfields of a given number field was given in an article by van Hoeij et al. This article reports on a massive speedup of this algorithm. This is primary achieved by our new…

Our main interest in this paper is to study some approximation problems for classes of functions with mixed smoothness. We use technique, based on a combination of results from hyperbolic cross approximation, which were obtained in 1980s --…

In [5] (=Terao, H.: Multiderivations of Coxeter arrangements. Inventiones math., 148 (2002) 659--674), we constructed a basis for the contact-order filtration of the module of derivations on the orbit space of a finite real reflection group…

The paper develops a method for discrete computational Fourier analysis of functions defined on quasicrystals and other almost periodic sets. A key point is to build the analysis around the emerging theory of quasicrystals and diffraction…

Learning rich and compact representations is an open topic in many fields such as object recognition or image retrieval. Deep neural networks have made a major breakthrough during the last few years for these tasks but their representations…

In this article, we establish some new combinatorial properties of cone types in Coxeter groups. Firstly, we show that for any element $x$ in a Coxeter group $W$ and root $\beta$ in its inversion set $\Phi(x)$, the set of elements $y \in W$…

This is an expository version of our paper [arXiv:1902.07384]. Our aim is to present recent Macaulay2 algorithms for computation of mixed multiplicities of ideals in a Noetherian ring which is either local or a standard graded algebra over…

We perform forward error analysis for a large class of recursive matrix multiplication algorithms in the spirit of [D. Bini and G. Lotti, Stability of fast algorithms for matrix multiplication, Numer. Math. 36 (1980), 63--72]. As a…

We give a presentation of a finite crystallographic reflection group in terms of an arbitrary seed in the corresponding cluster algebra of finite type and interpret the presentation in terms of companion bases in the associated root system.

We present a formula relating the set of left descents of an element of a Coxeter group with the sets of left descents of its projections on maximal quotients indexed by simple right descents. This formula is an instance of a general result…

We give a construction of an affine Hecke algebra associated to any Coxeter group acting on an abelian variety by reflections; in the case of an affine Weyl group, the result is an elliptic analogue of the usual double affine Hecke algebra.…

The paper derives new results on the marginal likelihood of a two-way table which clarify the conditions under which Ecological inference is possible and lead to an efficient algorithm for maximizing the exact multinomial likelihood. The…

The rich theory of Coxeter groups is used to provide an algebraic construction of finite volume hyperbolic n-manifolds. Combinatorial properties of finite images of these groups can be used to compute the volumes of the resulting manifolds.…

Coxeter groups are a special class of groups generated by involutions. They play important roles in the various areas of mathematics. This survey particularly focuses on how one uses Coxeter groups to construct interesting examples of…

In this paper, we describe a new algorithm to build a few sparse principal components from a given data matrix. Our approach does not explicitly create the covariance matrix of the data and can be viewed as an extension of the Kogbetliantz…

This paper introduces the theory and hardware implementation of two new algorithms for computing a single component of the discrete Fourier transform. In terms of multiplicative complexity, both algorithms are more efficient, in general,…

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…