Related papers: Association schemes on triples over few vertices

This study addresses a distributed optimization with a novel class of coupling of variables, called clique-wise coupling. A clique is a node set of a complete subgraph of an undirected graph. This setup is an extension of pairwise coupled…

Several methods for generating random Steiner triple systems (STSs) have been proposed in the literature, such as Stinson's hill-climbing algorithm and Cameron's algorithm, but these are not yet completely understood. Those algorithms, as…

We classify the Q-polynomial association schemes with $m_{1} = 4$ which are partially metric with respect to the nearest neighbourhood relation. An association scheme is partially metric with respect to a relation $R_1$ if the scheme graph…

A procedure for the construction and the classification of multilattices in arbitrary dimension is proposed. The algorithm allows to determine explicitly the location of the points of a multilattice given its space group, and to determine…

Steiner triple systems form one of the most studied classes of combinatorial designs. Configurations, including subsystems, play a central role in the investigation of Steiner triple systems. With sporadic instances of small systems, ad-hoc…

We give three constructions of three-class association schemes as fusion schemes of the cyclotomic scheme, two of which are primitive

We show that for any n divisible by 3, almost all order-n Steiner triple systems have a perfect matching (also known as a parallel class or resolution class). In fact, we prove a general upper bound on the number of perfect matchings in a…

There exists two types of nonassociative algebras whose associator satisfies a symmetric relation associated with a 1-dimensional invariant vector space with respect to the natural action of the symmetric group on three elements. The first…

We propose in this paper a unifying scheme for several algorithms from the literature dedicated to the solving of monotone inclusion problems involving compositions with linear continuous operators in infinite dimensional Hilbert spaces. We…

Bipartite Correlation clustering is the problem of generating a set of disjoint bi-cliques on a set of nodes while minimizing the symmetric difference to a bipartite input graph. The number or size of the output clusters is not constrained…

Schemes for exact multiplication of small matrices have a large symmetry group. This group defines an equivalence relation on the set of multiplication schemes. There are algorithms to decide whether two schemes are equivalent. However, for…

Trialitarian triples are triples of central simple algebras of degree 8 with orthogonal involution that provide a convenient structure for the representation of trialitarian algebraic groups as automorphism groups. This paper explicitly…

Alternating Sign Matrix(ASM for short) is a square matrix which is consist of 0, 1 and -1. In this paper, we characterize an ASM by showing a bijection between alternating sign matrix and six vertex model, and a bijection between six vertex…

In this paper, a class of statistics named ART (the alternant recursive topology statistics) is proposed to measure the properties of correlation between two variables. A wide range of bi-variable correlations both linear and nonlinear can…

In this paper we present a complete classification (isomorphism classes with some isomorphism invariants) of complex associative algebras up to dimension five (including both cases: unitary and non-unitary). In some symbolic computations we…

Applying results from partial difference sets, quadratic forms, and recent results of Brouwer and Van Dam, we construct the first known amorphic association scheme with negative Latin square type graphs and whose underlying set is a…

This paper describes a new algorithm - P&A algorithm - utilized in identifying overlapping communities in non oriented valued graph regardless of their number or their size. The complexity of this algorithm is minimal in the matter that the…

A simple but efficient spectral approach for analyzing the community structure of complex networks is introduced. It works the same way for all types of networks, by spectrally splitting the adjacency matrix into a "unipartite" and a…

Matrices are two-dimensional data structures allowing one to conceptually organize information. For example, adjacency matrices are useful to store the links of a network; correlation matrices are simple ways to arrange gene co-expression…

The emergence of massive graph data sets requires fast mining algorithms. Centrality measures to identify important vertices belong to the most popular analysis methods in graph mining. A measure that is gaining attention is forest…