English
Related papers

Related papers: Upper bounds on Kronecker coefficients with few ro…

200 papers

Let $\mathbf{v}_i$ be vectors in $\mathbb{R}^d$ and $\{\varepsilon_i\}$ be independent Rademacher random variables. Then the Littlewood-Offord problem entails finding the best upper bound for $\sup_{\mathbf{x} \in \mathbb{R}^d}…

Combinatorics · Mathematics 2020-09-03 Kyle Luh , David Xiang

In this paper we explore Kruyswijk's method and show how to obtain congruences for cubic partition. That apart we also examine inequalities for a(n) and provide upper bound for it in the fashion of the classic partition function p(n).

Number Theory · Mathematics 2017-01-02 Prabir Das Adhikary , Koustav Banerjee , Manosij Ghosh Dastidar

We give two lower bound formulas for multicolored Ramsey numbers. These formulas improve the bounds for several small multicolored Ramsey numbers.

Combinatorics · Mathematics 2007-05-23 Aaron Robertson

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 provide several constructions for problems in Ramsey theory. First, we prove a superexponential lower bound for the classical 4-uniform Ramsey number $r_4(5,n)$, and the same for the iterated $(k-4)$-fold logarithm of the $k$-uniform…

Combinatorics · Mathematics 2018-02-21 Dhruv Mubayi , Andrew Suk

We review some recent results on eigenvalues of fractional Laplacians and fractional Schr\"odinger operators. We discuss, in particular, Lieb-Thirring inequalities and their generalizations, as well as semi-classical asymptotics.

Spectral Theory · Mathematics 2017-11-07 Rupert L. Frank

We prove several congruences for trinomial coefficients.

Number Theory · Mathematics 2010-06-29 Hui-Qin Cao , Hao Pan

This work focuses on minimizing the eigenvalue of a noncommutative polynomial subject to a finite number of noncommutative polynomial inequality constraints. Based on the Helton-McCullough Positivstellensatz, the noncommutative analog of…

Optimization and Control · Mathematics 2025-09-10 Igor Klep , Victor Magron , Gaël Massé , Jurij Volčič

Littlewood Richardson coefficients are structure constants appearing in the representation theory of the general linear groups ($GL_n$). The main results of this paper are: 1. A strongly polynomial randomized approximation scheme for…

Combinatorics · Mathematics 2013-06-19 Hariharan Narayanan

In graph theory, knowing the number of complete subgraphs with r vertices that a graph g has, limits the number of its complete subgraphs with s vertices, for s > r. A useful upper bound is provided by the Kruskal-Katona theorem, but this…

Combinatorics · Mathematics 2018-12-27 Robert Cowen

Upper bounds are obtained for the $p$-capacity of compact sets in $\R^d$, with $d \ge 2$ and $1<p<d$. Upper and lower bounds are obtained for the product of $p$-capacity and powers of the $q$-torsional rigidity over the collection of all…

Analysis of PDEs · Mathematics 2025-07-25 Michiel van den Berg , Nunzia Gavitone

In this paper we prove the optimal upper bound $\frac{\lambda_{n}}{\lambda_{m}}\leq\frac{n^{2}}{m^{2}}$ $\Big(\lambda_{n}>\lambda_{m}\geq 11\sup\limits_{x\in[0,1]}q(x)\Big)$ for one-dimensional Schrodinger operators with a nonnegative…

Spectral Theory · Mathematics 2018-03-02 Jamel Ben Amara , Jihed Hedhly

An apriori bound for the condition number associated to each of the following problems is given: general linear equation solving, minimum squares, non-symmetric eigenvalue problems, solving univariate polynomials, solving systems of…

Numerical Analysis · Mathematics 2025-10-20 Gregorio Malajovich

In this paper we discuss a class of combinatorial constants in Ramsey theory- edge Folkman numbers. We give an upper bound on one of them- the number F_e(3,3,3;13).

Combinatorics · Mathematics 2011-03-24 Nikolay Kolev

Given a diagram D of a knot K, we give easily computable bounds for Rasmussen's concordance invariant s(K). The bounds are not independent of the diagram D chosen, but we show that for diagrams satisfying a given condition the bounds are…

Geometric Topology · Mathematics 2012-12-12 Andrew Lobb

A family of symmetric functions $\tilde{s}_\lambda$ was introduced in [OZ], and independently in [AS]. The $\tilde{s}_\lambda$ encode many stability properties of representations of symmetric groups (e.g. when multiplied, the structure…

Representation Theory · Mathematics 2021-12-03 Christopher Ryba

Kronecker coefficients encode the tensor products of complex irreducible representations of symmetric groups. Their stability properties have been considered recently by several authors (Vallejo, Pak and Panova, Stembridge). In previous…

Representation Theory · Mathematics 2014-12-05 Laurent Manivel

We show that a lower bound for covariance of $\min(X_1,X_2)$ and $\max(X_1,X_2)$ is $\cov{X_1}{X_2}$ and an upper bound for variance of \\ $\min(X_2,\max(X,X_1))$ is $\var{X} + \var{X_1} +\var{X_2}$ generalizing previous results. We also…

Probability · Mathematics 2007-05-23 N. Hemachandra , V. Cheriyan

Let $\Omega \subset \mathbb R^N$, $N \geq 2$, be a smooth bounded domain. We consider a boundary value problem of the form $$-\Delta u = c_{\lambda}(x) u + \mu(x) |\nabla u|^2 + h(x), \quad u \in H^1_0(\Omega)\cap L^{\infty}(\Omega)$$ where…

Analysis of PDEs · Mathematics 2018-11-02 Colette De Coster , Antonio J. Fernández , Louis Jeanjean

We prove the combinatorial invariance of the coefficient of $q$ in Kazhdan--Lusztig polynomials for arbitrary Coxeter groups. As a result, we obtain the Combinatorial Invariance Conjecture, of Lusztig and of Dyer, also for Bruhat intervals…

Combinatorics · Mathematics 2026-02-26 Grant T. Barkley , Christian Gaetz , Thomas Lam