相关论文: Problems on neat embeddings solved by rainbow cons…

Suppose we wish to embed an (associative) $k$-algebra $A$ in a $k$-algebra $R$ generated in some specified way; e.g., by two elements, or by copies of given $k$-algebras $A_1,$ $A_2,$ $A_3.$ Several authors have obtained sufficient…

Relation algebra and its reducts provide us with a strong tool for reasoning about nondeterministic programs and their partial correctness. Demonic calculus, introduced to model the behaviour of a machine where the demon is in control of…

Finite and Infinite-dimensional representations of symmetry algebras play a significant role in determining the spectral properties of physical Hamiltonians. In this paper, we introduce and apply a practical method to construct infinite…

Our objective in this project is three-fold, the first two covered in this paper. In tropical mathematics, as well as other mathematical theories involving semirings, when trying to formulate the tropical versions of classical algebraic…

We give an overview of the representation theory of restricted rational Cherednik algebras. These are certain finite-dimensional quotients of rational Cherednik algebras at t=0. Their representation theory is connected to the geometry of…

We show that certain C*-algebras which have been studied among others by Arzumanian, Vershik, Deaconu, and Renault in connection to a measure preserving transformation of a measure space and/or to a covering map of a compact space are…

Ground state solutions of elliptic problems have been analyzed extensively in the theory of partial differential equations, as they represent fundamental spatial patterns in many model equations. While the results for scalar equations, as…

We present the plactic algebra on an arbitrary alphabet set $A$ by row generators and column generators respectively. We give Gr\"{o}bner-Shirshov bases for such presentations. In the case of column generators, a finite Gr\"{o}bner-Shirshov…

We study rank-three matroids, known as point-line configurations, and their associated matroid varieties, defined as the Zariski closures of their realization spaces. Our focus is on determining finite generating sets of defining equations…

We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative…

The problem of construction of irreducible representations of quantum $A^q_n$ algebras is solved at the level of explicit integration of the linear (inhomogeneous) system in finite differences in the n-dimensional space. The general…

Let $HP_{n,m,k}$ be drawn uniformly from all $k$-uniform, $k$-partite hypergraphs where each part of the partition is a disjoint copy of $[n]$. We let $HP^{(\k)}_{n,m,k}$ be an edge colored version, where we color each edge randomly from…

We introduce the notion of the full quiver of a representation of an algebra, which is a cover of the (classical) quiver, but which captures properties of the representation itself. Gluing of vertices and of arrows enables one to study…

Let $M$ be a real-analytic connected CR-hypersurface of CR-dimension $n>0$ having a point of Levi-nondegeneracy. The following alternative is demonstrated for both the symmetry algebra $s$ and the automorphism group $G$ of $M$. Denote by…

For every fixed class of regular languages, there is a natural hierarchy of increasingly more general problems: Firstly, the membership problem asks whether a given language belongs to the fixed class of languages. Secondly, the separation…

Andr\'eka and Maddux classified the relation algebras with at most 3 atoms, and in particular they showed that all of them are representable. Hirsch and Cristiani showed that the network satisfaction problem (NSP) for each of these algebras…

The introduction of covering-based rough sets has made a substantial contribution to the classical rough sets. However, many vital problems in rough sets, including attribution reduction, are NP-hard and therefore the algorithms for solving…

Nowhere dense classes of graphs are classes of sparse graphs with rich structural and algorithmic properties, however, they fail to capture even simple classes of dense graphs. Monadically stable classes, originating from model theory,…

This paper aims to use topological methods to compute $\mathrm{Ext}$ between an irreducible representation of a finite monoid inflated from its group completion and one inflated from its group of units, or more generally coinduced from a…

Representation learning is central to graph machine learning, powering tasks such as link prediction and node classification. However, most graph embeddings are hard to interpret, offering limited insight into how learned features relate to…