Searcharxiv⌕ Search

arXiv subjects

Dean Matthew Menezes

Publications and source records attributed to Dean Matthew Menezes.

4 recordsLinked to original sources

A $19/5$ lower bound for the four-dimensional Erdős box problem

For every power $q\ge2$ of~$2$, we construct a box-free subset of $[q^5]^4$ with $q^{19}$ points, improving the lower-bound exponent in the four-dimensional Erdős box problem from $15/4$ to $19/5$. In fact, $[q^5]^4$ partitions into $q$ isomorphic box-free sets. The proof uses a finite-field rectangle lemma and orthogonality in a four-dimensional bilinear space. We also deduce a uniform bound $f_4(n)\ge2^{-19/20}n^{19/5}$ and a lower bound for grid-coloring numbers.

math.CO↗

Robust order properties in the HLM construction

Green's arithmetic regularity lemma over $G=\F_2^n$ has tower-type lower bounds. We show that the large order properties in the Hosseini--Lovett--Moshkovitz--Shapira (HLM) construction survive sparse edits. If $d$ is the top block dimension, then changing at most $|G|/16$ points of the top HLM set $A_s$ still leaves a half-graph of height $d/8$. For a suitable choice of the HLM maps, changing at most $\eps|G|$ points of a superlevel set of the averaged witness still leaves a half-graph of height $d/(8\sqrt{s})\ge{\rm twr}(s-2)$. The proofs use Sauer's lemma and the binary code formed by the top-level row traces.

math.CO↗

A noncircular oval with convex unit-tangent iterates

For an oriented regular plane curve $γ$, define ${\cal T}γ=γ+τ$, where $τ$ is its unit tangent. We construct a noncircular curve $Γ_0$ such that every iterate ${\cal T}^nΓ_0$, $n\geq0$, is a smooth embedded closed curve with everywhere positive curvature. This answers a question of Tabachnikov. The construction starts with a noncompact convex curve $C$, asymptotic at its two ends to parallel lines, satisfying ${\cal T} C=C+(V,0)$ for some $V>0$. From $C$ we construct long closed convex curves. After matching perimeters, we compare each curve with a convex curve whose unit-tangent image is the next curve in the sequence. In suitable arclength coordinates, their curvature functions differ by an exponentially small amount in $L^1$. Uniform inverse estimates turn these approximate relations into an exact sequence $Γ_{n+1}={\cal T}Γ_n$. Each $Γ_n$ lies in a strip of width bounded independently of $n$, whereas the radii of iterated circles tend to infinity.

math.DG↗

Moore's Greedy Algorithm for Minimizing the Number of Late Jobs: Structure and Implementation

Scheduling $n$ jobs with deadlines and processing times on a single resource to minimize late jobs equates to finding a maximum-cardinality feasible subset. Moore (1968) proposed a natural greedy algorithm for this: process jobs in nondecreasing order of processing time, adding each if the set remains feasible. While Zhao and Yuan recently matched the $O(n\log n)$ time of the classic Moore-Hodgson algorithm via amortized $O(\log n)$ feasibility queries, our first contribution is a simpler augmented BST data structure that achieves worst-case $O(\log n)$ query time. Moore's greedy algorithm is known to produce a maximum-cardinality feasible subset with minimum total processing time. Though the system of feasible subsets does not form a matroid, the algorithm behaves like a matroid greedy algorithm. Our second contribution explains this phenomenon: if all jobs have equal processing times, the problem corresponds to a nested matroid; with distinct processing time "tiers," Moore's algorithm effectively solves a sequence of nested matroid problems for each tier. Finally, we present an explicit linear-size flow network defining a polymatroid rank. A set is feasible exactly when its rank equals its total processing time, and Moore's algorithm accepts a job precisely when it yields its full processing-time marginal. By contracting shorter accepted jobs and measuring residual rank, we recover the tier matroid's complete rank function, offering a deep structural explanation for the greedy algorithm's correctness.

cs.DS↗