Related papers: Degenerating families of dendrograms
After introducing some motivations for this survey, we describe a formalism to parametrize a wide class of algebraic structures occurring naturally in various problems of topology, geometry and mathematical physics. This allows us to define…
We introduce a family of adic transformations on diagrams that are nonstationary and nonsimple. This family includes some previously studied adic transformations. We relate the dimension group of each these diagrams to the dynamical system…
For finite-dimensional Hopf algebras, their classification in characteristic $0$ (e.g. over $\mathbb{C}$) has been investigated for decades with many fruitful results, but their structures in positive characteristic have remained elusive.…
We introduce a new class of algebras, which we call cluster-tilted. They are by definition the endomorphism algebras of tilting objects in a cluster category. We show that their representation theory is very close to the representation…
In this paper, we devote to extending structures for dendriform algebras. First, we define extending datums and unified products of dendriform algebras, and theoretically solve the extending structure problem. As an application, we consider…
In this paper, we use the theory of Riordan matrices to introduce the notion of a Riordan graph. The Riordan graphs are a far-reaching generalization of the well known and well studied Pascal graphs and Toeplitz graphs, and also some other…
We construct a derived variant of Emerton's eigenvarieties using the locally analytic representation theory of $p$-adic groups. The main innovations include comparison and exploitation of two homotopy equivalent completed complexes…
The action of a finite reflection group (type A) on its set of roots is understood as a permutation representation or group action. We show that this representation is an induced representation from a certain kind of parabolic subgroup.…
Decompositions of networks are useful not only for structural exploration. They also have implications and use in analysis and computational solution of processes (such as the Ising model, percolation, SIR model) running on a given network.…
We show that all finite dimensional pointed Hopf algebras with the same diagram in the classification scheme of Andruskiewitsch and Schneider are cocycle deformations of each other. This is done by giving first a suitable characterization…
Complex systems are made up of many interacting components. Network science provides the tools to analyze and understand these interactions. Community detection is a key technique in network science for uncovering the structures that shape…
A method of {\it topological grammars} is proposed for multidimensional data approximation. For data with complex topology we define a {\it principal cubic complex} of low dimension and given complexity that gives the best approximation for…
Additive deformations of bialgebras in the sense of Wirth are deformations of the multiplication map of the bialgebra fulfilling a compatibility condition with the coalgebra structure and a continuity condition. Two problems concerning…
An ultrametric topology formalizes the notion of hierarchical structure. An ultrametric embedding, referred to here as ultrametricity, is implied by a natural hierarchical embedding. Such hierarchical structure can be global in the data…
In this paper we study the Grassmannian of submodules of a given dimension inside a finitely generated projective module $P$ for a finite dimensional algebra $\Lambda$ over an algebraically closed field. The orbit of such a submodule $C$…
Object oriented data analysis is the statistical analysis of populations of complex objects. In the special case of functional data analysis, these data objects are curves, where standard Euclidean approaches, such as principal component…
Ultrametric trees are trees whose leaves lie at the same distance from the root. They are used to model the genealogy of a population of particles co-existing at the same point in time. We show how the boundary of an ultrametric tree, like…
In this series we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects like undirected graphs, directed graphs, bidirected graphs, hypergraphs or finitary matroids. In…
Phylogenomics is a new field which applies to tools in phylogenetics to genome data. Due to a new technology and increasing amount of data, we face new challenges to analyze them over a space of phylogenetic trees. Because a space of…
The families of graphs defined by a certain type of system of equations over commutative rings have been studied and used since 1990s. This survey presents these families and their applications related to graphs, digraphs, and hypergraphs.…