Related papers: Explicit Pieri Inclusions
We prove a multidimensional Poisson limit theorem in free probability, and define joint free Poisson distributions in a non-commutative probability space. We define (compound) free Poisson process explicitly, similar to the definitions of…
In this paper we consider symmetric powers representation and exterior powers representation of finite groups, which generated by the representation which has finite dimension over the complex field. We calculate the multiplicity of…
In this article we obtain an explicit formula in terms of the partitions of the positive integer $n$ to express the $n$-th term of a wide class of sequences of numbers defined by recursion. Our proof is based only on arithmetics. We compare…
We give an elementary proof of the Pieri-type formula in the cohomology of a Grassmannian of maximal isotropic subspaces of an odd orthogonal or symplectic vector space. This proof proceeds by explicitly computing a triple intersection of…
Given a complex of groups, we construct a new class of complex of groups that records its local data and offer a functorial perspective on the statement that complexes of groups are locally developable. We also construct a new notion of an…
We introduce an algorithm to decompose orthogonal matrix representations of the symmetric group over the reals into irreducible representations, which as a by-product also computes the multiplicities of the irreducible representations. The…
We describe a class of integrable systems on Poisson submanifolds of the affine Poisson-Lie groups $\widehat{PGL}(N)$, which can be enumerated by cyclically irreducible elements the co-extended affine Weyl groups $(\widehat{W}\times…
Recently a nice work about the understanding of one-loop integrals has been done in [1] using the tricks of the projective space language associated to their Feynman parametrization. We find this language is also very suitable to deal with…
It is a classical result of Wigner that for an hermitian matrix with independent entries on and above the diagonal, the mean empirical eigenvalue distribution converges weakly to the semicircle law as matrix size tends to infinity. In this…
We present the first algorithm for computing class groups and unit groups of arbitrary number fields that provably runs in probabilistic subexponential time, assuming the Extended Riemann Hypothesis (ERH). Previous subexponential algorithms…
It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…
We describe an effective method for calculating certain infinite sums, generalizations of the classical Bernoulli polynomials. As shown by Edward Witten in his papers on two-dimensional gauge theories, the correlation functions of…
Jury and Martin establish an analogue of the classical inner-outer factorization of Hardy space functions. They show that every function $f$ in a Hilbert function space with a normalized complete Pick reproducing kernel has a factorization…
We consider the squared singular values of the product of $M$ standard complex Gaussian matrices. Since the squared singular values form a determinantal point process with a particular Meijer G-function kernel, the gap probabilities are…
Motivated by the study of the conjugacy problem for outer automorphism of free groups, we develop the algorithmic theory of the free-by-cyclic group produced by unipotent linearly growing automorphisms of f.g. free groups. We compute…
The complex analytic methods have found a wide range of applications in the study of multiplicity-free representations. This article discusses, in particular, its applications to the question of restricting highest weight modules with…
We give an incremental polynomial time algorithm for enumerating the vertices of any polyhedron $\mathcal{P}(A,\mathbf{1})=\{x\in\RR^n \mid Ax\geq \b1,~x\geq \b0\}$, when $A$ is a totally unimodular matrix. Our algorithm is based on…
Dynamic programming on path and tree decompositions of graphs is a technique that is ubiquitous in the field of parameterized and exponential-time algorithms. However, one of its drawbacks is that the space usage is exponential in the…
Bisymmetric Macdonald polynomials can be obtained through a process of antisymmetrization and $t$-symmetrization of non-symmetric Macdonald polynomials. Using the double affine Hecke algebra, we show that the evaluation of the bisymmetric…
It is well-known that the representation theory of the finite group of unipotent upper-triangular matrices $U_n$ over a finite field is a wild problem. By instead considering approximately irreducible representations (supercharacters), one…