English
Related papers

Related papers: Breaking down the reduced Kronecker coefficients

200 papers

In the paper, we establish a new estimate for Kloosterman sum over primes with respect to an arbitrary modulus $q$. This estimate together with some recent results of the second author are applied to the problem of solvability of the…

Number Theory · Mathematics 2019-12-09 M. E. Changa , M. A. Korolev

We sketch a tentative proof of P-completeness for the $\beta$-convertibility problem on untyped planar (a.k.a. ordered or non-commutative) $\lambda$-terms.

Logic in Computer Science · Computer Science 2024-04-09 Anupam Das , Damiano Mazza , Lê Thành Dũng Nguyên , Noam Zeilberger

A composite positive integer $n$ has the Lehmer property if $\phi(n)$ divides $n-1,$ where $\phi$ is an Euler totient function. In this note we shall prove that if $n$ has the Lehmer property, then $n\leq 2^{2^{K}}-2^{2^{K-1}}$, where $K$…

Number Theory · Mathematics 2018-07-02 Dominik Burek , Błażej Żmija

We study the problem of determining $sat(n,k,r)$, the minimum number of edges in a $k$-partite graph $G$ with $n$ vertices in each part such that $G$ is $K_r$-free but the addition of an edge joining any two non-adjacent vertices from…

Combinatorics · Mathematics 2017-10-26 António Girão , Teeradej Kittipassorn , Kamil Popielarz

This paper settles the sample complexity of single-parameter revenue maximization by showing matching upper and lower bounds, up to a poly-logarithmic factor, for all families of value distributions that have been considered in the…

Computer Science and Game Theory · Computer Science 2019-04-11 Chenghao Guo , Zhiyi Huang , Xinzhi Zhang

We study the parameterized and classical complexity of two related problems on undirected graphs $G=(V,E)$. In Strong Triadic Closure we aim to label the edges in $E$ as strong and weak such that at most~$k$ edges are weak and $G$ contains…

Data Structures and Algorithms · Computer Science 2019-08-07 Niels Grüttemeier , Christian Komusiewicz

In this paper, we prove existence of \emph{very weak solutions} to nonhomogeneous quasilinear parabolic equations beyond the duality pairing. The main ingredients are a priori esitmates in suitable weighted spaces combined with the…

Analysis of PDEs · Mathematics 2019-01-16 Karthik Adimurthi , Sun-Sig Byun , Wontae Kim

Let $K$ be the Calder\'on-Zygmund convolution kernel on $\mathbb{R}^d (d\geq2)$. Define the commutator associated with $K$ and $a\in L^\infty(\mathbb{R}^d)$ by \[ T_af(x)=p.v. \int K(x-y)m_{x,y}a\cdot f(y)dy. \] Recently, Grafakos and…

Classical Analysis and ODEs · Mathematics 2015-09-17 Yong Ding , Xudong Lai

We prove a lower bound of exp(-C (log(2/alpha))^7)N^{k-1} to the number of solutions of an invariant equation in k variables, contained in a set of density alpha. Moreover, we give a Behrend-type construction for the same problem with the…

Number Theory · Mathematics 2023-06-16 Tomasz Kosciuszko

We consider differences between $\log \Gamma(x)$ and truncations of certain classical asymptotic expansions in inverse powers of $x-\lambda$ whose coefficients are expressed in terms of Bernoulli polynomials $B_n(\lambda)$, and we obtain…

Classical Analysis and ODEs · Mathematics 2015-08-14 Harold G. Diamond , Armin Straub

The monotonicity of the Mittag-Leffler function $E_{\alpha}$ with respect to the parameter $\alpha$ is investigated, via some convex ordering properties for related random variables. In particular, it is shown that the mapping…

Classical Analysis and ODEs · Mathematics 2025-12-05 Rui Ferreira , Thomas Simon

We study weak solutions and minimizers $u$ of the non-autonomous problems $\operatorname{div} A(x, Du)=0$ and $\min_v \int_\Omega F(x,Dv)\,dx$ with quasi-isotropic $(p, q)$-growth. We consider the case that $u$ is bounded, H\"older…

Analysis of PDEs · Mathematics 2023-10-24 Peter Hästö , Jihoon Ok

We consider the class of conditional graph patterns (\emph{CGPs}) that allow user to query data graphs with complex patterns that contain negation and predicates. To overcome the prohibitive cost of subgraph isomorphism, we consider…

Databases · Computer Science 2022-07-27 Houari Mahfoud

We introduce the von Neumann entropy regularization of Unbalanced Non-commutative Optimal Transport, specifically Non-commutative Optimal Transport between semi-definite positive matrices (not necessarily with trace one). We prove the…

Optimization and Control · Mathematics 2024-02-28 Augusto Gerolin , Nataliia Monina

We study the concept of \emph{compactor}, which may be seen as a counting-analogue of kernelization in counting parameterized complexity. For a function $F:\Sigma^*\to \Bbb{N}$ and a parameterization $\kappa: \Sigma^*\to \Bbb{N}$, a…

Data Structures and Algorithms · Computer Science 2018-09-26 Eun Jung Kim , Maria Serna , Dimitrios M. Thilikos

For a smooth bounded domain $\Omega$ and $p \geq q \geq 2$, we establish quantified versions of the classical Friedrichs inequality $\|\nabla u\|_p^p - \lambda_1 \|u\|_q^p \geq 0$, $u \in W_0^{1,p}(\Omega)$, where $\lambda_1$ is a…

Analysis of PDEs · Mathematics 2026-03-16 Vladimir Bobkov , Sergey Kolonitskii

For the Riesz kernel $\kappa_\alpha(x,y):=|x-y|^{\alpha-n}$ on $\mathbb R^n$, where $n\geqslant2$, $\alpha\in(0,2]$, and $\alpha<n$, we consider the problem of minimizing the Gauss functional…

Classical Analysis and ODEs · Mathematics 2023-12-01 Natalia Zorii

As introduced by Bollob\'as, a graph $G$ is weakly $H$-saturated if the complete graph $K_n$ is obtained by iteratively completing copies of $H$ minus an edge. For all graphs $H$, we obtain an asymptotic lower bound for the critical…

Probability · Mathematics 2025-11-18 Zsolt Bartha , Brett Kolesnik

We prove that among all 1-periodic configurations $\Gamma$ of points on the real line $\mathbb{R}$ the quantities $$ \min_{x \in \mathbb{R}} \sum_{\gamma \in \Gamma} e^{- \pi \alpha (x - \gamma)^2} \quad \text{and} \quad \max_{x \in…

Classical Analysis and ODEs · Mathematics 2025-04-28 Markus Faulhuber , Stefan Steinerberger

In this paper, we develop machinery which makes it much easier to prove sum of squares lower bounds when the problem is symmetric under permutations of $[1,n]$ and the unsatisfiability of our problem comes from integrality arguments, i.e.…

Computational Complexity · Computer Science 2018-12-17 Aaron Potechin