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

We give a computational algorithm for computing Ext groups between bounded complexes of coherent sheaves on a projective variety, and we describe an implementation of this algorithm in Macaulay2. In particular, our results yield methods for…

In this paper we have considered a finite unitary matrix group with exact elements being unknown and only approximate elements available. Such a group becomes inconsistent with its own multiplication table. We found simple correction…

The purpose of this paper is to describe a general procedure for computing analogues of Young's seminormal representations of the symmetric groups. The method is to generalize the Jucys-Murphy elements in the group algebras of the symmetric…

We study how to detect groups in a complex network each of which consists of component nodes sharing a similar connection pattern. Based on the mixture models and the exploratory analysis set up by Newman and Leicht (Newman and Leicht 2007…

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…

Voloshyn introduced rational Weyl group elements in connection with rational normal forms on complex reductive groups and conjectured that, in type $D_r$ with $r$ odd, their number is $2^r-1$. We prove a stronger structural statement. For…

In \cite{KSS06} it was shown that with respect to the simple non-backtracking random walk on the free group $F_N=F(a_1,\dots,a_N)$ the Whitehead algorithm has strongly linear time generic-case complexity and that "generic" elements of $F_N$…

We describe the Witt invariants of a Weyl group over a field $k_0$ by giving generators for the $W(k_0)$-module of Witt invariants, under the assumption that the characteristic of $k_0$ does not divide the order of the group. For the Weyl…

It is known that summations over Weyl groups of Lie algebras is a problem which enters in many areas of physics as well as in mathematics. For this, a method which we would like to call {\bf permutation weights} has been previously proposed…

We study Coxeter diagrams of some unitary reflection groups. Using solely the combinatorics of diagrams, we give a new proof of the classification of root lattices defined over $\cE = \ZZ[e^{2 \pi i/3}]$: there are only four such lattices,…

We show thatthe double reversing algorithm proposed by dehornoy for solving the word problem in the braid group can also be used to recognize the conjugates of powers of the generators in an Artin group of spherical type. The proof uses a…

In the recently emerging field of nonabelian group-based cryptography, a prominently used one-way function is the Conjugacy Search Problem (CSP), and two important classes of platform groups are polycyclic and matrix groups. In this paper,…

In this paper we introduce an algorithm for determining the orbital elements and individual masses of visual binaries. The algorithm uses an optimal point, which minimizes a specific function describing the average length between the…

We translate the concept of restriction of an arrangement in terms of Hopf algebras. In consequence, every Nichols algebra gives rise to a simplicial complex decorated by Nichols algebras with restricted root systems. As applications, some…

In this article we apply the duality technique of R. Howe to study the structure of the Weyl algebra. We introduce a one-parameter family of ``ordering maps'', where by an ordering map we understand a vector space isomorphism of the…

We present the weighted weak group inverse, which is a new generalized inverse of operators between two Hilbert spaces, introduced to extend weak group inverse for square matrices. Some characterizations and representations of the weighted…

Let X be the group of weights of a maximal torus of a simply connected semisimple group over C and let W be the Weyl group. The semidirect product W(Q\otimes X/X) is called the extended Weyl group. There is a natural C(v)-algebra H called…

It is known that there exists an order isomorphism between the Weyl group orbit through a minuscule weight of a simply-laced finite-dimensional simple Lie algebra and the set of all order filters in a self-dual connected d-complete poset.…

In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real…

Following the general idea of Schur--Weyl scheme and using two suitable symmetric groups (instead of one), we try to make more explicit the classical problem of decomposing tensor representations of finite and infinite symmetric groups into…