Related papers: Fan, splint and branching rules
Vogt's theorem, concerning boundary angles of a convex arc with monotonic curvature (spiral arc), is taken as a starting point to establish basic properties of spirals. The theorem is expanded by removing requirements of convexity and…
In this article, we define the notion of slim (normal) bases and show their existence for various fields. As an application, an algorithm will be given that computes the spectrum of a basefield transform by merely using O(n) additions.
Semi-entwining structures are proposed as concepts simpler than entwining structures, yet they are shown to have interesting applications in constructing intertwining operators and braided algebras, lifting functors, finding solutions for…
In this paper, we propose a new algebraic winding number and prove that it computes the number of complex roots of a polynomial in a rectangle, including roots on edges or vertices with appropriate counting. The definition makes sense for…
We give an efficient algorithm for Lang's Theorem in split connected reductive groups defined over finite fields of characteristic greater than 3. This algorithm can be used to construct many important structures in finite groups of Lie…
Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…
In this expository paper, we first review the classification of the restricted simple Lie algebras in characteristic different from 2 and 3 and then we describe their infinitesimal deformations. We conclude by indicating some possible…
The weight systems of finite-dimensional representations of complex, simple Lie algebras exhibit patterns beyond Weyl-group symmetry. These patterns occur because weight systems can be decomposed into lattice polytopes in a natural way.…
We revisit the mathematical foundations of proper scoring rules (PSRs) and Bregman divergences and present their characteristic properties in a unified theoretical framework. In many situations it is preferable not to generate a PSR…
A synaptic algebra is a common generalization of several ordered algebraic structures based on algebras of self-adjoint operators, including the self-adjoint part of an AW*-algebra. In this paper we prove that a synaptic algebra A has the…
We investigate the properties of principal elements of Frobenius Lie algebras, following the work of M. Gerstenhaber and A. Giaquinto. We prove that any Lie algebra with a left symmetric algebra structure can be embedded, in a natural way,…
For $\mathbb Q$-factorial klt algebraically integrable adjoint foliated structures, we prove the cone theorem, the contraction theorem, and the existence of flips. Therefore, we deduce the existence of the minimal model program for such…
Following the definition of a root basis of an affine root system, we define a base of the root system of an affine Lie superalgebra to be a linearly independent subset $B$ of its root system such that each root can be written as a linear…
Balanced and well-balanced subsets of the set of positive roots of compact Lie algebras arise naturally in problems related to Hermitian and spin geometry. In this paper we compute the maximal and minimal size of well-balanced subsets in…
We extend some results of Bonahon, Bullock, Turaev and Wong concerning the skein algebras of closed surfaces to L^e's stated skein algebra associated to open surfaces. We prove that the stated skein algebra with deforming parameter +1…
In this paper, we study the controllability properties and the Lie algebra structure of networks of particles with spin immersed in an electro-magnetic field. We relate the Lie algebra structure to the properties of a graph whose nodes…
The concept of a skew root of a skew polynomial is used to introduce notions of algebraic closedness for $\sigma$-fields, that is, a field equipped with an endomorphism. It is shown that every $\sigma$-field can be embedded in algebraically…
We prove a semisimplicity criterion for a large class of algebras by a new method. This can be applied to Brauer, BMW, and $q$-Brauer algebras.
Subdivision schemes are iterative methods for the design of smooth curves and surfaces. Any linear subdivision scheme can be identified by a sequence of Laurent polynomials, also called subdivision symbols, which describe the linear rules…
The first aim is to construct generalizations of Polya type point process by applying a branching mechanism to these point processes. Conditions are given under which these point processes satisfy an integration by parts formula.…