相关论文: A SUBSET-SUM Characterisation of the A-Hierarchy
We introduce the concept of subalgebra spectrum, $Sp(A)$, for a subalgebra $A$ of finite codimension in $\mathbb{K}[x]$. The spectrum is a subset of the underlying field. We also introduce a tool, the characteristic polynomial of $A$, which…
In this article we will build a universal imbedding of a regular Hom- Lie triple system into a Lie algebra and show that the category of regular Hom-Lie triple systems is equivalent to a full subcategory of pairs of…
In this paper, we prove a generalization of the Schmidt's subspace theorem for polynomials of higher degree in subgeneral position with respect to a projective variety over a number field. Our result improves and generalizes the previous…
A new approach to the construction of general persistent polyhierarchical classifications is proposed. It is based on implicit description of category polyhierarchy by a generating polyhierarchy of classification criteria. Similarly to…
In this paper we give a method, based on the characteristic function of a set, to solve some difficult problems of set theory in undergraduate research.
Motivated by questions in biological classification, we discuss some elementary combinatorial and computational properties of certain set systems that generalize hierarchies, namely, 'patchworks', 'weak patchworks', 'ample patchworks' and…
Subgraph reconfiguration is a family of problems focusing on the reachability of the solution space in which feasible solutions are subgraphs, represented either as sets of vertices or sets of edges, satisfying a prescribed graph structure…
We review some basic features of the Lie-algebraic classification of W-algebras and related integrable hierarchies in 1+1 dimensions, pointing out the role of affine Lie algebras. We emphasize that the supersymmetric extensions of the above…
This paper considers a hyperplane arrangement constructed with a subset of a set of all simple paths in a graph. A connection of the constructed arrangement to the maximum matching problem is established. Moreover, the problem of finding…
We set up some foundations of generalised scheme theory related to new incompressible symmetric tensor categories. This is analogous to the relation between super schemes and the category of super vector spaces.
The article contains some important classes of multisets. Combinatorial proofs of problems on the number of m-submultisets and m-permutations of multiset elements are considered and effective algorithms for their calculation are given. In…
A unified description of the relationship between the Hamiltonian structure of a large class of integrable hierarchies of equations and W-algebras is discussed. The main result is an explicit formula showing that the former can be…
We consider a group-theoretic analogue of the classic subset sum problem. In this brief note, we show that the subset sum problem is NP-complete in the first Grigorchuk group. More generally, we show NP-hardness of that problem in weakly…
A network can be analyzed at different topological scales, ranging from single nodes to motifs, communities, up to the complete structure. We propose a novel intermediate-level topological analysis that considers non-overlapping subgraphs…
One form of the inclusion-exclusion principle asserts that if A and B are functions of finite sets then A(S) is the sum of B(T) over all subsets T of S if and only if B(S) is the sum of (-1)^|S-T| A(T) over all subsets T of S. If we replace…
Here, the structural symmetries of a hypergraph are represented through equivalence relations on the vertex set of the hypergraph. A matrix associated with the hypergraph may not reflect a specific structural symmetry. In the context of a…
B-systems are algebras (models) of an essentially algebraic theory that is expected to be constructively equivalent to the essentially algebraic theory of C-systems which is, in turn, constructively equivalent to the theory of contextual…
Abstract separation systems are a new unifying framework in which separations of graph, matroids and other combinatorial structures can be expressed and studied. We characterize the abstract separation systems that have representations as…
We give a characterization of the sets of objects of the derived category of a block of a finite group algebra (or other symmetric algebra) that occur as the set of images of simple modules under an equivalence of derived categories. We…
Rough set is mainly concerned with the approximations of objects through an equivalence relation on a universe. Matroid is a combinatorial generalization of linear independence in vector spaces. In this paper, we define a parametric set…