Related papers: Character-theoretic Techniques for Near-central En…

For a simple Lie algebra g we consider an analogue of the affine algebra ^gk with n singularities, defined starting from the ring of functions on the n-pointed disk. We study the center of its completed enveloping algebra and prove an…

In combinatorial group testing problems Questioner needs to find a special element $x \in [n]$ by testing subsets of $[n]$. Tapolcai et al. introduced a new model, where each element knows the answer for those queries that contain it and…

Let $\bar{G}$ be the simple algebraic supergroup $\mathrm{SL}(m|n)$ or $\mathrm{OSp}(m|2n)$ over $\mathbb{C}$. Let $\mathfrak{g}=\mathrm{Lie}(\bar{G})=\mathfrak{g}_{\bar{0}}\oplus\mathfrak{g}_{\bar{1}}$ and let $G=\bar{G}(\mathbb{C})$ where…

We apply the mechanism of factorization homology to construct and compute category-valued two-dimensional topological field theories associated to braided tensor categories, generalizing the $(0,1,2)$-dimensional part of…

In this paper we show that the center of the partition algebra $\mathcal{A}_{2k}(\delta)$, in the semisimple case, is given by the subalgebra of supersymmetric polynomials in the normalised Jucys-Murphy elements. For the non-semisimple…

We show that the classification of the symmetric spaces can be achieved by K-theoretical methods. We focus on Hermitian symmetric spaces of non-compact type, and define K-theory for JB*-triples along the lines of C*-theory. K-groups have to…

In a previous work we showcased the factorization method to find the symmetries of superintegrable systems with spherical separability in flat spaces. Here we analyze the same problem, but in constant curvature spaces along the examples of…

For a field $R$ of characteristic $p\ge 0$ and a matrix $c$ in the full $n\times n$ matrix algebra $M_n(R)$ over $R$, let $S_n(c,R)$ be the centralizer algebra of $c$ in $M_n(R)$. We show that $S_n(c,R)$ is a Frobenius-finite,…

We study the $\mathcal{F}$-center problem with outliers: given a metric space $(X,d)$, a general down-closed family $\mathcal{F}$ of subsets of $X$, and a parameter $m$, we need to locate a subset $S\in \mathcal{F}$ of centers such that the…

In the classic $k$-center problem, we are given a metric graph, and the objective is to open $k$ nodes as centers such that the maximum distance from any vertex to its closest center is minimized. In this paper, we consider two important…

In this article, we investigate the image and preimage of the important combinatorial sets such as central sets, $C$-sets, and $J_\delta$-sets which play an important role in the study of combinatorics under certain partial semigroup…

Spectral clustering has found extensive use in many areas. Most traditional spectral clustering algorithms work in three separate steps: similarity graph construction; continuous labels learning; discretizing the learned labels by k-means…

Many complex systems and datasets are characterized by multiway interactions of different categories, and can be modeled as edge-colored hypergraphs. We focus on clustering such datasets using the NP-hard edge-colored clustering problem,…

Regular $A_n$-, $B_n$- and $C_n$-crystals are edge-colored directed graphs, with ordered colors $1,2,...,n$, which are related to representations of quantized algebras $U_q(\mathfrak{sl}_{n+1})$, $U_q(\mathfrak{sp}_{2n})$ and…

Rank aggregation seeks a representative permutation for a collection of rankings and plays a central role in areas such as social choice, information retrieval, and computational biology. Two fundamental aggregation tasks are the center and…

The problem of interpolation at $(n+1)^2$ points on the unit sphere $\mathbb{S}^2$ by spherical polynomials of degree at most $n$ is proved to have a unique solution for several sets of points. The points are located on a number of circles…

A natural approach to analyze interaction data of form "what-connects-to-what-when" is to create a time-series (or rather a sequence) of graphs through temporal discretization (bandwidth selection) and spatial discretization (vertex…

The problem of estimating the number of clusters (say k) is one of the major challenges for the partitional clustering. This paper proposes an algorithm named k-SCC to estimate the optimal k in categorical data clustering. For the…

We define a general variant of the graph clustering problem where the criterion of density for the clusters is (high) connectivity. In {\sc Clustering to Given Connectivities}, we are given an $n$-vertex graph $G$, an integer $k$, and a…

We consider a generalized version of the correlation clustering problem, defined as follows. Given a complete graph $G$ whose edges are labeled with $+$ or $-$, we wish to partition the graph into clusters while trying to avoid errors: $+$…