Related papers: Generalized Clustering Conditions of Jack Polynomi…

This paper provides a theoretical explanation on the clustering aspect of nonnegative matrix factorization (NMF). We prove that even without imposing orthogonality nor sparsity constraint on the basis and/or coefficient matrix, NMF still…

The paper introduces the concept of a cluster structure to define a joint distribution of the sample size and its exchangeable random partitions. The cluster structure allows the probability distribution of the random partitions of a subset…

We introduce the notion of a lower bound cluster algebra generated by projective cluster variables as a polynomial ring over the initial cluster variables and the so-called projective cluster variables. We show that under an acyclicity…

In this paper we study the orthogonality conditions satisfied by Jacobi polynomials $P_n^{(\alpha,\beta)}$ when the parameters $\alpha$ and $\beta$ are not necessarily $>-1$. We establish orthogonality on a generic closed contour on a…

We consider fractional quantum Hall states built on Laughlin's original N-body wave-functions, i.e., they are of the form holomorphic times gaussian and vanish when two particles come close, with a given polynomial rate. Such states appear…

The aim of the present paper is to introduce a generalized quantum cluster character, which assigns to each object V of a finitary Abelian category C over a finite field FF_q and any sequence ii of simple objects in C the element X_{V,ii}…

We prove a sufficient condition for a finite clique complex to collapse to a $k$-dimensional complex, and use this to exhibit thresholds for $(k+1)$-collapsibility in a sparse random clique complex. In particular, if every strongly…

We introduce the aggregated clustering problem, where one is given $T$ instances of a center-based clustering task over the same $n$ points, but under different metrics. The goal is to open $k$ centers to minimize an aggregate of the…

Our goal is to settle the following faded problem: The Jacobian Conjecture (JC_n): If f_1,..,f_n are elements in a polynomial ring k[X_1,..,X_n] over a field k of characteristic 0 such that det(\partial f_i/ \partial X_j) is a nonzero…

Let $f,g_1,\dots,g_m$ be polynomials of degree at most $d$ with real coefficients in a vector of variables $x=(x_1,\dots,x_n)$. Assume that $f$ is non-negative on a basic semi-algebraic set $S$ defined by polynomial inequalities $g_j(x)\ge…

The Hamiltonian of the quantum Calogero-Sutherland model of $N$ identical particles on the circle with $1/r^{2}$ interactions has eigenfunctions consisting of Jack polynomials times the base state. By use of the generalized Jack polynomials…

The kernel polynomial method based on Jacobi polynomials $P_n^{\alpha,\beta}(x)$ is proposed. The optimal-resolution positivity-preserving kernels and the corresponding damping factors are obtained. The results provide a generalization of…

In this paper, we discuss the relations between the Jack polynomials, $\hbar$-dependent KP hierarchy and affine Yangian of ${\mathfrak{gl}}(1)$. We find that $\alpha=\hbar^2$ and $h_1=\hbar, \ h_2=-\hbar^{-1}$, where $\alpha$ is the…

A new procedure for simultaneously finding the optimal cluster structure of multivariate functional objects and finding the subspace to represent the cluster structure is presented. The method is based on the $k$-means criterion for…

In this work, we introduce a natural notion concerning finite vector spaces. A family of $k$-dimensional subspaces of $\mathbb{F}_q^n$, which forms a partial spread, is called almost affinely disjoint if any $(k+1)$-dimensional subspace…

In a sequence of seminal results in the 80's, Kaltofen showed that the complexity class VP is closed under taking factors. A natural question in this context is to understand if other natural classes of multivariate polynomials, for…

For every natural number k we prove a decomposition theorem for bounded measurable functions on compact abelian groups into a structured part, a quasi random part and a small error term. In this theorem quasi randomness is measured with the…

Given a sparse undirected graph G with weights on the edges, a k-plex partition of G is a partition of its set of nodes such that each component is a k-plex. A subset of nodes S is a k-plex if the degree of every node in the associated…

Number of zeros seen by a particle around small clusters of other particles is encoded in the root partition, and partly characterizes the correlations in fractional quantum Hall trial wavefunctions. We explore a generalization wherein we…

Let K be F_q((T)), or more generally any field of characteristic p equipped with a valuation having a finite residue field of q elements. Then a polynomial f(x) in K[x] having k+1 nonzero coefficients has at most q^k distinct zeros in K. We…