Related papers: Generalized Clustering Conditions of Jack Polynomi…

We study the $c$-vectors, $g$-vectors, and $F$-polynomials for generalized cluster algebras satisfying a normalization condition and a power condition recovering classical recursions and separation of additions formulas. We establish a…

It is an open question whether the fractional parts of nonlinear polynomials at integers have the same fine-scale statistics as a Poisson point process. Most results towards an affirmative answer have so far been restricted to almost sure…

The $\ell_2^2$ min-sum $k$-clustering problem is to partition an input set into clusters $C_1,\ldots,C_k$ to minimize $\sum_{i=1}^k\sum_{p,q\in C_i}\|p-q\|_2^2$. Although $\ell_2^2$ min-sum $k$-clustering is NP-hard, it is not known whether…

With the aim of derive a quasi-monomiality formulation in the context of discrete hypercomplex variables, one will amalgamate through a Clifford-algebraic structure of signature $(0,n)$ the umbral calculus framework with Lie-algebraic…

A classic result by Carbery and Wright states that a polynomial of Gaussian random variables exhibits anti-concentration in the following sense: for any degree $d$ polynomial $f$, one has the estimate $P( |f(x)| \leq \varepsilon \cdot…

The family of "Jack states" related to antisymmetric Jack polynomials are the exact zero-energy ground states of particular model short-range {\em many-body} repulsive interactions, defined by a few non-vanishing leading pseudopotentials.…

Let $p$ be a prime, and let $f(x)$ be an integer-valued polynomial. By a combinatorial approach, we obtain a nontrivial lower bound of the $p$-adic order of the sum $$\sum_{k=r(mod p^{\beta})}\binom{n}{k}(-1)^k f([(k-r)/p^{\alpha}]),$$…

Coefficients of super Jacobi polynomials of type $B(1,n)$ are rational functions in three parameters $k,p,q$. At the point $(-1,0,0)$ these coefficient may have poles. Let us set $q=0$ and consider pair $(k,p)$ as a point of $\Bbb A^2$. If…

We give a quantitative analysis of clustering in a stochastic model of one-dimensional gas. At time zero, the gas consists of $n$ identical particles that are randomly distributed on the real line and have zero initial speeds. Particles…

We show that for Gaussian random SU(m+1) polynomials of a large degree N the probability that there are no zeros in the disk of radius r is less than $e^{-c_{1,r} N^{m+1}}$, and is also greater than $e^{-c_{2,r} N^{m+1}}$. Enroute to this…

We show that $0,1$-polynomials of high degree and few terms are irreducible with high probability. Formally, let $k\in\mathbb{N}$ and $F(x)=1+\sum_{i=1}^kx^{n_i}$, where $ 0<n_1<\cdots<n_k\leq N. $ Then we show that…

We prove many factorization formulas for highest weight Macdonald polynomials indexed by particular partitions called quasistaircases. As a consequence we prove a conjecture of Bernevig and Haldane stated in the context of the fractional…

There is growing empirical evidence that spherical $k$-means clustering performs well at identifying groups of concomitant extremes in high dimensions, thereby leading to sparse models. We provide one of the first theoretical results…

For two collections of nonnegative and suitably normalised weights $\W=(\W_j)$ and $\V=(\V_{n,k})$, a probability distribution on the set of partitions of the set $\{1,...,n\}$ is defined by assigning to a generic partition $\{A_j, j\leq…

The nuclear equation of state is explored with the constrained HFB approach for self conjugate nuclei. It is found that beyond a certain low, more or less universal density, those nuclei spontaneously cluster into A/4 alpha particles with A…

For any fixed positive integer $k$, let $\alpha_{k}$ denote the smallest $\alpha \in (0,1)$ such that the random graph sequence $\left\{G\left(n, n^{-\alpha}\right)\right\}$ does not satisfy the zero-one law for the set $\mathcal{E}_{k}$ of…

We study the problem of obtaining lower bounds for polynomial calculus (PC) and polynomial calculus resolution (PCR) on proof degree, and hence by [Impagliazzo et al. '99] also on proof size. [Alekhnovich and Razborov '03] established that…

We obtain a family of polynomials defined by vanishing conditions and associated to tangles. We study more specifically the case where they are related to a O(n) loop model. We conjecture that their specializations at $z_i=1$ are {\it…

We study the coefficients in the expansion of Jack polynomials in terms of power sums. We express them as polynomials in the free cumulants of the transition measure of an anisotropic Young diagram. We conjecture that such polynomials have…

The objective of clustering is to discover natural groups in datasets and to identify geometrical structures which might reside there, without assuming any prior knowledge on the characteristics of the data. The problem can be seen as…