1.7k citations
- Technion – Israel Institute of TechnologyIL151 papers
- Oranim Academic College of EducationIL134 papers
- Tel Aviv UniversityIL55 papers
- Heidelberg UniversityDE36 papers
- Carmel (Israel)IL29 papers
- Columbia UniversityUS25 papers
- Massachusetts Institute of TechnologyUS25 papers
- National Research University Higher School of EconomicsRU25 papers
- University of AmsterdamNL22 papers
- Hebrew University of JerusalemIL21 papers
- Princeton UniversityUS21 papers
- Centre National de la Recherche ScientifiqueFR20 papers
36 papers · 1 filter
On the Effectiveness of Projection Methods for Convex Feasibility Problems with Linear Inequality Constraints
Y. Censor, W. Chen, P. L. Combettes +2
The effectiveness of projection methods for solving systems of linear inequalities is investigated. It is shown that they have a computational advantage over some alternatives and…
A concentration result with application to subgraph count
Guy Wolfovitz
Let H = (V,E) be a k-uniform hypergraph with a vertex set V and an edge set E. Let V_p be constructed by taking every vertex in V independently with probability p. Let X be the num…
Some recursive formulas for Selberg-type integrals
Sergio Iguri, Toufik Mansour
A set of recursive relations satisfied by Selberg-type integrals involving monomial symmetric polynomials are derived, generalizing previously known results. These formulas provide…
Translation invariance in groups of prime order
Vsevolod F. Lev
We prove that there is an absolute constant with the following property: if denotes the group of prime order , and a subset satisfies , t…
The continuous postage stamp problem
Vsevolod F. Lev
For a real set consider the semigroup , additively generated by ; that is, the set of all real numbers representable as a (finite) sum of elements of . If $A \subse…
The Max-Flow Min-Cut Theorem for Countable Networks
Ron Aharoni, Eli Berger, Agelos Georgakopoulos +2
We prove a strong version of the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there exist a flow and a cut that are "orthogonal" to each other…