Related papers: Kronecker multiplicities in the $(k,\ell)$ hook ar…

We introduce a new approach for generating combinatorial identities and formulas by the application of Kronecker substitution to polynomial expansions within quotient rings. Our main result enables the derivation of elementary arithmetic…

Let $\mathbb{F}$ be an algebraically closed field and $G$ be an almost quasi-simple group. An important problem in representation theory is to classify the subgroups $H<G$ and $\mathbb{F} G$-modules $L$ such that the restriction…

Fix a partition $\mu=(\mu_1,\dotsc,\mu_m)$ of an integer $k$ and positive integer $d$. For each $n>k$, let $\chi^\lambda_\mu$ denote the value of the irreducible character of $S_n$ at a permutation with cycle type…

We answer a question of Erd\"os, Herzog, and Piranian on the minimal area of polynomial lemniscates when all the zeros of the polynomial are constrained to lie on a compact set K whose logarithmic capacity is strictly larger than 1.

We introduce a family of generalized Schr\"oder polynomials $S_\tau(q,t,a)$, indexed by triangular partitions $\tau$ and prove that $S_\tau(q,t,a)$ agrees with the Poincar\'e series of the triply graded Khovanov-Rozansky homology of the…

Let $G$ be a simple algebraic group of type $E_n (n=6,7,8)$ defined over an algebraically closed field $k$ of characteristic $2$. We present examples of triples of closed reductive groups $H<M<G$ such that $H$ is $G$-completely reducible,…

Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…

Let K be a complex reductive algebraic group and V a representation of K. Let S denote the ring of polynomials on V. Assume that the action of K on S is multiplicity free. If V_{\lambda} is an irreducible representation of K, let…

We present three different upper bounds for Kronecker coefficients $g(\lambda,\mu,\nu)$ in terms of Kostka numbers, contingency tables and Littlewood--Richardson coefficients. We then give various examples, asymptotic applications, and…

For ample vector bundles $E$ over compact complex varieties $X$ and a Schur functor $S_I$ corresponding to an arbitrary partition $I$ of the integer $|I|$, one would like to know the optimal vanishing theorem for the cohomology groups…

We prove that every finite Borel measure $\mu$ in $\mathbb{R}^N$ that is bounded from above by the Hausdorff measure $\mathcal{H}^s$ can be split in countable many parts $\mu\lfloor_{E_k}$ that are bounded from above by the Hausdorff…

The thickness of a graph $G$ is the minimum number of planar subgraphs whose union is $G$. In this paper, we present sharp lower and upper bounds for the thickness of the Kronecker product $G\times H$ of two graphs $G$ and $H$. We also give…

We study homological multiplicities of spherical varieties of reductive group $G$ over a $p$-adic field $F$. Based on Bernstein's decomposition of the category of smooth representations of a $p$-adic group, we introduce a sheaf that…

In the present note, we study a new method of constructing efficient coverings for Kronecker powers of matrices, recently proposed by J. Alman, Y. Guan, A. Padaki [arXiv, 2022]. We provide an alternative proof for the case of symmetric…

We show that the loop homology algebras of polyhedral products of the form $(\underline{X},\underline{*})^{\mathcal{K}}$ can be written as a colimit over the flagification of $\mathcal{K}$, and obtain a similar result for the Poincar\'e…

In the present paper, we study problems related to the classical Borsuk's problem. Recall that the Borsuk's problem consists in finding the smallest number $ f(n) $ of parts of smaller diameter into which an arbitrary set of diameter 1 in…

Many aspects of the asymptotics of Plancherel distributed partitions have been studied in the past fifty years, in particular the limit shape, the distribution of the longest rows, connections with random matrix theory and characters of the…

We investigate the arithmetic formula complexity of the elementary symmetric polynomials S(k,n). We show that every multilinear homogeneous formula computing S(k,n) has size at least k^(Omega(log k))n, and that product-depth d multilinear…

Character polynomials are used to study the restriction of a polynomial representation of a general linear group to its subgroup of permutation matrices. A simple formula is obtained for computing inner products of class functions given by…

In the paper, the authors present several new relations and applications for the combinatorial sequence that counts the possible partitions of a finite set with the restriction that the size of each block is contained in a given set. One of…