English
Related papers

Related papers: Breaking down the reduced Kronecker coefficients

200 papers

Let $n, r, k$ be positive integers such that $3\leq k < n$ and $2\leq r \leq k-1$. Let $m(n, r, k)$ denote the maximum number of edges an $r$-uniform hypergraph on $n$ vertices can have under the condition that any collection of $i$ edges,…

Discrete Mathematics · Computer Science 2012-10-05 Niranjan Balachandran , Srimanta Bhattacharya

In 2007 it was conjectured that the Constraint Satisfaction Problem (CSP) over a constraint language $\Gamma$ is tractable if and only if $\Gamma$ is preserved by a weak near-unanimity (WNU) operation. After many efforts and partial…

Computational Complexity · Computer Science 2020-05-05 Dmitriy Zhuk

Our main goal is to compute the decomposition of arbitrary Kronecker powers of the Harmonics of $S_n$. To do this, we give a new way of decomposing the character for the action of $S_n$ on polynomial rings with $k$ sets of $n$ variables.…

Combinatorics · Mathematics 2021-04-02 Marino Romero

Let $G$ be a graph with degree sequence $d_1\geq \ldots \geq d_n$. Slater proposed $s\ell(G)=\min\{ s: (d_1+1)+\cdots+(d_s+1)\geq n\}$ as a lower bound on the domination number $\gamma(G)$ of $G$. We show that deciding the equality of…

Combinatorics · Mathematics 2016-08-17 Michael Gentner , Dieter Rautenbach

We study kernelization of classic hard graph problems when the input graphs fulfill triadic closure properties. More precisely, we consider the recently introduced parameters closure number $c$ and the weak closure number $\gamma$ [Fox et…

Data Structures and Algorithms · Computer Science 2021-03-09 Tomohiro Koana , Christian Komusiewicz , Frank Sommer

In the present note, we study a new method of constructing efficient coverings for Kronecker powers of matrices, recently proposed by J. Alman, Y. Guan, A. Padaki [arXiv, 2022]. We provide an alternative proof for the case of symmetric…

Data Structures and Algorithms · Computer Science 2022-12-06 Igor S. Sergeev

The normal covering number $\gamma(G)$ of a finite, non-cyclic group $G$ is the least number of proper subgroups such that each element of $G$ lies in some conjugate of one of these subgroups. We prove that there is a positive constant $c$…

Group Theory · Mathematics 2013-01-30 Daniela Bubboloni , Cheryl E. Praeger , Pablo Spiga

The lower and the upper irredundance numbers of a graph $G$, denoted $ir(G)$ and $IR(G)$ respectively, are conceptually linked to domination and independence numbers and have numerous relations to other graph parameters. It is a…

In this paper, we find the greatest values $\alpha_{1}$, $\alpha_{2}$, $\alpha_{3}$, $\alpha_{4}$, $\alpha_{5}$, $\alpha_{6}$, $\alpha_{7}$, $\alpha_{8}$ and the least values $\beta_{1}$, $\beta_{2}$, $\beta_{3}$, $\beta_{4}$, $\beta_{5}$,…

Classical Analysis and ODEs · Mathematics 2014-05-20 Zhi-Jun Guo , Yan Zhang , Yu-Ming Chu , Ying-Qing Song

The aim of this paper is to prove $\Gamma^{1,\alpha}$ Schauder estimates near a $C^{1,\alpha}$ non-characteristic portion of the boundary for $\Gamma^{0, \alpha}$ perturbations of horizontal Laplaceans in Carnot groups. This situation of…

Analysis of PDEs · Mathematics 2018-11-12 Agnid Banerjee , Nicola Garofalo , Isidro Munive

Let $G$ be a finite group and let $c(G)$ be the number of cyclic subgroups of $G$. We study the function $\alpha(G) = c(G)/|G|$. We explore its basic properties and we point out a connection with the probability of commutation. For many…

Group Theory · Mathematics 2018-02-23 Igor Lima , Martino Garonzi

Let $k \geq 3$. We prove the following three bounds for the matching number, $\alpha'(G)$, of a graph, $G$, of order $n$ size $m$ and maximum degree at most $k$. If $k$ is odd, then $\alpha'(G) \ge \left( \frac{k-1}{k(k^2 - 3)} \right) n \,…

Combinatorics · Mathematics 2016-04-19 Michael A. Henning , Anders Yeo

We provide a general framework to exclude parameterized running times of the form $O(\ell^\beta+ n^\gamma)$ for problems that have polynomial running time lower bounds under hypotheses from fine-grained complexity. Our framework is based on…

Data Structures and Algorithms · Computer Science 2023-01-09 Klaus Heeger , André Nichterlein , Rolf Niedermeier

Let $G$ be a finite group. Let $K/k$ be a Galois extension of number fields with Galois group isomorphic to $G$, and let $C \subseteq \mathrm{Gal}(K/k) \simeq G$ be a conjugacy invariant subset. It is well known that there exists an…

Number Theory · Mathematics 2026-01-01 Peter J. Cho , Robert J. Lemke Oliver , Asif Zaman

Let $\mathcal{N}\mathcal{F}$ be the class of smooth non-flat curves near the origin and near infinity previously introduced by the second author and let $\gamma\in\mathcal{N}\mathcal{F}$. We show - via a unifying approach relative to the…

Classical Analysis and ODEs · Mathematics 2020-06-08 Alejandra Gaitan , Victor Lie

We prove a lower bound $\Omega\left(\frac{k+l}{k^2l^2}N^{2-\frac{k+l+2}{kl}}\right)$ on the maximal possible weight of a $(k,l)$-free (that is, free of all-ones $k\times l$ submatrices) Boolean circulant $N \times N$ matrix. The bound is…

Computational Complexity · Computer Science 2017-01-31 M. I. Grinchuk , I. S. Sergeev

We give a positive combinatorial formula for the Kronecker coefficient g_{lambda mu(d) nu} for any partitions lambda, nu of n and hook shape mu(d) := (n-d,1^d). Our main tool is Haiman's \emph{mixed insertion}. This is a generalization of…

Combinatorics · Mathematics 2012-09-11 Jonah Blasiak

We study the weakly coupled critical elliptic system \begin{equation*} \begin{cases} -\Delta u=\mu_{1}|u|^{2^{*}-2}u+\lambda\alpha |u|^{\alpha-2}|v|^{\beta}u & \text{in }\Omega,\\ -\Delta v=\mu_{2}|v|^{2^{*}-2}v+\lambda\beta…

Analysis of PDEs · Mathematics 2018-05-29 Mónica Clapp , Jorge Faya

We present a lower bound on the Kronecker coefficients for tensor squares of the symmetric group via the characters of~$S_n$, which we apply to obtain various explicit estimates. Notably, we extend Sylvester's unimodality of $q$-binomial…

Combinatorics · Mathematics 2016-05-04 Igor Pak , Greta Panova

In this paper, we find the greatest values $\alpha$ and $\lambda$, and the least values $\beta$ and $\mu$ such that the double inequalities $$C^{\alpha}(a,b)A^{1-\alpha}(a,b)<M(a,b)<C^{\beta}(a,b)A^{1-\beta}(a,b)$$ and &[C(a,b)/6+5…

Classical Analysis and ODEs · Mathematics 2012-11-03 Miao-Kun Wang , Yu-Ming Chu , Bao-Yu Liu