Related papers: Trees, set compositions and the twisted descent al…
In this paper, we introduce a notion of twisted Roe algebra and a twisted coarse Baum-Connes conjecture with coefficients. We will study the basic properties of twisted Roe algebras, including a coarse analogue of the imprimitivity theorem…
This paper provides motivation as well as a method of construction for Hopf algebras, starting from an associative algebra. The dualization technique involved relies heavily on the use of Sweedler's dual.
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…
We construct explicit polynomial realizations of some combinatorial Hopf algebras based on various kind of trees or forests, and some more general classes of graphs, ranging from the Connes-Kreimer algebra to an algebra of labelled forests…
We introduce structured decompositions, category-theoretic structures which simultaneously generalize notions from graph theory (including treewidth, layered treewidth, co-treewidth, graph decomposition width, tree independence number,…
As a unification of increasing trees and plane trees, the weakly increasing trees labeled by a multiset was introduced by Lin-Ma-Ma-Zhou in 2021. Motived by some symmetries in plane trees proved recently by Dong, Du, Ji and Zhang, we…
It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…
We consider both analytically and numerically creation conditions of diverse hierarchical trees. A connection between the probabilities to create hierarchical levels and the probability to associate these levels into united structure is…
Theory of representations of F-algebra is a natural development of the theory of F-algebra. Exploring of morphisms of the representation leads to the concepts of generating set and basis of representation. In the book I considered the…
In this work, we propose a systematic derivation of normal forms for dispersive equations using decorated trees introduced in arXiv:2005.01649. The key tool is the arborification map which is a morphism from the Butcher-Connes-Kreimer Hopf…
Machine learning often aims to produce latent embeddings of inputs which lie in a larger, abstract mathematical space. For example, in the field of 3D modeling, subsets of Euclidean space can be embedded as vectors using implicit neural…
Motivated by Kalman residuated lattices, Nelson residuated lattices and Nelson paraconsistent residuated lattices, we provide a natural common generalization of them. Nelson conucleus algebras unify these examples and further extend them to…
We give a unified description of twisted forms of classical reductive groups schemes. Such group schemes are constructed from algebraic objects of finite rank, excluding some exceptions of small rank. These objects, augmented odd form…
We consider a general concept of composition and decomposition of objects, and discuss a few natural properties one may expect from a reasonable choice thereof. It will be demonstrated how this leads to multiplication and co- multiplication…
In this survey, we first review some known results on the representation theory of algebras with triangular decomposition, including the classification of the simple modules. We then discuss a recipe to construct Hopf algebras with…
We consider the creation conditions of diverse hierarchical trees both analytically and numerically. A connection between the probabilities to create hierarchical levels and the probability to associate these levels into a united structure…
We show that the class of finite rooted binary plane trees is a Ramsey class (with respect to topological embeddings that map leaves to leaves). That is, for all such trees P,H and every natural number k there exists a tree T such that for…
The twist construction is a method to build new interesting examples of geometric structures with torus symmetry from well-known ones. In fact it can be used to construct arbitrary nilmanifolds from tori. In our previous paper, we presented…
We construct some irreducible representations of the Leavitt path algebra of an arbitrary quiver. The constructed representations are associated to certain algebraic branching systems. For a row-finite quiver, we classify algebraic…
Motivated by the properties of the descent polynomials, which enumerate permutations of $S_n$ with a fixed descent set, we define descent polynomials for labeled rooted trees. We give recursive and explicit formulas for these polynomials…