Related papers: Normal Binary Hierarchical Models

We first investigate the algebraic structure of vertex algebroids $B$ when $B$ are simple Leibniz algebras. Next, we use these vertex algebroids $B$ to construct indecomposable non-simple $C_2$-cofinite $\mathbb{N}$-graded vertex algebras…

This paper analyses non-regular $|2|$-graded geometries, and show that they share many of the properties of regular geometries -- the existence of a unique normal Cartan connection encoding the structure, the harmonic curvature as…

Complex networks in natural, social, and technological systems generically exhibit an abundance of rich information. Extracting meaningful structural features from data is one of the most challenging tasks in network theory. Many methods…

We generalize double bracket vector fields, originally defined on semisimple Lie algebras, to Poisson manifolds equipped with a pseudo-Riemannian metric by utilizing a symmetric contravariant 2-tensor field. We extend the normal metric on…

For certain problems involving vector fields, it is possible to find an associated imaginary field that, in conjunction with the first, forms a complex field for which the equation can be solved. This result is generalized to arbitrary…

A new and extensive formalism is developed for monads and galaxies in non-standard enlargements. It is shown that monads and galaxies can be manipulated using order-preserving and order-reversing set-to-set maps, and that set properties…

Network systems consist of subsystems and their interconnections, and provide a powerful framework for analysis, modeling and control of complex systems. However, subsystems may have high-dimensional dynamics, and the amount and nature of…

We introduce a remarkable new family of norms on the space of $n \times n$ complex matrices. These norms arise from the combinatorial properties of symmetric functions, and their construction and validation involve probability theory,…

We construct a space of vector fields that are normal to differentiable curves in the plane. Its basis functions are defined via saddle point variational problems in reproducing kernel Hilbert spaces (RKHSs). First, we study the properties…

We study the complexity of finding an optimal hierarchical clustering of an unweighted similarity graph under the recently introduced Dasgupta objective function. We introduce a proof technique, called the normalization procedure, that…

We investigate arrangements of hyperplanes whose normal vectors are given by connected subgraphs of a fixed graph. These include the resonance arrangement and certain ideal subarrangements of Weyl arrangements. We characterize those which…

By natural way the hierarchy structure is introduced on directed graphs with weighted adjacencies. Embedded system of algebras of subsets of the set of vertices of such digraph and it's consolidations, which vertices are the elementary sets…

Motivated by questions arising in signal processing, computational complexity, and other areas, we study the ranks and border ranks of symmetric tensors using geometric methods. We provide improved lower bounds for the rank of a symmetric…

We provide a novel family of generative block-models for random graphs that naturally incorporates degree distributions: the block-constrained configuration model. Block-constrained configuration models build on the generalised…

For positive integers k,n, we investigate the simplicial complex NM_k(n) of all graphs G on vertex set [n] such that every matching in G has size less than k. This complex (along with other associated cell complexes) is found to be homotopy…

Let $A$ be a gentle algebra. For every collection of string and band diagrammes, we consider the constructible subset of the variety of representations containing all modules with this underlying diagramme. We study degenerations of such…

The normal form theory for polynomial vector fields is extended to those for $C^\infty$ vector fields vanishing at the origin. Explicit formulas for the $C^\infty$ normal form and the near identity transformation which brings a vector field…

We develop algorithms, implemented in Maple, that study the number of vertices with a particular number of children in a random ordered tree where all vertices must have a number of children in some finite set. By calculating the mixed…

The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…

We first study birational mappings generated by the composition of the matrix inversion and of a permutation of the entries of $ 3 \times 3 $ matrices. We introduce a semi-numerical analysis which enables to compute the Arnold complexities…