3 papers
math.CO2019
Dense graphs have rigid parts
Orit E. Raz, József Solymosi
While the problem of determining whether an embedding of a graph in is {\it infinitesimally rigid} is well understood, specifying whether a given embedding of $G…
cs.CC2019
Subspace arrangements, graph rigidity and derandomization through submodular optimization
Orit E. Raz, Avi Wigderson
This paper presents a deterministic, strongly polynomial time algorithm for computing the matrix rank for a class of symbolic matrices (whose entries are polynomials over a field).…
math.CO2015
On the number of unit-area triangles spanned by convex grids in the plane
Orit E. Raz, Micha Sharir, Ilya D. Shkredov
A finite set of real numbers is called convex if the differences between consecutive elements form a strictly increasing sequence. We show that, for any pair of convex sets $A, B\s…