Related papers: Breaking down the reduced Kronecker coefficients

Here is one of the results obtained in this paper: Let $\Omega\subset {\bf R}^n$ be a smooth bounded domain, let $q>1$, with $q<{{n+2}\over {n-2}}$ if $n\geq 3$ and let $\lambda_1$ be the first eigenvalue of the problem $$\cases{-\Delta…

Let $G$ be a connected compact group equipped with the normalised Haar measure $\mu$. Our first result shows that given $\alpha, \beta>0$, there is a constant $c = c(\alpha,\beta)>0$ such that for any compact sets $A,B\subseteq G$ with $…

In this article we study solutions to the (interior) thin obstacle problem under low regularity assumptions on the coefficients, the obstacle and the underlying manifold. Combining the linearization method of Andersson \cite{An16} and the…

The Kronecker coefficients are the structural constants for the tensor categories of representations of the symmetric groups; namely, given three partitions $\lambda, \mu, \tau$ of $n$, the multiplicity of $\lambda$ in $\mu \otimes \tau$ is…

We give an introduction to some of the recent ideas that go under the name "geometric complexity theory". We first sketch the proof of the known upper and lower bounds for the determinantal complexity of the permanent. We then introduce the…

In this paper, assuming the low-degree conjecture, we provide evidence of computational hardness for two problems: (1) the (partial) matching recovery problem in the sparse correlated Erd\H{o}s-R\'enyi graphs $\mathcal G(n,q;\rho)$ when the…

We prove the #P-hardness of the counting problems associated with various satisfiability, graph and combinatorial problems, when restricted to planar instances. These problems include \begin{romannum} \item[{}] {\sc 3Sat, 1-3Sat, 1-Ex3Sat,…

Let $ \mathbb{Q}\mathcal{E}_{\mathbb{Z}} $ be the set of power sums whose characteristic roots belong to $ \mathbb{Z} $ and whose coefficients belong to $ \mathbb{Q} $, i.e. $ G : \mathbb{N} \rightarrow \mathbb{Q} $ satisfies…

We consider weak solutions to $$-\Delta_pu+a(x,u)|\nabla u|^q=f(x,u),$$ with $p>1$, $q\geq\max\,\{p-1,1\}$. We exploit the Moser iteration technique to prove a Harnack comparison inequality for $C^1$ weak solutions. As a consequence we…

We prove essentially tight lower bounds, conditionally to the Exponential Time Hypothesis, for two fundamental but seemingly very different cutting problems on surface-embedded graphs: the Shortest Cut Graph problem and the Multiway Cut…

The reduced Kronecker coefficients are particular instances of Kronecker coefficients that contain enough information to recover them. In this notes we compute the generating function of a family of reduced Kronecker coefficients. We also…

In the $k$-cut problem, we want to find the lowest-weight set of edges whose deletion breaks a given (multi)graph into $k$ connected components. Algorithms of Karger \& Stein can solve this in roughly $O(n^{2k})$ time. On the other hand,…

We settle the question of where exactly the reduced Kronecker coefficients lie on the spectrum between the Littlewood-Richardson and Kronecker coefficients by showing that every Kronecker coefficient of the symmetric group is equal to a…

Let $(M,g)$ be a $m$-dimensional compact Riemannian manifold without boundary. Assume $\kappa\in C^2(M)$ is such that $-\Delta_g+\kappa$ is coercive. We prove the existence of a solution to the supercritical problems $$ -\Delta_gu+\kappa u=…

We study the following question: Given are two $k$-colorings $\alpha$ and $\beta$ of a graph $G$ on $n$ vertices, and integer $\ell$. The question is whether $\alpha$ can be modified into $\beta$, by recoloring vertices one at a time, while…

In this paper we consider the following problem $$\begin{cases} -\Delta_{g}u+V(x)u=\lambda\alpha(x)f(u), & \mbox{in }M\\ u\geq0, & \mbox{in }M\\ u\to0, & \mbox{as }d_{g}(x_{0},x)\to\infty \end{cases}$$where $(M,g)$ is a $N$-dimensional…

It is shown that, for any function $g$ that is weakly increasing on compact convex sets and has the property that if $\lambda\ge 0$ and $K^\prime$ is a translate of $\lambda K$ then $g(K^\prime) =\lambda g(K)$, then for any covering…

In this work, we study the two following minimization problems for $r \in \mathbb{N}^{*}$, \begin{equation*} \begin{array}{ccc} S_{0,r}(\varphi)=\displaystyle\inf_{u\in H_{0}^{r}(\Omega)\,|u+\varphi\|_{L^{2^{*r}}}=1}\|u\|_{r}^{2}&…

We further investigate the weak topology generated by the irreducible unitary representations of a group $G$. A deep result due to Ernest \cite{Ernest1971} and Hughes \cite{Hughes1973} asserts that every weakly compact subset of a locally…

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…