Related papers: On sumfree subsets of hypercubes

We give necessary and sufficient conditions for the sum of n subspaces of a Hilbert space to be closed. We also present various properties of n-tuples of subspaces with closed sum.

We develop a new simple approach to prove upper bounds for generalizations of the Heilbronn's triangle problem in higher dimensions. Among other things, we show the following: for fixed $d \ge 1$, any subset of $[0, 1]^d$ of size $n$…

In their paper, Bounds on the Number of Edges in Hypertrees, G.Y. Katona and P.G.N. Szab\'o introduced a new, natural definition of hypertrees in $k$-uniform hypergraphs and gave lower and upper bounds on the number of edges. They also…

We present two short proofs giving the best known asymptotic lower bound for the maximum element in a set of $n$ positive integers with distinct subset sums.

We prove a tight quantum query lower bound $\Omega(n^{k/(k+1)})$ for the problem of deciding whether there exist $k$ numbers among $n$ that sum up to a prescribed number, provided that the alphabet size is sufficiently large. This is an…

Eberhard and Pohoata conjectured that every $3$-cube-free subset of $[N]$ has size less than $2N/3+o(N)$. In this paper we show that if we replace $[N]$ with $\mathbb{Z}_N$ the upper bound of $2N/3$ holds, and the bound is tight when $N$ is…

We consider the dimensional reduction of N=1 {SYM}_{2+1} to 1+1 dimensions. The gauge groups we consider are U(N) and SU(N), where N is finite. We formulate the continuum bound state problem in the light-cone formalism, and show that any…

In contrast to finite arithmetic configurations, relatively little is known about which infinite patterns can be found in every set of natural numbers with positive density. Building on recent advances showing infinite sumsets can be found,…

We provide lower and upper bounds on the minimum size of a maximum stable set over graphs of flag spheres, as a function of the dimension of the sphere and the number of vertices. Further, we use stable sets to obtain an improved Lower…

We prove explicit bounds for the number of sums of consecutive prime squares below a given magnitude.

We introduce a lower bound for the independence number of an arbitrary $k$-uniform hypergraph that only depends on the number of vertices and number of edges of the hypergraph.

We study maximal subalgebras of an arbitrary finite dimensional algebra over a field, and obtain full classification/description results of such algebras. This is done by first obtaining a complete classification in the semisimple case, and…

We obtain a exponential large deviation upper bound for continuous observables on suspension semiflows over a non-uniformly expanding base transformation with non-flat singularities and/or discontinuities, where the roof function defining…

We introduce methods to count and enumerate all maximal independent, all maximum independent sets, and all independent sets in threshold graphs and k-threshold graphs. Within threshold graphs and k-threshold graphs independent sets…

We study the structure of the language of binary cube-free words. Namely, we are interested in the cube-free words that cannot be infinitely extended preserving cube-freeness. We show the existence of such words with arbitrarily long finite…

In this paper we introduce the concept of completeness of sets. We study this property on the set of integers. We examine how this property is preserved as we carry out various operations compatible with sets. We also introduce the problem…

We study sum-free sets in sparse random subsets of even order abelian groups. In particular, we determine the sharp threshold for the following property: the largest such set is contained in some maximum-size sum-free subset of the group.…

Using the auxiliary field method, a generic upper bound is obtained for the spinless Salpeter equation with two different masses. Analytical results are presented for the cases of the Coulomb and linear potentials when a mass is vanishing.

For positive integers $n$ and $m$, consider a multiset of non-empty subsets of $[m]$ such that there is a \textit{unique} partition of these subsets into $n$ partitions of $[m]$. We study the maximum possible size $g(n,m)$ of such a…

We consider the number of independent sets in hypergraphs, which allows us to define the independence density of countable hypergraphs. Hypergraph independence densities include a broad family of densities over graphs and relational…