Related papers: Big data approach to Kazhdan-Lusztig polynomials

We generalize a construction of Dunkl, obtaining a wide class intertwining functions on the symmetric group and a related family of multidimensional Hahn polynomials. Following a suggestion of Vilenkin and Klymik, we develop a tree-method…

Phylogenetic models have polynomial parametrization maps. For symmetric group-based models, Matsen studied the polynomial inequalities that characterize the joint probabilities in the image of these parametrizations. We employ this…

We compute the dimensions of the Hochschild cohomology of symmetric groups over prime fields in low degrees. This involves us in studying some partition identities and generating functions of the dimensions in any fixed degree of the…

In this note we develop a systematic combinatorial definition for constructed earlier supersymmetric polynomial families. These polynomial families generalize canonical Schur, Jack and Macdonald families so that the new polynomials depend…

Big data, with NxP dimension where N is extremely large, has created new challenges for data analysis, particularly in the realm of creating meaningful clusters of data. Clustering techniques, such as K-means or hierarchical clustering are…

For a composition $\lambda$ of $n$ we consider the Kazhdan-Lusztig cell in the symmetric group $S_n$ containing the longest element of the standard parabolic subgroup of $S_n$ associated to $\lambda$. In this paper we extend some of the…

Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups preserving the linear, projective and combinatorial…

The advent of the big data paradigm has transformed how industries manage and analyze information, ushering in an era of unprecedented data volume, velocity, and variety. Within this landscape, mixed-data clustering has become a critical…

We construct a complex $\mathcal{L}_\bullet^\lambda$ resolving the irreducible representations $\mathcal{S}^{\lambda[n]}$ of the symmetric groups $S_n$ by representations restricted from $GL_n(k)$. This construction lifts to…

This paper introduces {\em fusion subspace clustering}, a novel method to learn low-dimensional structures that approximate large scale yet highly incomplete data. The main idea is to assign each datum to a subspace of its own, and minimize…

In this paper we study various approaches for exploiting symmetries in polynomial optimization problems within the framework of semi definite programming relaxations. Our special focus is on constrained problems especially when the…

We survey the theory of totally symmetric sets, with applications to homomorphisms of symmetric groups, braid groups, linear groups, and mapping class groups.

Clustering large, mixed data is a central problem in data mining. Many approaches adopt the idea of k-means, and hence are sensitive to initialisation, detect only spherical clusters, and require a priori the unknown number of clusters. We…

The simultaneous grouping of rows and columns is an important technique that is increasingly used in large-scale data analysis. In this paper, we present a novel co-clustering method using co-variables in its construction. It is based on a…

We apply big data techniques, including exploratory and topological data analysis, to investigate quantum invariants. More precisely, our study explores the Jones polynomial's structural properties and contrasts its behavior under four…

The discrete cosine transforms of types V--VIII are generalized to the antisymmetric and symmetric multivariate discrete cosine transforms. Four families of discretely and continuously orthogonal Chebyshev-like polynomials corresponding to…

Let Ln denote linear octagonal-quadrilateral networks. In this paper, we aim to firstly investigate the Laplacian spectrum on the basis of Laplacian polynomial of Ln. Then, by applying the relationship between the coefficients and roots of…

In this paper we show that the Kazhdan-Lusztig polynomials (and, more generally, parabolic KL polynomials) for the group $S_n$ coincide with the coefficients of the canonical basis in $n$th tensor power of the fundamental representation of…

Using resolutions of singularities introduced by Cortez and a method for calculating Kazhdan-Lusztig polynomials due to Polo, we prove the conjecture of Billey and Braden characterizing permutations w with Kazhdan-Lusztig polynomial…

Polypolyhedra are edge-transitive compounds of polyhedra. In this paper we use group theory to determine the number of distinct polypolyhedra whose symmetry group is any given finite irreducible Coxeter group. We apply this result in order…