English
Related papers

Related papers: The hook fusion procedure

200 papers

The multidimensional quantization procedure, proposed by the first author and its modifications (reduction to radicals and lifting on U(1)-coverings) give us a almost universal theoretical tools to find irreducible representations of Lie…

Representation Theory · Mathematics 2014-06-09 Do Ngoc Diep , Truong Chi Trung

The present work stemmed from the study of the problem of harmonic analysis on the infinite-dimensional unitary group U(\infty). That problem consisted in the decomposition of a certain 4-parameter family of unitary representations, which…

Representation Theory · Mathematics 2016-03-10 Vadim Gorin , Grigori Olshanski

We introduce and study an affine analogue of skew Young diagrams and tableaux on them. It turns out that the double affine Hecke algebra of type $A$ acts on the space spanned by standard tableaux on each diagram. It is shown that the…

Quantum Algebra · Mathematics 2007-05-23 Takeshi Suzuki , Monica Vazirani

We are interested in the problem of translating between two representations of closure systems, namely implicational bases and meet-irreducible elements. Albeit its importance, the problem is open. Motivated by this problem, we introduce…

Combinatorics · Mathematics 2023-06-16 Lhouari Nourine , Simon Vilmin

In this paper we consider the general structure of irreducible tensor representations of the Poincare group of arbitrary dimension with multiple sets of Lorentz indices and different ways to construct them from basic elements (Lorentz…

High Energy Physics - Phenomenology · Physics 2025-09-30 Roman Ryutin

The hook components of $V^{\otimes n}$ interpolate between the symmetric power $\sym^n(V)$ and the exterior power $\wedge^n(V)$. When $V$ is the vector space of $k\times m$ matrices over $\bbc$, we decompose the hook components into…

Representation Theory · Mathematics 2007-05-23 Ron M. Adin , Avital Frumkin , Yuval Roichman

We show the irreducibility of some unitary representations of the group of symplectomorphisms and the group of contactomorphisms.

Representation Theory · Mathematics 2014-04-17 Łukasz Garncarek

The fundamental group of the complement of a hyperplane arrangement plays an important role in studying the corresponding arrangements. In particular, for large families of hyperplane arrangements, this fundamental group, being isomorphic…

Geometric Topology · Mathematics 2013-04-30 Michael Friedman , David Garber

In this article we consider hook removal operators on odd partitions, i.e., partitions labelling odd-degree irreducible characters of finite symmetric groups. In particular we complete the discussion, started by Isaacs, Navarro, Olsson and…

Representation Theory · Mathematics 2017-11-27 Christine Bessenrodt , Eugenio Giannelli , Jorn B. Olsson

We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do {\it not} request special choices of bases.…

Symbolic Computation · Computer Science 2016-01-11 Jakob Ablinger , Johannes Bluemlein , Abilio de Freitas , Carsten Schneider

We construct Hopf algebras whose elements are representations of combinatorial automorphism groups, by generalising a theorem of Zelevinsky on Hopf algebras of representations of wreath products. As an application we attach symmetric…

Representation Theory · Mathematics 2021-09-14 Tyrone Crisp , Caleb Kennedy Hill

We establish a link between two geometric approaches to the representation theory of rational Cherednik algebras of type A: one based on a noncommutative Proj construction, used in [GS]; the other involving quantum hamiltonian reduction of…

Quantum Algebra · Mathematics 2008-03-26 V. Ginzburg , I. Gordon , J. T. Stafford

In an earlier paper [1] it was shown that the Frobenius compound characters for the symmetric groups are related to the irreducible characters by a linear relation that involves a unitriagular coupling matrix that gives the Frobenius…

Representation Theory · Mathematics 2018-05-15 Ronald F. Fox

In this paper we factorize matrix polynomials into a complete set of spectral factors using a new design algorithm and we provide a complete set of block roots (solvents). The procedure is an extension of the (scalar) Horner method for the…

Signal Processing · Electrical Eng. & Systems 2018-03-29 Belkacem Bekhiti , Abdelhakim Dahimene , Kamel Hariche , George F. Fragulis

We present new computational results for symplectic monodromy groups of hypergeometric differential equations. In particular, we compute the arithmetic closure of each group, sometimes justifying arithmeticity. The results are obtained by…

Group Theory · Mathematics 2020-06-09 A. S. Detinko , D. L. Flannery , A. Hulpke

The review of developed by the authors new techniques for covariant calculation of matrix elements in QED, the so-called formalism of "Diagonal Spin Basis" (DSB), is presented. In DSB spin 4-vectors of in- and out- fermions are expressed…

High Energy Physics - Phenomenology · Physics 2015-06-25 M. V. Galynskii , S. M. Sikach

The new approach to the theory of complex representrations of the finite symmetric groups which based on the notions of Coxeter generators., Gelfand-Zetlin algebras, Hecke algebra, Young-Jucys-Murphi generators and which hardly used…

Representation Theory · Mathematics 2007-05-23 A. M. Vershik , A. Yu. Okounkov

The computation of tunes and matched beam distributions are essential steps in the analysis of circular accelerators. If certain symmetries - like midplane symmetrie - are present, then it is possible to treat the betatron motion in the…

Mathematical Physics · Physics 2013-07-17 Christian Baumgarten

Cholesky factorization provides photonic lattices that are the isospectral partners or the square root of other arrays of coupled waveguides. The procedure is similar to that used in supersymmetric quantum mechanics. However, Cholesky…

Optics · Physics 2020-10-28 P. I. Martinez Berumen , B. M. Rodríguez-Lara

A prototype for an extensible interactive graphical term manipulation system is presented that combines pattern matching and nondeterministic evaluation to provide a convenient framework for doing tedious algebraic manipulations that so far…

Symbolic Computation · Computer Science 2007-05-23 Thomas Fischbacher