Related papers: Breaking down the reduced Kronecker coefficients

We prove a tight quantum query lower bound $\Omega(n^{k/(k+1)})$ for the problem of deciding whether there exist $k$ numbers among $n$ that sum up to a prescribed number, provided that the alphabet size is sufficiently large. This is an…

Continuing the study of complexity theory of Koepke's Ordinal Turing Machines (OTMs) that was started by Rin, L\"owe and the author, we prove the following results: (1) An analogue of Ladner's theorem for OTMs holds: That is, there are…

We study the two inference problems of detecting and recovering an isolated community of \emph{general} structure planted in a random graph. The detection problem is formalized as a hypothesis testing problem, where under the null…

In this paper, we show the existence and non-existence of minimizers of the following minimization problems which include an open problem mentioned by Horiuchi and Kumlin in 2012: \begin{align*} G_a := \inf_{u \in W_0^{1,N}(\Omega )…

The Kronecker coefficients are the decomposition multiplicities of the tensor product of two irreducible representations of the symmetric group. Unlike the Littlewood--Richardson coefficients, which are the analogues for the general linear…

Let $\beta>0$. Motivated by jumbled graphs defined by Thomason, the celebrated expander mixing lemma and Haemers's vertex separation inequality, we define that a graph $G$ with $n$ vertices is a weakly $(n,\beta)$-graph if $\frac{|X|…

Kostka, Littlewood-Richardson, Plethysm and Kronecker coefficients are the multiplicities of irreducible representations in the decomposition of representations of the symmetric group that play an important role in representation theory,…

We study the complexity of computing majority as a composition of local functions: \[ \text{Maj}_n = h(g_1,\ldots,g_m), \] where each $g_j :\{0,1\}^{n} \to \{0,1\}$ is an arbitrary function that queries only $k \ll n$ variables and $h :…

We consider a monotone submodular maximization problem whose constraint is described by a logic formula on a graph. Formally, we prove the following three `algorithmic metatheorems.' (1) If the constraint is specified by a monadic…

Let $\Omega \subset \mathbb{R}^N$ ($N \geq 3$) be a $C^2$ bounded domain and $\Sigma \subset \Omega$ is a $C^2$ compact boundaryless submanifold in $\mathbb{R}^N$ of dimension $k$, $0\leq k < N-2$. For $\mu\leq (\frac{N-k-2}{2})^2$, put…

Suppose $0 < \alpha \leq n$, $H: \Bbb R^n \to [0,1]$ is a Lebesgue measurable function, and $A_\alpha(H)$ is the infimum of all numbers $C$ for which the inequality $\int_B H(x) dx \leq C R^\alpha$ holds for all balls $B \subset \Bbb R^n$…

Amdeberhan et al. (2024) introduced the notion of a generalized overcubic partition function $\overline a_c (n)$ and proved an infinite family of congruences modulo a prime $p\ge 3$ and some Ramanujan type congruences. In this paper, we…

We consider several old problems involving the number of prime divisors function $\omega(n)$, as well as the related functions $\Omega(n)$ and $\tau(n)$. Firstly, we show that there are infinitely many positive integers $n$ such that…

We prove a $\Gamma$-convergence result for space dependent weak membrane energies, that is for 'truncated quadratic potentials', that are quadratic below some threshold (depending on the pair of points that we are considering) and constant…

It is known that the Kronecker coefficient of three partitions is a bounded and weakly increasing sequence if one increases the first part of all three partitions. Furthermore if the first parts of partitions \lambda,\mu are big enough then…

This paper gives the first quantitative bounds for the inverse theorem for the Gowers $U^4$-norm over $\mathbb{F}_p^n$ when $p=2,3$. We build upon earlier work of Gowers and Mili\'cevi\'c who solved the corresponding problem for $p\geq 5$.…

Fix a finite group $G$. We study the computational complexity of counting problems of the following flavor: given a group $\Gamma$, count the number of homomorphisms $\Gamma \to G$. Our first result establishes that this problem is…

In the $\ell$-Coloring Problem, we are given a graph on $n$ nodes, and tasked with determining if its vertices can be properly colored using $\ell$ colors. In this paper we study below-guarantee graph coloring, which tests whether an…

We study the minimization problem for Conjunctive Regular Path Queries (CRPQs) and unions of CRPQs (UCRPQs). This is the problem of checking, given a query and a number $k$, whether the query is equivalent to one of size at most $k$. For…

In this note we extend a 2018 result of Bardos and Titi \cite{BT} to a new class of functional spaces $C^{0,\alpha}_\lambda(\bar{\Omega})$. It is shown that weak solutions $\,u\,$ satisfy the energy equality provided that $u\in…