中文
相关论文

相关论文: A diagrammatic approach to Kronecker squares

200 篇论文

Double Kostka polynomials are polynomials indexed by a pair of double partitions. As in the ordinary case, double Kostka polynomials are defined in terms of Schur functions and Hall-Littlewood functions associated to double partitions. In…

表示论 · 数学 2015-01-27 Liu Shiyuan , Toshiaki Shoji

We present a lower bound on the Kronecker coefficients for tensor squares of the symmetric group via the characters of~$S_n$, which we apply to obtain various explicit estimates. Notably, we extend Sylvester's unimodality of $q$-binomial…

组合数学 · 数学 2016-05-04 Igor Pak , Greta Panova

The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…

组合数学 · 数学 2007-05-23 Jason Fulman

Let $f_1,\dots,f_k\in\mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an integer $n<x$ such that the fractional parts $\|f_i(n)\|\ll x^{c/k}$ for all $1\le i\le k$ and for some constant…

数论 · 数学 2020-11-25 James Maynard

We present positivity conjectures for the Schur expansion of Jack symmetric functions in two bases given by binomial coefficients. Partial results suggest that there are rich combinatorics to be found in these bases, including Eulerian…

组合数学 · 数学 2026-02-17 Per Alexandersson , James Haglund , George Wang

This paper proposes methods for likelihood-based inference in multivariate linear regressions when the correlation matrix of the responses is separable; that is, it has a Kronecker product structure, but the variances are unrestricted. The…

统计计算 · 统计学 2026-04-16 Karl Oskar Ekvall

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…

群论 · 数学 2024-07-24 Sheehan Olver

The problem of decomposing the Kronecker product of $S_n$ characters is one of the last major open problems in the ordinary representation theory of the symmetric group $S_n$. Here we prove upper and lower polynomial bounds for the…

表示论 · 数学 2010-11-09 Amitai Regev

We define the double Gromov-Witten invariants of Hirzebruch surfaces in analogy with double Hurwitz numbers, and we prove that they satisfy a piecewise polynomiality property analogous to their 1-dimensional counterpart. Furthermore we show…

代数几何 · 数学 2015-12-02 Federico Ardila , Erwan Brugalle

The problem of finding independent components of an indexed object (e.g., a tensor) with arbitrary number of indices and arbitrary linear symmetries is discussed. It is proved that the number of independent components $f(k)$ is a polynomial…

广义相对论与量子宇宙学 · 物理学 2007-05-23 Sergei A. Klioner

We provide a combinatorial description of the coefficients appearing in the expansion of Hall-Littlewood polynomials in terms of monomial symmetric functions. We also give a Littlewood-Richardson rule for Hall-Littlewood polynomials. For…

组合数学 · 数学 2007-06-13 Christoph Schwer

The two variable Kostka functions are the scalar products of the Macdonald polynomials with the Schur polynomials with respect to the scalar product which makes the Hall-Littlewood polynomials pairwise orthogonal. A conjecture of Macdonald…

q-alg · 数学 2008-02-03 Friedrich Knop

Kronecker's Theorem and Rabin's Theorem are fundamental results about computable fields F and the decidability of the set of irreducible polynomials over F. We adapt these theorems to the setting of differential fields K, with constrained…

交换代数 · 数学 2014-04-15 Russell Miller , Alexey Ovchinnikov , Dmitry Trushin

Recently, a novel method based on coding partitions [1]-[4] has been used to derive power series expansions to previously intractable problems. In this method the coefficients at $k$ are determined by summing the contributions made by each…

组合数学 · 数学 2012-03-23 Victor Kowalenko

In this paper, we derive some formulae involving coefficients of polynomials which occur quite naturally in the study of restricted partitions. Our method involves a recently discovered sieve technique by Li and Wan (Sci. China. Math.…

数论 · 数学 2020-11-11 Ankush Goswami , Venkata Raghu Tej Pantangi

It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…

动力系统 · 数学 2025-03-17 Ziyad AlSharawi , Jose S. Cánovas , Sadok Kallel

By applying a Gr\"{o}bner-Shirshov basis of the symmetric group $S_{n}$, we give two formulas for Schubert polynomials, either of which involves only nonnegative monomials. We also prove some combinatorial properties of Schubert…

环与代数 · 数学 2017-09-15 Zerui Zhang , Yuqun Chen

Using a recursion formula due to Dvir, we obtain information on maximal and almost maximal components in Kronecker products of characters of the symmetric groups. This is applied to confirm a conjecture made by Bessenrodt and Kleshchev in…

组合数学 · 数学 2014-05-13 Christine Bessenrodt , Stephanie van Willigenburg

This paper reexamines univariate reduction from a toric geometric point of view. We begin by constructing a binomial variant of the $u$-resultant and then retailor the generalized characteristic polynomial to fully exploit sparsity in the…

代数几何 · 数学 2009-09-25 J. Maurice Rojas

We present positivity conjectures for the Schur expansion of Jack symmetric functions in two bases given by binomial coefficients. Partial results suggest that there are rich combinatorics to be found in these bases, including Eulerian…

组合数学 · 数学 2019-07-02 Per Alexandersson , James Haglund , George Wang