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
18 papers · 1 filter
Reduction and submanifolds of generalized complex manifolds
Izu Vaisman
We recall the presentation of the generalized, complex structures by classical tensor fields, while noticing that one has a similar presentation and the same integrability conditio…
A note on the Coulomb branch of susy Yang-Mills
Daniel Kabat, Gilad Lifschytz
We compute the force between oppositely charged W bosons in the large N limit of Yang-Mills with 16 supercharges broken to SU(N) x U(1) by a finite Higgs vev. We clarify some issue…
Explaining the unobserved: why quantum mechanics is not only about information
Amit Hagar, Meir Hemmo
A remarkable theorem by Clifton, Bub and Halvorson (2003)(CBH) characterizes quantum theory in terms of information--theoretic principles. According to Bub (2004, 2005) the philoso…
Scaling and Universality of the Complexity of Analog Computation
Yaniv Avizrats, Joshua Feinberg, Shmuel Fishman
We apply a probabilistic approach to study the computational complexity of analog computers which solve linear programming problems. We analyze numerically various ensembles of lin…
Fermion Bag Solitons in the Massive Gross-Neveu and Massive Nambu-Jona-Lasinio Models in 1+1 Dimensions: Inverse Scattering Analysis
Joshua Feinberg, Shlomi Hillel
Formation of fermion bag solitons is an important paradigm in the theory of hadron structure. We report here on our non-perturbative analysis of this phenomenon in the 1+1 dimensio…
The Linear Arrangement Problem Parameterized Above Guaranteed Value
G. Gutin, A. Rafiey, S. Szeider +1
A linear arrangement (LA) is an assignment of distinct integers to the vertices of a graph. The cost of an LA is the sum of lengths of the edges of the graph, where the length of a…