D. Menezes

collaborators

5 papers

math.DG2026

A noncircular oval with convex unit-tangent iterates

Dean Matthew Menezes

For an oriented regular plane curve $γ$ , define $T γ = γ + τ$ , where $τ$ is its unit tangent. We construct a noncircular curve $Γ_{0}$ such that every iterate $T^{n} Γ_{0}$ , $n\g…

math.CO2026

The Three-Dimensional Erdős Box Problem Has Exponent $11/4$

Dean Menezes

Let $z (n)$ be the maximum number of edges in a tripartite $3$ -uniform hypergraph with $n$ vertices in each part and no copy of $K_{2, 2, 2}^{(3)}$ (a ``box''). Erdős (1964) proved th…

math.GM2026

A Lorentz Endpoint and Quantitative Obstruction for a Cowling-Price Moment Reduction

Dean Menezes

Let $M_{r, p}^{(d)} (g) = \int_{R^{d}} ∣ x ∣^{r} ∣ g (x) ∣^{p} d x, 1 < p < \infty.$ Write $p^{'} = p / (p - 1)$ and $ω_{d} = ∣ B (0, 1) ∣$ . A direct step in the Wigderson--Wigderson moment method as…

math.CO2026

Sharp Bounds for Discrete Cube Skeleta

Dean Menezes

Fix integers $0 \leq k < n$ . Let $F_{n, k} (N)$ be the least size of a finite set $B \subset Z^{n}$ that contains a filled axis-parallel cube $k$ -skeleton centered at each point of some $N…

cs.DS2026

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

Dean Matthew Menezes, C. Gregory Plaxton

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…

A noncircular oval with convex unit-tangent iterates

The Three-Dimensional Erdős Box Problem Has Exponent 11/4

A Lorentz Endpoint and Quantitative Obstruction for a Cowling-Price Moment Reduction

Sharp Bounds for Discrete Cube Skeleta

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

The Three-Dimensional Erdős Box Problem Has Exponent $11/4$