Related papers: Fan, splint and branching rules

We produce a new basis for the Schur and Weyl modules associated to a row-convex shape, D. The basis is indexed by new class of "straight" tableaux which we introduce by weakening the usual requirements for standard tableaux. Spanning is…

The orbits of Weyl groups W(A(n)) of simple A(n) type Lie algebras are reduced to the union of orbits of the Weyl groups of maximal reductive subalgebras of A(n). Matrices transforming points of the orbits of W(An) into points of subalgebra…

This is an exposition in order to give an explicit way to understand (1) a non-topological proof for an existence of a base of an affine root system, (2) a Serre-type definition of an elliptic Lie algebra with rank =>2, and (3) the…

We introduce the notion of a subregular subalgebra, which we believe is useful for classification of subalgebras of Lie algebras. We use it to construct a non-regular invariant generalized complex structure on a Lie group. As an…

We give a generalized definition of stretch that simplifies the efficient construction of low-stretch embeddings suitable for graph algorithms. The generalization, based on discounting highly stretched edges by taking their $p$-th power for…

We assume some standard choices for the branch cuts of a group of functions and consider the problem of then calculating the branch cuts of expressions involving those functions. Typical examples include the addition formulae for inverse…

This paper describes an algorithm for determining the branching geometry of algebraic functions. The graphs of these complex-valued functions have a complicated interweaving structure that can be described by analytic branches separated by…

Convergent rewriting systems on algebraic structures give methods to solve decision problems, to prove coherence results, and to compute homological invariants. These methods are based on higher-dimensional extensions of the critical…

We realize Leavitt ultragraph path algebras as partial skew group rings. Using this realization we characterize artinian ultragraph path algebras and give simplicity criteria for these algebras.

In this paper, we study the generating functions for the number of pattern restricted Stirling permutations with a given number of plateaus, descents and ascents. Properties of the generating functions, including symmetric properties and…

Skewed probit regression is but one example of a statistical model that generalizes a simpler model, like probit regression. All skew-symmetric distributions and link functions arise from symmetric distributions by incorporating a skewness…

For a field K and directed graph E, we analyze those elements of the Leavitt path algebra L_K(E) which lie in the commutator subspace [L_K(E), L_K(E)]. This analysis allows us to give easily computable necessary and sufficient conditions to…

We propose a mechanism to explain what occurs when a mixture of grains of different sizes and different shapes (i.e. different repose angles) is poured into a quasi-two-dimensional cell. Specifically, we develop a model that displays…

Classical and exceptional Lie algebras and their representations are among the most important tools in the analysis of symmetry in physical systems. In this letter we show how the computation of tensor products and branching rules of…

In this paper branching rules for the fundamental representations of the symplectic groups in positive characteristic are found. The submodule structure of the restrictions of the fundamental modules for the group $Sp_{2n}(K)$ to the…

We study the properties of glued knots, a sub-class of real rational knots, that can be constructed by gluing ellipses. We define an invariant called the gluing degree and relate it to various classical properties of knots and classify all…

This paper introduces a new algebra, the crossing algebra, that is applied to count the number of components for arborescent knots, links, tangles or states (of a state polynomial expansion such as the Kauffman bracket). This algebra is…

A "blendstring" is a piecewise polynomial interpolant with high-degree two-point Hermite interpolational polynomials on each piece, analogous to a cubic spline. Blendstrings are smoother and can be more accurate than cubic splines, and can…

We propose Range and Roots which are two common patterns useful for specifying a wide range of counting and occurrence constraints. We design specialised propagation algorithms for these two patterns. Counting and occurrence constraints…

We prove that a planar graph is generically rigid in the plane if and only if it can be embedded as a pseudo-triangulation. This generalizes the main result of math.CO/0307347 which treats the minimally generically rigid case. The proof…