Related papers: Generalized Clustering Conditions of Jack Polynomi…

We describe a new formula for weight multiplicities and characters of semisimple Lie algebras. Our formula expresses these weight multiplicities as sums of positive rational numbers. In fact, the formula works more generally for the Jacobi…

We prove new formulas and congruences for $p(n,k):=$ the number of partitions of $n$ into $k$ parts and $q(n,k):=$ the number of partitions of $n$ into $k$ distinct parts. Also, we give lower and upper bounds for the density of the set…

Correlations in interacting many-particle systems can lead to the formation of clusters, in particular bound states and resonances. Systematic quantum statistical approaches allow to combine the nuclear statistical equilibrium description…

We study random partitions $\lambda=(\lambda_1,\lambda_2,...,\lambda_d)$ of $n$ whose length is not bigger than a fixed number $d$. Suppose a random partition $\lambda$ is distributed according to the Jack measure, which is a deformation of…

Clustering is an unsupervised learning task that aims to partition data into a set of clusters. In many applications, these clusters correspond to real-world constructs (e.g. electoral districts) whose benefit can only be attained by groups…

We develop a new algorithm for factoring a bivariate polynomial $F\in \mathbb{K}[x,y]$ which takes fully advantage of the geometry of the Newton polygon of $F$. Under a non degeneracy hypothesis, the complexity is…

We characterize mutation-finite cluster algebras of rank at least 3 using positive semi-definite quadratic forms. In particular, we associate with every unpunctured bordered surface a positive semi-definite quadratic space $V$, and with…

We introduce the $(p,q)$-Fair Clustering problem. In this problem, we are given a set of points $P$ and a collection of different weight functions $W$. We would like to find a clustering which minimizes the $\ell_q$-norm of the vector over…

We study the irreducibility of Wronskian Hermite polynomials labelled by partitions. It is known that these polynomials factor as a power of x times a remainder polynomial. We show that the remainder polynomial is irreducible for the…

Let ${\mathcal P}_k$ denote the set of all algebraic polynomials of degree at most $k$ with real coefficients. Let ${\mathcal P}_{n,k}$ be the set of all algebraic polynomials of degree at most $n+k$ having exactly $n+1$ zeros at $0$. Let…

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

We apply the Dunkl-Opdam operators and generalized Jack polynomials to study category O for the rational Cherednik algebra of type G(r,1,n). We determine the set of aspherical values, and answer a question of Iain Gordon on the ordering of…

Generalizing the notion of a multiplicative inequality among minors of a totally positive matrix, we describe, over full rank cluster algebras of finite type, the cone of Laurent monomials in cluster variables that are bounded as a…

Let $K\to L$ be an algebraic field extension and $\nu$ a valuation of $K$. The purpose of this paper is to describe the totality of extensions $\left\{\nu'\right\}$ of $\nu$ to $L$ using a refined version of MacLane's key polynomials. In…

We introduce a real-parameter refinement of the classical integer hierarchies underlying Schmidt number, block-positivity, and $k$-positivity for maps between matrix algebras. Starting from a compact family of $\alpha$-admissible unit…

We prove that the skein categories of Walker--Johnson-Freyd satisfy excision. This allows us to conclude that skein categories are $k$-linear factorisation homology and taking the free cocompletion of skein categories recovers locally…

For each pair of positive integers (k,r) such that k+1,r-1 are coprime, we introduce an ideal $I^{(k,r)}_n$ of the ring of symmetric polynomials. The ideal $I^{(k,r)}_n$ has a basis consisting of Jack polynomials with parameter…

Many clustering schemes are defined by optimizing an objective function defined on the partitions of the underlying set of a finite metric space. In this paper, we construct a framework for studying what happens when we instead impose…

We show that the problem of deciding positivity of Kronecker coefficients is NP-hard. Previously, this problem was conjectured to be in P, just as for the Littlewood-Richardson coefficients. Our result establishes in a formal way that…

Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…