Related papers: Big data approach to Kazhdan-Lusztig polynomials
In this paper, we focus on exploiting the group structure for large-dimensional factor models, which captures the homogeneous effects of common factors on individuals within the same group. In view of the fact that datasets in…
Two decades ago P. Martin and D. Woodcock made a surprising and prophetic link between statistical mechanics and representation theory. They observed that the decomposition numbers of the blob algebra (that appeared in the context of…
Hurwitz numbers count covers of curves satisfying fixed ramification data. Via monodromy representation, this counting problem can be transformed to a problem of counting factorizations in the symmetric group. This and other beautiful…
We use Kazhdan-Lusztig bases of representations of the symmetric group to express Pfaffians with entries $(a_i-a_j) h_{i+j}$. In the case where the parameters $a_i$ are specialized to successive powers of $q$, and the $h_i$ are complete…
There is considered the problem of describing up to linear conformal equivalence those harmonic cubic homogeneous polynomials for which the squared-norm of the Hessian is a nonzero multiple of the quadratic form defining the Euclidean…
We study multiple orthogonal polynomials exploiting their explicit determinantal representation in terms of moments. Our reasoning follows that applied to solve the Hermite-Pad\'{e} approximation and interpolation problems. We study also…
We introduce and study symmetric polynomials, which as very special cases include polynomials related to the supersymmetric eight-vertex model, and other elliptic lattice models with $\Delta=\pm 1/2$. There is also a close relation to…
In this article, we survey the the recent literature surrounding the geometry of complex polynomials. Specific areas surveyed are i) Generalizations of the Gauss--Lucas Theorem, ii) Geometry of Polynomials Level Sets, and iii) Shape…
After a quick review of the representation theory of the symmetric group, we give an exposition of the tools brought about by the so-called half-infinite wedge representation of the infinite symmetric group. We show how these can be applied…
We develop some applications of certain algebraic and combinatorial conditions on the elements of Coxeter groups, such as elementary proofs of the positivity of certain structure constants for the associated Kazhdan--Lusztig basis. We also…
The parabolic Kazhdan-Lusztig polynomials for Grassmannians can be computed by counting Dyck partitions. We "lift" this combinatorial formula to the corresponding category of singular Soergel bimodules to obtain bases of the Hom spaces…
Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials;…
We consider two families of polynomials that play the same role in the Temperley Lieb algebra of a Coxeter group as the Kazhdan Lusztig and R polynomials play in the Hecke algebra of the group. We study these polynomials from a…
In this paper we define a two-variable, generic Hecke algebra, H, for each complex reflection group G(b,1,n). The algebra H specializes to the group algebra of G(b,1,n) and also to an endomorphism algebra of a representation of GL(n,q)…
This paper deals with the problem of finding, for a given graph and a given natural number k, a subgraph of k nodes with a maximum number of edges. This problem is known as the k-cluster problem and it is NP-hard on general graphs as well…
Many methods have been developed for data clustering, such as k-means, expectation maximization and algorithms based on graph theory. In this latter case, graphs are generally constructed by taking into account the Euclidian distance as a…
Cluster algebras are a recent topic of study and have been shown to be a useful tool to characterize structures in several knowledge fields. An important problem is to establish whether or not a given cluster algebra is of finite type.…
We show that parabolic Kazhdan-Lusztig polynomials of type $A$ compute the decomposition numbers in certain Harish-Chandra series of unipotent characters of finite groups of Lie types $B$, $C$ and $D$ over a field of non-defining…
We present an algorithm for solving the conjugacy search problem in the four strand braid group. The computational complexity is cubic with respect to the braid length.
This paper presents a comparative analysis of different optimization techniques for the K-means algorithm in the context of big data. K-means is a widely used clustering algorithm, but it can suffer from scalability issues when dealing with…