Related papers: A Proof of the Strict Monotone 5-step Conjecture

We consider supersymmetry in five dimensions, where the fermionic parameters are a 2-form under SL(5). Supermultiplets are investigated using the pure spinor superfield formalism, and are found to be closely related to infinite-dimensional…

We study the Parallel Task Scheduling problem $Pm|size_j|C_{\max}$ with a constant number of machines. This problem is known to be strongly NP-complete for each $m \geq 5$, while it is solvable in pseudo-polynomial time for each $m \leq 3$.…

Using the self-consistent field theory (SCFT) in spherical unit cells of various dimensionalities, D, a phase diagram of a diblock, A-b-B, is calculated in 5 dimensional space, d = 5. This is an extension of a previous work for d = 4. The…

We systematically study the extension of the Supersymmetric Standard Model (SSM) by an anomaly-free discrete gauge symmetry Z_N. We extend the work of Ibanez and Ross with N=2,3 to arbitrary values of N. As new fundamental symmetries, we…

We recap the main features of Minimal Dark Matter (MDM) and assess its status in the light of the recent experimental data. The theory selects an electroweak 5-plet with hypercharge Y=0 as a fully successful DM candidate, automatically…

Let $(M^5,g)$ be a five-dimensional non-trivial simply-connected compact quasi-Einstein manifold with boundary. If $M$ has constant scalar $R$, Johnatan Costa, Ernani Ribeiro Jr, and Detang Zhou show that $R$ = $((m-5)k+20)/(m-k+4)\lambda$…

In this paper we generalize the main result of [4] for manifolds that are not necessarily Einstein. In fact, we obtain an upper bound for the volume of a locally volume-minimizing closed hypersurface $\Sigma$ of a Riemannian 5-manifold $M$…

A famous conjecture of Erd\H{o}s asserts that for $k\ge 3$, the maximum number of edges in an $n$-vertex $k$-uniform hypergraph without $s+1$ pairwise disjoint edges is $\max\{\binom{n}{k}-\binom{n-s}{k},\binom{sk+k-1}{k}\}$. This problem…

It is widely acknowledged that the convergence proof of the error in the $l_{\infty}$ norm of the high-order finite difference method (FDM) and finite element method (FEM) in 2D is challenging. In this paper, we derive the sixth-order…

A monotone CNF formula is a Boolean formula in conjunctive normal form where each variable appears positively. We design a deterministic fully polynomial-time approximation scheme (FPTAS) for counting the number of satisfying assignments…

We exhibit a monotone function computable by a monotone circuit of quasipolynomial size such that any monotone circuit of polynomial depth requires exponential size. This is the first size-depth tradeoff result for monotone circuits in the…

Let $\mu_{\text{2n}}(d,v)$ (respectively, $\mu^{\text{s}}_{\text{2n}}(d,v)$) be the minimal number of facets of a (simplicial) 2-neighborly $d$-polytope with $v$ vertices, $v > d \ge 4$. It is known that $\mu_{\text{2n}}(4,v) = v (v-3)/2$,…

Shape constrained densities are encountered in many nonparametric estimation problems. The classes of monotone or convex (and monotone) densities can be viewed as special cases of the classes of k-monotone densities. A density g is said to…

We analyze some phenomenological implications of heterotic M-theory with five-branes. Recent results for the effective 4-dimensional action are used to perform a systematic analysis of the parameter space, finding the restrictions that…

We construct a quasi-polynomial time deterministic approximation algorithm for computing the volume of an independent set polytope with restrictions. Randomized polynomial time approximation algorithms for computing the volume of a convex…

Ferrers diagram rank-metric codes were introduced by Etzion and Silberstein in 2009. In their work, they proposed a conjecture on the largest dimension of a space of matrices over a finite field whose nonzero elements are supported on a…

We construct examples of embedded flexible cross-polytopes in the spheres of all dimensions. These examples are interesting from two points of view. First, in dimensions 4 and higher, they are the first examples of embedded flexible…

For a $d$-dimensional polytope with $v$ vertices, $d+1\le v\le2d$, we calculate precisely the minimum possible number of $m$-dimensional faces, when $m=1$ or $m\ge0.62d$. This confirms a conjecture of Gr\"unbaum, for these values of $m$.…

Zonotopes are studied from the point of view of central symmetry and how volumes of facets and the angles between them determine a zonotope uniquely. New proofs are given for theorems of Shephard and McMullen characterizing a zonotope by…

In this paper we investigate the problem of searching monotone multi-dimensional arrays. We generalize Linial and Saks' search algorithm \cite{LS1} for monotone 3-dimensional arrays to $d$-dimensions with $d\geq 4$. Our new search algorithm…