English
Related papers

Related papers: Restriction coefficients for partitions with at mo…

200 papers

In this paper, we calculate the space $Ext^1_{GL(n)}(L_n(\lambda),L_n(\mu))$, where GL(n) is the general linear group of degree $n$ over an algebraically closed field of positive characteristic, $L_n(\lambda)$ and $L_n(\mu)$ are rational…

Representation Theory · Mathematics 2007-05-23 Vladimir Shchigolev

Let $\lambda$, $\mu$, $\lambda'$, $\mu'$ be partitions. The conjecture of Lam, Postnikov and Pylyavskyy states that, if $\lambda+\mu = \lambda' + \mu'$, and $\min(\lambda_i-\lambda_j, \mu_i-\mu_j) \leq \lambda'_i - \lambda'_j \leq…

Combinatorics · Mathematics 2026-05-01 David E Speyer

In this paper, we present, given a odd integer $d$, a decomposition of the multiset of bar lengths of a bar partition $\lambda$ as the union of two multisets, one consisting of the bar lengths in its $\bar{d}$-core partition…

Combinatorics · Mathematics 2013-01-09 Jean-Baptiste Gramain , Jorn B. Olsson

We propose a new approach to study the Kronecker coefficients by using the Schur-Weyl duality between the symmetric group and the partition algebra. We explain the limiting behavior and associated bounds in the context of the partition…

Representation Theory · Mathematics 2013-02-26 Christopher Bowman , Maud De Visscher , Rosa Orellana

An integer-valued matrix $\mathbf{A}$ is $\Delta$-modular if each $\text{rank}(\mathbf{A}) \times \text{rank}(\mathbf{A})$ submatrix has determinant at most $\Delta$ in absolute value. The column number problem is to determine the maximum…

Combinatorics · Mathematics 2025-09-18 Joseph Paat , Zach Walsh , Luze Xu

In 2003, Maroti showed that one could use the machinery of l-cores and l-quotients of partitions to establish lower bounds for p(n), the number of partitions of n. In this paper we explore these ideas in the case l=2, using them to give a…

Combinatorics · Mathematics 2007-05-23 Mark Wildon

We establish a rather unexpected and simple criterion for the boundedness of Schur multipliers $S_M$ on Schatten $p$-classes which solves a conjecture proposed by Mikael de la Salle. Given $1 < p < \infty$, a simple form our main result…

Functional Analysis · Mathematics 2023-04-03 José M. Conde-Alonso , Adrián M. González-Pérez , Javier Parcet , Eduardo Tablate

Using purely combinatorial methods we calculate the first degree cohomology of Specht modules indexed by two part partitions over fields of characteristic $p\ge 3$. These combinatorial methods also allow us to obtain an explicit description…

Representation Theory · Mathematics 2021-05-06 Liam Jolliffe

For any two partitions $\lambda$ and $\mu$ of a positive integer $N$, let $\chi_{\lambda}(\mu)$ be the value of the irreducible character of the symmetric group $S_{N}$ associated with $\lambda$, evaluated at the conjugacy class of elements…

Number Theory · Mathematics 2026-04-01 Jayanta Barman , Kamalakshya Mahatab

We prove various inequalities between the number of partitions with the bound on the largest part and some restrictions on occurrences of parts. We explore many interesting consequences of these partition inequalities. In particular, we…

Combinatorics · Mathematics 2017-08-08 Alexander Berkovich , Ali K. Uncu

Determining if a symmetric function is Schur-positive is a prevalent and, in general, a notoriously difficult problem. In this paper we study the Schur-positivity of a family of symmetric functions. Given a partition \lambda, we denote by…

Combinatorics · Mathematics 2013-10-11 Cristina Ballantine , Rosa Orellana

Motivated by questions of Mulmuley and Stanley we investigate quasi-polynomials arising in formulas for plethysm. We demonstrate, on the examples of $S^3(S^k)$ and $S^k(S^3)$, that these need not be counting functions of inhomogeneous…

Representation Theory · Mathematics 2018-02-12 Thomas Kahle , Mateusz Michalek

In the present work, we investigate real numbers whose sequence of partial quotients enjoys some combinatorial properties involving the notion of palindrome. We provide three new transendence criteria, that apply to a broad class of…

Number Theory · Mathematics 2012-05-07 Boris Adamczewski , Yann Bugeaud

We study the complexity of computing Kronecker coefficients $g(\lambda,\mu,\nu)$. We give explicit bounds in terms of the number of parts $\ell$ in the partitions, their largest part size $N$ and the smallest second part $M$ of the three…

Combinatorics · Mathematics 2015-02-25 Igor Pak , Greta Panova

We present a study of three families of Kronecker coefficients, which we describe in terms of reduced Kronecker coefficients. This study is grounded on the generating function of the coefficients, proved by a bijection between two…

Combinatorics · Mathematics 2016-04-05 L. Colmenarejo

We construct the polynomial induction functor, which is the right adjoint to the restriction functor from the category of polynomial representations of a general linear group to the category of representations of its Weyl group. This…

Representation Theory · Mathematics 2021-12-17 Sridhar P. Narayanan , Digjoy Paul , Amritanshu Prasad , Shraddha Srivastava

We compute the dimension $d_{n,r}(q) = \dim(\IR_q^r)$ of the defining module $\IR_q^r$ for the $q$-partition algebra. This module comes from $r$-iterations of Harish-Chandra restriction and induction on $\GL_n(\FF_q)$. This dimension is a…

Combinatorics · Mathematics 2009-09-08 Tom Halverson , Nathaniel Thiem

We show that the shifted rank, or srank, of any partition $\lambda$ with distinct parts equals the lowest degree of the terms appearing in the expansion of Schur's $Q_{\lambda}$ function in terms of power sum symmetric functions. This gives…

Combinatorics · Mathematics 2008-05-20 William Y. C. Chen , Donna Q. J. Dou , Robert L. Tang , Arthur L. B. Yang

We propose a new approach to combine Restricted Boltzmann Machines (RBMs) that can be used to solve combinatorial optimization problems. This allows synthesis of larger models from smaller RBMs that have been pretrained, thus effectively…

Machine Learning · Computer Science 2019-09-10 Saavan Patel , Sayeef Salahuddin

We show that the number of partitions of n with alternating sum k such that the multiplicity of each part is bounded by 2m+1 equals the number of partitions of n with k odd parts such that the multiplicity of each even part is bounded by m.…

Combinatorics · Mathematics 2012-08-23 William Y. C. Chen , Ae Ja Yee , Albert J. W. Zhu