English
Related papers

Related papers: Breaking down the reduced Kronecker coefficients

200 papers

Although unification can be used to implement a weak form of $\beta$-reduction, several linguistic phenomena are better handled by using some form of $\lambda$-calculus. In this paper we present a higher order feature description calculus…

cmp-lg · Computer Science 2008-02-03 Luis Damas , Nelma Moreira

Let $P(n)$ be the number of polyominoes of $n$ cells and $\lambda$ be Klarner's constant, that is, $\lambda=\lim_{n\to\infty} \sqrt[n]{P(n)}$. We show that there exist some positive numbers $A,T$, so that for every $n$ \[ P(n) \ge…

Combinatorics · Mathematics 2025-07-15 Vuong Bui

We study the weighted norm inequality of $(1,q)$-type, \[ \Vert \mathbf{G}\nu \Vert_{L^q(\Omega, d\sigma)} \le C \Vert \nu \Vert, \quad \text{ for all } \nu \in \mathcal{M}^+(\Omega), \] along with its weak-type analogue, for $0 < q < 1$,…

Analysis of PDEs · Mathematics 2018-02-14 Stephen Quinn , Igor E. Verbitsky

In this work, we study the generalized k-th power symbol (a/n)_k and present a comprehensive collection of its algebraic properties. The results are classified according to their dependence on the three main parameters a, n, and k. In…

General Mathematics · Mathematics 2025-10-02 Es-said En-naoui

A Kronecker coefficient is the multiplicity of an irreducible representation of a finite group $G$ in a tensor product of irreducible representations. We define Kronecker Hecke algebras and use them as a tool to study Kronecker coefficients…

Representation Theory · Mathematics 2025-10-07 Jyotirmoy Ganguly , Digjoy Paul , Amritanshu Prasad , K N Raghavan , Velmurugan S

A recolouring sequence, between $k$-colourings $\alpha$ and $\beta$ of a graph $G$, transforms $\alpha$ into $\beta$ by recolouring one vertex at a time, such that after each recolouring step we again have a proper $k$-colouring of $G$. The…

Combinatorics · Mathematics 2026-02-20 Stijn Cambie , Wouter Cames van Batenburg , Daniel W. Cranston

In this paper we consider a generalization of the well-known budgeted maximum coverage problem. We are given a ground set of elements and a set of bins. The goal is to find a subset of elements along with an associated set of bins, such…

Data Structures and Algorithms · Computer Science 2018-08-10 Francesco Cellinese , Gianlorenzo D'Angelo , Gianpiero Monaco , Yllka Velaj

In the present paper, we consider the coupled Schr\"{o}dinger systems with critical exponent: \begin{equation*} \begin{cases} -\Delta u_i+\lambda_{i}u_i=\sum\limits_{j=1}^{d} \beta_{ij}|u_j|^{3}|u_i|u_i \quad ~\text{ in } \Omega,\\ u_i \in…

Analysis of PDEs · Mathematics 2022-04-05 Tianhao Liu , Song You , Wenming Zou

Finite temperature Euclidean two-point functions in quantum mechanics or quantum field theory are characterized by a discrete set of Fourier coefficients $G_{k}$, $k\in\mathbb Z$, associated with the Matsubara frequencies $\nu_{k}=2\pi…

High Energy Physics - Lattice · Physics 2016-08-17 Frank Ferrari

Given complex parameters $x$, $\nu$, $\alpha$, $\beta$ and $\gamma \notin -\mathbb{N}$, consider the infinite lower triangular matrix $\mathbf{A}(x,\nu;\alpha, \beta,\gamma)$ with elements $$ A_{n,k}(x,\nu;\alpha,\beta,\gamma) =…

Classical Analysis and ODEs · Mathematics 2020-07-07 Ridha Nasri , Alain Simonian , Fabrice Guillemin

This paper studies the unification problem with associative, commutative, and associative-commutative functions mainly from a viewpoint of the parameterized complexity on the number of variables. It is shown that both associative and…

Symbolic Computation · Computer Science 2013-10-04 Tatsuya Akutsu , Takeyuki Tamura , Atsuhiro Takasu

Let $\Gamma$ be a quiver on n vertices $v_1, v_2, ..., v_n$ with $g_{ij}$ edges between $v_i$ and $v_j$, and let $\alpha \in \N^n$. Hua gave a formula for $A_{\Gamma}(\alpha, q)$, the number of isomorphism classes of absolutely…

Representation Theory · Mathematics 2018-03-30 Geir T. Helleloid , Fernando Rodriguez Villegas

The $k$-colouring reconfiguration problem asks whether, for a given graph $G$, two proper $k$-colourings $\alpha$ and $\beta$ of $G$, and a positive integer $\ell$, there exists a sequence of at most $\ell+1$ proper $k$-colourings of $G$…

Computational Complexity · Computer Science 2014-10-30 Matthew Johnson , Dieter Kratsch , Stefan Kratsch , Viresh Patel , Daniël Paulusma

We give a weak factorization proof of the Hardy space $H^{p}(\mathbb{R}^{n})$ in the multilinear setting, for $\frac{n}{n+1} < p <1$. As a consequence, we obtain a characterization of the boundedness of the commutator $[b,T]$ from…

Classical Analysis and ODEs · Mathematics 2018-02-07 Marie-Jose S. Kuffner

Recurrent Neural Networks (RNN) can be difficult to deploy on resource constrained devices due to their size. As a result, there is a need for compression techniques that can significantly compress RNNs without negatively impacting task…

Machine Learning · Computer Science 2019-10-10 Urmish Thakker , Igor Fedorov , Jesse Beu , Dibakar Gope , Chu Zhou , Ganesh Dasika , Matthew Mattina

Let $\mathcal{P}$ denote the set of all primes. $P_{1},P_{2},P_{3}$ are three subsets of $\mathcal{P}$. Let $\underline{\delta}(P_{i})$ $(i=1,2,3)$ denote the lower density of $P_{i}$ in $\mathcal{P}$, respectively. It is proved that if…

Number Theory · Mathematics 2016-03-02 Quanli Shen

We construct several topological groups with very strong combinatorial properties. In particular, we give simple examples of subgroups of the real line R (thus strictly o-bounded) which have the Hurewicz property but are not sigma-compact,…

General Topology · Mathematics 2010-11-02 Boaz Tsaban

Let $\Omega\subset\mathbb{R}^N$, $N\geq 1$, be an open bounded connected set. We consider the indefinite weighted eigenvalue problem $-\Delta u =\lambda m u$ in $\Omega$ with $\lambda \in \mathbb{R}$, $m\in L^\infty(\Omega)$ and with…

Analysis of PDEs · Mathematics 2025-09-17 Claudia Anedda , Fabrizio Cuccu

In this paper we give a combinatorial interpretation for the coefficient of $s_{\nu}$ in the Kronecker product $s_{(n-p,p)}\ast s_{\lambda}$, where $\lambda=(\lambda_1, ..., \lambda_{\ell(\lambda)})\vdash n$, if $\ell(\lambda)\geq 2p-1$ or…

Combinatorics · Mathematics 2013-01-23 Cristina M. Ballantine , Rosa C. Orellana

Let $s\in(0,1),$ $1<p<\frac{N}{s}$ and $\Omega\subset\mathbb{R}^N$ be an open bounded set. In this work we study the existence of solutions to problems ($E_\pm$) $Lu\pm g(u)=\mu$ and $u=0$ a.e. in $\mathbb{R}^N\setminus\Omega,$ where $g\in…

Analysis of PDEs · Mathematics 2023-07-18 Konstantinos T. Gkikas