Related papers: Properties of Commutative Association Schemes deri…
Classifying Frobenius algebras is a key question that has been addressed in various contexts. The structure of finite-dimensional Frobenius algebras depends on the base field and the dimension of the algebra, leading to different…
Combinatorial methods (or methods of elementary transformations) came to group theory from low-dimensional topology in the beginning of the century. Soon after that, combinatorial group theory became an independent area with its own…
We generalize signature Gr\"obner bases, previously studied in the free algebra over a field or polynomial rings over a ring, to ideals in the mixed algebra $R[x_1,...,x_k]\langle y_1,\dots,y_n \rangle$ where $R$ is a principal ideal…
This paper is a study of the Lie groups of point symmetries admitted by a system describing a non-stationary planar flow of an ideal plastic material. For several types of forces involved in the system, the infinitesimal generators which…
A relation algebra is called measurable when its identity is the sum of measurable atoms, and an atom is called measurable if its square is the sum of functional elements. In this paper we show that atomic measurable relation algebras have…
Lie group theory states that knowledge of a $m$-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by $m$ the number of equations. We apply this principle by finding some \emph{affine…
Hilbert schemes of zero-dimensional ideals in a polynomial ring can be covered with suitable affine open subschemes whose construction is achieved using border bases. Moreover, border bases have proved to be an excellent tool for describing…
A subspace of an algebra with involution is called a Lie skew-ideal if it is closed under Lie products with skew-symmetric elements. Lie skew-ideals are classified in central simple algebras with involution (there are eight of them for…
Let (W,S) be a Coxeter system of affine type D, and let TL(W) the corresponding generalized Temperley-Lieb algebra. In this extended abstract we define an infinite dimensional associative algebra made of decorated diagrams which is…
Finding vertex-to-vertex correspondences in real-world graphs is a challenging task with applications in a wide variety of domains. Structural matching based on graphs connectivities has attracted considerable attention, while the…
Border basis schemes are open subschemes of Hilbert schemes parametrizing 0-dimensional subschemes of $\mathbb{P}^n$ of given length. They yield open coverings and are easy to describe and to compute with. Our topic is to find re-embeddings…
An association scheme is called amorphic if every possible fusion of relations gives rise to a fusion scheme. We call a pair of relations fusing if fusing that pair gives rise to a fusion scheme. We define the fusing-relations graph on the…
Let R be a commutative ring with unity, M be an unitary R-module and {\Gamma} be a simple graph. This research article is an interplay of combinatorial and algebraic properties of M . We show a combinatorial object completely determines an…
This paper focuses on the derivations and automorphism groups of certain finite-dimensional associative algebras over the field of complex numbers. Using classification results for algebras of dimensions two, three, and four, along with…
The associative interaction, such as hydrogen bonding, can bring about versatile functionalities to polymer systems, which has been investigated by tremendous researches, but the fundamental understanding on association process is still…
A characteristic pair is a pair (G,C) of polynomial sets in which G is a reduced lexicographic Groebner basis, C is the minimal triangular set contained in G, and C is normal. In this paper, we show that any finite polynomial set P can be…
In this paper, we continue to adapt the theories of spectra and schemes developed by Grothendieck in algebraic geometry to the category of groups. Let $G$ be a group, and $(H,f_G^H)$ and object of the comma category $C(G)$. In [5], we have…
Association Rule Mining is a machine learning method for discovering the interesting relations between the attributes in a huge transaction database. Typically, algorithms for Association Rule Mining generate a huge number of association…
Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…
We develop a general approach to finding combinatorial models for cluster algebras. The approach is to construct a labeled graph called a framework. When a framework is constructed with certain properties, the result is a model…