Jonathan S. Needleman

activity

20032026

most citedCalculus on the Sierpinski Gasket I: Polynomials, Exponentials and Power Series

34 citations · 34 across the 6 of their papers we have counts for

collaborators

Showing 2026Show all

2 papers · 1 filter

cs.DM2026

Maximal Linear Arrangement is NP complete on Bipartite Graphs

Aparna Das, Jonathan Needleman

The linear arrangement of a simple graph $G = (V, E)$ is a bijective labeling $π$ of the vertices of $G$ to the set ${1, \dots, n}$ . The maximum linear arrangement ($\texttt{maxL…

math.NT2026

Consecutive Cycle Sums

Jessica Marotti, Jonathan Needleman

Consider placing the numbers $1, \dots, n$ consecutively around an $n$ -cycle. We ask for a given $n$ , which numbers $k$ can be written as a sum of consecutive numbers on the $n$ -c…