Related papers: Breaking down the reduced Kronecker coefficients

Let $\Gamma=\langle a,b | a b^{p} a^{-1} = b^{q}\rangle$ be a Baumslag--Solitar group and $G$ be a complex reductive algebraic group with maximal compact subgroup $K<G$. We show that, when $p$ and $q$ are relatively prime with distinct…

Let $G$ denote a compact monothetic group, and let $$\rho (x) = \alpha_k x^k + \ldots + \alpha_1 x + \alpha_0,$$ where $\alpha_0, \ldots , \alpha_k$ are elements of $G$ one of which is a generator of $G$. Let $(p_n)_{n\geq 1}$ denote the…

Covering and partitioning the edges of a graph into cliques are classical problems at the intersection of combinatorial optimization and graph theory, having been studied through a range of algorithmic and complexity-theoretic lenses.…

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). We describe a…

Parameterized complexity enables the practical solution of generally intractable NP-hard problems when certain parameters are small, making it particularly useful in real-world applications. The study of string problems in this framework…

In this article, we prove that the double inequality $$\alpha G(a,b)+(1-\alpha)C(a,b)<M(a,b)<\beta G(a,b)+(1-\beta)C(a,b)$$ holds true for all $a,b>0$ with $a\neq b$ if and only if $\alpha\geq 5/9$ and $\beta\leq…

The \textit{toughness} $t(G)$ of a graph $G$ is a measure of its connectivity that is closely related to Hamiltonicity. Brouwer proved the lower bound $t(G) > \ell / \lambda - 2$ on the toughness of any connected $\ell$-regular graph, where…

In the paper, the authors find the greatest value $\lambda$ and the least value $\mu $ such that the double inequality \begin{multline*} C(\lambda a+(1-\lambda)b,\lambda b+(1-\lambda )a)<\alpha A(a,b)+(1-\alpha)T(a,b)\\ < C(\mu…

For $r \in [0,1]$ we say that a set $A \subseteq \omega$ is \emph{coarsely computable at density} $r$ if there is a computable set $C$ such that $\{n : C(n) = A(n)\}$ has lower density at least $r$. Let $\gamma(A) = \sup \{r : A \hbox{ is…

We study integrals of the form \begin{equation*} \int_{-1}^1(C_n^{(\lambda)}(x))^2(1-x)^\alpha (1+x)^\beta\, dx, \end{equation*} where $C_n^{(\lambda)}$ denotes the Gegenbauer-polynomial of index $\lambda>0$ and $\alpha,\beta>-1$. We give…

We compute the K-functional related to some couple of spaces as small or classical Lebesgue space or Lorentz-Marcinkiewicz spaces completing the results of the previous works of the authors. This computation allows to determine the…

Let $\Omega \subset \mathbb{R}^N$ ($N \geq 3$) be a $C^2$ bounded domain and $\Sigma \subset \Omega$ be a compact, $C^2$ submanifold without boundary, of dimension $k$ with $0\leq k < N-2$. Put $L_\mu = \Delta + \mu d_\Sigma^{-2}$ in…

In this paper, we give improved bounds for the computational complexity of computing with planar algebraic curves. More specifically, for arbitrary coprime polynomials $f$, $g \in \mathbb{Z}[x,y]$ and an arbitrary polynomial $h \in…

In this paper we investigate the colorful components framework, motivated by applications emerging from comparative genomics. The general goal is to remove a collection of edges from an undirected vertex-colored graph $G$ such that in the…

The aim of this paper is to treat the following problem $$ (P) \left\{ \begin{array}{rcll} (-\Delta)^s_{p, \beta} u &= & f(x,u) &\mbox{ in }\Omega, u & = & 0 &\mbox{ in } \mathds{R}^N\setminus\Omega, \end{array} \right. $$ where $$…

Let $f(n)$ and $g(n)$ be the number of unordered and ordered factorizations of $n$ into integers larger than one. Let $F(n)$ and $G(n)$ have the additional restriction that the factors are coprime. We establish the asymptotic bounds for the…

The cardinal invariants $ \mathfrak h, \mathfrak b, \mathfrak s$ of $\mathcal P (\omega)$ are known to satisfy that $\omega_1 \leq \mathfrak h \leq\min\{\mathfrak b, \mathfrak s\}$. We prove that all inequalities can be strict. We also…

We extend the well known bottleneck paths problem in two directions for directed unweighted (unit edge cost) graphs with positive real edge capacities. Firstly we narrow the problem domain and compute the bottleneck of the entire network in…

Given a group $G$, we write $g^G$ for the conjugacy class of $G$ containing the element $g$. A theorem of B. H. Neumann states that if $G$ is a group in which all conjugacy classes are finite with bounded size, then the commutator subgroup…

Let $G$ be a simple topological graph and let $\Gamma$ be a polyline drawing of $G$. We say that $\Gamma$ \emph{partially preserves the topology} of $G$ if it has the same external boundary, the same rotation system, and the same set of…