Related papers: K-Knuth Equivalence for Increasing Tableaux
In this paper we study pattern-replacement equivalence relations on the set $S_n$ of permutations of length $n$. Each equivalence relation is determined by a set of patterns, and equivalent permutations are connected by pattern-replacements…
A subsequence of a word $w$ is a word $u$ such that $u = w[i_1] w[i_2] , \dots w[i_{|u|}]$, for some set of indices $1 \leq i_1 < i_2 < \dots < i_k \leq |w|$. A word $w$ is $k$-subsequence universal over an alphabet $\Sigma$ if every word…
Integrating Large Language Models (LLMs) in Intelligent Tutoring Systems (ITS) presents transformative opportunities for personalized education. However, current implementations face two critical challenges: maintaining factual accuracy and…
This paper investigates the class of k-universal finite graphs, a local analog of the class of universal graphs, which arises naturally in the study of finite variable logics. The main results of the paper, which are due to Shelah,…
Word representations are created using analogy context-based statistics and lexical relations on words. Word representations are inputs for the learning models in Natural Language Understanding (NLU) tasks. However, to understand language,…
Contextual word representations, typically trained on unstructured, unlabeled text, do not contain any explicit grounding to real world entities and are often unable to remember facts about those entities. We propose a general method to…
In 1991 H\'ebrard introduced a factorization of words that turned out to be a powerful tool for the investigation of a word's scattered factors (also known as (scattered) subwords or subsequences). Based on this, first Karandikar and…
A key fact about M.-P. Sch\"{u}tzenberger's (1972) promotion operator on rectangular standard Young tableaux is that iterating promotion once per entry recovers the original tableau. For tableaux with strictly increasing rows and columns,…
We construct Kn\"orrer type equivalences outside of the hypersurface case, namely, between singularity categories of cyclic quotient surface singularities and certain finite dimensional local algebras. This generalises Kn\"orrer's…
We address the challenge of building domain-specific knowledge models for industrial use cases, where labelled data and taxonomic information is initially scarce. Our focus is on inductive link prediction models as a basis for practical…
We prove that if two nonzero homomorphisms from the Cuntz algebra O_infinity to a purely infinite simple C*-algebra have the same class in KK-theory, and if either both are unital or both are nonunital, then they are approximately unitarily…
Table entailment, the binary classification task of finding if a sentence is supported or refuted by the content of a table, requires parsing language and table structure as well as numerical and discrete reasoning. While there is extensive…
We give a systematic account of the various pictures of KK-theory for real C*-algebras, proving natural isomorphisms between the groups that arise from each picture. As part of this project, we develop the universal properties of KK-theory,…
We study the Kawai-Lewellen-Tye (KLT) relations for quantum field theory by reformulating it as an isomorphism between two Lie algebras. We also show how explicit formulas for KLT relations arise when studying rational functions on…
In arXiv:1808.06095 we have introduced the Knuth class of the word recording a sequence of locations for repeated internal insertion operations in the Sagan-Stanley skew RSK correspondence, with no prescribed external insertion of new…
We introduce a new centrality index for bipartite network of papers and authors that we call $K$-index. The $K$-index grows with the citation performance of the papers that cite a given researcher and can seen as a measure of scientific…
We study the complexity of the $KK$-equivalence relation on unital $C^*$-algebras, in the sense of descriptive set theory. We prove that $KK$-equivalence is analytic, which in turn shows that the set of separable $C^*$-algebras satisfying…
Schensted row insertion is a fundamental component of the Robinson-Schensted-Knuth (RSK) algorithm, a powerful tool in combinatorics and representation theory. This study examines the insertion of a deterministic number into a random…
Comparison and evaluation of graph-based representations of sentence meaning is a challenge because competing representations of the same sentence may have different number of nodes, and it is not obvious which nodes should be compared to…
Clustering is a fundamental task in unsupervised learning. Previous research has focused on learning-augmented $k$-means in Euclidean metrics, limiting its applicability to complex data representations. In this paper, we generalize…