616 citations
- Oranim Academic College of EducationIL41 papers
- Technion – Israel Institute of TechnologyIL23 papers
- Carmel (Israel)IL9 papers
- Centre National de la Recherche ScientifiqueFR5 papers
- Hebrew University of JerusalemIL5 papers
- Nankai UniversityCN5 papers
- Calvin UniversityUS3 papers
- Columbia UniversityUS3 papers
- Dalian Maritime UniversityCN3 papers
- Georgia Institute of TechnologyUS3 papers
- Helsinki Institute of PhysicsFI3 papers
- Royal Holloway University of LondonGB3 papers
20 papers · 1 filter
On Stably free modules over Laurent polynomial rings
Abed Abedelfatah
We prove constructively that for any finite-dimensional commu- tative ring R, every stably free module over R[X;X^{1}] of rank > dim R is free, i.e., R[X;X^{-1}] is (dimR)-Hermite.
p-wave Holographic Superconductors and five-dimensional gauged Supergravity
Francesco Aprile, Diego Rodriguez-Gomez, Jorge G. Russo
We explore five-dimensional and SO(6) gauged supergravities as frameworks for condensed matter applications. These theories contain cha…
Death of soliton trains in attractive Bose-Einstein condensates
Alexej I. Streltsov, Ofir. E. Alon, Lorenz S. Cederbaum
Experiments on ultra-cold attractive Bose-Einstein Condensates (BECs) have demonstrated that at low dimensions atomic clouds can form localized objects, propagating for long times…
Unique perfect phylogeny is NP-hard
Michel Habib, Juraj Stacho
We answer, in the affirmative, the following question proposed by Mike Steel as a $100 challenge: "Is the following problem NP-hard? Given a ternary phylogenetic X-tree T and a col…
A Greedy Partition Lemma for Directed Domination
Yair Caro, Michael A. Henning
A directed dominating set in a directed graph is a set of vertices of such that every vertex has an adjacent vertex in with directe…
Directed Domination in Oriented Graphs
Yair Caro, Michael A. Henning
A directed dominating set in a directed graph is a set of vertices of such that every vertex has an adjacent vertex in with directe…