Eric Ren

activity

20232025

most citedImproved upper bounds on longest-path and maximal subdivision transversals

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

math.AC2025

On numerical semigroup elements and the $ℓ_{0}$ - and $ℓ_{\infty}$ -norms of their factorizations

Sogol Cyrusian, Alex Domat, Christopher O'Neill +3

A numerical semigroup $S$ is a cofinite, additively-closed subset of $Z_{\geq 0}$ that contains 0, and a factorization of $x \in S$ is a $k$ -tuple $z = (z_{1}, \dots, z_{k})$ w…

math.AC2024

Perspicacious $l_{p}$ norm parameters

Christopher O'Neill, Vadim Ponomarenko, Eric Ren

Fix $t \in [1, \infty]$ . Let $S$ be an atomic commutative semigroup and, for all $x \in S$ , let $L_{t} (S) := {∥ f ∥_{t} : f \in Z (x)}$ be the " $t$ -length set" of $x$ (using the sta…

math.CO2023★ 1 cited

Improved upper bounds on longest-path and maximal subdivision transversals

Henry Kierstead, Eric Ren

Let $G$ be a connected graph on $n$ vertices. The Gallai number $G a l (G)$ of $G$ is the size of the smallest set of vertices that meets every maximum path in $G$ . Grünbaum construct…

On numerical semigroup elements and the ℓ0​- and ℓ∞​-norms of their factorizations

Perspicacious lp​ norm parameters

Improved upper bounds on longest-path and maximal subdivision transversals

On numerical semigroup elements and the $ℓ_{0}$ - and $ℓ_{\infty}$ -norms of their factorizations

Perspicacious $l_{p}$ norm parameters