Related papers: Extending Snow's algorithm for computations in the…

We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…

Let $G$ be a complex connected reductive algebraic group. Let $G/B$ denote the flag variety of $G$. Let $H$ be an algebraic subgroup of $G$ such that the set ${\bf H}(G/B)$ of the $H$-orbits in $G/B$ is finite ; $H$ is said to be {\it…

In this note, we mainly consider the extended Weyl algebra of two generators (u,v), that is, the algebra generated by u,v with the fundamental commutation relation. Weyl algebra is realized on the space of polynomials of u and v by defining…

It is shown that except in three cases conjugacy classes of classical Weyl groups $W(B_{n})$ and $W(D_{n})$ are of type ${\rm D}$. This proves that Nichols algebras of irreducible Yetter-Drinfeld modules over the classical Weyl groups…

We develop the ARE method (Action-Rectification-Expansion), a structural framework for the organization of Leibniz terms in determinants through cyclic group actions and orbital decompositions. The symmetric group S_n is partitioned into…

In 2005 J.L. Waldspurger proved the following theorem: given a finite real reflection group $W$, the closed positive root cone is tiled by the images of the open weight cone under the action of the linear transformations $id-w$. Shortly…

The multiplicative Newton-like method developed by the author et al. is extended to the situation where the dynamics is restricted to the orthogonal group. A general framework is constructed without specifying the cost function. Though the…

The weighted ensemble (WE) method, an enhanced sampling approach based on periodically replicating and pruning trajectories in a set of parallel simulations, has grown increasingly popular for computational biochemistry problems, due in…

We construct new sequence transformations based on Wynn's epsilon and rho algorithms. The recursions of the new algorithms include the recursions of Wynn's epsilon and rho algorithm and of Osada's generalized rho algorithm as special cases.…

Using complexified quaternions, an intriguing link between generators of two different and surprisingly commuting four-dimensional representations of the SU(2)xU(1) Lie group, and generators of two four-dimensional spin 1/2 representations…

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 complete the construction of the modular generalized Springer correspondence for an arbitrary connected reductive group, with a uniform proof of the disjointness of induction series that avoids the case-by-case arguments for classical…

We study the statistical estimation problem of orthogonal group synchronization and rotation group synchronization. The model is $Y_{ij} = Z_i^* Z_j^{*T} + \sigma W_{ij}\in\mathbb{R}^{d\times d}$ where $W_{ij}$ is a Gaussian random matrix…

We develop an algorithm computing the transcendental lattice and the Mordell--Weil group of an extremal elliptic surface. As an example, we compute the lattices of four exponentially large series of surfaces

The discrete cosine and sine transforms are generalized to a triangular fragment of the honeycomb lattice. The honeycomb point sets are constructed by subtracting the root lattice from the weight lattice points of the crystallographic root…

We define and study a correspondence between the set of distinguished G^0-conjugacy classes in a fixed connected component of a reductive group G (with G^0 almost simple) and the set of (twisted) elliptic conjugacy classes in the Weyl…

The multiplicity of a weight in a finite-dimensional irreducible representation of a simple Lie algebra g can be computed via Kostant's weight multiplicity formula. This formula consists of an alternating sum over the Weyl group (a finite…

Our main objective is to show that the computational methods that we previously developed to search for difference families in cyclic groups can be fully extended to the more general case of arbitrary finite abelian groups. In particular…

The main purpose of this paper is to develop new algorithms for computing invariant rings in a general setting. This includes invariants of nonreductive groups but also of groups acting on algebras over certain rings. In particular, we…

Let g be a simple Lie algebra, with fixed Borel subalgebra b and with Weyl group W. Expanding on previous work of Fan and Stembridge in the simply laced case, this note aims to study the fully commutative elements of W, and their…