相关论文: Decomposition numbers for finite Coxeter groups an…

Kamiya, Takemura, and Terao introduced a characteristic quasi-polynomial which enumerates the numbers of elements in the complement of hyperplane arrangements modulo positive integers. In this paper, we compute the characteristic…

In this paper, we decompose the set of fully commutative elements into natural subsets when the Coxeter group is of type $D_n$, and study the combinatorics of these subsets, revealing hidden structures. (We do not consider type $A_n$ first,…

We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings; that is, we study the number of ways a permutation can be decomposed into a product of a given number of 2-cycles, 3-cycles, etc.…

Consider an ideal $I \subset R = \bC[x_1,...,x_n]$ defining a complex affine variety $X \subset \bC^n$. We describe the components associated to $I$ by means of {\em numerical primary decomposition} (NPD). The method is based on the…

We calculate the decomposition series of the D-module defined as the push-forward of a rank one linear system on the complement of a normal crossings hyperplane configuration and use data of a resolution of singularities to give a…

We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies…

In this article we introduce the notion of a \textit{regular partition} of a Coxeter group. We develop the theory of these partitions, and show that the class of regular partitions is essentially equivalent to the class of automata (not…

Let W be an irreducible finitely generated Coxeter group. The geometric representation of W in GL(V) provides a discrete embedding in the orthogonal group of the Tits form (the associated bilinear form of the Coxeter group). If the Tits…

Arnold, Falk, & Winther, in "Finite element exterior calculus, homological techniques, and applications" (2006), show how to geometrically decompose the full and trimmed polynomial spaces on simplicial elements into direct sums of…

In a previous article by the author and P. Wesolek, it was shown that a compactly generated locally compact group $G$ admits a finite normal series $(G_i)$ in which the factors are compact, discrete or irreducible in the sense that no…

The tensor rank decomposition, or canonical polyadic decomposition, is the decomposition of a tensor into a sum of rank-1 tensors. The condition number of the tensor rank decomposition measures the sensitivity of the rank-1 summands with…

Tensor decompositions are promising tools for big data analytics as they bring multiple modes and aspects of data to a unified framework, which allows us to discover complex internal structures and correlations of data. Unfortunately most…

The notion of noncrossing partitions of a partially ordered set (poset) is introduced here. When the poset in question is $[n]=\{1,2,\dots, n\}$ with the complete order of natural numbers, conventional noncrossing partitions arise. The…

We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…

Inspired by the study of the minimal excludant in integer partitions by G.E. Andrews and D. Newman, we introduce a pair of new partition statistics, sqrank and rerank. They are related to a polynomial bosonic form of statistical…

Given a homogeneous component of an exterior algebra, we characterize those subspaces in which every nonzero element is decomposable. In geometric terms, this corresponds to characterizing the projective linear subvarieties of the Grassmann…

In this paper we prove, without the finite rank assumption, that any irreducible Coxeter group of infinite order is directly indecomposable as an abstract group. The key ingredient of the proof is that we can determine, for an irreducible…

We give efficient algorithms for finding power-sum decomposition of an input polynomial $P(x)= \sum_{i\leq m} p_i(x)^d$ with component $p_i$s. The case of linear $p_i$s is equivalent to the well-studied tensor decomposition problem while…

For any finite Coxeter system $(W,S)$ we construct a certain noncommutative algebra, so-called {\it bracket algebra}, together with a familiy of commuting elements, so-called {\it Dunkl elements.} Dunkl elements conjecturally generate an…

In this paper, we study a polynomial decomposition model that arises in problems of system identification, signal processing and machine learning. We show that this decomposition is a special case of the X-rank decomposition --- a powerful…