Related papers: Properties of Commutative Association Schemes deri…
Fuzzy clustering algorithms can be roughly categorized into two main groups: Fuzzy C-Means (FCM) based methods and mixture model based methods. However, for almost all existing FCM based methods, how to automatically selecting proper…
An imprimitive symmetric indecomposable association scheme of rank 5 is said to be Higmanian. A divisible design graph is a graph whose adjacency matrix is an incidence matrix of a symmetric divisible design. We establish conditions which…
In this paper we consider a problem of searching a space of predictive models for a given training data set. We propose an iterative procedure for deriving a sequence of improving models and a corresponding sequence of sets of non-linear…
We make an attempt to develop "noncommutative algebraic geometry" in which noncommutative affine schemes are in one-to-one correspondence with associative algebras. In the first part we discuss various aspects of smoothness in affine…
An algebra ${\cal G}$ of symmetric {\em one-particle} operators is constructed for the Calogero model. This is an infinite-dimensional Lie-algebra, which is independent of the interaction parameter $\lambda$ of the model. It is constructed…
We give an accessible introduction into the theory of lower central series of associative algebras, exhibiting the interplay between algebra, geometry and representation theory that is characteristic for this subject, and to discuss some…
We introduce a family of mathematical objects called $\mathcal{P}$-schemes, where $\mathcal{P}$ is a poset of subgroups of a finite group $G$. A $\mathcal{P}$-scheme is a collection of partitions of the right coset spaces $H\backslash G$,…
In this paper, we study the characters of homogeneous monotonic P-polynomial table algebras with finite dimension d>=5. We then apply them to association schemes. To this end, we develop some methods using tridiagonal matrices and…
We give a necessary and sufficient smoothness condition for the scheme parameterizing the n-dimensional representations of a finitely generated associative algebra over an algebraically closed field of characteristic zero. In particular,…
We describe a version of the FGLM algorithm that can be used to compute generic fibers of positive-dimensional polynomial ideals. It combines the FGLM algorithm with a Hensel lifting strategy. In analogy with Hensel lifting, we show that…
This paper focuses on the statistical analysis of shapes of data objects called shape graphs, a set of nodes connected by articulated curves with arbitrary shapes. A critical need here is a constrained registration of points (nodes to…
In this paper, we study the Lie point symmetry group of a system describing an ideal plastic plane flow in two dimensions in order to find analytical solutions of the system. The infinitesimal generators that span the Lie algebra for this…
In this thesis we are interested in studying algebraic properties of monomial algebras, that can be linked to combinatorial structures, such as graphs and clutters, and to optimization problems. A goal here is to establish bridges between…
In this paper we construct a combinatorial algorithm of resolution of singularities for binomial ideals, over a field of arbitrary characteristic. This algorithm is applied to any binomial ideal. This means ideals generated by binomial…
We discuss in this paper combinatorial aspects of boundary loop models, that is models of self-avoiding loops on a strip where loops get different weights depending on whether they touch the left, the right, both or no boundary. These…
Given a finite, simple, vertex-weighted graph, we construct a graded associative (non-commutative) algebra, whose generators correspond to vertices and whose ideal of relations has generators that are graded commutators corresponding to…
Recent elegant work on the structure of Perturbative Quantum Field Theory (PQFT) has revealed an astonishing interplay between analysis(Riemann Zeta functions), topology (Knot theory), combinatorial graph theory (Feynman Diagrams) and…
Algorithms for computing congruence closure of ground equations over uninterpreted symbols and interpreted symbols satisfying associativity and commutativity (AC) properties are proposed. The algorithms are based on a framework for…
This paper investigates Gaussian copula mixture models (GCMM), which are an extension of Gaussian mixture models (GMM) that incorporate copula concepts. The paper presents the mathematical definition of GCMM and explores the properties of…
Gaussian mixture models (GMMs) are ubiquitous in statistical learning, particularly for unsupervised problems. While full GMMs suffer from the overparameterization of their covariance matrices in high-dimensional spaces, spherical GMMs…