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

We propose a new class of method for solving nonlinear systems of equations, which, among other things,has four nice features: (i) it is inspired by the mathematical property of damped oscillators, (ii) it can be regarded as a simple…

Root subgroup factorization is a refinement of triangular (or LDU) factorization. For a complex reductive Lie group, and a choice of reduced factorization of the longest Weyl group element, the forward map from root subgroup coordinates to…

We show that except in several cases conjugacy classes of classical Weyl groups $W(B_n)$ and $W(D_n)$ are of type {\rm D}. We prove that except in three cases Nichols algebras of irreducible Yetter-Drinfeld ({\rm YD} in short )modules over…

Let w be an elliptic element of the Weyl group of a connected reductive group G. Let X be the set of pairs (g,B) where g is an element of G, B is a Borel subgroup of G and B,gBg^{-1} are in relative position w. Then G acts naturally on X.…

An algorithm for the explicit computation of a complete set of primitive central idempotents, Wedderburn decomposition and the automorphism group of the semisimple group algebra of a finite metabelian group is developed. The algorithm is…

A method for successive synthesis of the Weyl matrix on the square lattice is proposed. It allows one to compute the Weyl matrix of a large graph by adding new edges and solving elementary systems of linear algebraic equations at each step.…

We give compact extended formulations for the packing and partitioning orbitopes (with respect to the full symmetric group) described and analyzed in (Kaibel and Pfetsch, 2008). These polytopes are the convex hulls of all 0/1-matrices with…

Matrix elements between nonorthogonal Slater determinants represent an essential component of many emerging electronic structure methods. However, evaluating nonorthogonal matrix elements is conceptually and computationally harder then…

This work presents a novel approach to distribute orbitals into subspaces within electron-pairing-based natural orbital functionals (NOFs). This approach modifies the coupling between weakly and strongly occupied orbitals by applying an…

We define a map from the set of conjugacy classes of a Weyl group W to the representation ring of W tensored with the ring of polynomials in one variable.

Let G be a connected reductive group. We define a map from the set of unipotent classes in G to the set of conjugacy classes in the Weyl group (assuming that the characteristic is not bad). This map is a one sided inverse of a map in the…

Efficient algorithms for solving the Smallest Enclosing Sphere (SES) problem, such as Welzl's algorithm, often fail to handle degenerate subsets of points in 3D space. Degeneracies and ill-posed configurations present significant…

In the study of walks with small steps confined to multidimensional orthants, a certain group of transformations plays a central role. In particular, several techniques to potentially compute the generating function, including the orbit sum…

We study the large $N$ expansion of winding Wilson loops in the off-critical regime of the Gross-Witten-Wadia (GWW) unitary matrix model. These have been recently considered in arXiv:1705.06542 and computed by numerical methods. We present…

In recent papers we have refined a conjecture of Lehrer and Solomon expressing the characters of a finite Coxeter group $W$ afforded by the homogeneous components of its Orlik-Solomon algebra as sums of characters induced from linear…

Periodic orbit expressions for the density of states lead to spurious results when directly used to calculate quantities of thermodynamic interest. This is because the trace formula is usually valid only for large energies while the…

We introduce a family of unital associative algebras A which are multiparameter analogues of the Weyl algebras and determine the simple weight modules and the Whittaker modules for them. All these modules can be regarded as spaces of…

In linear combinatorial optimization, we aim to find $S^* = \arg\min_{S \in \mathcal{F}} \langle w,\mathbf{1}_S \rangle$ for a family $\mathcal{F} \subseteq 2^U$ over a ground set $U$ of $n$ elements. Traditionally, $w$ is known or…

In this paper we introduce a polynomial time algorithm that solves both the conjugacy decision and search problems in free abelian-by-infinite cyclic groups where the input is elements in normal form. We do this by adapting the work of…

A tensor network is a diagram that specifies a way to "multiply" a collection of tensors together to produce another tensor (or matrix). Many existing algorithms for tensor problems (such as tensor decomposition and tensor PCA), although…