Related papers: A classification of generalized root systems
We describe an algorithm for classifying the closed subsets of a root system, up to conjugation by the associated Weyl group. Such a classification of an irreducible root system is closely related to the classification of the regular…
We generalize the definition and properties of root systems to complex reflection groups - roots become rank one projective modules over the ring of integers of a number field k. In the irreducible case, we provide a classification of root…
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
We investigate the class of root systems R obtained by extending an irreducible root system by a torsion-free group G. In this context there is a Weyl group W and a group U with the presentation by conjugation. We show under additional…
The theory of generalized inverses of matrices and operators is closely connected with projections, i.e., idempotent (bounded) linear transformations. We show that a similar situation occurs in any associative ring $\mathcal{R}$ with a unit…
We introduce the simple notion of a "crystallographic arrangement" and prove a one-to-one correspondence between these arrangements and the connected simply connected Cartan schemes for which the real roots are a finite root system (up to…
This paper introduces the concept of a generic finite set, and points out that a consistent and significant interpretation of the grossone notation of Yarolslav D. Sergeyev is that of a generic natural number. This means that the grossone…
In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…
A spherical system is a combinatorial object, arising in the theory of wonderful varieties, defined in terms of a root system. All spherical systems can be obtained by means of some general combinatorial procedures (such as parabolic…
The notion of generic reducibility was introduced by A.Rybalov in his CiE 2018 paper: a set A is generically reducible to set B if there exists a total computable function f that m-reduces A to B such that the f-preimage of every set that…
We introduce the framework of general probabilistic theories (GPTs for short). GPTs are a class of operational theories that generalize both finite-dimensional classical and quantum theory, but they also include other, more exotic theories,…
We define the concept of a regular object with respect to another object in an arbitrary category. We present basic properties of regular objects and we study this concept in the special cases of abelian categories and locally finitely…
Cell structures were introduced by W. Debski and E. Tymchatyn as a way to study some classes of topological spaces and their continuous functions by means of discrete approximations. In this work we weaken the notion of cell structure and…
We study subsets in possibly degenerate symplectic vector spaces over finite fields, which are stable under a given Coxeter/Weyl reflection group. These symplectic root systems provide crucial combinatorical data to classify…
This paper develops from scratch a theory of Galois rings and orders over arbitrary fields. Our approach is different from others in the literature in that there is no non-modularity assumption. We prove, when the field is algebraically…
For commutative rings, we introduce the notion of a {\em universal grading}, which can be viewed as the "largest possible grading". While not every commutative ring (or order) has a universal grading, we prove that every {\em reduced order}…
For a star-shaped Kac-Moody root system, we provide an effective algorithm to obtain representatives of the Weyl group orbits of roots with a given norm and implement it as a computer program. We also explain the relationship between these…
We compare three notions of genericity of separable metric structures. Our analysis provides a general model theoretic technique of showing that structures are generic in descriptive set theoretic (topological) sense and in measure…
The paper purposes to contribute to the classification of pointed Hopf algebras by the method of Andruskiewitsch and Schneider. The structure of arithmetic root systems is enlightened such that their relation to ordinary root systems…
We classify all groups G and all pairs (V,W) of absolutely simple Yetter-Drinfeld modules over G such that the support of the direct sum of V and W generates G, the square of the braiding between V and W is not the identity, and the Nichols…