Related papers: Association schemes and Hypergroups
Classical finite association schemes lead to a finite-dimensional algebras which are generated by finitely many stochastic matrices. Moreover, there exist associated finite hypergroups. The notion of classical discrete association schemes…
The theory of classical realizability is a framework in which we can develop the proof-program correspondence. Using this framework, we show how to transform into programs the proofs in classical analysis with dependent choice and the…
In this paper, we show how certain three-class association schemes and orthogonal arrays give rise to partial geometric designs. We also investigate the connections between partial geometric designs and certain regular graphs having three…
We prove that the set of non-degenerate second order maximally superintegrable systems in the complex Euclidean plane carries a natural structure of a projective variety, equipped with a linear isometry group action. This is done by…
In this paper, we study the category of trigroups as a generalization of the notion of digroup [4] and analyze their relationship with 3-racks [1] and Leibniz 3-algebras [6]. Trigroups are essentially associative trioids in which there are…
We give an elementary construction of polyhedra whose links are connected bipartite graphs, which are not necessarily isomorphic pairwise. We show, that the fundamental groups of some of our polyhedra contain surface groups. In particular,…
We study the collection of group structures that can be realized as a group of rational points on an elliptic curve over a finite field (such groups are well known to be of rank at most two). We also study various subsets of this collection…
We discuss the isomorphism problem of projective schemes; given two projective schemes, can we algorithmically decide whether they are isomorphic? We give affirmative answers in the case of one-dimensional projective schemes, the case of…
A relation algebra is called measurable when its identity is the sum of measurable atoms, and an atom is called measurable if its square is the sum of functional elements. In this paper we show that atomic measurable relation algebras have…
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
We introduce the separating semigroup of a real algebraic curve of dividing type. The elements of this semigroup record the possible degrees of the covering maps obtained by restricting separating morphisms to the real part of the curve. We…
In this paper, we provide constructions to enumerate large numbers of CI-liaison classes. To this end, we introduce a liaison invariant and prove several results concerning it, notably that it commutes with hypersurface sections. This…
We consider the problem of realizing a group as the fundamental group of a graph of groups where the vertex groups are restricted to certain classes (for example, coming from a certain finite list of groups, or having bounded geometric…
It is shown that in various categories, including many consisting of maps or hypermaps, oriented or unoriented, of a given hyperbolic type, every countable group $A$ is isomorphic to the automorphism group of uncountably many non-isomorphic…
We construct a wide subcategory of the category of finite association schemes with a collection of desirable properties. Our subcategory has a first isomorphism theorem analogous to that of groups. Also, standard constructions taking…
In the framework of algebraic supergeometry, we give a construction of the scheme-theoretic supergeometric analogue of Chevalley groups, namely affine algebraic supergroups associated to simple Lie superalgebras of classical type. In…
We construct a geometric system from which the Hall algebra can be recovered. This system inherently satisfies higher associativity conditions and thus leads to a categorification of the Hall algebra. We then suggest how to use this…
For any finite group $G$, and any positive integer $n$, we construct an association scheme which admits the diagonal group $D_n(G)$ as a group of automorphisms. The rank of the association scheme is the number of partitions of $n$ into at…
A perfect matching in a hypergraph is a set of edges that partition the set of vertices. We study the complexity of deciding the existence of a perfect matching in orderable and separable hypergraphs. We show that the class of orderable…
Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…