Related papers: A construction for weak Schur partitions

The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. From an optimization point of view, one could instead…

Partition regularity over algebraic structures is a topic in Ramsey theory that has been extensively researched by combinatorialists. Motivated by recent work in this area, we investigate the computability-theoretic and reverse-mathematical…

We extend the study of the occupancy fraction of the hard-core model in two novel directions. One direction gives a tight lower bound in terms of individual vertex degrees, extending work of Sah, Sawhney, Stoner and Zhao which bounds the…

We prove that the coefficients of certain weight -1/2 harmonic Maass forms are traces of singular moduli for weak Maass forms. To prove this theorem, we construct a theta lift from spaces of weight -2 harmonic weak Maass forms to spaces of…

Graham, R\"odl, and Ruci\'nski originally posed the problem of determining the minimum number of monochromatic Schur triples that must appear in any 2-coloring of the first $n$ integers. This question was subsequently resolved independently…

We use type I string models with supersymmetry broken by compactification (\`a la Scherk-Schwarz) in order to test the weak gravity conjecture in the presence of runaway potentials in a perturbative string theory setting. For a finite value…

In quantum theory, a weak value is a complex number with a somewhat technical definition: it is a ratio whose numerator is the matrix element of a self-adjoint operator and whose denominator is the inner product of a corresponding pair of…

One of the major open problems in complexity theory is proving super-logarithmic lower bounds on the depth of circuits (i.e., $\mathbf{P}\not\subseteq\mathbf{NC}^{1}$). Karchmer, Raz, and Wigderson (Computational Complexity 5(3/4), 1995)…

Let $G\cong \mathbb Z/m_1\mathbb Z\times\ldots\times \mathbb Z/m_r\mathbb Z$ be a finite abelian group with $m_1\mid\ldots\mid m_r=\exp(G)$. The $n$-term subsums version of Kneser's Theorem, obtained either via the DeVos-Goddyn-Mohar…

We focus on N = 3 chiral supergravity (SUGRA) which is the lowest N theory involving a spin-1/2 field, and derive the Ashtekar's canonical formulation of N = 3 SUGRA starting with the chiral Lagrangian constructed by closely following the…

The Burgess inequality is the best upper bound we have for the character sum $S_{\chi}(M,N) = \sum_{M<n\le M+N} \chi(n).$ Until recently, no explicit estimates had been given for the inequality. In 2006, Booker gave an explicit estimate for…

We prove specific biases in the number of occurrences of parts belonging to two different residue classes $a$ and $b$, modulo a fixed non-negative integer $m$, for the sets of unrestricted partitions, partitions into distinct parts, and…

Let $D=(V,A)$ be a digraph of order $n$ and let $W$ be any subset of $V$. We define the minimum semi-degree of $W$ in $D$ to be $\delta^0(W)=\mbox{min}\{\delta^+(W),\delta^-(W)\}$, where $\delta^+(W)$ is the minimum out-degree of $W$ in $D$…

We explore lattice structures on integer binary relations (i.e. binary relations on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$) and on integer posets (i.e. partial orders on the set $\{1, 2, \dots, n\}$ for a fixed integer $n$).…

We prove that for arbitrary partitions $\mathbf{\lambda} \subseteq \mathbf{\kappa},$ and integers $0\leq c<r\leq n,$ the sequence of Schur polynomials $S_{(\mathbf{\kappa} + k\cdot \mathbf{1}^c)/(\mathbf{\lambda} + k\cdot…

A partition of a positive integer $n$ is a non-increasing sequence of positive integers which sum to $n$. A recently studied aspect of partitions is the minimal excludant of a partition, which is defined to be the smallest positive integer…

We study the weak gravity conjecture in non-supersymmetric string theory setups. Precisely, those are type I string theory with supersymmetry broken \`a la Scherk-Schwarz and open strings on D branes wrapped around magnetized tori in type…

We introduce the binary value principle which is a simple subset-sum instance expressing that a natural number written in binary cannot be negative, relating it to central problems in proof and algebraic complexity. We prove conditional…

For an integer $m\ge 2$, a partition $\lambda=(\lambda_1,\lambda_2,\ldots)$ is called $m$-falling, a notion introduced by Keith, if the least nonnegative residues mod $m$ of $\lambda_i$'s form a nonincreasing sequence. We extend a bijection…

We give an upper bound for the minimum $s$ with the property that every sufficiently large integer can be represented as the sum of $s$ positive $k$-th powers of integers represented as the sum of three positive cubes for the cases $2\leq…