Related papers: Labelled well-quasi-order for permutation classes
We investigate the use of labelled graphs as a Morita equivalence invariant for inverse semigroups. We construct a labelled graph from a combinatorial inverse semigroup $S$ with $0$ admitting a special set of idempotent $\mathcal{D}$-class…
In semi-supervised learning, information from unlabeled examples is used to improve the model learned from labeled examples. In some learning problems, partial label information can be inferred from otherwise unlabeled examples and used to…
Chung and Graham define quasirandom subsets of $\mathbb{Z}_n$ to be those with any one of a large collection of equivalent random-like properties. We weaken their definition and call a subset of $\mathbb{Z}_n$ $\epsilon$-balanced if its…
Recent work has proven that training large language models with self-supervised tasks and fine-tuning these models to complete new tasks in a transfer learning setting is a powerful idea, enabling the creation of models with many…
We use quasi-orders to describe the structure of C-groups. We do this by associating a quasi-order to each compatible C-relation of a group, and then give the structure of such quasi-ordered groups. We also reformulate in terms of…
Comparability graphs are a popular class of graphs. We introduce as the digraph analogue of comparability graphs the class of comparability digraphs. We show that many concepts such as implication classes and the knotting graph for a…
Man\v{c}inska and Roberson introduced quantum graph homomorphisms as the existence of perfect quantum strategies for graph homomorphism games. The resulting relation is a quasi-order on finite graphs, and hence gives a partial order after…
This work studies how a suitably-designed classical system generates with a quantum-like (QL) state space mediated by a graph. The graph plays a special dual role by directing the topology of the classical network and defining a state space…
In this work, we address semi-supervised classification of graph data, where the categories of those unlabeled nodes are inferred from labeled nodes as well as graph structures. Recent works often solve this problem via advanced graph…
Semi-supervised learning methods are usually employed in the classification of data sets where only a small subset of the data items is labeled. In these scenarios, label noise is a crucial issue, since the noise may easily spread to a…
The exchange graph of a cluster algebra encodes the combinatorics of mutations of clusters. Through the recent "categorifications" of cluster algebras using representation theory one obtains a whole variety of exchange graphs associated…
We develop a theory of ordered *-vector spaces with an order unit. We prove fundamental results concerning positive linear functionals and states, and we show that the order (semi)norm on the space of self-adjoint elements admits multiple…
Few-shot node classification is tasked to provide accurate predictions for nodes from novel classes with only few representative labeled nodes. This problem has drawn tremendous attention for its projection to prevailing real-world…
A permutation graph is the intersection graph of a set of segments between two parallel lines. In other words, they are defined by a permutation $\pi$ on $n$ elements, such that $u$ and $v$ are adjacent if an only if $u<v$ but…
We refine the construction of quasi-homomorphisms on mapping class groups. It is useful to know that there are unbounded quasi-homomorphisms which are bounded when restricted to particular subgroups since then one deduces that the mapping…
Open-world semi-supervised learning aims at inferring both known and novel classes in unlabeled data, by harnessing prior knowledge from a labeled set with known classes. Despite its importance, there is a lack of theoretical foundations…
Label propagation is an essential semi-supervised learning method based on graphs, which has a broad spectrum of applications in pattern recognition and data mining. This paper proposes a quantum semi-supervised classifier based on label…
Dlab and Ringel showed that algebras being quasi-hereditary in all total orders for indices of primitive idempotents becomes hereditary. So, we are interested in for which orders a given quasi-hereditary algebra is again quasi-hereditary.…
An ordered semiring is a commutative semiring equipped with a compatible preorder. Ordered semirings generalise both distributive lattices and commutative rings, and provide a convenient framework to unify certain aspects of lattice theory…
We introduce sound and complete labelled sequent calculi for the basic normal non-distributive modal logic L and some of its axiomatic extensions, where the labels are atomic formulas of the first order language of enriched formal contexts,…