Related papers: A construction for weak Schur partitions

We construct a class of Fourier multipliers whose associated operators are weak (1,1) bounded but fail to be weak (p, p) bounded for any 1 < p \leq \infty. Moreover, we show that this result is sharp.

We analyze Kumar's recent quadratic algebraic branching program size lower bound proof method (CCC 2017) for the power sum polynomial. We present a refinement of this method that gives better bounds in some cases. The lower bound relies on…

Let $X$ be a reflexive Hardy space or weighted Bergman space on the unit disk in the complex plane. For a bounded linear operator $S$ on $X$, let $\textrm{wem}(S):= \sup_{(f_n)} \limsup_n \|Sf_n\|$, that is, the supremum of cluster points…

Recently, Andrews introduced separable integer partition classes and studied some well-known theorems. In this article, we will consider the types of partitions with restrictions on consecutive parts. We will show that such partitions are…

A subset P of N x N is called Schur bounded if every infinite matrix with bounded entries which is zero off of P yields a bounded Schur multiplier on B(H). Such sets are characterized as being the union of a subset with at most k entries in…

Let $\mathfrak{g}$ be a finite or an affine type Lie algebra over $\mathbb{C}$ with root system $\Delta$. We show a parabolic generalization of the partial sum property for $\Delta$, which we term the parabolic partial sum property. It…

We consider the problem of multiplying sparse matrices (over a semiring) where the number of non-zero entries is larger than main memory. In the classical paper of Hong and Kung (STOC '81) it was shown that to compute a product of dense $U…

This paper concerns cheaply computable formulas and bounds for the condition number of the TLS problem. For a TLS problem with data $A$, $b$, two formulas are derived that are simpler and more compact than the known results in the…

We prove the global-in-time existence of nonnegative weak solutions to a class of fourth order partial differential equations on a convex bounded domain in arbitrary spatial dimensions. Our proof relies on the formal gradient flow structure…

Explicit expressions for restricted partition function $W(s,{\bf d}^m)$ and its quasiperiodic components $W_j(s,{\bf d}^m)$ (called Sylvester waves) for a set of positive integers ${\bf d}^m = \{d_1, d_2, ..., d_m\}$ are derived. The…

We show that every Banach space in which weakly compact sets are super weakly compact in automatically weakly sequentially complete answering a question by Silber (2024). In the proof we show how to build a weakly compact set which is not…

This paper deals with the problem of when, given a collection $\mathcal C$ of weakly compact operators between separable Banach spaces, there exists a separable reflexive Banach space $Z$ with a Schauder basis so that every element in…

Let s be a string whose symbols are solely available through access(i), a read-only operation that probes s and returns the symbol at position i in s. Many compressed data structures for strings, trees, and graphs, require two kinds of…

We prove new lower bounds on the maximum size of subsets $A\subseteq \{1,\dots,N\}$ or $A\subseteq \mathbb{F}_p^n$ not containing three-term arithmetic progressions. In the setting of $\{1,\dots,N\}$, this is the first improvement upon a…

Weak superimposed codes are combinatorial structures related closely to generalized cover-free families, superimposed codes, and disjunct matrices in that they are only required to satisfy similar but less stringent conditions. This class…

In this paper we study several partition relations, defined by Saharon Shelah, and relate them to the Hales-Jewett numbers. In particular we give an upper bound for the Hales-Jewett numbers using the primitive recursive function…

Let $f$ be a homogeneous polynomial over a field. For many fields, including number fields and function fields, we prove that the strength of $f$ is bounded above by a constant multiple of the Birch rank of $f.$ The constant depends only on…

Let $\Sigma_{2n}$ be the set of all partitions of the even integers from the interval $(4,2n], n>2,$ into two odd prime parts. We select a partition from the set $\Sigma_{2n}$ uniformly at random. Let $2G_n$ be the number partitioned by…

Since the breakthrough superpolynomial multilinear formula lower bounds of Raz (Theory of Computing 2006), proving such lower bounds against multilinear algebraic branching programs (mABPs) has been a longstanding open problem in algebraic…

Using techniques from integrable systems, we obtain a number of exact results for random partitions. In particular, we prove a simple formula for correlation functions of what we call the Schur measure on partitions (which is a far reaching…