Related papers: A note on clustered cells
We present the theory of higher order invariants and higher order automorphic forms in the simplest case, that of a compact quotient. In this case many things simplify and we are thus able to prove a more precise structure theorem than in…
A main task in data analysis is to organize data points into coherent groups or clusters. The stochastic block model is a probabilistic model for the cluster structure. This model prescribes different probabilities for the presence of edges…
This document is rather a course about groups than a research paper. However, it can be of interest for many master students in mathematics which are devoted to the p-group classification theory. This paper is inspirated of the course of…
We discuss arrangements of equal minors of totally positive matrices. More precisely, we investigate the structure of equalities and inequalities between the minors. We show that arrangements of equal minors of largest value are in…
We present an approach to model-based hierarchical clustering by formulating an objective function based on a Bayesian analysis. This model organizes the data into a cluster hierarchy while specifying a complex feature-set partitioning that…
The method of Hol\'y, Sokol and \v{C}ern\'y (Applied Soft Computing, 2017, Vol. 60, p. 752-762) clusters objects based on their incidence in a large number of given sets. The idea is to minimize the occurrence of multiple objects from the…
The well-known clustering algorithm of Miller, Peng, and Xu (SPAA 2013) is useful for many applications, including low-diameter decomposition and low-energy distributed algorithms. One nice property of their clustering, shown in previous…
These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…
Decomposable ordered structures were introduced in \cite{OnSt} to develop a general framework to study `finite-dimensional' totally ordered structures. This paper continues this work to include decomposable structures on which a ordered…
We consider a generalized version of the correlation clustering problem, defined as follows. Given a complete graph $G$ whose edges are labeled with $+$ or $-$, we wish to partition the graph into clusters while trying to avoid errors: $+$…
We introduce quasi-homomorphisms of cluster algebras, a flexible notion of a map between cluster algebras of the same type (but with different coefficients). The definition is given in terms of seed orbits, the smallest equivalence classes…
The first-order model theory of modules has been studied for decades. More recently, the model theoretic study of nonelementary classes of modules--especially Abstract Elementary Classes of modules--has produced interesting results. This…
This paper adresses two issues in dealing with bicategories of fractions. The first is to introduce a set of conditions on a class of arrows in a bicategory which is weaker than the one given in Pronk, Etendues and stacks as bicategories of…
The explosion in the amount of data available for analysis often necessitates a transition from batch to incremental clustering methods, which process one element at a time and typically store only a small subset of the data. In this paper,…
The main goal of this paper is to show that the (multi-homogeneous) coordinate ring of a partial flag variety $\mathbb{C} [G / P_K^{-}]$ admits a cluster algebra structure if $G$ is any simply-connected semisimple complex algebraic group.…
This thesis proposes a framework based on a notion of combinatorial cell complex (cc) whose cells are defined simply as finite sets of vertices. The cells of a cc are subject to four axioms involving a rank function that assigns a rank (or…
We give a short and self-contained proof of the Marker-Steinhorn Theorem for o-minimal expansions of ordered groups, based on an analysis of linear orders definable in such structures.
Polar orderings arose in recent work of Salvetti and the second author on minimal CW-complexes for complexified hyperplane arrangements. We study the combinatorics of these orderings in the classical framework of oriented matroids, and…
We study the version of the C-Planarity problem in which edges connecting the same pair of clusters must be grouped into pipes, which generalizes the Strip Planarity problem. We give algorithms to decide several families of instances for…
The paper tackles the problem of clustering multiple networks, directed or not, that do not share the same set of vertices, into groups of networks with similar topology. A statistical model-based approach based on a finite mixture of…