Related papers: Super Hayashi Quandles
Consider a collection of finitely many polygons in $\mathbb C$, such that for each side of each polygon, there exists another side of some polygon in the collection (possibly the same) that is parallel and of equal length. A translation…
CLP(H) is an instantiation of the general constraint logic programming scheme with the constraint domain of hedges. Hedges are finite sequences of unranked terms, built over variadic function symbols and three kinds of variables: for terms,…
We introduce the notion of a quandle with a good involution and its homology groups. Carter et al. defined quandle cocycle invariants for oriented links and oriented surface-links. By use of good involutions, quandle cocyle invariants can…
We give a complete description of the associated group of any quandle as a central extension of the inner-automorphism group. As an application, we compute the second quandle homology groups of quandles of some families, including those of…
In this paper we study different questions concerning automorphisms of quandles. For a conjugation quandle $Q={\rm Conj}(G)$ of a group $G$ we determine several subgroups of ${\rm Aut}(Q)$ and find necessary and sufficient conditions when…
This thesis is split up into two parts: The first one concerns (pseudo)-holomorphic Hamiltonian systems, while the second part is about K\"ahler structures of complex coadjoint orbits. We begin the first part by investigating basic…
We undertake the study of profinite quandles. We provide several constructions of profinite quandles from profinite groups, and from other profinite quandle. We characterize which subquandles of profinite quandles are again profinite.…
Quandles can be regarded as generalizations of symmetric spaces. In the study of symmetric spaces, the notion of flatness plays an important role. In this paper, we define the notion of flat quandles, by referring to the theory of…
A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, these graphs are studied by presenting some examples and defining some of their sub-structures such as removable…
We establish a canonical correspondence between connected quandles and certain configurations in transitive groups, called quandle envelopes. This correspondence allows us to efficiently enumerate connected quandles of small orders, and…
Several important decision problems on conjunctive queries (CQs) are NP-complete in general but become tractable, and actually highly parallelizable, if restricted to acyclic or nearly acyclic queries. Examples are the evaluation of Boolean…
Clustering aims to group unlabelled samples based on their similarities. It has become a significant tool for the analysis of high-dimensional data. However, most of the clustering methods merely generate pseudo labels and thus are unable…
This work shows a study about the structure of the cycles contained in a Minimal Strong Digraph (MSD). The structure of a given cycle is determined by the strongly connected components (or strong components, SCs) that appear after…
Given a semigroup S with zero, which is left-cancellative in the sense that st=sr \neq 0 implies that t=r, we construct an inverse semigroup called the inverse hull of S, denoted H(S). When S admits least common multiples, in a precise…
Many networks in real-life typically contain parts in which some nodes are more highly connected to each other than the other nodes of the network. The collection of such nodes are usually called clusters, communities, cohesive groups or…
A thrackle is a drawing of a graph in which each pair of edges meets precisely once. Conway's Thrackle Conjecture asserts that a planar thrackle drawing of a graph cannot have more edges than vertices, which is equivalent to saying that no…
For a graph $G$ and partition $\mathcal{U}$ of its vertex set, an independent transversal of $(G, \mathcal{U})$ is an independent set of $G$ that contains one vertex from each block of $\mathcal{U}$. Buys, Kang, and Ozeki studied when a…
We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that…
We study Helly graphs of finite combinatorial dimension, i.e. whose injective hull is finite-dimensional. We describe very simple fine simplicial subdivisions of the injective hull of a Helly graph, following work of Lang. We also give a…
The Kaehler manifolds of quasi-constant holomorphic sectional curvatures are introduced as Kaehler manifolds with complex distribution of codimension two, whose holomorphic sectional curvature only depends on the corresponding point and the…