Related papers: Breaking down the reduced Kronecker coefficients

Given a bounded open set $\Omega\subset \mathbb{R}^n$, we study sequences of quadratic functionals on the Sobolev space $H^1_0(\Omega)$, perturbed by sequences of bounded linear functionals. We prove that their $\Gamma$-limits, in the weak…

Applying the $q$-Zeilberger algorithm, we establish a unified $q$-analogue of the (C.2) and (G.2) supercongruences of Van Hamme, which can be viewed as a refinement of several previously known results. As consequences, we obtain a…

Optimizing non-convex functions is a fundamental challenge across machine learning and combinatorial optimization. We introduce and study $\gamma$-weakly $\theta$-up-concavity, a novel first-order condition that characterizes a broad class…

We study the topological version of the partition calculus in the setting of countable ordinals. Let $\alpha$ and $\beta$ be ordinals and let $k$ be a positive integer. We write $\beta\to_{top}(\alpha,k)^2$ to mean that, for every red-blue…

We study robust versions of properties of $(n,d,\lambda)$-graphs, namely, the property of a random sparsification of an $(n,d,\lambda)$-graph, where each edge is retained with probability $p$ independently. We prove such results for the…

We consider parameterised subgraph-counting problems of the following form: given a graph G, how many k-tuples of its vertices have a given property? A number of such problems are known to be #W[1]-complete; here we substantially generalise…

For any elements b,c of a number field K, let G(b,c) denote the backwards orbit of b under the map f_c: C-->C given by f_c(x)=x^2+c. We prove an upper bound on the number of elements of G(b,c) whose degree over K is at most some constant B.…

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…

We investigate the existence and multiplicity of abstract weak solutions of the equation $-\Delta_p u -\Delta_q u=\alpha |u|^{p-2}u + \beta |u|^{q-2}u$ in a bounded domain under zero Dirichlet boundary conditions, assuming $1<q<p$ and…

The \emph{$k$-restricted edge-connectivity} of a graph $G$, denoted by $\lambda_k(G)$, is defined as the minimum size of an edge set whose removal leaves exactly two connected components each containing at least $k$ vertices. This graph…

Let us consider the following minimum problem \[ \lambda_\alpha(p,r)= \min_{\substack{u\in W_{0}^{1,p}(-1,1)\\ u\not\equiv0}}\dfrac{\displaystyle\int_{-1}^{1}|u'|^{p}dx+\alpha\left|\int_{-1}^{1}|u|^{r-1}u\, dx\right|^{\frac…

In this paper, we investigate the minimization problem : $$ \inf_{ \displaystyle{\begin{array}{lll} u \in H_0^1(\Omega), v \in H_0^1(\Omega),\\ \quad \| u \|_{L^{q}} =1, \quad \| v \|_{L^{q}} = 1 \end{array}}} \left[ \frac{1}{2}…

We consider the following Lane-Emden system with Neumann boundary conditions \[ -\Delta u= |v|^{q-1}v \text{ in } \Omega,\qquad -\Delta v= |u|^{p-1}u \text{ in } \Omega,\qquad \partial_\nu u=\partial_\nu v=0 \text{ on } \partial \Omega, \]…

We determine the border ranks of tensors that could potentially advance the known upper bound for the exponent $\omega$ of matrix multiplication. The Kronecker square of the small $q=2$ Coppersmith-Winograd tensor equals the $3\times 3$…

We investigate a class of Kirchhoff type equations involving a combination of linear and superlinear terms as follows: \begin{equation*} -\left( a\int_{\mathbb{R}^{N}}|\nabla u|^{2}dx+1\right) \Delta u+\mu V(x)u=\lambda…

Generalization problems in languages with binders involve computing the most common structure between expressions while respecting bound variable renaming and freshness constraints. These problems often lack a least general solution.…

Let $G$ be a finite group admitting a coprime automorphism $\alpha$ of order $e$. Denote by $I_G(\alpha)$ the set of commutators $g^{-1}g^\alpha$, where $g\in G$, and by $[G,\alpha]$ the subgroup generated by $I_G(\alpha)$. We study the…

The multiplicities a_{lambda,mu} of simple modules L(mu) in the composition series of Kac modules V(lambda) for the Lie superalgebra gl(m/n) were described by Serganova, leading to her solution of the character problem for gl(m/n). In…

Kernelization is an important tool in parameterized algorithmics. Given an input instance accompanied by a parameter, the goal is to compute in polynomial time an equivalent instance of the same problem such that the size of the reduced…

We show that unconstrained quadratic optimization over a Grassmannian $\operatorname{Gr}(k,n)$ is NP-hard. Our results cover all scenarios: (i) when $k$ and $n$ are both allowed to grow; (ii) when $k$ is arbitrary but fixed; (iii) when $k$…